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

• 2000
• 
  Micah Adler, Christian Scheideler:
  Efficient Communication Strategies for Ad Hoc Wireless Networks. Theory Comput. Syst. 33(5/6): 337-391 (2000)
• 
  Jochen Alber, Rolf Niedermeier:
  On Multidimensional Curves with Hilbert Property. Theory Comput. Syst. 33(4): 295-312 (2000)
• 
  Hannah Bast:
  On Scheduling Parallel Tasks at Twilight. Theory Comput. Syst. 33(5/6): 489-563 (2000)
• 
  Stefan D. Bruda, Selim G. Akl:
  The Characterization of Data-Accumulating Algorithms. Theory Comput. Syst. 33(1): 85-96 (2000)
• 
  Hong-Chung Chen, Yue-Li Wang:
  An Efficient Algorithm for Generating Prüfer Codes from Labelled Trees. Theory Comput. Syst. 33(1): 97-105 (2000)
• 
  Alessandra Cherubini, Pierluigi San Pietro:
  Tree Adjoining Languages and Multipushdown Languages. Theory Comput. Syst. 33(4): 257-293 (2000)
• 
  Thomas H. Cormen, Frank K. H. A. Dehne, Pierre Fraigniaud, Yossi Matias:
  Guest Editors' Foreword. Theory Comput. Syst. 33(5/6): 335 (2000)
• 
  Bruno Courcelle, Johann A. Makowsky, Udi Rotics:
  Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width. Theory Comput. Syst. 33(2): 125-150 (2000)
• 
  Pierluigi Crescenzi, Luca Trevisan:
  On Approximation Scheme Preserving Reducibility and Its Applications. Theory Comput. Syst. 33(1): 1-16 (2000)
• 
  Artur Czumaj:
  Recovery Time of Dynamic Allocation Processes. Theory Comput. Syst. 33(5/6): 465-487 (2000)
• 
  Panagiota Fatourou, Paul G. Spirakis:
  Efficient Scheduling of Strict Multithreaded Computations. Theory Comput. Syst. 33(3): 173-232 (2000)
• 
  Akio Fujiyoshi, Takumi Kasai:
  Spinal-Formed Context-Free Tree Grammars. Theory Comput. Syst. 33(1): 59-83 (2000)
• 
  Sanjay Jain, Arun Sharma:
  Team Learning of Computable Languages. Theory Comput. Syst. 33(1): 35-58 (2000)
• 
  David W. Juedes, Jack H. Lutz:
  Modeling Time-Bounded Prefix Kolmogorov Complexity. Theory Comput. Syst. 33(2): 111-123 (2000)
• 
  Spyros C. Kontogiannis, Grammati E. Pantziou, Paul G. Spirakis, Moti Yung:
  Robust Parallel Computations through Randomization. Theory Comput. Syst. 33(5/6): 427-464 (2000)
• 
  Ambrose Kofi Laing, Robert Cypher, Christian A. Duncan:
  On the Flattest Common Supersequence Method for Deadlock-Free Routing in Arbitrary Networks. Theory Comput. Syst. 33(5/6): 393-426 (2000)
• 
  Wolfgang Lindner, Rainer Schuler, Osamu Watanabe:
  Resource-Bounded Measure and Learnability. Theory Comput. Syst. 33(2): 151-170 (2000)
• 
  Luis B. Morales, A. Sánchez-Flores:
  Erratum: Diagonal Polynomials and Diagonal Orders on Multidimensional Lattices. Theory Comput. Syst. 33(1): 107 (2000)
• 
  C. Greg Plaxton, Torsten Suel:
  A Superlogarithmic Lower Bound for Shuffle-Unshuffle Sorting Networks. Theory Comput. Syst. 33(3): 233-254 (2000)
• 
  Arnold L. Rosenberg:
  Editorial Message. Theory Comput. Syst. 33(5/6): 333 (2000)
• 
  Yoshifumi Sakai, Akira Maruoka:
  Learning Monotone Log-Term DNF Formulas under the Uniform Distribution. Theory Comput. Syst. 33(1): 17-33 (2000)
• 
  Martin Sauerhoff:
  An Improved Hierarchy Result for Partitioned BDDs. Theory Comput. Syst. 33(4): 313-329 (2000)