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

• 2004
• 
  Naoki Abe, Roni Khardon:
  Foreword. Theor. Comput. Sci. 313(2): 173-174 (2004)
• 
  Ingo Althöfer:
  Improved game play by multiple computer hint. Theor. Comput. Sci. 313(3): 315-324 (2004)
• 
  Dana Angluin:
  Queries revisited. Theor. Comput. Sci. 313(2): 175-194 (2004)
• 
  Anne Bergeron, Sylvie Hamel:
  From cascade decompositions to bit-vector algorithms. Theor. Comput. Sci. 313(1): 3-16 (2004)
• 
  Bernard Boigelot, Louis Latour:
  Counting the solutions of Presburger equations without enumerating them. Theor. Comput. Sci. 313(1): 17-29 (2004)
• 
  Jean-Marc Champarnaud, Gérard Duchamp:
  Derivatives of rational expressions and related theorems. Theor. Comput. Sci. 313(1): 31-44 (2004)
• 
  Jan Daciuk, Gertjan van Noord:
  Finite automata for compact representation of tuple dictionaries. Theor. Comput. Sci. 313(1): 45-56 (2004)
• 
  Zhe Dang, Tevfik Bultan, Oscar H. Ibarra, Richard A. Kemmerer:
  Past pushdown timed automata and safety verification. Theor. Comput. Sci. 313(1): 57-71 (2004)
• 
  Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer:
  Solitaire Clobber. Theor. Comput. Sci. 313(3): 325-338 (2004)
• 
  Erik D. Demaine, Rudolf Fleischer, Aviezri S. Fraenkel, Richard J. Nowakowski:
  Appendix B: Open problems at the 2002 Dagstuhl Seminar on Algorithmic Combinatorial Game Theory. Theor. Comput. Sci. 313(3): 539-543 (2004)
• 
  François Denis, Aurélien Lemay, Alain Terlutte:
  Learning regular languages using RFSAs. Theor. Comput. Sci. 313(2): 267-294 (2004)
• 
  Benjamin Doerr:
  European tenure games. Theor. Comput. Sci. 313(3): 339-351 (2004)
• 
  Ioana Dumitriu, Joel Spencer:
  A Halfliar's game. Theor. Comput. Sci. 313(3): 353-369 (2004)
• 
  Péter L. Erdös, Ulrich Faigle, Winfried Hochstättler, Walter Kern:
  Note on the game chromatic index of trees. Theor. Comput. Sci. 313(3): 371-376 (2004)
• 
  Jacques Farré, José Fortes Gálvez:
  Bounded-connect noncanonical discriminating-reverse parsers. Theor. Comput. Sci. 313(1): 73-91 (2004)
• 
  Sándor P. Fekete, Rudolf Fleischer, Aviezri S. Fraenkel, Matthias Schmitt:
  Traveling salesmen in the presence of competition. Theor. Comput. Sci. 313(3): 377-392 (2004)
• 
  Rudolf Fleischer, Richard J. Nowakowski:
  Preface: Algorithmic Combinatorial Game Theory. Theor. Comput. Sci. 313(3): 313 (2004)
• 
  Aviezri S. Fraenkel:
  Complexity, appeal and challenges of combinatorial games. Theor. Comput. Sci. 313(3): 393-415 (2004)
• 
  Nathalie Friburger, Denis Maurel:
  Finite-state transducer cascades to extract named entities in texts. Theor. Comput. Sci. 313(1): 93-104 (2004)
• 
  Tamás Gaál:
  Deciding sequentiability of finite-state transducers by finite-state pattern-matching. Theor. Comput. Sci. 313(1): 105-117 (2004)
• 
  Dominique Geniet, Jean-Philippe Dubernard:
  Scheduling hard sporadic tasks with regular languages and generating functions. Theor. Comput. Sci. 313(1): 119-132 (2004)
• 
  J. P. Grossman:
  Periodicity in one-dimensional peg duotaire. Theor. Comput. Sci. 313(3): 417-425 (2004)
• 
  J. P. Grossman:
  Appendix A: Report on the First International Clobber Tournament. Theor. Comput. Sci. 313(3): 533-537 (2004)
• 
  Frank Harary, Wolfgang Slany, Oleg Verbitsky:
  On the lengths of symmetry breaking-preserving games on graphs. Theor. Comput. Sci. 313(3): 427-446 (2004)
• 
  Colin de la Higuera, Jean-Christophe Janodet:
  Inference of [omega]-languages from prefixes. Theor. Comput. Sci. 313(2): 295-312 (2004)
• 
  Markus Holzer, Stefan Schwoon:
  Assembling molecules in ATOMIX is hard. Theor. Comput. Sci. 313(3): 447-462 (2004)
• 
  S. Howse, Richard J. Nowakowski:
  Periodicity and arithmetic-periodicity in hexadecimal games. Theor. Comput. Sci. 313(3): 463-472 (2004)
• 
  Sanjay Jain, Frank Stephan:
  Learning how to separate. Theor. Comput. Sci. 313(2): 209-228 (2004)
• 
  Yuri Kalnishkan, Volodya Vovk, Michael V. Vyugin:
  Loss functions, complexities, and the Legendre transformation. Theor. Comput. Sci. 313(2): 195-207 (2004)
• 
  Frank Katritzke, Wolfgang Merzenich, Michael Thomas:
  Enhancements of partitioning techniques for image compression using weighted finite automata. Theor. Comput. Sci. 313(1): 133-144 (2004)

skipping 9 more matches