default search action
39th LICS 2024: Tallinn, Estonia
- Pawel Sobocinski, Ugo Dal Lago, Javier Esparza:
Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2024, Tallinn, Estonia, July 8-11, 2024. ACM 2024 - Noah Abou El Wafa
, André Platzer
Complete Game Logic with Sabotage. 1:1-1:15 - Bharat Adsul
An expressively complete local past propositional dynamic logic over Mazurkiewicz traces and its applications. 2:1-2:13 - Cameron Allett
Non-Elementary Compression of First-Order Proofs in Deep Inference Using Epsilon-Terms. 3:1-3:14 - Ashwani Anand
Verifying Unboundedness via Amalgamation. 4:1-4:15 - Victor Arrial
Genericity Through Stratification. 5:1-5:15 - Ali Asadi
Deterministic Sub-exponential Algorithm for Discounted-sum Games with Unary Weights. 6:1-6:12 - A. R. Balasubramanian
Decidability and Complexity of Decision Problems for Affine Continuous VASS. 7:1-7:13 - Demian Banakh
Injective hardness condition for PCSPs. 8:1-8:10 - Chris Barrett
The Relational Machine Calculus. 9:1-9:15 - Libor Barto
Algebraic Approach to Approximation. 10:1-10:14 - Valérie Berthé
On the Decidability of Monadic Second-Order Logic with Arithmetic Predicates. 11:1-11:14 - Victor Blanchi
Element-free probability distributions and random partitions. 12:1-12:14 - Michael Blondin
Soundness of reset workflow nets. 13:1-13:14 - Manuel Bodirsky
The Complexity of Resilience Problems via Valued Constraint Satisfaction Problems. 14:1-14:14 - Udi Boker
Discounted-Sum Automata with Real-Valued Discount Factors. 15:1-15:14 - Filippo Bonchi
Diagrammatic Algebra of First Order Logic. 16:1-16:15 - Sougata Bose
Bounded-Memory Strategies in Partial-Information Games. 17:1-17:14 - Ulrik Torben Buchholtz
Primitive Recursive Dependent Type Theory. 18:1-18:12 - Benedict Bunting
Contextual Equivalence for State and Control via Nested Data. 19:1-19:14 - Pierre Cagne
On symmetries of spheres in univalent foundations. 20:1-20:14 - Antonio Casares
Positional ω-regular languages. 21:1-21:14 - Miroslav Chodil
The Finite Satisfiability Problem for PCTL is Undecidable. 22:1-22:14 - Lorenzo Ciardo
Quantum advantage and CSP complexity. 23:1-23:15 - Lorenzo Ciardo
1-in-3 vs. Not-All-Equal: Dichotomy of a broken promise. 24:1-24:12 - Laura Ciobanu
Slice closures of indexed languages and word equations with counting constraints. 25:1-25:12 - Pierre Clairambault
An Analysis of Symmetry in Quantitative Semantics. 26:1-26:13 - Alexandre Clément
Minimal Equational Theories for Quantum Circuits. 27:1-27:14 - Liron Cohen
Separating Markov's Principles. 28:1-28:14 - Víctor Dalmau
Local consistency as a reduction between constraint satisfaction problems. 29:1-29:15 - Anupam Das
A proof theory of right-linear (ω-)grammars via cyclic proofs. 30:1-30:14 - Danila Demin
First order complexity of finite random structures. 31:1-31:14 - Pietro Di Gianantonio
A Cartesian Closed Category for Random Variables. 32:1-32:14 - Emmanuel Filiot
Finite-valued Streaming String Transducers. 33:1-33:14 - Eric Finster
A Syntax for Strictly Associative and Unital ∞-Categories. 34:1-34:13 - Oskar Fiuk
On the complexity of Maslov's class K. 35:1-35:14 - Jakub Gajarský
Elementary first-order model checking for sparse graphs. 36:1-36:14 - Zeinab Galal
Combining fixpoint and differentiation theory. 37:1-37:14 - Arka Ghosh
Equivariant ideals of polynomials. 38:1-38:14 - Sergey Goncharov
Bialgebraic Reasoning on Higher-order Program Equivalence. 39:1-39:15 - Martin Grohe
Are Targeted Messages More Effective? 40:1-40:14 - Emmanuel Hainry
Declassification Policy for Program Complexity Analysis. 41:1-41:14 - Masahito Hasegawa
Braids, Twists, Trace and Duality in Combinatory Algebras. 42:1-42:14 - James Hefford
A Profunctorial Semantics for Quantum Supermaps. 43:1-43:15 - Tal Hershko
First order distinguishability of sparse random graphs. 44:1-44:14 - Stefan Hetzl
On the Completeness of Interpolation Algorithms. 45:1-45:13 - Ismaël Jecker
Determinisation and Unambiguisation of Polynomially-Ambiguous Rational Weighted Automata. 46:1-46:13 - Nadim Kasymov
Defining algorithmically presented structures in first order logic. 47:1-47:13 - Marie Morgane Kerjean
δ is for Dialectica. 48:1-48:13 - Eren Keskin
On the Separability Problem of VASS Reachability Languages. 49:1-49:14 - Sandra Kiefer
Bounding the Weisfeiler-Leman Dimension via a Depth Analysis of I/R-Trees. 50:1-50:14 - Søren Brinck Knudstorp
Relevant S is Undecidable. 51:1-51:8 - Mayuko Kori
Composing Codensity Bisimulations. 52:1-52:13 - Vasileios Koutavas
Pushdown Normal-Form Bisimulation: A Nominal Context-Free Approach to Program Equivalence. 53:1-53:15 - Nathan Lhote
Uniformisation of Regular Relations in First-Order Logic with Two Variables. 54:1-54:13 - John M. Li
A Nominal Approach to Probabilistic Separation Logic. 55:1-55:14 - Samuel Mimram
Delooping cyclic groups with lens spaces in homotopy type theory. 56:1-56:15 - Fabian Mitterwallner
Linear Termination is Undecidable. 57:1-57:12 - Yoàv Montacute
Concurrent Games over Relational Structures: The Origin of Game Comonads. 58:1-58:14 - Mikolaj Bojanczyk
Rank-decreasing transductions. 59:1-59:13 - Tim Lyon
Decidability of Quasi-Dense Modal Logics. 60:1-60:8 - Hugo Paquet
Effectful semantics in bicategories: strong, commutative, and concurrent pseudomonads. 61:1-61:15 - Kirstin Peters
Separation and Encodability in Mixed Choice Multiparty Sessions. 62:1-62:15 - Maximilian Pflueger
A Characterisation Theorem for Two-Way Bisimulation-Invariant Monadic Least Fixpoint Logic Over Finite Structures. 63:1-63:14 - Thomas Place
Dot-depth three, return of the J-class. 64:1-64:15 - Pierre-Marie Pédrot
"Upon This Quote I Will Build My Church Thesis". 65:1-65:12 - Wojciech Rozowski
A Completeness Theorem for Probabilistic Regular Expressions. 66:1-66:14 - Christian Sattler
Natural numbers from integers. 67:1-67:9 - Nicole Schirrmacher
Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes. 68:1-68:12 - Amin Karamlou
No Go Theorems: Directed Containers That Do Not Distribute Over Distribution Monads. 69:1-69:13 - Alex Simpson
Equivalence and Conditional Independence in Atomic Sheaf Logic. 70:1-70:14 - Harry Vinall-Smeeth
From Quantifier Depth to Quantifier Number: Separating Structures with k Variables. 71:1-71:14 - Thorsten Wißmann
Initial Algebras Unchained - A Novel Initial Algebra Construction Formalized in Agda. 72:1-72:14
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-11-19 20:33 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: