• 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

• 2007
• 
  Heiner Ackermann, Alantha Newman, Heiko Röglin, Berthold Vöcking:
  Decision-making based on approximate and smoothed Pareto curves. Theor. Comput. Sci. 378(3): 253-270 (2007)
• 
  Andris Ambainis, Kazuo Iwama, Akinori Kawachi, Rudy Raymond, Shigeru Yamashita:
  Improved algorithms for quantum identification of Boolean oracles. Theor. Comput. Sci. 378(1): 41-53 (2007)
• 
  Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi, Arie Tamir:
  Efficient algorithms for center problems in cactus networks. Theor. Comput. Sci. 378(3): 237-252 (2007)
• 
  Yuriy Brun:
  Arithmetic computation in the tile assembly model: Addition and multiplication. Theor. Comput. Sci. 378(1): 17-31 (2007)
• 
  Zhi-Zhong Chen, Xiaotie Deng, Ding-Zhu Du:
  Preface. Theor. Comput. Sci. 378(3): 209-210 (2007)
• 
  Erdong Chen, Linji Yang, Hao Yuan:
  Longest increasing subsequences in windows based on canonical antichain partition. Theor. Comput. Sci. 378(3): 223-236 (2007)
• 
  Gang Cheng, Ping Li, Peng Shi:
  A new algorithm based on copulas for VaR valuation with empirical calculations. Theor. Comput. Sci. 378(2): 190-197 (2007)
• 
  Gabriel Ciobanu, Linqiang Pan, Gheorghe Paun, Mario J. Pérez-Jiménez:
  P systems with minimal parallelism. Theor. Comput. Sci. 378(1): 117-130 (2007)
• 
  Mark Daley, Michael Domaratzki:
  On codes defined by bio-operations. Theor. Comput. Sci. 378(1): 3-16 (2007)
• 
  Xiaotie Deng:
  Preface. Theor. Comput. Sci. 378(2): 133 (2007)
• 
  Joan Feigenbaum, David R. Karger, Vahab S. Mirrokni, Rahul Sami:
  Subjective-cost policy routing. Theor. Comput. Sci. 378(2): 175-189 (2007)
• 
  Simon Fischer, Berthold Vöcking:
  On the structure and complexity of worst-case equilibria. Theor. Comput. Sci. 378(2): 165-174 (2007)
• 
  Sumit Ganguly:
  Counting distinct items over update streams. Theor. Comput. Sci. 378(3): 211-222 (2007)
• 
  Dinesh Garg, Kamal Jain, Kunal Talwar, Vijay V. Vazirani:
  A primal-dual algorithm for computing Fisher equilibrium in the absence of gross substitutability property. Theor. Comput. Sci. 378(2): 143-152 (2007)
• 
  Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang:
  Average case analysis for tree labelling schemes. Theor. Comput. Sci. 378(3): 271-291 (2007)
• 
  Sanjiv Kapoor, Aranyak Mehta, Vijay V. Vazirani:
  An auction-based market equilibrium algorithm for a production model. Theor. Comput. Sci. 378(2): 153-164 (2007)
• 
  Elham Kashefi, Iordanis Kerenidis:
  Statistical Zero Knowledge and quantum one-way functions. Theor. Comput. Sci. 378(1): 101-116 (2007)
• 
  Lan Liu, Xi Chen, Jing Xiao, Tao Jiang:
  Complexity and approximation of the minimum recombinant haplotype configuration problem. Theor. Comput. Sci. 378(3): 316-330 (2007)
• 
  Florin Manea, Carlos Martín-Vide, Victor Mitrana:
  Erratum to: "Accepting networks of splicing processors: Complexity results" [Theoret. Comput. Sci. 371(2007) 72-82]. Theor. Comput. Sci. 378(1): 131 (2007)
• 
  Bodo Manthey, Rüdiger Reischuk:
  Smoothed analysis of binary search trees. Theor. Comput. Sci. 378(3): 292-315 (2007)
• 
  Frank Neumann, Ingo Wegener:
  Randomized local search, evolutionary algorithms, and the minimum spanning tree problem. Theor. Comput. Sci. 378(1): 32-40 (2007)
• 
  Dezhong Peng, Zhang Yi:
  Convergence analysis of the OJAn MCA learning algorithm by the deterministic discrete time method. Theor. Comput. Sci. 378(1): 87-100 (2007)
• 
  Grzegorz Rozenberg:
  Preface. Theor. Comput. Sci. 378(1): 1-2 (2007)
• 
  El-Ghazali Talbi, Benjamin Weinberg:
  Breaking the search space symmetry in partitioning problems: An application to the graph coloring problem. Theor. Comput. Sci. 378(1): 78-86 (2007)
• 
  Sébastien Vérel, Philippe Collard, Marco Tomassini, Leonardo Vanneschi:
  Fitness landscape of the cellular automata majority problem: View from the "Olympus". Theor. Comput. Sci. 378(1): 54-77 (2007)
• 
  Yinyu Ye:
  Exchange market equilibria with Leontief's utility: Freedom of pricing leads to rationality. Theor. Comput. Sci. 378(2): 134-142 (2007)
• 
  Robert W. Zhu, Guomin Yang, Duncan S. Wong:
  An efficient identity-based key exchange protocol with KGS forward secrecy for low-power devices. Theor. Comput. Sci. 378(2): 198-207 (2007)