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

• 1999
• 
  Serge Abiteboul, Laurent Herr, Jan Van den Bussche:
  Temporal Connectives Versus Explicit Timestamps to Query Temporal Databases. J. Comput. Syst. Sci. 58(1): 54-68 (1999)
• 
  Serge Abiteboul, Victor Vianu:
  Regular Path Queries with Constraints. J. Comput. Syst. Sci. 58(3): 428-452 (1999)
• 
  Joseph Albert, Yannis E. Ioannidis, Raghu Ramakrishnan:
  Equivalence of Keyed Relational Schemas by Conjunctive Queries. J. Comput. Syst. Sci. 58(3): 512-534 (1999)
• 
  Noga Alon, Yossi Matias, Mario Szegedy:
  The Space Complexity of Approximating the Frequency Moments. J. Comput. Syst. Sci. 58(1): 137-147 (1999)
• 
  Gheorghe Antonoiu, Pradip K. Srimani:
  A Self-Stabilizing Distributed Algorithm to Find the Median of a Tree Graph. J. Comput. Syst. Sci. 58(1): 215-221 (1999)
• 
  Sanjeev Arora, David R. Karger, Marek Karpinski:
  Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems. J. Comput. Syst. Sci. 58(1): 193-210 (1999)
• 
  Robert Beals:
  Algorithms for Matrix Groups and the Tits Alternative. J. Comput. Syst. Sci. 58(2): 260-279 (1999)
• 
  Amir Ben-Dor, Anna R. Karlin, Nathan Linial, Yuri Rabinovich:
  A Note on the Influence of an epsilon-Biased Random Source. J. Comput. Syst. Sci. 58(1): 174-176 (1999)
• 
  Avrim Blum, R. Ravi, Santosh S. Vempala:
  A Constant-Factor Approximation Algorithm for the k-MST Problem. J. Comput. Syst. Sci. 58(1): 101-108 (1999)
• 
  Jonathan F. Buss, Gudmund Skovbjerg Frandsen, Jeffrey O. Shallit:
  The Computational Complexity of Some Problems of Linear Algebra. J. Comput. Syst. Sci. 58(3): 572-596 (1999)
• 
  Jin-yi Cai, D. Sivakumar:
  Sparse Hard Sets for P: Resolution of a Conjecture of Hartmanis. J. Comput. Syst. Sci. 58(2): 280-296 (1999)
• 
  John Case, Mark A. Fulk:
  Maximal Machine Learnable Classes. J. Comput. Syst. Sci. 58(1): 211-214 (1999)
• 
  Jianer Chen, Donald K. Friesen, Hao Zheng:
  Tight Bound on Johnson's Algorithm for Maximum Satisfiability. J. Comput. Syst. Sci. 58(3): 622-640 (1999)
• 
  Jürgen Dassow, Victor Mitrana:
  Stack Cooperation in Multistack Pushdown Automata. J. Comput. Syst. Sci. 58(3): 611-621 (1999)
• 
  Tamal K. Dey, Sumanta Guha:
  Transforming Curves on Surfaces. J. Comput. Syst. Sci. 58(2): 297-325 (1999)
• 
  Freddy Dumortier, Marc Gyssens, Luc Vandeurzen, Dirk Van Gucht:
  On the Decidability of Semilinearity for Semialgebraic Sets and Its Implications for Spatial Databases. J. Comput. Syst. Sci. 58(3): 535-571 (1999)
• 
  Ronald Fagin:
  Combining Fuzzy Information from Multiple Systems. J. Comput. Syst. Sci. 58(1): 83-99 (1999)
• 
  Takeshi Fukuda, Yasuhiko Morimoto, Shinichi Morishita, Takeshi Tokuyama:
  Mining Optimized Association Rules for Numeric Attributes. J. Comput. Syst. Sci. 58(1): 1-12 (1999)
• 
  Leslie Ann Goldberg, Philip D. MacKenzie:
  Analysis of Practical Backoff Protocols for Contention Resolution with Multiple Servers. J. Comput. Syst. Sci. 58(1): 232-258 (1999)
• 
  Marc Gyssens, Jan Van den Bussche, Dirk Van Gucht:
  Complete Geometric Query Languages. J. Comput. Syst. Sci. 58(3): 483-511 (1999)
• 
  Armin Haken, Stephen A. Cook:
  An Exponential Lower Bound for the Size of Monotone Real Circuits. J. Comput. Syst. Sci. 58(2): 326-335 (1999)
• 
  Lane A. Hemaspaandra, Jörg Rothe:
  Creating Strong, Total, Commutative, Associative One-Way Functions from Any One-Way Function in Complexity Theory. J. Comput. Syst. Sci. 58(3): 648-659 (1999)
• 
  H. V. Jagadish, Alberto O. Mendelzon, Inderpal Singh Mumick:
  Managing Conflicts Between Rules. J. Comput. Syst. Sci. 58(1): 13-28 (1999)
• 
  Michael J. Kearns, Yishay Mansour:
  On the Boosting Ability of Top-Down Decision Tree Learning Algorithms. J. Comput. Syst. Sci. 58(1): 109-128 (1999)
• 
  Adam Krawczyk:
  The Complexity of Finding a Second Hmiltonian Cycle in Cubic Graphs. J. Comput. Syst. Sci. 58(3): 641-647 (1999)
• 
  Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén:
  Characterizing Linear Size Circuits in Terms of Pricacy. J. Comput. Syst. Sci. 58(1): 129-136 (1999)
• 
  Alon Y. Levy, Anand Rajaraman, Jeffrey D. Ullman:
  Answering Queries Using Limited External Query Processors. J. Comput. Syst. Sci. 58(1): 69-82 (1999)
• 
  Carsten Lund, Steven J. Phillips, Nick Reingold:
  Paging Against a Distribution and IP Networking. J. Comput. Syst. Sci. 58(1): 222-232 (1999)
• 
  Giovanni Manzini, Luciano Margara:
  Attractors of Linear Cellular Automata. J. Comput. Syst. Sci. 58(3): 597-610 (1999)
• 
  Giansalvatore Mecca, Paolo Atzeni:
  Cut and Paste. J. Comput. Syst. Sci. 58(3): 453-482 (1999)

skipping 7 more matches