• 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

• 2008
• 
  Luca Aceto, Wan J. Fokkink, Anna Ingólfsdóttir, Mohammad Reza Mousavi:
  Lifting Non-Finite Axiomatizability Results to Extensions of Process Algebras. IFIP TCS 2008: 301-316
• 
  Luca Aceto, Anna Ingólfsdóttir, Bas Luttik, Paul van Tilburg:
  Finite Equational Bases for Fragments of CCS with Restriction and Relabelling. IFIP TCS 2008: 317-332
• 
  Benjamin Aminof, Axel Legay, Aniello Murano, Olivier Serre:
  µ-calculus Pushdown Module Checking with Imperfect State Information. IFIP TCS 2008: 333-348
• 
  Rena Bakhshi, Wan J. Fokkink, Jun Pang, Jaco van de Pol:
  Leader Election in Anonymous Rings: Franklin Goes Probabilistic. IFIP TCS 2008: 57-72
• 
  Tobias Berg, Harald Hempel:
  Inverse Problems Have Inverse Complexity. IFIP TCS 2008: 73-86
• 
  Alberto Bertoni, Christian Choffrut, Roberto Radicioni:
  Literal Shuffle of Compressed Words. IFIP TCS 2008: 87-100
• 
  Frédéric Blanqui, Jean-Pierre Jouannaud, Pierre-Yves Strub:
  From Formal Proofs to Mathematical Proofs: A Safe, Incremental Way for Building in First-order Decision Procedures. IFIP TCS 2008: 349-365
• 
  Viviana Bono, Ferruccio Damiani, Elena Giachino:
  On Traits and Types in a Java-like Setting. IFIP TCS 2008: 367-382
• 
  Luca Cardelli:
  From Processes to ODEs by Chemistry. IFIP TCS 2008: 261-281
• 
  Kaustuv Chaudhuri, Dale Miller, Alexis Saurin:
  Canonical Sequent Proofs via Multi-Focusing. IFIP TCS 2008: 383-396
• 
  Olivier Cogis, Benoît Darties, Sylvain Durand, Jean-Claude König, Geneviève Simonet:
  The mv-decomposition: definition and application to the distance-2 broadcast problem in multi-hops radio networks. IFIP TCS 2008: 115-126
• 
  Amin Coja-Oghlan, André Lanka:
  Partitioning Random Graphs with General Degree Distributions. IFIP TCS 2008: 127-141
• 
  Maxime Crochemore, Alessandra Gabriele, Filippo Mignosi, Mauriana Pesaresi:
  On the Longest Common Factor Problem. IFIP TCS 2008: 143-155
• 
  Romain Demangeon, Daniel Hirschkoff, Davide Sangiorgi:
  Static and dynamic typing for the termination of mobile processes. IFIP TCS 2008: 413-427
• 
  Alberto Dennunzio, Pierre Guillon, Benoît Masson:
  Stable Dynamics of Sand Automata. IFIP TCS 2008: 157-169
• 
  Thomas Ehrhard:
  Differential Linear Logic and Processes. IFIP TCS 2008: 283
• 
  Javier Esparza, Stefan Kiefer, Michael Luttenberger:
  Solving Monotone Polynomial Equations. IFIP TCS 2008: 285-298
• 
  Emmanuel Filiot, Sophie Tison:
  Regular n-ary Queries in Trees and Variable Independence. IFIP TCS 2008: 429-443
• 
  Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl:
  On tractability of Cops and Robbers game. IFIP TCS 2008: 171-185
• 
  David de Frutos-Escrig, Carlos Gregorio-Rodríguez:
  Universal Coinductive Characterisations of Process Semantics. IFIP TCS 2008: 397-412
• 
  Dora Giammarresi, Antonio Restivo:
  Ambiguity and Complementation in Recognizable Two-dimensional Languages. IFIP TCS 2008: 5-20
• 
  Dietrich Kuske, Markus Lohrey:
  Hamiltonicity of automatic graphs. IFIP TCS 2008: 445-459
• 
  Grégory Lafitte, Michael Weiss:
  Computability of Tilings. IFIP TCS 2008: 187-201
• 
  Xingwu Liu, Juhua Pu, Jianzhong Pan:
  A Classification of Degenerate Loop Agreement. IFIP TCS 2008: 203-213
• 
  Kamal Lodaya, Paritosh K. Pandya, Simoni S. Shah:
  Marking the chops: an unambiguous temporal logic. IFIP TCS 2008: 461-476
• 
  Alexandre Blondin Massé, Srecko Brlek, Andrea Frosini, Sébastien Labbé, Simone Rinaldi:
  Reconstructing words from a fixed palindromic length sequence. IFIP TCS 2008: 101-114
• 
  Roland Meyer:
  On Boundedness in Depth in the pi-Calculus. IFIP TCS 2008: 477-489
• 
  Alexander Okhotin, Panos Rondogiannis:
  On the expressive power of univariate equations over sets of natural numbers. IFIP TCS 2008: 215-227
• 
  Nicolas Ollinger, Gaétan Richard:
  Collisions and their Catenations: Ultimately Periodic Tilings of the Plane. IFIP TCS 2008: 229-240
• 
  Nicolas Peltier:
  A Unified View of Tree Automata and Term Schematisations. IFIP TCS 2008: 491-505

skipping 7 more matches