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

• 2013
• 
  Beniamino Accattoli:
  Compressing Polarized Boxes. LICS 2013: 428-437
• 
  Rajeev Alur, Loris D'Antoni, Jyotirmoy V. Deshmukh, Mukund Raghothaman, Yifei Yuan:
  Regular Functions and Cost Register Automata. LICS 2013: 13-22
• 
  Rajeev Alur, Antoine Durand-Gasselin, Ashutosh Trivedi:
  From Monadic Second-Order Definable String Transformations to Transducers. LICS 2013: 458-467
• 
  Matthew Anderson, Anuj Dawar, Bjarki Holm:
  Maximum Matching and Linear Programming in Fixed-Point Logic with Counting. LICS 2013: 173-182
• 
  Andrea Asperti, Jean-Jacques Lévy:
  The Cost of Usage in the Lambda-Calculus. LICS 2013: 293-300
• 
  Philippe Balbiani, Andreas Herzig, Nicolas Troquard:
  Dynamic Logic of Propositional Assignments: A Well-Behaved Variant of PDL. LICS 2013: 143-152
• 
  Michael Benedikt, Stefan Göller, Stefan Kiefer, Andrzej S. Murawski:
  Bisimilarity of Pushdown Automata is Nonelementary. LICS 2013: 488-498
• 
  Massimo Benerecetti, Fabio Mogavero, Aniello Murano:
  Substructure Temporal Logic. LICS 2013: 368-377
• 
  Lars Birkedal, Rasmus Ejlers Møgelberg:
  Intensional Type Theory with Guarded Recursive Types qua Fixed Points on Universes. LICS 2013: 213-222
• 
  Mikolaj Bojanczyk, Bartek Klin, Slawomir Lasota, Szymon Torunczyk:
  Turing Machines with Atoms. LICS 2013: 183-192
• 
  Benedikt Bollig, Dietrich Kuske, Roy Mennicke:
  The Complexity of Model Checking Multi-stack Systems. LICS 2013: 163-172
• 
  Anudhyan Boral, Sylvain Schmitz:
  Model-Checking Parse Trees. LICS 2013: 153-162
• 
  Tomás Brázdil, Krishnendu Chatterjee, Vojtech Forejt, Antonín Kucera:
  Trading Performance for Stability in Markov Decision Processes. LICS 2013: 331-340
• 
  Witold Charatonik, Piotr Witkowski:
  Two-Variable Logic with Counting and Trees. LICS 2013: 73-82
• 
  Swarat Chaudhuri, Sriram Sankaranarayanan, Moshe Y. Vardi:
  Regular Real Analysis. LICS 2013: 509-518
• 
  Thomas Colcombet:
  Magnitude Monadic Logic over Words and the Use of Relative Internal Set Theory. LICS 2013: 123
• 
  Hubert Comon-Lundh:
  LICS: Logic in Computer Security - Some Attacker's Models and Related Decision Problems. LICS 2013: 1
• 
  Ioana Cristescu, Jean Krivine, Daniele Varacca:
  A Compositional Semantics for the Reversible p-Calculus. LICS 2013: 388-397
• 
  Pierre-Évariste Dagand, Conor McBride:
  A Categorical Treatment of Ornaments. LICS 2013: 530-539
• 
  Stéphane Demri, Diego Figueira, M. Praveen:
  Reasoning about Data Repetitions with Counter Systems. LICS 2013: 33-42
• 
  Kord Eickmeyer, Ken-ichi Kawarabayashi, Stephan Kreutzer:
  Model Checking for Successor-Invariant First-Order Logic on Minor-Closed Graph Classes. LICS 2013: 134-142
• 
  Alessandro Facchini, Filip Murlak, Michal Skrzypczak:
  Rabin-Mostowski Index Problem: A Step beyond Deterministic Automata. LICS 2013: 499-508
• 
  Alessandro Facchini, Yde Venema, Fabio Zanasi:
  A Characterization Theorem for the Alternation-Free Fragment of the Modal µ-Calculus. LICS 2013: 478-487
• 
  Hugo Férée, Mathieu Hoyrup, Walid Gomaa:
  On the Query Complexity of Real Functionals. LICS 2013: 103-112
• 
  Emmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier, Frédéric Servais:
  From Two-Way to One-Way Finite State Transducers. LICS 2013: 468-477
• 
  Marcelo P. Fiore, Makoto Hamana:
  Multiversal Polymorphic Algebraic Theories: Syntax, Semantics, Translations, and Equational Logic. LICS 2013: 520-529
• 
  Gaëlle Fontaine:
  Why is it Hard to Obtain a Dichotomy for Consistent Query Answering? LICS 2013: 550-559
• 
  Olle Fredriksson, Dan R. Ghica:
  Abstract Machines for Game Semantics, Revisited. LICS 2013: 560-569
• 
  Neil Ghani, Lorenzo Malatesta, Fredrik Nordvall Forsberg, Anton Setzer:
  Fibred Data Types. LICS 2013: 243-252
• 
  Tomasz Gogacz, Jerzy Marcinkowski:
  Converging to the Chase - A Tool for Finite Controllability. LICS 2013: 540-549

skipping 33 more matches