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

• 1986
• 
  Serge Abiteboul, Nicole Bidoit:
  Non First Normal Form Relations: An Algebra Allowing Data Restructuring. J. Comput. Syst. Sci. 33(3): 361-393 (1986)
• 
  Giorgio Ausiello, Alessandro D'Atri, Marina Moscarini:
  Chordality Properties on Graphs and Minimal Conceptual Connections in Semantic Data Models. J. Comput. Syst. Sci. 33(2): 179-202 (1986)
• 
  Howard C. Card, Adonios Thanailakis, Werner Pries, Robert D. McLeod:
  Analysis of Bounded Linear Cellular Automata Based on a Method of Image Charges. J. Comput. Syst. Sci. 33(3): 473-480 (1986)
• 
  Tim Connors:
  Equivalence of Views by Query Capacity. J. Comput. Syst. Sci. 33(2): 234-274 (1986)
• 
  Stavros S. Cosmadakis, Paris C. Kanellakis, Nicolas Spyratos:
  Partition Semantics for Relations. J. Comput. Syst. Sci. 33(2): 203-233 (1986)
• 
  Elias Dahlhaus, Manfred K. Warmuth:
  Membership for Growing Context-Sensitive Grammars is Polynomial. J. Comput. Syst. Sci. 33(3): 456-472 (1986)
• 
  Amos Fiat, Adi Shamir:
  Polymorphic Arrays: A Novel VLSI Layout for Systolic Computers. J. Comput. Syst. Sci. 33(1): 47-65 (1986)
• 
  Albert G. Greenberg, Alan Weiss:
  A Lower Bound for Probabilistic Algorithms for Finite State Machines. J. Comput. Syst. Sci. 33(1): 88-105 (1986)
• 
  Orna Grumberg, Nissim Francez, Shmuel Katz:
  A Complete Rule for Equifair Termination. J. Comput. Syst. Sci. 33(3): 313-332 (1986)
• 
  Thanasis Hadzilacos, Christos H. Papadimitriou:
  Algorithmic Aspects of Multiversion Concurrency Control. J. Comput. Syst. Sci. 33(2): 297-310 (1986)
• 
  Günter Hotz:
  A Representation Theorem of Infinite Dimensional Algebras and Applications to Language Theory. J. Comput. Syst. Sci. 33(3): 423-455 (1986)
• 
  Dirk Janssens, Grzegorz Rozenberg, Emo Welzl:
  The Bounded Degree Problem for NLC Grammars is Decidable. J. Comput. Syst. Sci. 33(3): 415-422 (1986)
• 
  Martin E. Kaliski, S. Yunkap Kwankam, Pamela Halpern, David Shulman:
  A Theory of Orbital Behavior in a Class of Nonlinear Systems: Chaos and a Signature-Based Approach. J. Comput. Syst. Sci. 33(3): 394-414 (1986)
• 
  Heikki Mannila, Kari-Jouko Räihä:
  Design by Example: An Application of Armstrong Relations. J. Comput. Syst. Sci. 33(2): 126-141 (1986)
• 
  Ketan Mulmuley:
  Fully Abstract Submodels of Typed Lambda Calculi. J. Comput. Syst. Sci. 33(1): 2-46 (1986)
• 
  J. Ian Munro:
  An Implicit Data Structure Supporting Insertion, Deletion, and Search in O(log² n) Time. J. Comput. Syst. Sci. 33(1): 66-74 (1986)
• 
  Ramamohan Paturi, Janos Simon:
  Probabilistic Communication Complexity. J. Comput. Syst. Sci. 33(1): 106-123 (1986)
• 
  Yehoshua Sagiv:
  Concurrent Operations on B*-Trees with Overtaking. J. Comput. Syst. Sci. 33(2): 275-296 (1986)
• 
  Miklos Santha, Umesh V. Vazirani:
  Generating Quasi-random Sequences from Semi-random Sources. J. Comput. Syst. Sci. 33(1): 75-87 (1986)
• 
  Andrzej Tarlecki:
  Quasi-varieties in Abstract Algebraic Institutions. J. Comput. Syst. Sci. 33(3): 333-360 (1986)
• 
  Moshe Y. Vardi:
  Querying Logical Databases. J. Comput. Syst. Sci. 33(2): 142-160 (1986)
• 
  Ouri Wolfson, Mihalis Yannakakis:
  Deadlock-Freedom (and Safety) of Transactions in a Distributed Database. J. Comput. Syst. Sci. 33(2): 161-178 (1986)