default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCSR 2015: Listvyanka, Russia
- Lev D. Beklemishev
, Daniil V. Musatov:
Computer Science - Theory and Applications - 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 13-17, 2015, Proceedings. Lecture Notes in Computer Science 9139, Springer 2015, ISBN 978-3-319-20296-9 - Sam Buss:
Propositional Proofs in Frege and Extended Frege Systems (Abstract). 1-6 - Vladimir V. Podolskii:
Circuit Complexity Meets Ontology-Based Data Access. 7-26 - Antonis Achilleos:
NEXP-Completeness and Universal Hardness Results for Justification Logic. 27-52 - Maxim A. Babenko, Alexander V. Karzanov:
A Combinatorial Algorithm for the Planar Multiflow Problem with Demands Located on Three Holes. 53-66 - Mikhail Barash, Alexander Okhotin:
Generalized LR Parsing for Grammars with Contexts. 67-79 - Simone Bova, Friedrich Slivovsky:
On Compiling Structured CNFs to OBDDs. 80-93 - Claudia Carapelle, Shiguang Feng, Alexander Kartzow, Markus Lohrey:
Satisfiability of ECTL* with Tree Constraints. 94-108 - Julien Cassaigne, Juhani Karhumäki, Aleksi Saarela:
On Growth and Fluctuation of k-Abelian Complexity. 109-122 - Nathann Cohen, Daniel Gonçalves, Eunjung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller:
A Polynomial-Time Algorithm for Outerplanar Diameter Improvement. 123-142 - Konrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma, Dimitrios M. Thilikos:
Editing to a Planar Graph of Given Degrees. 143-156 - Mateus de Oliveira Oliveira:
On the Satisfiability of Quantum Circuits of Small Treewidth. 157-172 - Volker Diekert, Florent Martin, Géraud Sénizergues, Pedro V. Silva:
Equations over Free Inverse Monoids with Idempotent Variables. 173-188 - Manfred Droste, Vitaly Perevoshchikov:
A Logical Characterization of Timed Pushdown Languages. 189-203 - Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen:
An In-Place Priority Queue with O(1) Time for Push and lg n + O ( 1 ) Comparisons for Pop. 204-218 - Dmitry Itsykson, Mikhail Slabodkin, Dmitry Sokolov:
Resolution Complexity of Perfect Matching Principles for Sparse Graphs. 219-230 - Jozef Stefan Jirásek, Galina Jirásková, Alexander Szabari:
Operations on Self-Verifying Finite Automata. 231-261 - Fairouz Kamareddine, Joe B. Wells, Daniel Lima Ventura:
Automath Type Inclusion in Barendregt's Cube. 262-282 - Alexander Knop:
Circuit Lower Bounds for Average-Case MA. 283-295 - Alexander Kozachinskiy:
Making Randomness Public in Unbounded-Round Information Complexity. 296-309 - Violetta Lonati, Dino Mandrioli, Federica Panella, Matteo Pradella:
First-Order Logic Definability of Free Languages. 310-324 - Marina I. Maslennikova, Emanuele Rodaro:
Representation of (Left) Ideal Regular Languages by Synchronizing Automata. 325-338 - Alexey Milovanov:
Some Properties of Antistochastic Strings. 339-349 - N. S. Narayanaswamy, C. S. Rahul:
Approximation and Exact Algorithms for Special Cases of Connected f-Factors. 350-363 - Vincent Penelle:
Rewriting Higher-Order Stack Trees. 364-397 - Christoph Benzmüller, Bruno Woltzenlogel Paleo:
Interacting with Modal Logics in the Coq Proof Assistant. 398-411 - Martin Zimmermann:
Delay Games with WMSO+U Winning Conditions. 412-425 - Florian Zuleger:
Asymptotically Precise Ranking Functions for Deterministic Size-Change Systems. 426-442
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-04-27 18:10 CEST 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:
