default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCSR 2016: St. Petersburg, Russia
- Alexander S. Kulikov, Gerhard J. Woeginger:
Computer Science - Theory and Applications - 11th International Computer Science Symposium in Russia, CSR 2016, St. Petersburg, Russia, June 9-13, 2016, Proceedings. Lecture Notes in Computer Science 9691, Springer 2016, ISBN 978-3-319-34170-5 - Orna Kupferman:
On High-Quality Synthesis. 1-15 - Andris Ambainis, Krisjanis Prusis, Jevgenijs Vihrovs:
Sensitivity Versus Certificate Complexity of Boolean Functions. 16-28 - Laurent Bartholdi:
Algorithmic Decidability of Engel's Property for Automaton Groups. 29-40 - Mike Behrisch
, Miki Hermann, Stefan Mengel, Gernot Salzer:
The Next Whisky Bar. 41-56 - René van Bevern, Vincent Froese, Christian Komusiewicz:
Parameterizing Edge Modification Problems Above Lower Bounds. 57-72 - René van Bevern, Artem V. Pyatkin:
Completing Partial Schedules for Open Shop with Unit Processing Times and Routing. 73-87 - Manuel Bodirsky, Marcello Mamino:
Max-Closed Semilinear Constraint Satisfaction. 88-101 - Katerina Böhmová, Matús Mihalák, Tobias Pröger, Gustavo Sacomoto, Marie-France Sagot:
Computing and Listing st-Paths in Public Transportation Networks. 102-116 - Patricia Bouyer, Thomas Brihaye, Pierre Carlier, Quentin Menet:
Compositional Design of Stochastic Timed Automata. 117-130 - Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin:
Online Bounded Analysis. 131-145 - Alejandro Díaz-Caro, Abuzer Yakaryilmaz:
Affine Computation and Affine Automaton. 146-160 - Toshihiro Fujito, Tomoaki Shimoda:
On Approximating (Connected) 2-Edge Dominating Set by a Tree. 161-176 - Petr A. Golovach, George B. Mertzios:
Graph Editing to a Given Degree Sequence. 177-191 - Shankar Balachandran, Sajin Koroth:
Subclasses of Baxter Permutations Based on Pattern Avoidance. 192-206 - Alexander Kozachinskiy:
On Slepian-Wolf Theorem with Interaction. 207-222 - Manfred Kufleitner, Tobias Walter:
Level Two of the Quantifier Alternation Hierarchy over Infinite Words. 223-236 - Manfred Kufleitner, Jan Philipp Wächter:
The Word Problem for Omega-Terms over the Trotter-Weil Hierarchy - (Extended Abstract). 237-250 - Meena Mahajan, Nitin Saurabh:
Some Complete and Intermediate Polynomials in Algebraic Complexity Theory. 251-265 - Meena Mahajan, Anuj Tawari:
Sums of Read-Once Formulas: How Many Summands Suffice? 266-279 - Alexey Milovanov:
Algorithmic Statistics: Normal Objects and Universal Models. 280-293 - Daniel Moeller, Ramamohan Paturi, Stefan Schneider:
Subquadratic Algorithms for Succinct Stable Matching. 294-308 - Partha Mukhopadhyay:
Depth-4 Identity Testing and Noether's Normalization Lemma. 309-323 - Zeev Nutov:
Improved Approximation Algorithms for Min-Cost Connectivity Augmentation Problems. 324-339 - Alexander Okhotin:
The Hardest Language for Conjunctive Grammars. 340-351 - Victor Y. Pan, Liang Zhao:
Low-Rank Approximation of a Matrix: Novel Insights, New Progress, and Extensions. 352-366 - Arno Pauly, Florian Steinberg:
Representations of Analytic Functions and Weihrauch Degrees. 367-381 - Alexander Rabinovich:
On Expressive Power of Regular Expressions over Infinite Orders. 382-393 - Tim Smith:
Prediction of Infinite Words with Automata. 394-408 - Hing Yin Tsang, Ning Xie, Shengyu Zhang:
Fourier Sparsity of GF(2) Polynomials. 409-424
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.
last updated on 2025-11-26 07:50 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
