• 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

• 2004
• 
  Martín Abadi, Georges Gonthier, Benjamin Werner:
  Choice in Dynamic Linking. FoSSaCS 2004: 12-26
• 
  Patrick Baillot, Virgile Mogbil:
  Soft lambda-Calculus: A Language for Polynomial Time Computation. FoSSaCS 2004: 27-41
• 
  Liana Bozga, Cristian Ene, Yassine Lakhnech:
  On the Existence of an Effective and Complete Inference System for Cryptographic Protocols. FoSSaCS 2004: 42-57
• 
  Antonio Bucciarelli, Benjamin Leperchey:
  Hypergraphs and Degrees of Parallelism: A Completeness Result. FoSSaCS 2004: 58-71
• 
  Luís Caires:
  Behavioral and Spatial Observations in a Logic for the pi-Calculus. FoSSaCS 2004: 72-89
• 
  Jérémie Chalopin, Yves Métivier:
  Election and Local Computations on Edges. FoSSaCS 2004: 90-104
• 
  Hubert Comon-Lundh:
  Intruder Theories (Ongoing Work). FoSSaCS 2004: 1-4
• 
  Giovanni Conforti, Giorgio Ghelli:
  Decidability of Freshness, Undecidability of Revelation. FoSSaCS 2004: 105-120
• 
  Stéphane Demri:
  LTL over Integer Periodicity Constraints: (Extended Abstract). FoSSaCS 2004: 121-135
• 
  Hartmut Ehrig, Barbara König:
  Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting. FoSSaCS 2004: 151-166
• 
  Andrzej Filinski, Henning Korsholm Rohde:
  A Denotational Account of Untyped Normalization by Evaluation. FoSSaCS 2004: 167-181
• 
  Wan J. Fokkink, Sumit Nain:
  On Finite Alphabets and Infinite Bases: From Ready Pairs to Possible Worlds. FoSSaCS 2004: 182-194
• 
  Blaise Genest, Marius Minea, Anca Muscholl, Doron A. Peled:
  Specifying and Verifying Partial Order Properties Using Template MSCs. FoSSaCS 2004: 195-210
• 
  Dan R. Ghica, Andrzej S. Murawski:
  Angelic Semantics of Fine-Grained Concurrency. FoSSaCS 2004: 211-225
• 
  Pablo Giambiagi, Gerardo Schneider, Frank D. Valencia:
  On the Expressiveness of Infinite Behavior and Name Scoping in Process Calculi. FoSSaCS 2004: 226-240
• 
  Pietro Di Gianantonio, Marino Miculan:
  Unifying Recursive and Co-recursive Definitions in Sheaf Categories. FoSSaCS 2004: 136-150
• 
  Matthew Hennessy, Julian Rathke, Nobuko Yoshida:
  safeDpi: A Language for Controlling Mobile Code. FoSSaCS 2004: 241-256
• 
  Daniel Kirsten:
  Distance Desert Automata and the Star Height One Problem. FoSSaCS 2004: 257-272
• 
  Stephen Lack, Pawel Sobocinski:
  Adhesive Categories. FoSSaCS 2004: 273-288
• 
  James Laird:
  A Game Semantics of Local Names and Good Variables. FoSSaCS 2004: 289-303
• 
  Daniel Leivant:
  Partial Correctness Assertions Provable in Dynamic Logics. FoSSaCS 2004: 304-317
• 
  Salvador Lucas:
  Polynomials for Proving Termination of Context-Sensitive Rewriting. FoSSaCS 2004: 318-332
• 
  Gerald Lüttgen, Walter Vogler:
  Bisimulation on Speed: Lower Time Bounds. FoSSaCS 2004: 333-347
• 
  Oded Maler, Amir Pnueli:
  On Recognizable Timed Languages. FoSSaCS 2004: 348-362
• 
  Sebastian Maneth, Giorgio Busatto:
  Tree Transducers and Tree Compressions. FoSSaCS 2004: 363-377
• 
  Antoine Meyer:
  On Term Rewriting Systems Having a Rational Derivation. FoSSaCS 2004: 378-392
• 
  Robin Milner:
  Theories for the Global Ubiquitous Computer. FoSSaCS 2004: 5-11
• 
  Michael W. Mislove, Joël Ouaknine, Dusko Pavlovic, James Worrell:
  Duality for Labelled Markov Processes. FoSSaCS 2004: 393-407
• 
  Iain Phillips, Maria Grazia Vigliotti:
  Electoral Systems in Ambient Calculi. FoSSaCS 2004: 408-422
• 
  Emmanuel Polonowski:
  Strong Normalization of lambda-mu-mu/tilde-Calculus with Explicit Substitutions. FoSSaCS 2004: 423-437

skipping 7 more matches