• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 29 matches

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