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

• 1997
• 
  Jean-Paul Allouche, Emmanuel Cateland, William J. Gilbert, Heinz-Otto Peitgen, Jeffrey O. Shallit, Guentcho Skordev:
  Automatic Maps in Exotic Numeration System. Theory Comput. Syst. 30(3): 285-331 (1997)
• 
  Kazuyuki Amano, Akira Maruoka:
  Approximation Algorithms for DNF Under Distributions with Limited Independence. Theory Comput. Syst. 30(2): 181-196 (1997)
• 
  Gianfranco Bilardi, Franco P. Preparata:
  Processor-Time Tradeoffs under Bounded-Speed Message Propagation: Part I, Upper Bounds. Theory Comput. Syst. 30(6): 523-546 (1997)
• 
  Hans-Jörg Burtschick, Wolfgang Lindner:
  On Sets Turing Reducible to p-Selective Sets. Theory Comput. Syst. 30(2): 135-143 (1997)
• 
  Eric Goles Ch., Martín Matamala:
  Reaction-Diffusion Automata: Three States Implies Universality. Theory Comput. Syst. 30(3): 223-229 (1997)
• 
  Patrizio Cintioli, Riccardo Silvestri:
  Helping by Unambiguous Computation and Probabilistic Computation. Theory Comput. Syst. 30(2): 165-180 (1997)
• 
  Carsten Damm, Markus Holzer, Peter Rossmanith:
  Expressing Uniformity via Oracles. Theory Comput. Syst. 30(4): 355-366 (1997)
• 
  Frank K. H. A. Dehne, Xiaotie Deng, Patrick W. Dymond, Andreas Fabri, Ashfaq A. Khokhar:
  A Randomized Parallel Three-Dimensional Convex Hull Algorithm for Coarse-Grained Multicomputers. Theory Comput. Syst. 30(6): 547-558 (1997)
• 
  Shimon Even, Sergio Rajsbaum:
  The Use of a Synchronizer Yields the Maximum Computation Rate in Distributed Networks. Theory Comput. Syst. 30(5): 447-474 (1997)
• 
  Moti Frances, Ami Litman:
  On Covering Problems of Codes. Theory Comput. Syst. 30(2): 113-119 (1997)
• 
  James Haralambides, Fillia Makedon:
  Approximation Algorithms for the Bandwidth Minimization Problem for a Large Class of Trees. Theory Comput. Syst. 30(1): 67-90 (1997)
• 
  Lenwood S. Heath:
  Graph Embeddings and Simplicial Maps. Theory Comput. Syst. 30(1): 51-65 (1997)
• 
  Friedhelm Meyer auf der Heide, Martin Storch, Rolf Wanka:
  Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks. Theory Comput. Syst. 30(6): 627-644 (1997)
• 
  Hendrik Jan Hoogeboom, Paulien ten Pas:
  Monadic Second-Order Definable Text Languages. Theory Comput. Syst. 30(4): 335-354 (1997)
• 
  Christos Kaklamanis, Danny Krizanc, Satish Rao:
  New Graph Decompositions with Applications to Emulations. Theory Comput. Syst. 30(1): 39-49 (1997)
• 
  Frank Thomson Leighton, Yuan Ma, Torsten Suel:
  On Probabilistic Networks for Selection, Merging, and Sorting. Theory Comput. Syst. 30(6): 559-582 (1997)
• 
  Charles E. Leiserson, Keith H. Randall:
  Parallel Algorithms for the Circuit Value Update Problem. Theory Comput. Syst. 30(6): 583-597 (1997)
• 
  Jack H. Lutz:
  Observations on Measure and Lowness for \Deltap_2. Theory Comput. Syst. 30(4): 429-442 (1997)
• 
  Philip D. MacKenzie:
  Lower Bounds for Randomized Exclusive Write PRAMs. Theory Comput. Syst. 30(6): 599-626 (1997)
• 
  Ioan I. Macarie:
  Multihead Two-Way Probabilistic Finite Automata. Theory Comput. Syst. 30(1): 91-109 (1997)
• 
  Christoph Meinel, Anna Slobodová:
  A Reducibility Concept for Problems Defined in Terms of Ordered Binary Decision Diagrams. Theory Comput. Syst. 30(5): 495-518 (1997)
• 
  Luis B. Morales:
  Diagonal Polynomials and Diagonal Orders on Multidimensional Lattices. Theory Comput. Syst. 30(4): 367-382 (1997)
• 
  Andrea Pietracaprina, Franco P. Preparata:
  Practical Constructive Schemes for Deterministic Shared-Memory Access. Theory Comput. Syst. 30(1): 3-37 (1997)
• 
  Andrea Pietracaprina, Geppino Pucci:
  The Complexity of Deterministic PRAM Simulation on Distributed Memory Machines. Theory Comput. Syst. 30(3): 231-247 (1997)
• 
  Jean-Eric Pin, Pascal Weil:
  Ponynominal Closure and Unambiguous Product. Theory Comput. Syst. 30(4): 383-422 (1997)
• 
  Nicholas Pippenger:
  Regular Languages and Stone Duality. Theory Comput. Syst. 30(2): 121-134 (1997)
• 
  Françoise Point, Véronique Bruyère:
  On the Cobham-Semenov Theorem. Theory Comput. Syst. 30(2): 197-220 (1997)
• 
  Vijay Raghavan, Dawn Wilkins:
  A Characterization and Nearly Linear-Time Equivalence Test for µ-Branching Programs. Theory Comput. Syst. 30(3): 249-283 (1997)
• 
  Uwe Schöning:
  Complexity of Presburger Arithmetic with Fixed Quantifier Dimension. Theory Comput. Syst. 30(4): 423-428 (1997)
• 
  Nir Shavit, Dan Touitou:
  Elimination Trees and the Construction of Pools and Stacks. Theory Comput. Syst. 30(6): 645-670 (1997)

skipping 3 more matches