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

• 2022
• 
  Dana Angluin, Timos Antonopoulos, Dana Fisman, Nevin George:
  Representing Regular Languages of Infinite Words Using Mod 2 Multiplicity Automata. FoSSaCS 2022: 1-20
• 
  Flavio Ascari, Roberto Bruni, Roberta Gori:
  Limits and difficulties in the design of under-approximation abstract domains. FoSSaCS 2022: 21-39
• 
  Christel Baier, Florian Funke, Jakob Piribauer, Robin Ziemek:
  On probability-raising causality in Markov decision processes. FoSSaCS 2022: 40-60
• 
  A. R. Balasubramanian, Lucie Guillou, Chana Weil-Kennedy:
  Parameterized Analysis of Reconfigurable Broadcast Networks. FoSSaCS 2022: 61-80
• 
  Michael Blondin, Javier Esparza:
  Separators in Continuous Petri Nets. FoSSaCS 2022: 81-100
• 
  Guillaume Boisseau, Robin Piedeleu:
  Graphical Piecewise-Linear Algebra. FoSSaCS 2022: 101-119
• 
  Udi Boker, Karoliina Lehtinen:
  Token Games and History-Deterministic Quantitative Automata. FoSSaCS 2022: 120-139
• 
  Udi Boker, Karoliina Lehtinen, Salomon Sickert:
  On the Translation of Automata to Linear Temporal Logic. FoSSaCS 2022: 140-160
• 
  Anne Broadbent, Martti Karvonen:
  Categorical composable cryptography. FoSSaCS 2022: 161-183
• 
  Georgiana Caltais, Hossein Hojjat, Mohammad Reza Mousavi, Hünkar Can Tunç:
  DyNetKAT: An Algebra of Dynamic Networks. FoSSaCS 2022: 184-204
• 
  Davide Castelnovo, Fabio Gadducci, Marino Miculan:
  A new criterion for M, N-adhesivity, with an application to hierarchical graphs. FoSSaCS 2022: 205-224
• 
  Dmitry Chistikov, Christoph Haase, Alessio Mansutti:
  Quantifier elimination for counting extensions of Presburger arithmetic. FoSSaCS 2022: 225-243
• 
  Alessandro Cimatti, Luca Geatti, Nicola Gigante, Angelo Montanari, Stefano Tonetta:
  A first-order logic characterisation of safety and co-safety languages. FoSSaCS 2022: 244-263
• 
  Thomas Colcombet, Sam van Gool, Rémi Morvan:
  First-order separation over countable ordinals. FoSSaCS 2022: 264-284
• 
  Raul Fervari, Alessio Mansutti:
  Modal Logics and Local Quantifiers: A Zoo in the Elementary Hierarchy. FoSSaCS 2022: 305-324
• 
  Bernd Finkbeiner, Philippe Heim, Noemi Passing:
  Temporal Stream Logic modulo Theories. FoSSaCS 2022: 325-346
• 
  Simon J. Gay, Diogo Poças, Vasco T. Vasconcelos:
  The Different Shades of Infinite Session Types. FoSSaCS 2022: 347-367
• 
  Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux:
  Complete and tractable machine-independent characterizations of second-order polytime. FoSSaCS 2022: 368-388
• 
  André Hirschowitz, Tom Hirschowitz, Ambroise Lafont, Marco Maggesi:
  Variable binding and substitution for (nameless) dummies. FoSSaCS 2022: 389-408
• 
  Reijo Jaakkola:
  Uniform Guarded Fragments. FoSSaCS 2022: 409-427
• 
  Dylan McDermott, Exequiel Rivas, Tarmo Uustalu:
  Sweedler Theory of Monads. FoSSaCS 2022: 428-448
• 
  José Espírito Santo, Delia Kesner, Loïc Peyrot:
  A Faithful and Quantitative Notion of Distant Reduction for Generalized Applications. FoSSaCS 2022: 285-304
• 
  Tobias Winkler, Christina Gehnen, Joost-Pieter Katoen:
  Model Checking Temporal Properties of Recursive Probabilistic Programs. FoSSaCS 2022: 449-469
• 
  Patricia Bouyer, Lutz Schröder:
  Foundations of Software Science and Computation Structures - 25th International Conference, FOSSACS 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Munich, Germany, April 2-7, 2022, Proceedings. Lecture Notes in Computer Science 13242, Springer 2022, ISBN 978-3-030-99252-1 [contents]