default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID37th LICS 2022: Haifa, Israel
- Christel Baier, Dana Fisman:
LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2 - 5, 2022. ACM 2022, ISBN 978-1-4503-9351-5 - Mikolaj Bojanczyk:
Transducers of polynomial growth. 1:1-1:27 - Daniel Gratzer
:
Normalization for Multimodal Type Theory. 2:1-2:13 - Edon Kelmendi:
Computing the Density of the Positivity Set for Linear Recurrence Sequences. 3:1-3:12 - Junyi Liu, Li Zhou, Gilles Barthe, Mingsheng Ying:
Quantum Weakest Preconditions for Reasoning about Expected Runtimes of Quantum Programs. 4:1-4:13 - Richard Lipton, Florian Luca, Joris Nieuwveld, Joël Ouaknine, David Purser, James Worrell:
On the Skolem Problem and the Skolem Conjecture. 5:1-5:9 - C. Aiswarya, Soumodev Mal, Prakash Saivasan:
On the Satisfiability of Context-free String Constraints with Subword-Ordering. 6:1-6:13 - Nathanael L. Ackerman, Julian Asilis, Jieqi Di, Cameron E. Freer, Jean-Baptiste Tristan:
Computable PAC Learning of Continuous Features. 7:1-7:12 - Nikhil Balaji, Klara Nosan, Mahsa Shirmohammadi, James Worrell:
Identity Testing for Radical Expressions. 8:1-8:11 - Jirí Adámek:
Varieties of Quantitative Algebras and Their Monads. 9:1-9:10 - Martin Avanzini, Georg Moser, Romain Péchoux, Simon Perdrix, Vladimir Zamdzhiev:
Quantum Expectation Transformers for Cost Analysis. 10:1-10:13 - Arka Ghosh, Piotr Hofman, Slawomir Lasota:
Solvability of orbit-finite systems of linear equations. 11:1-11:13 - Benedikt Ahrens, Paige Randall North, Niels van der Weide:
Semantics for two-dimensional type theory. 12:1-12:14 - Yoàv Montacute, Nihil Shah:
The Pebble-Relation Comonad in Finite Model Theory. 13:1-13:11 - Thomas Place:
The amazing mixed polynomial closure and its applications to two-variable first-order logic. 14:1-14:14 - Wojciech Czerwinski, Engel Lefaucheux, Filip Mazowiecki, David Purser, Markus A. Whiteland:
The boundedness and zero isolation problems for weighted automata over nonnegative rationals. 15:1-15:13 - Francesco Dagnino, Fabio Pasquali:
Logical Foundations of Quantitative Equality. 16:1-16:13 - Remi Delannoy, Kuldeep S. Meel:
On Almost-Uniform Generation of SAT Solutions: The power of 3-wise independent hashing. 17:1-17:10 - Clemens Kupke, Johannes Marti, Yde Venema:
Size measures and alphabetic equivalence in the μ-calculus. 18:1-18:13 - Gianluca Curzi, Anupam Das:
Cyclic Implicit Complexity. 19:1-19:13 - Michael Blondin, Filip Mazowiecki, Philip Offtermatt:
The complexity of soundness in workflow nets. 20:1-20:13 - Anca Muscholl, Igor Walukiewicz:
Active learning for sound negotiations✱. 21:1-21:12 - Pierre Ohlmann:
Characterizing Positionality in Games of Infinite Duration over Infinite Graphs. 22:1-22:12 - Bart Jacobs:
Partitions and Ewens Distributions in element-free Probability Theory. 23:1-23:9 - R. Govind, Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz:
Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods. 24:1-24:14 - Ilario Bonacina, Maria Luisa Bonet:
On the strength of Sherali-Adams and Nullstellensatz as propositional proof systems. 25:1-25:12 - Moses Ganardi, Rupak Majumdar, Georg Zetzsche:
The Complexity of Bidirected Reachability in Valence Systems. 26:1-26:15 - Davide Barbarossa:
Resource approximation for the λμ-calculus. 27:1-27:12 - Pascal Bergsträßer, Moses Ganardi, Anthony W. Lin, Georg Zetzsche:
Ramsey Quantifiers over Automatic Structures: Complexity and Applications to Verification. 28:1-28:14 - Kristina Sojakova, G. A. Kavvos:
Syllepsis in Homotopy Type Theory. 29:1-29:12 - Moritz Lichter, Pascal Schweitzer:
Choiceless Polynomial Time with Witnessed Symmetric Choice. 30:1-30:13 - Jan Dreier, Jakub Gajarský, Sandra Kiefer, Michal Pilipczuk, Szymon Torunczyk:
Treelike Decompositions for Transductions of Sparse Graphs. 31:1-31:14 - Pawel M. Idziak, Piotr Kawalek, Jacek Krzaczkowski:
Complexity of Modular Circuits. 32:1-32:11 - Guanyan Li, Andrzej S. Murawski, Luke Ong:
Probabilistic Verification Beyond Context-Freeness. 33:1-33:13 - Clemens Armin Grabmayer:
Milner's Proof System for Regular Expressions Modulo Bisimilarity is Complete: Crystallization: Near-Collapsing Process Graph Interpretations of Regular Expressions. 34:1-34:13 - Lukas Heidemann, David Reutter, Jamie Vicary:
Zigzag normalisation for associative n-categories. 35:1-35:13 - Antoine Mottet, Michael Pinsker:
Smooth approximations and CSPs over finitely bounded homogeneous structures. 36:1-36:13 - Diego Figueira, Anthony Widjaja Lin:
Reasoning on Data Words over Numeric Domains. 37:1-37:13 - Sean K. Moss, Paolo Perrone:
Probability monads with submonads of deterministic states. 38:1-38:13 - Jakub Gajarský, Michal Pilipczuk, Szymon Torunczyk:
Stable graphs of bounded twin-width. 39:1-39:12 - Wojciech Czerwinski, Lukasz Orlikowski:
Lower Bounds for the Reachability Problem in Fixed Dimensional VASSes. 40:1-40:12 - Erich Grädel, Hayyan Helal, Matthias Naaf, Richard Wilke:
Zero-One Laws and Almost Sure Valuations of First-Order Logic in Semiring Semantics. 41:1-41:12 - Magnus Baunsgaard Kristensen, Rasmus Ejlers Møgelberg, Andrea Vezzosi:
Greatest HITs: Higher inductive types in coinductive definitions via induction under clocks. 42:1-42:13 - Laurent Doyen:
Stochastic Games with Synchronizing Objectives. 43:1-43:12 - Jens Oliver Gutsfeld, Arne Meier, Christoph Ohrem, Jonni Virtema:
Temporal Team Semantics Revisited. 44:1-44:13 - Melissa Antonelli, Ugo Dal Lago, Paolo Pistone:
Curry and Howard Meet Borel. 45:1-45:13 - Aliaume Lopez:
When Locality Meets Preservation. 46:1-46:14 - Beniamino Accattoli, Ugo Dal Lago, Gabriele Vanoni:
Reasonable Space for the λ-Calculus, Logarithmically. 47:1-47:13 - Eric Finster, David Reutter, Jamie Vicary, Alex Rice:
A Type Theory for Strictly Unital ∞-Categories. 48:1-48:12 - Beniamino Accattoli:
Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic. 49:1-49:15 - Luc Dartois, Paul Gastin, R. Govind, Shankara Narayanan Krishna:
Efficient Construction of Reversible Transducers from Regular Transducer Expressions. 50:1-50:13 - Elena Di Lavore, Giovanni de Felice, Mario Román:
Monoidal Streams for Dataflow Programming. 51:1-51:14 - Matteo Mio, Ralph Sarkis, Valeria Vignudelli:
Beyond Nonexpansive Operations in Quantitative Algebraic Reasoning. 52:1-52:13 - Guillaume Geoffroy:
A first-order completeness result about characteristic Boolean algebras in classical realizability. 53:1-53:8 - Édouard Bonnet, Jan Dreier, Jakub Gajarský, Stephan Kreutzer, Nikolas Mählmann, Pierre Simon, Szymon Torunczyk:
Model Checking on Interpretations of Classes of Bounded Local Cliquewidth. 54:1-54:13 - Anuj Dawar, Felipe Ferreira Santos:
Separating LREC from LFP. 55:1-55:13 - Raven Beutner, David Carral, Bernd Finkbeiner, Jana Hofmann, Markus Krötzsch:
Deciding Hyperproperties Combined with Functional Specifications. 56:1-56:13 - Cristina Matache, Sean K. Moss, Sam Staton:
Concrete categories and higher-order recursion: With applications including probability, differentiability, and full abstraction. 57:1-57:14 - Corentin Barloy, Michaël Cadilhac, Charles Paperman, Thomas Zeume:
The Regular Languages of First-Order Logic with One Alternation. 58:1-58:11 - Dmitry Chistikov, Christoph Haase, Alessio Mansutti:
Geometric decision procedures and the VC dimension of linear arithmetic theories. 59:1-59:13 - Takeshi Tsukada, Kazuyuki Asada:
Linear-Algebraic Models of Linear Logic as Categories of Modules over Σ-Semirings✱. 60:1-60:13 - Chase Ford, Stefan Milius, Lutz Schröder, Harsh Beohar, Barbara König:
Graded Monads and Behavioural Equivalence Games. 61:1-61:13 - Valentin Blot:
A direct computational interpretation of second-order arithmetic via update recursion. 62:1-62:11 - David Baelde, Amina Doumane, Denis Kuperberg, Alexis Saurin:
Bouncing Threads for Circular and Non-Wellfounded Proofs: Towards Compositionality with Circular Proofs. 63:1-63:13 - Paul-André Melliès:
A Functorial Excursion Between Algebraic Geometry and Linear Logic. 64:1-64:13
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-10-31 20:03 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
