![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- 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.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 73 matches
- 2024
- Liron Cohen
, Yannick Forster
, Dominik Kirst
, Bruno da Rocha Paiva
, Vincent Rahli
:
Separating Markov's Principles. LICS 2024: 28:1-28:14 - Sergey Goncharov
, Stefan Milius
, Stelios Tsampas
, Henning Urbat
:
Bialgebraic Reasoning on Higher-order Program Equivalence. LICS 2024: 39:1-39:15 - Arka Ghosh
, Slawomir Lasota:
Equivariant ideals of polynomials. LICS 2024: 38:1-38:14 - Bharat Adsul
, Paul Gastin
, Shantanu Kulkarni
, Pascal Weil
:
An expressively complete local past propositional dynamic logic over Mazurkiewicz traces and its applications. LICS 2024: 2:1-2:13 - Cameron Allett
:
Non-Elementary Compression of First-Order Proofs in Deep Inference Using Epsilon-Terms. LICS 2024: 3:1-3:14 - Ashwani Anand
, Sylvain Schmitz
, Lia Schütze
, Georg Zetzsche
:
Verifying Unboundedness via Amalgamation. LICS 2024: 4:1-4:15 - Victor Arrial
, Giulio Guerrieri
, Delia Kesner
:
Genericity Through Stratification. LICS 2024: 5:1-5:15 - Ali Asadi
, Krishnendu Chatterjee
, Jakub Svoboda
, Raimundo Saona Urmeneta
:
Deterministic Sub-exponential Algorithm for Discounted-sum Games with Unary Weights. LICS 2024: 6:1-6:12 - A. R. Balasubramanian
:
Decidability and Complexity of Decision Problems for Affine Continuous VASS. LICS 2024: 7:1-7:13 - Demian Banakh
, Marcin Kozik
:
Injective hardness condition for PCSPs. LICS 2024: 8:1-8:10 - Chris Barrett
, Daniel Castle
, Willem Heijltjes
:
The Relational Machine Calculus. LICS 2024: 9:1-9:15 - Libor Barto
, Silvia Butti
, Alexandr Kazda
, Caterina Viola
, Stanislav Zivný
:
Algebraic Approach to Approximation. LICS 2024: 10:1-10:14 - Valérie Berthé
, Toghrul Karimov
, Joris Nieuwveld
, Joël Ouaknine
, Mihir Vahanwala
, James Worrell
:
On the Decidability of Monadic Second-Order Logic with Arithmetic Predicates. LICS 2024: 11:1-11:14 - Victor Blanchi
, Hugo Paquet
:
Element-free probability distributions and random partitions. LICS 2024: 12:1-12:14 - Michael Blondin
, Alain Finkel
, Piotr Hofman
, Filip Mazowiecki
, Philip Offtermatt
:
Soundness of reset workflow nets. LICS 2024: 13:1-13:14 - Manuel Bodirsky
, Zaneta Semanisinová
, Carsten Lutz
:
The Complexity of Resilience Problems via Valued Constraint Satisfaction Problems. LICS 2024: 14:1-14:14 - Mikolaj Bojanczyk
, Pierre Ohlmann
:
Rank-decreasing transductions. LICS 2024: 59:1-59:13 - Udi Boker
:
Discounted-Sum Automata with Real-Valued Discount Factors. LICS 2024: 15:1-15:14 - Filippo Bonchi
, Alessandro Di Giorgio
, Nathan Haydon
, Pawel Sobocinski
:
Diagrammatic Algebra of First Order Logic. LICS 2024: 16:1-16:15 - Sougata Bose
, Rasmus Ibsen-Jensen
, Patrick Totzke
:
Bounded-Memory Strategies in Partial-Information Games. LICS 2024: 17:1-17:14 - Ulrik Torben Buchholtz
, Johannes Schipp von Branitz
:
Primitive Recursive Dependent Type Theory. LICS 2024: 18:1-18:12 - Benedict Bunting
, Andrzej S. Murawski
:
Contextual Equivalence for State and Control via Nested Data. LICS 2024: 19:1-19:14 - Pierre Cagne
, Ulrik Torben Buchholtz
, Nicolai Kraus
, Marc Bezem
:
On symmetries of spheres in univalent foundations. LICS 2024: 20:1-20:14 - Antonio Casares
, Pierre Ohlmann
:
Positional ω-regular languages. LICS 2024: 21:1-21:14 - Miroslav Chodil
, Antonín Kucera
:
The Finite Satisfiability Problem for PCTL is Undecidable. LICS 2024: 22:1-22:14 - Lorenzo Ciardo
:
Quantum advantage and CSP complexity. LICS 2024: 23:1-23:15 - Lorenzo Ciardo
, Marcin Kozik
, Andrei A. Krokhin
, Tamio-Vesa Nakajima
, Stanislav Zivný
:
1-in-3 vs. Not-All-Equal: Dichotomy of a broken promise. LICS 2024: 24:1-24:12 - Laura Ciobanu
, Georg Zetzsche
:
Slice closures of indexed languages and word equations with counting constraints. LICS 2024: 25:1-25:12 - Pierre Clairambault
, Simon Forest
:
An Analysis of Symmetry in Quantitative Semantics. LICS 2024: 26:1-26:13 - Alexandre Clément
, Noé Delorme
, Simon Perdrix
:
Minimal Equational Theories for Quantum Circuits. LICS 2024: 27:1-27:14
skipping 43 more matches
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-07-17 04:52 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint