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

• 2000
• 
  Luca Aceto, Zoltán Ésik, Anna Ingólfsdóttir:
  On the Two-Variable Fragment of the Equational Theory of the Max-Sum Algebra of the Natural Numbers. STACS 2000: 267-278
• 
  Hesham Al-Ammal, Leslie Ann Goldberg, Philip D. MacKenzie:
  Binary Exponential Backoff Is Stable for High Arrival Rates. STACS 2000: 169-180
• 
  Eric Allender, Meena Mahajan:
  The Complexity of Planarity Testing. STACS 2000: 87-98
• 
  Andris Ambainis, Ronald de Wolf:
  Average-Case Quantum Query Complexity. STACS 2000: 133-144
• 
  Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, Sebastiaan Terwijn:
  Almost Complete Sets. STACS 2000: 419-430
• 
  Vikraman Arvind, Johannes Köbler:
  Graph Isomorphism Is Low for ZPP(NP) and Other Lowness Results. STACS 2000: 431-442
• 
  Vikraman Arvind, Johannes Köbler, Martin Mundhenk, Jacobo Torán:
  Nondeterministic Instance Complexity and Hard-to-Prove Tautologies. STACS 2000: 314-323
• 
  Norbert Ascheuer, Sven Oliver Krumke, Jörg Rambau:
  Online Dial-a-Ride Problems: Minimizing the Completion Time. STACS 2000: 639-650
• 
  Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude König:
  An Approximation Algorithm for the Precedence Constrained Scheduling Problem with Hierarchical Communications. STACS 2000: 443-454
• 
  Yair Bartal, Elias Koutsoupias:
  On the Competitive Ratio of the Work Function Algorithm for the k-Server Problem. STACS 2000: 605-613
• 
  Alberto Bertoni, Massimiliano Goldwurm, Massimo Santini:
  Random Generation and Approximate Counting of Ambiguously Described Combinatorial Structures. STACS 2000: 567-580
• 
  Vincent D. Blondel, Olivier Bournez, Pascal Koiran, John N. Tsitsiklis:
  The Stability of Saturated Linear Dynamical Systems Is Undecidable. STACS 2000: 479-490
• 
  Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger:
  An Improved Lower Bound on the Approximability of Metric TSP and Approximation Algorithms for the TSP with Sharpened Triangle Inequality. STACS 2000: 382-394
• 
  Hans L. Bodlaender, Ton Kloks, Richard B. Tan, Jan van Leeuwen:
  lambda-Coloring of Graphs. STACS 2000: 395-406
• 
  Annalisa De Bonis, Alfredo De Santis:
  Randomness in Visual Cryptography. STACS 2000: 626-638
• 
  Vincent Bouchitté, Ioan Todinca:
  Listing All Potential Maximal Cliques of a Graph. STACS 2000: 503-515
• 
  Harry Buhrman, Stephen A. Fenner, Lance Fortnow, Dieter van Melkebeek:
  Optimal Proof Systems and Sparse Sets. STACS 2000: 407-418
• 
  Julien Cervelle, Bruno Durand:
  Tilings: Recursivity and Regularity. STACS 2000: 491-502
• 
  Marek Chrobak, Jirí Sgall:
  The Weighted 2-Server Problem. STACS 2000: 593-604
• 
  Andrea E. F. Clementi, Paolo Penna, Riccardo Silvestri:
  The Power Range Assignment Problem in Radio Networks on the Plane. STACS 2000: 651-660
• 
  Kaustubh Deshmukh, Priti Shankar, Amitava Dasgupta, B. Sundar Rajan:
  On the Many Faces of Block Codes. STACS 2000: 53-64
• 
  Catalin Dima:
  Real-Time Automata and the Kleene Algebra of Sets of Real Numbers. STACS 2000: 279-289
• 
  Stefan Edelkamp, Ingo Wegener:
  On the Performance of WEAK-HEAPSORT. STACS 2000: 254-266
• 
  Michael Elkin, David Peleg:
  The Hardness of Approximating Spanner Problems. STACS 2000: 370-381
• 
  Joost Engelfriet, Sebastian Maneth:
  Characterizing and Deciding MSO-Definability of Macro Tree Transductions. STACS 2000: 542-554
• 
  Alain Finkel, Grégoire Sutre:
  Decidability of Reachability Problems for Classes of Two Counters Automata. STACS 2000: 346-357
• 
  Jessica H. Fong, Martin Strauss:
  An Approximate L^p-Difference Algorithm for Massive Data Streams. STACS 2000: 193-204
• 
  Christian Glaßer, Heinz Schmitz:
  Languages of Dot-Depth 3/2. STACS 2000: 555-566
• 
  Mikael Goldmann, Alexander Russell:
  Spectral Bounds on General Hard Core Predicates. STACS 2000: 614-625
• 
  Yijie Han:
  Fast Integer Sorting in Linear Space. STACS 2000: 242-253

skipping 25 more matches