• 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 30 matches

• 2012
• 
  Maxim A. Babenko, Ivan Pouzyrevsky:
  Resilient Quicksort and Selection. CSR 2012: 6-17
• 
  Sebastian S. Bauer, Uli Fahrenberg, Axel Legay, Claus R. Thrane:
  General Quantitative Specification Theories with Modalities. CSR 2012: 18-30
• 
  Michael Blondin, Pierre McKenzie:
  The Complexity of Intersecting Finite Automata Having Few Final States. CSR 2012: 31-42
• 
  Bartlomiej Bosek, Stefan Felsner, Kolja B. Knauer, Grzegorz Matecki:
  News about Semiantichains and Unichain Coverings. CSR 2012: 43-51
• 
  Dmitry V. Chistikov:
  Checking Tests for Read-Once Functions over Arbitrary Bases. CSR 2012: 52-63
• 
  Nachshon Cohen, Zeev Nutov:
  Approximating Minimum Power Edge-Multi-Covers. CSR 2012: 64-75
• 
  Evgeny Demenkov:
  A Lower Bound on Circuit Complexity of Vector Function in U 2. CSR 2012: 76-80
• 
  Evgeny Demenkov, Alexander S. Kulikov, Ivan Mihajlin, Hiroki Morizumi:
  Computing All MOD-Functions Simultaneously. CSR 2012: 81-88
• 
  Volker Diekert, Manfred Kufleitner:
  Bounded Synchronization Delay in Omega-Rational Expressions. CSR 2012: 89-98
• 
  Martin Dietzfelbinger, Michael Rink:
  Towards Optimal Degree-Distributions for Left-Perfect Matchings in Random Bipartite Graphs. CSR 2012: 99-111
• 
  Stefan Dobrev, Evangelos Kranakis, Oscar Morales-Ponce, Milan Plzík:
  Robust Sensor Range for Constructing Strongly Connected Spanning Digraphs in UDGs. CSR 2012: 112-124
• 
  Amr Elmasry, Jyrki Katajainen:
  Worst-Case Optimal Priority Queues via Extended Regular Counters. CSR 2012: 125-137
• 
  Eli Fox-Epstein, Danny Krizanc:
  The Complexity of Minor-Ancestral Graph Properties with Forbidden Pairs. CSR 2012: 138-147
• 
  Andreas Goerdt, Lutz Falke:
  Satisfiability Thresholds beyond k -XORSAT. CSR 2012: 148-159
• 
  Petr A. Golovach, Bernard Lidický, Barnaby Martin, Daniël Paulusma:
  Finding Vertex-Surjective Graph Homomorphisms. CSR 2012: 160-171
• 
  Pinar Heggernes, Sigve Hortemo Sæther:
  Broadcast Domination on Block Graphs in Linear Time. CSR 2012: 172-183
• 
  Bernhard Heinemann:
  Characterizing Certain Topological Specifications. CSR 2012: 184-195
• 
  Galina Jirásková:
  Descriptional Complexity of Operations on Alternating and Boolean Automata. CSR 2012: 196-204
• 
  Timo Jolivet, Jarkko Kari:
  Consistency of Multidimensional Combinatorial Substitutions. CSR 2012: 205-216
• 
  Christos A. Kapoutsis, Giovanni Pighizzini:
  Two-Way Automata Characterizations of L/poly versus NL. CSR 2012: 217-228
• 
  Prateek Karandikar, Philippe Schnoebelen:
  Cutting through Regular Post Embedding Problems. CSR 2012: 229-240
• 
  Dennis Komm, Richard Královic, Tobias Mömke:
  On the Advice Complexity of the Set Cover Problem. CSR 2012: 241-252
• 
  Florent R. Madelaine, Barnaby Martin, Juraj Stacho:
  Constraint Satisfaction with Counting Quantifiers. CSR 2012: 253-265
• 
  Daniil Musatov:
  Space-Bounded Kolmogorov Extractors. CSR 2012: 266-277
• 
  Romeo Rizzi, Florian Sikora:
  Some Results on more Flexible Versions of Graph Motif. CSR 2012: 278-289
• 
  Ville Salo:
  A Characterization of Cellular Automata Generated by Idempotents on the Full Shift. CSR 2012: 290-301
• 
  Svetlana N. Selezneva:
  Constructing Polynomials for Functions over Residue Rings Modulo a Composite Number in Linear Time. CSR 2012: 302-313
• 
  Hans Ulrich Simon:
  Boolean Composition of Visual Secret Sharing Schemes. CSR 2012: 314-325
• 
  Vijay V. Vazirani:
  Can the Theory of Algorithms Ratify the "Invisible Hand of the Market"? CSR 2012: 1-5
• 
  Edward A. Hirsch, Juhani Karhumäki, Arto Lepistö, Michail Kh. Prilutskii:
  Computer Science - Theory and Applications - 7th International Computer Science Symposium in Russia, CSR 2012, Nizhny Novgorod, Russia, July 3-7, 2012. Proceedings. Lecture Notes in Computer Science 7353, Springer 2012, ISBN 978-3-642-30641-9 [contents]