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

• 2001
• 
  Mikel Aldaz, Guillermo Matera, José Luis Montaña, Luis Miguel Pardo:
  A new method to obtain lower bounds for polynomial evaluation. Theor. Comput. Sci. 259(1-2): 577-596 (2001)
• 
  Vikraman Arvind, Jacobo Torán:
  A nonadaptive NC checker for permutation group intersection. Theor. Comput. Sci. 259(1-2): 597-611 (2001)
• 
  André Barbé, Guentcho Skordev:
  Decimation-invariant sequences and their automaticity. Theor. Comput. Sci. 259(1-2): 379-403 (2001)
• 
  Stephen L. Bloom, Christian Choffrut:
  Long words: the theory of concatenation and omega-power. Theor. Comput. Sci. 259(1-2): 533-548 (2001)
• 
  Annalisa De Bonis, Luisa Gargano, Ugo Vaccaro:
  Efficient algorithms for chemical threshold testing problems. Theor. Comput. Sci. 259(1-2): 493-511 (2001)
• 
  Paola Bonizzoni, Ross M. McConnell:
  Nesting of prime substructures in k-ary relations. Theor. Comput. Sci. 259(1-2): 341-357 (2001)
• 
  Paola Bonizzoni, Gianluca Della Vedova:
  The complexity of multiple sequence alignment with SP-score that is a metric. Theor. Comput. Sci. 259(1-2): 63-79 (2001)
• 
  Arturo Carpi, Aldo de Luca:
  Words and special factors. Theor. Comput. Sci. 259(1-2): 145-182 (2001)
• 
  John Case, Keh-Jiann Chen, Sanjay Jain:
  Costs of general purpose learning. Theor. Comput. Sci. 259(1-2): 455-473 (2001)
• 
  Marek Chrobak, Christoph Dürr:
  Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms. Theor. Comput. Sci. 259(1-2): 81-98 (2001)
• 
  Marie-Andrée Jacob-Da Col:
  Applications quasi-affines et pavages du plan discret. Theor. Comput. Sci. 259(1-2): 245-269 (2001)
• 
  Jean-Christophe Dubacq, Bruno Durand, Enrico Formenti:
  Kolmogorov complexity and cellular automata classification. Theor. Comput. Sci. 259(1-2): 271-285 (2001)
• 
  Henning Fernau, Markus Holzer, Rudolf Freund:
  Hybrid modes in cooperating distributed grammar systems: internal versus external hybridization. Theor. Comput. Sci. 259(1-2): 405-426 (2001)
• 
  Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni:
  Dynamic algorithms for classes of constraint satisfaction problems. Theor. Comput. Sci. 259(1-2): 287-305 (2001)
• 
  Amparo Fúster-Sabater, L. Javier García-Villalba:
  An efficient algorithm to generate binary sequences for cryptographic purposes. Theor. Comput. Sci. 259(1-2): 679-688 (2001)
• 
  Andreas Goerdt:
  The giant component threshold for random regular graphs with edge faults H. Prodinger. Theor. Comput. Sci. 259(1-2): 307-321 (2001)
• 
  Dima Grigoriev:
  Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity. Theor. Comput. Sci. 259(1-2): 613-622 (2001)
• 
  David Guijarro, Víctor Lavín, Vijay Raghavan:
  Monotone term decision lists. Theor. Comput. Sci. 259(1-2): 549-575 (2001)
• 
  Gerald A. Heuer:
  Three-part partition games on rectangles. Theor. Comput. Sci. 259(1-2): 639-661 (2001)
• 
  Chính T. Hoàng, R. Sritharan:
  Finding houses and holes in graphs. Theor. Comput. Sci. 259(1-2): 233-244 (2001)
• 
  Dawei Hong, Jean-Camille Birget:
  Approximation of some NP-hard optimization problems by finite machines, in probability. Theor. Comput. Sci. 259(1-2): 323-339 (2001)
• 
  Juha Honkala, Arto Salomaa:
  Watson-Crick D0L systems with regular triggers. Theor. Comput. Sci. 259(1-2): 689-698 (2001)
• 
  Susanne Kaufmann, Frank Stephan:
  Robust learning with infinite additional information. Theor. Comput. Sci. 259(1-2): 427-454 (2001)
• 
  Peter Kirrinnis:
  Fast algorithms for the Sylvester equation AX-XB^T=C. Theor. Comput. Sci. 259(1-2): 623-638 (2001)
• 
  Ines Klimann:
  New types of automata to solve fixed point problems. Theor. Comput. Sci. 259(1-2): 183-197 (2001)
• 
  Kojiro Kobayashi:
  On time optimal solutions of the firing squad synchronization problem for two-dimensional paths. Theor. Comput. Sci. 259(1-2): 129-143 (2001)
• 
  Guo-Hui Lin, Guoliang Xue:
  Signed genome rearrangement by reversals and transpositions: models and approximations. Theor. Comput. Sci. 259(1-2): 513-531 (2001)
• 
  Gianluca De Marco, Luisa Gargano, Ugo Vaccaro:
  Concurrent multicast in weighted networks. Theor. Comput. Sci. 259(1-2): 359-377 (2001)
• 
  Maurice Margenstern, Kenichi Morita:
  NP problems are tractable in the space of cellular automata in the hyperbolic plane. Theor. Comput. Sci. 259(1-2): 99-128 (2001)
• 
  Lothar M. Schmitt:
  Theory of genetic algorithms. Theor. Comput. Sci. 259(1-2): 1-61 (2001)

skipping 5 more matches