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

• 1991
• 
  Luca Aceto, Matthew Hennessy:
  Adding Action Refinement to a Finite Process Algebra. ICALP 1991: 506-519
• 
  Rajeev Alur, Costas Courcoubetis, David L. Dill:
  Model-Checking for Probabilistic Real-Time Systems (Extended Abstract). ICALP 1991: 115-126
• 
  Yosi Ben-Asher, David Peleg, Rajiv Ramaswami, Assaf Schuster:
  The POwer of Reconfiguration. ICALP 1991: 139-150
• 
  Marshall W. Bern, David Eppstein, F. Frances Yao:
  The Expected Extremes in a Delaunay Triangulation. ICALP 1991: 674-685
• 
  Binay K. Bhattacharya, Godfried T. Toussaint:
  Computing Shortest Transversals. ICALP 1991: 649-660
• 
  Dario Bini, Luca Gemignani, Victor Y. Pan:
  Improved Parallel Computations with Matrices and Polynomials. ICALP 1991: 520-531
• 
  Hans L. Bodlaender, Ton Kloks:
  Better Algorithms for the Pathwidth and Treewidth of Graphs. ICALP 1991: 544-555
• 
  Roland N. Bol, Jan Friso Groote:
  The Meaning of Negative Premises in Transition System Specifications. ICALP 1991: 481-494
• 
  Ahmed Bouajjani, Jean-Claude Fernandez, Susanne Graf, Carlos Rodriguez, Joseph Sifakis:
  Safety for Branching Time Semantics. ICALP 1991: 76-92
• 
  Véronique Bruyère, Clelia de Felice:
  Degree and Decomposability of Variable-Length Codes. ICALP 1991: 575-587
• 
  Antonio Bucciarelli, Thomas Ehrhard:
  Extensional Embedding of a Strongly Stable Model of PCF. ICALP 1991: 35-46
• 
  Rafael Casas, Josep Díaz, Conrado Martinez:
  Static on Random Trees. ICALP 1991: 186-203
• 
  Bernard Chazelle:
  Computational Geometry for the Gourmet: Old Fare and New Dishes. ICALP 1991: 686-696
• 
  Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, Micha Sharir, Jack Snoeyink:
  Ray Shooting in Polygons Using Geodesic Triangulations. ICALP 1991: 661-646
• 
  Hong Chen, Jieh Hsiang:
  Logic Programming with Recurrence Domains. ICALP 1991: 20-34
• 
  Rance Cleaveland, Bernhard Steffen:
  Computing Behavioural Relations, Logically. ICALP 1991: 127-138
• 
  Hubert Comon:
  Complete Axiomatizations of Some Quotient Term Algebras. ICALP 1991: 469-480
• 
  Felipe Cucker, A. Torrecillas:
  Two P-Complete Problems in the Theory of the Reals. ICALP 1991: 556-565
• 
  Karel Culík II, Simant Dube:
  Balancing Order and Chaos in Image Generation (Extended Abstract). ICALP 1991: 600-614
• 
  Pierre-Louis Curien, Roberto Di Cosmo:
  A Concluent Reduction for the Lambda-Calculus with Surjective Pairing and Terminal Object. ICALP 1991: 291-302
• 
  Nachum Dershowitz:
  Cononical Sets of Horn Clauses. ICALP 1991: 267-278
• 
  Volker Diekert, Edward Ochmanski, Klaus Reinhardt:
  On Confluent Semi-Commutations - Decidability and Complexity Results. ICALP 1991: 229-241
• 
  Hristo N. Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis:
  Computing Shortest Paths and Distances in Planar Graphs. ICALP 1991: 327-338
• 
  Gérard Duchamp, Daniel Krob:
  Lazard's Factorizations of Free Partially Commutative Monoids. ICALP 1991: 242-253
• 
  Pavol Duris, Zvi Galil:
  On the Power of Multiple Reads in a Chip. ICALP 1991: 697-706
• 
  Christine Ernoult, Alan Mycroft:
  Uniform Ideals and Strictness Analysis. ICALP 1991: 47-59
• 
  Tim Fernando:
  Provably Recursive Programs and Program Extraction. ICALP 1991: 303-313
• 
  Limor Fix, Nissim Francez, Orna Grumberg:
  Program Composition and Modular Verification. ICALP 1991: 93-114
• 
  Jean-Denis Fouks:
  General Resolution of Tseitin Formulas is Hard. ICALP 1991: 151-162
• 
  Martin Fürer:
  An Efficient NC Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs. ICALP 1991: 429-440

skipping 31 more matches