• 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

• 2008
• 
  Joan Boyar, René Peralta:
  Tight bounds for the multiplicative complexity of symmetric functions. Theor. Comput. Sci. 396(1-3): 223-246 (2008)
• 
  Samuel R. Buss, Jan Hoffmann:
  The NP-hardness of finding a directed acyclic graph for regular resolution. Theor. Comput. Sci. 396(1-3): 271-276 (2008)
• 
  Eric Goles Ch., Luis Salinas:
  Comparison between parallel and serial dynamics of Boolean networks. Theor. Comput. Sci. 396(1-3): 247-253 (2008)
• 
  David B. Chandler, Maw-Shang Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng:
  Partitioned probe comparability graphs. Theor. Comput. Sci. 396(1-3): 212-222 (2008)
• 
  Ying-You Chen, Dyi-Rong Duh, Tai-Ling Ye, Jung-Sheng Fu:
  Weak-vertex-pancyclicity of (n, k)-star graphs. Theor. Comput. Sci. 396(1-3): 191-199 (2008)
• 
  Wenbin Chen, Jiangtao Meng, Dengpan Yin:
  An improved lower bound for approximating minimum GCD multiplier in l_infinity norm (GCDM_infinity). Theor. Comput. Sci. 396(1-3): 1-9 (2008)
• 
  Miguel Couceiro, Maurice Pouzet:
  On a quasi-ordering on Boolean functions. Theor. Comput. Sci. 396(1-3): 71-87 (2008)
• 
  James D. Currie:
  Palindrome positions in ternary square-free words. Theor. Comput. Sci. 396(1-3): 254-257 (2008)
• 
  Xavier Défago, Samia Souissi:
  Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity. Theor. Comput. Sci. 396(1-3): 97-112 (2008)
• 
  W. M. B. Dukes, Mark F. Flanagan, Toufik Mansour, Vincent Vajnovszki:
  Combinatorial Gray codes for classes of pattern avoiding permutations. Theor. Comput. Sci. 396(1-3): 35-49 (2008)
• 
  Paul E. Dunne, Yann Chevaleyre:
  The complexity of deciding reachability properties of distributed negotiation schemes. Theor. Comput. Sci. 396(1-3): 113-144 (2008)
• 
  Bruno Escoffier, Jérôme Monnot:
  A better differential approximation ratio for symmetric TSP. Theor. Comput. Sci. 396(1-3): 63-70 (2008)
• 
  Trevor I. Fenner, Mark Levene, George Loizou:
  Modelling the navigation potential of a web page. Theor. Comput. Sci. 396(1-3): 88-96 (2008)
• 
  Regant Y. S. Hung, H. F. Ting:
  Competitive analysis of most-request-first for scheduling broadcasts with start-up delay. Theor. Comput. Sci. 396(1-3): 200-211 (2008)
• 
  Sandy Irani, Vitus J. Leung:
  Probabilistic analysis for scheduling with conflicts. Theor. Comput. Sci. 396(1-3): 158-179 (2008)
• 
  Lila Kari, Petr Sosík:
  On the weight of universal insertion grammars. Theor. Comput. Sci. 396(1-3): 264-270 (2008)
• 
  Xueliang Li, Wenli Zhou:
  The 2nd-order conditional 3-coloring of claw-free graphs. Theor. Comput. Sci. 396(1-3): 151-157 (2008)
• 
  Guizhen Liu, Ping Li:
  Paths in circuit graphs of matroids. Theor. Comput. Sci. 396(1-3): 258-263 (2008)
• 
  Longcheng Liu, Enyu Yao:
  Inverse min-max spanning tree problem under the Weighted sum-type Hamming distance. Theor. Comput. Sci. 396(1-3): 28-34 (2008)
• 
  Lingfa Lu, Liqi Zhang, Jinjiang Yuan:
  The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan. Theor. Comput. Sci. 396(1-3): 283-289 (2008)
• 
  Young-Soo Myung:
  On the clique partitioning problem in weighted interval graphs. Theor. Comput. Sci. 396(1-3): 290-293 (2008)
• 
  Gregory Neven:
  A simple transitive signature scheme for directed trees. Theor. Comput. Sci. 396(1-3): 277-282 (2008)
• 
  Luis Salinas, Eric Goles Ch.:
  Covering by squares. Theor. Comput. Sci. 396(1-3): 10-27 (2008)
• 
  Min-Zheng Shieh, Shi-Chun Tsai:
  Jug measuring: Algorithms and complexity. Theor. Comput. Sci. 396(1-3): 50-62 (2008)
• 
  Oleg Verbitsky:
  On the obfuscation complexity of planar graphs. Theor. Comput. Sci. 396(1-3): 294-300 (2008)
• 
  Chen Wang, Myung Ah Park, James Willson, Yongxi Cheng, Andras Farago, Weili Wu:
  On approximate optimal dual power assignment for biconnectivity and edge-biconnectivity. Theor. Comput. Sci. 396(1-3): 180-190 (2008)
• 
  Raphael Yuster:
  All-pairs disjoint paths from a common ancestor in O~(n^infinit) time. Theor. Comput. Sci. 396(1-3): 145-150 (2008)