Остановите войну!
for scientists:
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 96 matches
- 2018
- Arnaud Durand, Anselm Haak, Heribert Vollmer:
Model-Theoretic Characterization of Boolean and Arithmetic Circuit Classes of Small Depth. LICS 2018: 354-363 - Michael Hahn, Andreas Krebs, Howard Straubing:
Wreath Products of Distributive Forest Algebras. LICS 2018: 512-520 - S. Akshay, Blaise Genest, Nikhil Vyas:
Distribution-based objectives for Markov Decision Processes. LICS 2018: 36-45 - Joël D. Allred, Ulrich Ultes-Nitsche:
A Simple and Optimal Complementation Algorithm for Büchi Automata. LICS 2018: 46-55 - Robert Atkey:
Syntax and Semantics of Quantitative Type Theory. LICS 2018: 56-65 - Albert Atserias, Joanna Ochremiak:
Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Isomorphism Problem. LICS 2018: 66-75 - Steve Awodey, Jonas Frey, Sam Speight:
Impredicative Encodings of (Higher) Inductive Types. LICS 2018: 76-85 - Giorgio Bacci, Robert Furber, Dexter Kozen, Radu Mardare, Prakash Panangaden, Dana S. Scott:
Boolean-Valued Semantics for the Stochastic λ-Calculus. LICS 2018: 669-678 - Giorgio Bacci, Radu Mardare, Prakash Panangaden, Gordon D. Plotkin:
An Algebraic Theory of Markov Processes. LICS 2018: 679-688 - Christel Baier, Nathalie Bertrand, Clemens Dubslaff, Daniel Gburek, Ocan Sankur:
Stochastic Shortest Paths and Weight-Bounded Properties in Markov Decision Processes. LICS 2018: 86-94 - Mark Bickford, Liron Cohen, Robert L. Constable, Vincent Rahli:
Computability Beyond Church-Turing via Choice Sequences. LICS 2018: 245-254 - Michael Blondin, Javier Esparza, Stefan Jaax, Antonín Kucera:
Black Ninjas in the Dark: Formal Analysis of Population Protocols. LICS 2018: 1-10 - Valentin Blot, Jim Laird:
Extensional and Intensional Semantic Universes: A Denotational Model of Dependent Types. LICS 2018: 95-104 - Manuel Bodirsky, Florent R. Madelaine, Antoine Mottet:
A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP. LICS 2018: 105-114 - Rose Bohrer, André Platzer:
A Hybrid, Dynamic Logic for Hybrid-Dynamic Information Flow. LICS 2018: 115-124 - Mikolaj Bojanczyk, Laure Daviaud, Shankara Narayanan Krishna:
Regular and First-Order List Functions. LICS 2018: 125-134 - Mikolaj Bojanczyk, Martin Grohe, Michal Pilipczuk:
Definable decompositions for graphs of bounded linear cliquewidth. LICS 2018: 135-144 - Mikolaj Bojanczyk, Szymon Torunczyk:
On computability and tractability for infinite sets. LICS 2018: 145-154 - Udi Boker, Yariv Shaulian:
Automaton-Based Criteria for Membership in CTL. LICS 2018: 155-164 - Filippo Bonchi, Pierre Ganty, Roberto Giacobazzi, Dusko Pavlovic:
Sound up-to techniques and Complete abstract domains. LICS 2018: 175-184 - Filippo Bonchi, Fabio Gadducci, Aleks Kissinger, Pawel Sobocinski, Fabio Zanasi:
Rewriting with Frobenius. LICS 2018: 165-174 - Tomás Brázdil, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný, Dominik Velan, Florian Zuleger:
Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS. LICS 2018: 185-194 - Roberto Bruni, Hernán C. Melgratti, Ugo Montanari:
Concurrency and Probability: Removing Confusion, Compositionally. LICS 2018: 195-204 - Ulrik Buchholtz, Kuen-Bang Hou (Favonia):
Cellular Cohomology in Homotopy Type Theory. LICS 2018: 521-529 - Ulrik Buchholtz, Floris van Doorn, Egbert Rijke:
Higher Groups in Homotopy Type Theory. LICS 2018: 205-214 - Simon Castellan, Pierre Clairambault, Hugo Paquet, Glynn Winskel:
The concurrent game semantics of Probabilistic PCF. LICS 2018: 215-224 - Yijia Chen, Jörg Flum:
Tree-depth, quantifier elimination, and quantifier rank. LICS 2018: 225-234 - Yijia Chen, Moritz Müller, Keita Yokoyama:
A parameterized halting problem, the linear time hierarchy, and the MRDP theorem. LICS 2018: 235-244 - Thierry Coquand:
Inner Models of Univalence. LICS 2018: 11-12 - Thierry Coquand, Simon Huber, Anders Mörtberg:
On Higher Inductive Types in Cubical Type Theory. LICS 2018: 255-264
skipping 66 more matches
loading more results
failed to load more results, please try again later
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-04-24 10:21 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