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

• 2017
• 
  Jirí Adámek, Stefan Milius:
  On Corecursive Algebras for Functors Preserving Coproducts. CALCO 2017: 3:1-3:15
• 
  Zeinab Bakhtiari, Helle Hvid Hansen:
  Bisimulation for Weakly Expressive Coalgebraic Modal Logics. CALCO 2017: 4:1-4:16
• 
  Henning Basold, Damien Pous, Jurriaan Rot:
  Monoidal Company for Accessible Functors. CALCO 2017: 5:1-5:16
• 
  Harsh Beohar, Sebastian Küpper:
  On Path-Based Coalgebras and Weak Notions of Bisimulation. CALCO 2017: 6:1-6:17
• 
  Kenta Cho, Bart Jacobs:
  The EfProb Library for Probabilistic Calculations. CALCO 2017: 25:1-25:8
• 
  Corina Cîrstea, Shunsuke Shimizu, Ichiro Hasuo:
  Parity Automata for Quantitative Linear Time Logics. CALCO 2017: 7:1-7:18
• 
  Thomas Colcombet, Daniela Petrisan:
  Automata Minimization: a Functorial Approach. CALCO 2017: 8:1-8:16
• 
  Fredrik Dahlqvist, Alexander Kurz:
  The Positivication of Coalgebraic Logics. CALCO 2017: 9:1-9:15
• 
  Clovis Eberhart, Tom Hirschowitz:
  Justified Sequences in String Diagrams: a Comparison Between Two Approaches to Concurrent Game Semantics. CALCO 2017: 10:1-10:16
• 
  Sebastian Enqvist, Yde Venema:
  Disjunctive Bases: Normal Forms for Modal Logics. CALCO 2017: 11:1-11:16
• 
  Brendan Fong, Fabio Zanasi:
  A Universal Construction for (Co)Relations. CALCO 2017: 12:1-12:16
• 
  Alessandro Gianola, Stefano Kasangian, Nicoletta Sabadini:
  Cospan/Span(Graph): an Algebra for Open, Reconfigurable Automata Networks. CALCO 2017: 2:1-2:17
• 
  William John Gowers, James Laird:
  Sequoidal Categories and Transfinite Games: A Coalgebraic Approach to Stateful Objects in Game Semantics. CALCO 2017: 13:1-13:17
• 
  Tomas Jakl, Achim Jung:
  Free Constructions and Coproducts of d-Frames. CALCO 2017: 14:1-14:15
• 
  Alexander Knapp, Till Mossakowski:
  UML Interactions Meet State Machines - An Institutional Approach. CALCO 2017: 15:1-15:15
• 
  Harald König, Uwe Wolter:
  Being Van Kampen in Presheaf Topoi is a Uniqueness Property. CALCO 2017: 16:1-16:15
• 
  Dan Marsden, Fabrizio Genovese:
  Custom Hypergraph Categories via Generalized Relations. CALCO 2017: 17:1-17:16
• 
  Stefan Milius:
  Proper Functors and their Rational Fixed Point. CALCO 2017: 18:1-18:16
• 
  David Reutter, Jamie Vicary:
  A Classical Groupoid Model for Quantum Networks. CALCO 2017: 19:1-19:18
• 
  David Reutter, Jamie Vicary:
  A 2-Categorical Approach to Composing Quantum Structures. CALCO 2017: 20:1-20:20
• 
  Fatemeh Seifan, Lutz Schröder, Dirk Pattinson:
  Uniform Interpolation in Coalgebraic Modal Logic. CALCO 2017: 21:1-21:16
• 
  Alex Simpson:
  Probability Sheaves and the Giry Monad. CALCO 2017: 1:1-1:6
• 
  Ana Sokolova, Harald Woracek:
  Termination in Convex Sets of Distributions. CALCO 2017: 22:1-22:16
• 
  David Sprunger, Lawrence S. Moss:
  Precongruences and Parametrized Coinduction for Logics for Behavioral Equivalence. CALCO 2017: 23:1-23:15
• 
  Henning Urbat:
  Finite Behaviours and Finitary Corecursion. CALCO 2017: 24:1-24:16
• 
  Front Matter, Table of Contents, Preface, List of Authors. CALCO 2017: 0:i-0:x
• 
  Filippo Bonchi, Barbara König:
  7th Conference on Algebra and Coalgebra in Computer Science, CALCO 2017, June 12-16, 2017, Ljubljana, Slovenia. LIPIcs 72, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2017, ISBN 978-3-95977-033-0 [contents]