• 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

• 2014
• 
  Rupam Acharyya, Sourav Chakraborty, Nitesh Jha:
  Counting Popular Matchings in House Allocation Problems. CSR 2014: 39-51
• 
  Saeed Akhoondian Amiri, Ali Golshani, Stephan Kreutzer, Sebastian Siebertz:
  Vertex Disjoint Paths in Upward Planar Graphs. CSR 2014: 52-64
• 
  Vikraman Arvind, S. Raja, A. V. Sreejith:
  On Lower Bounds for Multiplicative Circuits and Linear Circuits in Noncommutative Domains. CSR 2014: 65-76
• 
  Martijn Baartse, Klaus Meer:
  Testing Low Degree Trigonometric Polynomials. CSR 2014: 77-96
• 
  Abhishek Bhrushundi, Sourav Chakraborty, Raghav Kulkarni:
  Property Testing Bounds for Linear and Quadratic Functions via Parity Decision Trees. CSR 2014: 97-110
• 
  Anudhyan Boral, Marek Cygan, Tomasz Kociumaka, Marcin Pilipczuk:
  A Fast Branching Algorithm for Cluster Vertex Deletion. CSR 2014: 111-124
• 
  Stéphane Demri, Didier Galmiche, Dominique Larchey-Wendling, Daniel Méry:
  Separation Logic with One Quantified Variable. CSR 2014: 125-138
• 
  Volker Diekert, Artur Jez, Wojciech Plandowski:
  Finding All Solutions of Equations in Free Groups and Monoids with Involution. CSR 2014: 1-15
• 
  Stefan Edelkamp, Armin Weiß:
  QuickXsort: Efficient Sorting with n logn - 1.399n + o(n) Comparisons on Average. CSR 2014: 139-152
• 
  Henning Fernau, Juan Alberto Rodríguez-Velázquez:
  Notions of Metric Dimension of Corona Products: Combinatorial and Computational Results. CSR 2014: 153-166
• 
  Magnus Gausdal Find:
  On the Complexity of Computing Two Nonlinearity Measures. CSR 2014: 167-175
• 
  Lukas Fleischer, Manfred Kufleitner, Alexander Lauser:
  Block Products and Nesting Negations in FO2. CSR 2014: 176-189
• 
  Martin Fürer, Huiwen Yu:
  Space Saving by Dynamic Algebraization. CSR 2014: 375-388
• 
  Martin Grohe:
  Algorithmic Meta Theorems for Sparse Graph Classes. CSR 2014: 16-22
• 
  Milka Hutagalung, Martin Lange:
  Model Checking for String Problems. CSR 2014: 190-203
• 
  Sanjay Jain, Bakhadyr Khoussainov, Frank Stephan, Dan Teng, Siyuan Zou:
  Semiautomatic Structures. CSR 2014: 204-217
• 
  Akinori Kawachi, Benjamin Rossman, Osamu Watanabe:
  The Query Complexity of Witness Finding. CSR 2014: 218-231
• 
  Vladimir N. Krupski:
  Primal Implication as Encryption. CSR 2014: 232-244
• 
  Markus Lohrey, Manfred Schmidt-Schauß:
  Processing Succinct Matrices and Vectors. CSR 2014: 245-258
• 
  Barnaby Martin, Juraj Stacho:
  Constraint Satisfaction with Counting Quantifiers 2. CSR 2014: 259-272
• 
  Jenish C. Mehta:
  Dynamic Complexity of Planar 3-Connected Graph Isomorphism. CSR 2014: 273-286
• 
  Victor Y. Pan:
  Fast Approximate Computations with Cauchy Matrices, Polynomials and Rational Functions. CSR 2014: 287-299
• 
  Pawel Parys:
  First-Order Logic on CPDA Graphs. CSR 2014: 300-313
• 
  Max Rabkin:
  Recognizing Two-Sided Contexts in Cubic Time. CSR 2014: 314-324
• 
  Jazmín Romero, Alejandro López-Ortiz:
  A Parameterized Algorithm for Packing Overlapping Subgraphs. CSR 2014: 325-336
• 
  Julia Schüler, Andreas Spillner:
  Crossing-Free Spanning Trees in Visibility Graphs of Points between Monotone Polygonal Obstacles. CSR 2014: 337-350
• 
  Konrad W. Schwerdtfeger:
  The Connectivity of Boolean Satisfiability: Dichotomies for Formulas and Circuits. CSR 2014: 351-364
• 
  Alexei L. Semenov, Sergey Soprunov, Vladimir A. Uspensky:
  The Lattice of Definability. Origins, Recent Developments, and Further Directions. CSR 2014: 23-38
• 
  Nikolay K. Vereshchagin:
  Randomized Communication Complexity of Approximating Kolmogorov Complexity. CSR 2014: 365-374
• 
  Edward A. Hirsch, Sergei O. Kuznetsov, Jean-Éric Pin, Nikolay K. Vereshchagin:
  Computer Science - Theory and Applications - 9th International Computer Science Symposium in Russia, CSR 2014, Moscow, Russia, June 7-11, 2014. Proceedings. Lecture Notes in Computer Science 8476, Springer 2014, ISBN 978-3-319-06685-1 [contents]