![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Theoretical Computer Science, Volume 807
Volume 807, February 2020
- Giorgio Ausiello, Lila Kari, Grzegorz Rozenberg, Donald Sannella
, Paul G. Spirakis, Pierre-Louis Curien:
Preface. 1-2 - Samson Abramsky
:
Whither semantics? 3-14 - Rajeev Alur, Dana Fisman, Konstantinos Mamouras, Mukund Raghothaman
, Caleb Stanford
:
Streamable regular transductions. 15-41 - Guy Avni, Thomas A. Henzinger, Orna Kupferman:
Dynamic resource allocation games. 42-55 - Amotz Bar-Noy, David Peleg, Dror Rawitz:
Vertex-weighted realizations of graphs. 56-72 - Andreas Blass, Yuri Gurevich:
Braided distributivity. 73-94 - Roberto Bruni, Hernán C. Melgratti, Ugo Montanari:
Bayesian network semantics for Petri nets. 95-113 - Cristian S. Calude, Sanjay Jain
, Wolfgang Merkle, Frank Stephan
:
Searching for shortest and least programs. 114-127 - Ilaria Castellani
, Mariangiola Dezani-Ciancaglini
, Paola Giannini
, Ross Horne
:
Global types with internal delegation. 128-153 - Adrien Durier, Daniel Hirschkoff, Davide Sangiorgi:
Towards 'up to context' reasoning about higher-order processes. 154-168 - Thomas Ehrhard, Jean Krivine, Ying Jiang:
A calculus of branching processes. 169-184 - Loukas Georgiadis
, Giuseppe F. Italiano, Aikaterini Karanasiou:
Approximating the smallest 2-vertex connected spanning subgraph of a directed graph. 185-200 - Kazuo Iwama, Junichi Teruyama:
Improved average complexity for comparison-based sorting. 201-219 - Dexter Kozen
, Alexandra Silva:
Left-handed completeness. 220-233 - Pierre Leone, Kasun Samarasinghe, José D. P. Rolim:
Every Schnyder drawing is a greedy embedding. 234-244 - Kalpana Mahalingam
, Palak Pandoh
, Kamala Krithivasan:
On the least number of palindromes in two-dimensional words. 245-256 - Yuri V. Matijasevic
:
The Riemann Hypothesis in computer science. 257-265 - Marios Mavronicolas
, Burkhard Monien:
Conditional Value-at-Risk: Structure and complexity of equilibria. 266-283 - Michael W. Mislove
:
Domains and stochastic processes. 284-297 - Min Wu, Matthew Wicker, Wenjie Ruan
, Xiaowei Huang
, Marta Kwiatkowska:
A game-based approximate verification of deep neural networks with provable guarantees. 298-329 - Fang Yu, Daowen Qiu, Xiaoming Wang, Qin Li
, Lvzhou Li, Jozef Gruska:
Security improvements of several basic quantum private query protocols with O(log N) communication complexity. 330-340
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.