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

• 2008
• 
  Erika Ábrahám, Andreas Grüner, Martin Steffen:
  Abstract Interface Behavior of Object-Oriented Languages with Monitors. Theory Comput. Syst. 43(3-4): 322-361 (2008)
• 
  Sergei N. Artëmov, Volker Diekert, Dima Grigoriev:
  Foreword. Theory Comput. Syst. 43(2): 99 (2008)
• 
  Vikraman Arvind, Bireswar Das:
  SZK Proofs for Black-Box Group Problems. Theory Comput. Syst. 43(2): 100-117 (2008)
• 
  Roland Carl Backhouse, Henk Doornbos:
  Datatype-Generic Termination Proofs. Theory Comput. Syst. 43(3-4): 362-393 (2008)
• 
  Reuven Bar-Yehuda, Ido Feldman, Dror Rawitz:
  Improved Approximation Algorithm for Convex Recoloring of Trees. Theory Comput. Syst. 43(1): 3-18 (2008)
• 
  Arnold Beckmann, Benedikt Löwe:
  Computability in Europe 2006. Theory Comput. Syst. 43(3-4): 295-297 (2008)
• 
  Ulrich Berger, Tie Hou:
  Coinduction for Exact Real Number Computation. Theory Comput. Syst. 43(3-4): 394-409 (2008)
• 
  Jan A. Bergstra, John V. Tucker:
  Division Safe Calculation in Totalised Fields. Theory Comput. Syst. 43(3-4): 410-424 (2008)
• 
  Olaf Beyersdorff:
  Tuples of Disjoint NP-Sets. Theory Comput. Syst. 43(2): 118-135 (2008)
• 
  Markus Bläser, L. Shankar Ram:
  Approximately Fair Cost Allocation in Metric Traveling Salesman Games. Theory Comput. Syst. 43(1): 19-37 (2008)
• 
  Manuel Bodirsky, Jan Kára:
  The Complexity of Equality Constraint Languages. Theory Comput. Syst. 43(2): 136-158 (2008)
• 
  David Doty:
  Dimension Extractors and Optimal Decompression. Theory Comput. Syst. 43(3-4): 425-463 (2008)
• 
  Thomas Erlebach, Giuseppe Persiano:
  WAOA 2005 Special Issue of TOCS. Theory Comput. Syst. 43(1): 1-2 (2008)
• 
  Anna Gál, Michal Koucký, Pierre McKenzie:
  Incremental Branching Programs. Theory Comput. Syst. 43(2): 159-184 (2008)
• 
  Christine Gaßner:
  A Hierarchy below the Halting Problem for Additive Machines. Theory Comput. Syst. 43(3-4): 464-470 (2008)
• 
  Evan Goris:
  Feasible Operations on Proofs: The Logic of Proofs for Bounded Arithmetic. Theory Comput. Syst. 43(2): 185-203 (2008)
• 
  Xin Han, Kazuo Iwama, Guochuan Zhang:
  Online Removable Square Packing. Theory Comput. Syst. 43(1): 38-55 (2008)
• 
  John M. Hitchcock, María López-Valdés, Elvira Mayordomo:
  Scaled Dimension and the Kolmogorov Complexity of Turing-Hard Sets. Theory Comput. Syst. 43(3-4): 471-497 (2008)
• 
  Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Gábor Rudolf, Jihui Zhao:
  On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction. Theory Comput. Syst. 43(2): 204-233 (2008)
• 
  Ronald Koch, Martin Skutella, Ines Spenke:
  Maximum k -Splittable s , t -Flows. Theory Comput. Syst. 43(1): 56-66 (2008)
• 
  Margarita V. Korovina, Nicolai N. Vorobjov Jr.:
  Bounds on Sizes of Finite Bisimulations of Pfaffian Dynamical Systems. Theory Comput. Syst. 43(3-4): 498-515 (2008)
• 
  Lars Kristiansen:
  Complexity-Theoretic Hierarchies Induced by Fragments of Gödel's T. Theory Comput. Syst. 43(3-4): 516-541 (2008)
• 
  Johann A. Makowsky:
  From a Zoo to a Zoology: Towards a General Theory of Graph Polynomials. Theory Comput. Syst. 43(3-4): 542-562 (2008)
• 
  Daniel Mölle, Stefan Richter, Peter Rossmanith:
  Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover. Theory Comput. Syst. 43(2): 234-253 (2008)
• 
  Alban Ponse, Mark van der Zwaag:
  Risk Assessment for One-Counter Threads. Theory Comput. Syst. 43(3-4): 563-582 (2008)
• 
  Kirk Pruhs, Rob van Stee, Patchrawat Uthaisombut:
  Speed Scaling of Tasks with Precedence Constraints. Theory Comput. Syst. 43(1): 67-80 (2008)
• 
  Rose H. Abdul Rauf, Ulrich Berger, Anton Setzer:
  A Provably Correct Translation of the lambda -Calculus into a Mathematical Model of C++. Theory Comput. Syst. 43(3-4): 298-321 (2008)
• 
  Vladimir V. Rybakov:
  Branching Time Logics BTL^{U, S}_{N, N^-1}(Z)_a with Operations Until and Since Based on Bundles of Integer Numbers, Logical Consecutions, Deciding Algorithms. Theory Comput. Syst. 43(2): 254-271 (2008)
• 
  Helmut Schwichtenberg:
  Realizability interpretation of proofs in constructive analysis. Theory Comput. Syst. 43(3-4): 583-602 (2008)
• 
  Hadas Shachnai, Tami Tamir, Omer Yehezkely:
  Approximation Schemes for Packing with Item Fragmentation. Theory Comput. Syst. 43(1): 81-98 (2008)

skipping 2 more matches