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

• 2003
• 
  Karell Bertet, Jens Gustedt, Michel Morvan:
  Weak-order extensions of an order. Theor. Comput. Sci. 304(1-3): 249-268 (2003)
• 
  Sara Brunetti, Alain Daurat:
  An algorithm reconstructing convex lattice sets. Theor. Comput. Sci. 304(1-3): 35-57 (2003)
• 
  Wei-Ting Cao, Zhi-Ying Wen:
  Some properties of the factors of Sturmian sequences. Theor. Comput. Sci. 304(1-3): 365-385 (2003)
• 
  Marco Carpentieri:
  On the simulation of quantum turing machines. Theor. Comput. Sci. 304(1-3): 103-128 (2003)
• 
  Guangting Chen, Guoliang Xue:
  A PTAS for weight constrained Steiner trees in series-parallel graphs. Theor. Comput. Sci. 304(1-3): 237-247 (2003)
• 
  Maggie Xiaoyan Cheng, Xiufeng Du, Manki Min, Hung Q. Ngo, Lu Ruan, Jianhua Sun, Weili Wu:
  Super link-connectivity of iterated line digraphs. Theor. Comput. Sci. 304(1-3): 461-469 (2003)
• 
  Pierluigi Crescenzi, Alberto Del Lungo, Roberto Grossi, Elena Lodi, Linda Pagli, Gianluca Rossi:
  Text sparsification via local maxima. Theor. Comput. Sci. 304(1-3): 341-364 (2003)
• 
  Pablo Dartnell, Alejandro Maass, Fernando Schwartz:
  Combinatorial constructions associated to the dynamics of one-sided cellular automata. Theor. Comput. Sci. 304(1-3): 485-497 (2003)
• 
  Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro:
  On universally easy classes for NP-complete problems. Theor. Comput. Sci. 304(1-3): 471-476 (2003)
• 
  Joan Feigenbaum, Arvind Krishnamurthy, Rahul Sami, Scott Shenker:
  Hardness results for multicast cost sharing. Theor. Comput. Sci. 304(1-3): 215-236 (2003)
• 
  Enrico Formenti, Aristide Grange:
  Number conserving cellular automata II: dynamics. Theor. Comput. Sci. 304(1-3): 269-290 (2003)
• 
  Masahiko Fukuyama:
  A Nim game played on graphs. Theor. Comput. Sci. 304(1-3): 387-399 (2003)
• 
  Masahiko Fukuyama:
  A Nim game played on graphs II. Theor. Comput. Sci. 304(1-3): 401-419 (2003)
• 
  Zoltán Fülöp, Zsolt Gazdag:
  Shape preserving top-down tree transducers. Theor. Comput. Sci. 304(1-3): 315-339 (2003)
• 
  William I. Gasarch, Evan Golub, Aravind Srinivasan:
  When does a random Robin Hood win? Theor. Comput. Sci. 304(1-3): 477-484 (2003)
• 
  Yassine Hachaïchi:
  A descriptive complexity approach to the linear hierarchy. Theor. Comput. Sci. 304(1-3): 421-429 (2003)
• 
  Kosaburo Hashiguchi, Yoshito Wada, Shuji Jimbo:
  Regular binoid expressions and regular binoid languages. Theor. Comput. Sci. 304(1-3): 291-313 (2003)
• 
  John M. Hitchcock:
  Fractal dimension and logarithmic loss unpredictability. Theor. Comput. Sci. 304(1-3): 431-441 (2003)
• 
  Antonín Kucera:
  The complexity of bisimilarity-checking for one-counter processes. Theor. Comput. Sci. 304(1-3): 157-183 (2003)
• 
  Jia Lee, Katsunobu Imai, Kenichi Morita:
  Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars. Theor. Comput. Sci. 304(1-3): 185-200 (2003)
• 
  Maciej Liskiewicz, Mitsunori Ogihara, Seinosuke Toda:
  The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes. Theor. Comput. Sci. 304(1-3): 129-156 (2003)
• 
  Guy Louchard, Helmut Prodinger:
  Ascending runs of sequences of geometrically distributed random variables: a probabilistic analysis. Theor. Comput. Sci. 304(1-3): 59-86 (2003)
• 
  Andrei A. Muchnik, Alexei L. Semenov, Maxim Ushakov:
  Almost periodic sequences. Theor. Comput. Sci. 304(1-3): 1-33 (2003)
• 
  Joong Chae Na, Alberto Apostolico, Costas S. Iliopoulos, Kunsoo Park:
  Truncated suffix trees and their application to data compression. Theor. Comput. Sci. 304(1-3): 87-101 (2003)
• 
  V. Y. Popov:
  The approximate period problem for DNA alphabet. Theor. Comput. Sci. 304(1-3): 443-447 (2003)
• 
  Li Sheng:
  2-Role assignments on triangulated graphs. Theor. Comput. Sci. 304(1-3): 201-214 (2003)
• 
  Sándor Vágvölgyi:
  On ground tree transformations and congruences induced by tree automata. Theor. Comput. Sci. 304(1-3): 449-459 (2003)