default search action
CSR 2017: Kazan, Russia
- Pascal Weil:
Computer Science - Theory and Applications - 12th International Computer Science Symposium in Russia, CSR 2017, Kazan, Russia, June 8-12, 2017, Proceedings. Lecture Notes in Computer Science 10304, Springer 2017, ISBN 978-3-319-58746-2 - Thierry Coquand:
Type Theory and Formalisation of Mathematics. 1-6 - Javier Esparza
:
Advances in Parameterized Verification of Population Protocols. 7-14 - Alexandru Gheorghiu, Theodoros Kapourniotis, Elham Kashefi:
Verification of Quantum Computation and the Price of Trust. 15-19 - Andrew McGregor:
Graph Sketching and Streaming: New Approaches for Analyzing Massive Graphs. 20-24 - Thomas Place, Marc Zeitoun
Concatenation Hierarchies: New Bottle, Old Wine. 25-37 - Ronitt Rubinfeld:
Can We Locally Compute Sparse Connected Subgraphs? 38-47 - Michal Adamczyk, Mai Alzamel, Panagiotis Charalampopoulos
Palindromic Decompositions with Gaps and Errors. 48-61 - Maxim A. Babenko, Ignat I. Kolesnichenko, Ivan Smirnov:
Cascade Heap: Towards Time-Optimal Extractions. 62-70 - Olivier Bodini, Matthieu Dien, Antoine Genitrini, Frédéric Peschanski:
Entropic Uniform Sampling of Linear Extensions in Series-Parallel Posets. 71-84 - Cornelius Brand, Marc Roth
Parameterized Counting of Trees, Forests and Matroid Bases. 85-98 - Marie-Pierre Béal, Pavel Heller:
Generalized Dyck Shifts. 99-111 - Lukas Fleischer, Manfred Kufleitner
Green's Relations in Finite Transformation Semigroups. 112-125 - Aida Gainutdinova, Abuzer Yakaryilmaz
Nondeterministic Unitary OBDDs. 126-140 - Viliam Geffert:
Unary Coded PSPACE-Complete Languages in ASPACE(loglog n). 141-153 - Michael Hochman, Pascal Vanier
Turing Degree Spectra of Minimal Subshifts. 154-161 - Kamil Khadiev
Reordering Method and Hierarchies for Quantum and Classical Ordered Binary Decision Diagrams. 162-175 - Elena Khramtcova, Maarten Löffler:
Dynamic Stabbing Queries with Sub-logarithmic Local Updates for Overlapping Intervals. 176-190 - Chris Köcher
The Transformation Monoid of a Partially Lossy Queue. 191-205 - Gilad Kutiel:
Approximation Algorithms for the Maximum Carpool Matching Problem. 206-216 - Alexei Miasnikov, Svetla Vassileva, Armin Weiß
The Conjugacy Problem in Free Solvable Groups and Wreath Products of Abelian Groups is in $${{\mathsf {T}}}{{\mathsf {C}}}^0$$. 217-231 - Alexey Milovanov:
On Algorithmic Statistics for Space-Bounded Algorithms. 232-244 - Meghana Nasre
Popularity in the Generalized Hospital Residents Setting. 245-259 - Alexander Okhotin
Edit Distance Neighbourhoods of Input-Driven Pushdown Automata. 260-272 - Mozhgan Pourmoradnasseri
The (Minimum) Rank of Typical Fooling-Set Matrices. 273-284 - Alexander V. Seliverstov
On Probabilistic Algorithm for Solving Almost All Instances of the Set Partition Problem. 285-293 - Dmitry Sokolov
Dag-Like Communication and Its Applications. 294-307 - Oleg Verbitsky, Maksim Zhukovskii:
The Descriptive Complexity of Subgraph Isomorphism Without Numerics. 308-322 - Piotr Wojciechowski, Ramaswamy Chandrasekaran, K. Subramani:
On a Generalization of Horn Constraint Systems. 323-336
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 2024-10-01 20:31 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: