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

• 2007
• 
  Nir Andelman, Yossi Azar, Motti Sorani:
  Truthful Approximation Mechanisms for Scheduling Selfish Related Machines. Theory Comput. Syst. 40(4): 423-436 (2007)
• 
  Lali Barrière, Paola Flocchini, Pierre Fraigniaud, Nicola Santoro:
  Rendezvous and Election of Mobile Agents: Impact of Sense of Direction. Theory Comput. Syst. 40(2): 143-162 (2007)
• 
  Valérie Berthé, Michel Rigo:
  Odometers on Regular Languages. Theory Comput. Syst. 40(1): 1-31 (2007)
• 
  Dietmar Berwanger, Erich Grädel, Giacomo Lenzi:
  The Variable Hierarchy of the µ-Calculus Is Strict. Theory Comput. Syst. 40(4): 437-466 (2007)
• 
  Harry Buhrman, Ilan Newman, Hein Röhrig, Ronald de Wolf:
  Robust Polynomials and Quantum Algorithms. Theory Comput. Syst. 40(4): 379-395 (2007)
• 
  Fabio Burderi, Antonio Restivo:
  Varieties of Codes and Kraft Inequality. Theory Comput. Syst. 40(4): 507-520 (2007)
• 
  Volker Diekert, Bruno Durand:
  Foreword. Theory Comput. Syst. 40(4): 301 (2007)
• 
  Benjamin Doerr:
  Roundings Respecting Hard Constraints. Theory Comput. Syst. 40(4): 467-483 (2007)
• 
  Frank Drewes, Johanna Högberg:
  Query Learning of Regular Tree Languages: How to Avoid Dead States. Theory Comput. Syst. 40(2): 163-185 (2007)
• 
  Gianni Franceschini:
  Sorting Stably, in Place, with O(n log n) Comparisons and O(n) Moves. Theory Comput. Syst. 40(4): 327-353 (2007)
• 
  Peter J. Grabner, Michel Rigo:
  Distribution of Additive Functions with Respect to Numeration Systems on Regular Languages. Theory Comput. Syst. 40(3): 205-223 (2007)
• 
  Vesa Halava, Tero Harju, Juhani Karhumäki:
  The Structure of Infinite Solutions of Marked and Binary Post Correspondence Problems. Theory Comput. Syst. 40(1): 43-54 (2007)
• 
  Thomas Hofmeister, Uwe Schöning, Rainer Schuler, Osamu Watanabe:
  Randomized Algorithms for 3-SAT. Theory Comput. Syst. 40(3): 249-262 (2007)
• 
  Emmanuel Jeandel:
  Topological Automata. Theory Comput. Syst. 40(4): 397-407 (2007)
• 
  Haim Kaplan, Tova Milo, Ronen Shabo:
  Compact Labeling Scheme for XML Ancestor Queries. Theory Comput. Syst. 40(1): 55-99 (2007)
• 
  Telikepalli Kavitha, Kurt Mehlhorn:
  Algorithms to Compute Minimum Cycle Basis in Directed Graphs. Theory Comput. Syst. 40(4): 485-505 (2007)
• 
  Ondrej Klíma, Pascal Tesson, Denis Thérien:
  Dichotomies in the Complexity of Solving Systems of Equations over Finite Semigroups. Theory Comput. Syst. 40(3): 263-297 (2007)
• 
  Matthias Krause:
  OBDD-Based Cryptanalysis of Oblivious Keystream Generators. Theory Comput. Syst. 40(1): 101-121 (2007)
• 
  Andreas Krebs, Klaus-Jörn Lange, Stephanie Reifferscheid:
  Characterizing TC⁰ in Terms of Infinite Groups. Theory Comput. Syst. 40(4): 303-325 (2007)
• 
  Michal Kunc:
  The Power of Commuting with Finite Sets of Words. Theory Comput. Syst. 40(4): 521-551 (2007)
• 
  Gregorio Malajovich, Klaus Meer:
  Computing Minimal Multi-Homogeneous Bezout Numbers Is Hard. Theory Comput. Syst. 40(4): 553-570 (2007)
• 
  Euripides Markou, Andrzej Pelc:
  Efficient Exploration of Faulty Trees. Theory Comput. Syst. 40(3): 225-247 (2007)
• 
  Victor Poupet:
  Cellular Automata: Real-Time Equivalence between One-Dimensional Neighborhoods. Theory Comput. Syst. 40(4): 409-421 (2007)
• 
  Igor E. Shparlinski, Ron Steinfeld:
  Chinese Remaindering with Multiplicative Noise. Theory Comput. Syst. 40(1): 33-41 (2007)
• 
  Yung H. Tsin:
  A Simple 3-Edge-Connected Component Algorithm. Theory Comput. Syst. 40(2): 125-142 (2007)
• 
  Volker Weber, Thomas Schwentick:
  Dynamic Complexity Theory Revisited. Theory Comput. Syst. 40(4): 355-377 (2007)
• 
  Guang Xu, Jinhui Xu:
  Constant Approximation Algorithms for Rectangle Stabbing and Related Problems. Theory Comput. Syst. 40(2): 187-204 (2007)