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

• 2020
• 
  Jirí Adámek, Stefan Milius, Lawrence S. Moss:
  On Well-Founded and Recursive Coalgebras. FoSSaCS 2020: 17-36
• 
  S. Akshay, Blaise Genest, Loïc Hélouët, Sharvik Mital:
  Timed Negotiations. FoSSaCS 2020: 37-56
• 
  Mario Alvarez-Picallo, Jean-Simon Pacaud Lemay:
  Cartesian Difference Categories. FoSSaCS 2020: 57-76
• 
  Béatrice Bérard, Benedikt Bollig, Mathieu Lehaut, Nathalie Sznajder:
  Parameterized Synthesis for Fragments of First-Order Logic Over Data Words. FoSSaCS 2020: 97-118
• 
  Filippo Bonchi, Robin Piedeleu, Pawel Sobocinski, Fabio Zanasi:
  Contextual Equivalence for Signal Flow Graphs. FoSSaCS 2020: 77-96
• 
  Thomas Colcombet, Nathanaël Fijalkow, Pierre Ohlmann:
  Controlling a Random Population. FoSSaCS 2020: 119-135
• 
  Zinovy Diskin:
  General Supervised Learning as Change Propagation with Delta Lenses. FoSSaCS 2020: 177-197
• 
  Thomas Ehrhard:
  Non-idempotent Intersection Types in Logical Form. FoSSaCS 2020: 198-216
• 
  Léo Exibard, Emmanuel Filiot, Pierre-Alain Reynier:
  On Computability of Data Word Functions Defined by Transducers. FoSSaCS 2020: 217-236
• 
  Alain Finkel, Serge Haddad, Igor Khmelnitsky:
  Minimal Coverability Tree Construction Made Complete and Efficient. FoSSaCS 2020: 237-256
• 
  Marcelo P. Fiore, Andrew M. Pitts, S. C. Steenkamp:
  Constructing Infinitary Quotient-Inductive Types. FoSSaCS 2020: 257-276
• 
  Marcelo Fiore, Philip Saville:
  Relative Full Completeness for Bicategorical Cartesian Closed Structure. FoSSaCS 2020: 277-298
• 
  Mai Gehrke, Tomas Jakl, Luca Reggio:
  A Duality Theoretic View on Limits of Finite Structures. FoSSaCS 2020: 299-318
• 
  Cinzia Di Giusto, Laetitia Laversa, Étienne Lozes:
  On the k-synchronizability of Systems. FoSSaCS 2020: 157-176
• 
  Gerco van Heerdt, Clemens Kupke, Jurriaan Rot, Alexandra Silva:
  Learning Weighted Automata over Principal Ideal Domains. FoSSaCS 2020: 602-621
• 
  Mathieu Huot, Sam Staton, Matthijs Vákár:
  Correctness of Automatic Differentiation via Diffeologies and Categorical Gluing. FoSSaCS 2020: 319-338
• 
  Patricia Johann, Andrew Polonsky:
  Deep Induction: Induction Rules for (Truly) Nested Types. FoSSaCS 2020: 339-358
• 
  David M. Kahn, Jan Hoffmann:
  Exponential Automatic Amortized Resource Analysis. FoSSaCS 2020: 359-380
• 
  Tobias Kappé, Paul Brunet, Alexandra Silva, Jana Wagemaker, Fabio Zanasi:
  Concurrent Kleene Algebra with Observations: From Hypotheses to Completeness. FoSSaCS 2020: 381-400
• 
  Satoshi Kura:
  Graded Algebraic Theories. FoSSaCS 2020: 401-421
• 
  Ugo Dal Lago, Giulio Guerrieri, Willem Heijltjes:
  Decomposing Probabilistic Lambda-Calculi. FoSSaCS 2020: 136-156
• 
  James Laird:
  A Curry-style Semantics of Interaction: From Untyped to Second-Order Lazy λ μ-Calculus. FoSSaCS 2020: 422-441
• 
  Ivan Lanese, Iain C. C. Phillips, Irek Ulidowski:
  An Axiomatic Approach to Reversible Computation. FoSSaCS 2020: 442-461
• 
  Christof Löding, Anton Pirogov:
  Ambiguity, Weakness, and Regularity in Probabilistic Büchi Automata. FoSSaCS 2020: 522-541
• 
  Alessio Mansutti:
  An Auxiliary Logic on Trees: on the Tower-Hardness of Logics Featuring Reachability and Submodel Reasoning. FoSSaCS 2020: 462-481
• 
  Usama Mehmood, Shouvik Roy, Radu Grosu, Scott A. Smolka, Scott D. Stoller, Ashish Tiwari:
  Neural Flocking: MPC-Based Supervised Learning of Flocking Controllers. FoSSaCS 2020: 1-16
• 
  Thomas Neele, Antti Valmari, Tim A. C. Willemse:
  The Inconsistent Labelling Problem of Stutter-Preserving Partial-Order Reduction. FoSSaCS 2020: 482-501
• 
  Romain Péchoux, Simon Perdrix, Mathys Rennela, Vladimir Zamdzhiev:
  Quantum Programming with Inductive Datatypes: Causality and Affine Type Theory. FoSSaCS 2020: 562-581
• 
  Brigitte Pientka, Ulrich Schöpp:
  Semantical Analysis of Contextual Types. FoSSaCS 2020: 502-521
• 
  Miriam Polzer, Sergey Goncharov:
  Local Local Reasoning: A BI-Hyperdoctrine for Full Ground Store. FoSSaCS 2020: 542-561

skipping 3 more matches