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

• 2004
• 
  Thorsten Bernholt, Paul Fischer:
  The complexity of computing the MCD-estimator. Theor. Comput. Sci. 326(1-3): 383-398 (2004)
• 
  Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger:
  On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality. Theor. Comput. Sci. 326(1-3): 137-153 (2004)
• 
  Cédric Chauve, Guillaume Fertin:
  On maximal instances for the original syntenic distance. Theor. Comput. Sci. 326(1-3): 29-43 (2004)
• 
  Qi Cheng:
  On the ultimate complexity of factorials. Theor. Comput. Sci. 326(1-3): 419-429 (2004)
• 
  Anders Dessmark, Andrzej Pelc:
  Optimal graph exploration without good maps. Theor. Comput. Sci. 326(1-3): 343-362 (2004)
• 
  Jean-Pierre Duval, Roman Kolpakov, Gregory Kucherov, Thierry Lecroq, Arnaud Lefebvre:
  Linear-time computation of local periods. Theor. Comput. Sci. 326(1-3): 229-240 (2004)
• 
  Marcia Edson, Luca Q. Zamboni:
  On representations of positive integers in the Fibonacci base. Theor. Comput. Sci. 326(1-3): 241-260 (2004)
• 
  Friedrich Eisenbrand, Fabrizio Grandoni:
  On the complexity of fixed parameter clique and dominating set. Theor. Comput. Sci. 326(1-3): 57-67 (2004)
• 
  Jirí Fiala, Aleksei V. Fishkin, Fedor V. Fomin:
  On distance constrained labeling of disk graphs. Theor. Comput. Sci. 326(1-3): 261-292 (2004)
• 
  James Allen Fill, Nevin Kapur:
  Limiting distributions for additive functionals on Catalan trees. Theor. Comput. Sci. 326(1-3): 69-102 (2004)
• 
  Yashar Ganjali, Mohammad Taghi Hajiaghayi:
  Characterization of networks supporting multi-dimensional linear interval routing schemes. Theor. Comput. Sci. 326(1-3): 103-116 (2004)
• 
  Alan Gibbons, Paul Sant:
  Rotation sequences and edge-colouring of binary tree pairs. Theor. Comput. Sci. 326(1-3): 409-418 (2004)
• 
  Teofilo F. Gonzalez, David Serena:
  Complexity of pairwise shortest path routing in the grid. Theor. Comput. Sci. 326(1-3): 155-185 (2004)
• 
  Lane A. Hemaspaandra, Mayur Thakur:
  Lower bounds and the hardness of counting properties. Theor. Comput. Sci. 326(1-3): 1-28 (2004)
• 
  Svante Janson, Stefano Lonardi, Wojciech Szpankowski:
  On average sequence complexity. Theor. Comput. Sci. 326(1-3): 213-227 (2004)
• 
  Predrag R. Jelenkovic, Ana Radovanovic:
  Least-recently-used caching with dependent requests. Theor. Comput. Sci. 326(1-3): 293-327 (2004)
• 
  Marcos A. Kiwi, Alexander Russell:
  The chilean highway problem. Theor. Comput. Sci. 326(1-3): 329-342 (2004)
• 
  Stefano Leonardi, Guido Schäfer:
  Cross-monotonic cost sharing methods for connected facility location games. Theor. Comput. Sci. 326(1-3): 431-442 (2004)
• 
  Minming Li, Shawn L. Huang, Xiaoming Sun, Xiao Huang:
  Performance evaluation for energy efficient topologic control in ad hoc wireless networks. Theor. Comput. Sci. 326(1-3): 399-408 (2004)
• 
  Tomomi Matsui, Yasuko Matsui, Yoko Ono:
  Random generation of 2 times 2 times ... times 2 times J contingency tables. Theor. Comput. Sci. 326(1-3): 117-135 (2004)
• 
  Pascal Michel:
  Small Turing machines and generalized busy beaver competition. Theor. Comput. Sci. 326(1-3): 45-56 (2004)
• 
  Xun Yi:
  Authenticated key agreement in dynamic peer groups. Theor. Comput. Sci. 326(1-3): 363-382 (2004)
• 
  Martin Ziegler, Vasco Brattka:
  Computability in linear algebra. Theor. Comput. Sci. 326(1-3): 187-211 (2004)