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

• 1993
• 
  Javed A. Aslam, Aditi Dhagat:
  On-Line Algorithms for 2-Coloring Hypergraphs Via Chip Games. Theor. Comput. Sci. 112(2): 355-369 (1993)
• 
  Jean-Daniel Boissonnat, Monique Teillaud:
  On the Randomized Construction of the Delaunay Tree. Theor. Comput. Sci. 112(2): 339-354 (1993)
• 
  Richard D. Bourgin, Sally E. Howe:
  Shortest Curves in Planar Regions with Curved Boundary. Theor. Comput. Sci. 112(2): 215-253 (1993)
• 
  Cristian Calude, Cezar Câmpeanu:
  Note on the Topological Structure of Random Strings. Theor. Comput. Sci. 112(2): 383-390 (1993)
• 
  Erzsébet Csuhaj-Varjú, Alica Kelemenová:
  Descriptional Complexity of Context-Free Grammar Forms. Theor. Comput. Sci. 112(2): 277-289 (1993)
• 
  Aviezri S. Fraenkel, Edward R. Scheinerman, Daniel Ullman:
  Undirected Edge Geography. Theor. Comput. Sci. 112(2): 371-381 (1993)
• 
  Thomas Herbst, Richard M. Thomas:
  Group Presentations, Formal Languages and Characterizations of One-Counter Groups. Theor. Comput. Sci. 112(2): 187-213 (1993)
• 
  Oscar H. Ibarra, Nicholas Q. Trân:
  A Note on Simple Programs with Two Variables. Theor. Comput. Sci. 112(2): 391-397 (1993)
• 
  Ryszard Janicki, Maciej Koutny:
  Structure of Concurrency. Theor. Comput. Sci. 112(1): 5-52 (1993)
• 
  Ivan Korec:
  Irrational Speeds of Configurations Growth in Generalized Pascal Triangles. Theor. Comput. Sci. 112(2): 399-412 (1993)
• 
  Jean Néraud:
  Deciding Whether a Finite Set of Words has Rank at Most Two. Theor. Comput. Sci. 112(2): 311-337 (1993)
• 
  Mitsunori Ogiwara, Antoni Lozano:
  On Sparse Hard Sets for Counting Classes. Theor. Comput. Sci. 112(2): 255-275 (1993)
• 
  Jerzy Skurczynski:
  The Borel Hierarchy is Infinite in the Class of Regular Sets of Trees. Theor. Comput. Sci. 112(2): 413-418 (1993)
• 
  Yellamraju V. Srinivas:
  A Sheaf-Theoretic Approach to Pattern Matching and Related Problems. Theor. Comput. Sci. 112(1): 53-97 (1993)
• 
  Carl Sturtivant, Gudmund Skovbjerg Frandsen:
  The Computational Efficacy of Finite-Field Arithmetic. Theor. Comput. Sci. 112(2): 291-309 (1993)
• 
  Ondrej Sýkora, Imrich Vrto:
  Edge Separators for Graphs of Bounded Genus with Applications. Theor. Comput. Sci. 112(2): 419-429 (1993)
• 
  Carolyn L. Talcott:
  A Theory of Binding Structures and Applications to Rewriting. Theor. Comput. Sci. 112(1): 99-143 (1993)
• 
  Muffy Thomas, Phil Watson:
  Solving Divergence in Knuth-Bendix Completion by Enriching Signatures. Theor. Comput. Sci. 112(1): 145-185 (1993)