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

• 1997
• 
  Foto N. Afrati:
  Bounded Arity Datalog (not-)Queries on Graphs. J. Comput. Syst. Sci. 55(2): 210-228 (1997)
• 
  Shai Ben-David, Michael Lindenbaum:
  Learning Distributions by Their Density Levels: A Paradigm for Learning without a Teacher. J. Comput. Syst. Sci. 55(1): 171-182 (1997)
• 
  Jean Berstel, Luc Boasson:
  The Set of Minimal Words of a Context-Free Language is Context-Free. J. Comput. Syst. Sci. 55(3): 477-488 (1997)
• 
  Joan Boyar, Rolf Fagerberg, Kim S. Larsen:
  Amortization Results for Chromatic Search Trees, with an Application to Priority Queues. J. Comput. Syst. Sci. 55(3): 504-521 (1997)
• 
  John Case, Susanne Kaufmann, Efim B. Kinber, Martin Kummer:
  Learning Recursive Functions from Approximations. J. Comput. Syst. Sci. 55(1): 183-196 (1997)
• 
  Surajit Chaudhuri, Phokion G. Kolaitis:
  Can Datalog Be Approximated? J. Comput. Syst. Sci. 55(2): 355-369 (1997)
• 
  Edith Cohen:
  Size-Estimation Framework with Applications to Transitive Closure and Reachability. J. Comput. Syst. Sci. 55(3): 441-453 (1997)
• 
  Joost Engelfriet, Vincent van Oostrom:
  Logical Description of Contex-Free Graph Languages. J. Comput. Syst. Sci. 55(3): 489-503 (1997)
• 
  Christos Faloutsos, Ibrahim Kamel:
  Relaxing the Uniformity and Independence Assumptions Using the Concept of Fractal Dimension. J. Comput. Syst. Sci. 55(2): 229-240 (1997)
• 
  Yoav Freund, Robert E. Schapire:
  A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting. J. Comput. Syst. Sci. 55(1): 119-139 (1997)
• 
  Eddy Fromentin, Michel Raynal:
  Shared Global States in Distributed Computations. J. Comput. Syst. Sci. 55(3): 522-528 (1997)
• 
  Stéphane Grumbach, Jianwen Su:
  Finitely Representable Databases. J. Comput. Syst. Sci. 55(2): 273-298 (1997)
• 
  Leonid Gurvits, Pascal Koiran:
  Approximation and Learning of Convex Superpositions. J. Comput. Syst. Sci. 55(1): 161-170 (1997)
• 
  Ramesh Hariharan:
  Optimal Parallel Suffix Tree Construction. J. Comput. Syst. Sci. 55(1): 44-69 (1997)
• 
  Lane A. Hemaspaandra, Mitsunori Ogihara:
  Universally Serializable Computation. J. Comput. Syst. Sci. 55(3): 547-560 (1997)
• 
  Monika Rauch Henzinger, Philip N. Klein, Satish Rao, Sairam Subramanian:
  Faster Shortest-Path Algorithms for Planar Graphs. J. Comput. Syst. Sci. 55(1): 3-23 (1997)
• 
  Jeffrey C. Jackson:
  An Efficient Membership-Query Algorithm for Learning DNF with Respect to the Uniform Distribution. J. Comput. Syst. Sci. 55(3): 414-440 (1997)
• 
  David R. Karger, Daphne Koller:
  (De)randomized Construction of Small Sample Spaces in NC. J. Comput. Syst. Sci. 55(3): 402-413 (1997)
• 
  Daniel J. Kleitman, Frank Thomson Leighton, Yuan Ma:
  On the Design of Reliable Boolean Circuits That Contain Partially Unreliable Gates. J. Comput. Syst. Sci. 55(3): 385-401 (1997)
• 
  Vasudha Krishnaswamy, Divyakant Agrawal, John L. Bruno, Amr El Abbadi:
  Relative Serializability: An Approach for Relaxing the Atomicity of Transactions. J. Comput. Syst. Sci. 55(2): 344-354 (1997)
• 
  Leonid Libkin, Limsoon Wong:
  Query Languages for Bags and Aggregate Functions. J. Comput. Syst. Sci. 55(2): 241-272 (1997)
• 
  Sushant Patnaik, Neil Immerman:
  Dyn-FO: A Parallel, Dynamic Complexity Class. J. Comput. Syst. Sci. 55(2): 199-209 (1997)
• 
  Alexander A. Razborov, Steven Rudich:
  Natural Proofs. J. Comput. Syst. Sci. 55(1): 24-35 (1997)
• 
  Jorma Rissanen:
  Stochastic Complexity in Learning. J. Comput. Syst. Sci. 55(1): 89-95 (1997)
• 
  Dale Schuurmans:
  Characterizing Rational Versus Exponential learning Curves. J. Comput. Syst. Sci. 55(1): 140-160 (1997)
• 
  Rakesh K. Sinha, Jayram S. Thathachar:
  Efficient Oblivious Branching Programs for Threshold and Mod Functions. J. Comput. Syst. Sci. 55(3): 373-384 (1997)
• 
  Ray J. Solomonoff:
  The Discovery of Algorithmic Probability. J. Comput. Syst. Sci. 55(1): 73-88 (1997)
• 
  Dan Suciu, Jan Paredaens:
  The Complexity of the Evaluation of Complex Algebra Expressions. J. Comput. Syst. Sci. 55(2): 322-343 (1997)
• 
  Dan Suciu, Val Tannen:
  A Query Language for NC. J. Comput. Syst. Sci. 55(2): 299-321 (1997)
• 
  V. G. Vovk:
  Learning about the Parameter of the Bernoulli Model. J. Comput. Syst. Sci. 55(1): 96-104 (1997)

skipping 4 more matches