Остановите войну!
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 67 matches
- 2015
- Beniamino Accattoli, Claudio Sacerdoti Coen:
On the Relative Usefulness of Fireballs. LICS 2015: 141-155 - Nathanael L. Ackerman, Cameron E. Freer, Robert S. Lubarsky:
Feedback Turing Computability, and Turing Computability as Feedback. LICS 2015: 523-534 - Jirí Adámek, Robert S. R. Myers, Henning Urbat, Stefan Milius:
Varieties of Languages in a Category. LICS 2015: 414-425 - Antoine Amarilli, Michael Benedikt:
Finite Open-World Query Answering with Number Restrictions. LICS 2015: 305-316 - Albert Atserias, José L. Balcázar:
Entailment among Probabilistic Implications. LICS 2015: 621-632 - Matthias Baaz, Alexander Leitsch, Giselle Reis:
A Note on the Complexity of Classical and Intuitionistic Proofs. LICS 2015: 657-666 - Borja Balle, Prakash Panangaden, Doina Precup:
A Canonical Form for Weighted Automata and Applications to Approximate Minimization. LICS 2015: 701-712 - Arnold Beckmann, Norbert Preining:
Hyper Natural Deduction. LICS 2015: 547-558 - Michael Benedikt, Balder ten Cate, Michael Vanden Boom:
Interpolation with Decidable Fixpoint Logics. LICS 2015: 378-389 - Michael Benedikt, Balder ten Cate, Thomas Colcombet, Michael Vanden Boom:
The Complexity of Boundedness for Guarded Logics. LICS 2015: 293-304 - Meghyn Bienvenu, Stanislav Kikot, Vladimir V. Podolskii:
Tree-like Queries in OWL 2 QL: Succinctness and Complexity Results. LICS 2015: 317-328 - Michael Blondin, Alain Finkel, Stefan Göller, Christoph Haase, Pierre McKenzie:
Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete. LICS 2015: 32-43 - Mikolaj Bojanczyk:
Star Height via Games. LICS 2015: 214-219 - Udi Boker, Thomas A. Henzinger, Jan Otop:
The Target Discounted-Sum Problem. LICS 2015: 750-761 - Laura Bozzelli, David Pearce:
On the Complexity of Temporal Equilibrium Logic. LICS 2015: 645-656 - Tomás Brázdil, Stefan Kiefer, Antonín Kucera, Petr Novotný:
Long-Run Average Behaviour of Probabilistic Vector Addition Systems. LICS 2015: 44-55 - Paul Brunet, Damien Pous:
Petri Automata for Kleene Allegories. LICS 2015: 68-79 - Felix Canavoi, Erich Grädel, Simon Leßenich, Wied Pakusa:
Defining Winning Strategies in Fixed-Point Logic. LICS 2015: 366-377 - Arnaud Carayol, Olivier Serre:
How Good Is a Strategy in a Game with Nature? LICS 2015: 609-620 - Facundo Carreiro:
PDL Is the Bisimulation-Invariant Fragment of Weak Chain Logic. LICS 2015: 341-352 - Catarina Carvalho, Florent R. Madelaine, Barnaby Martin:
From Complexity to Algebra and Back: Digraph Classes, Collapsibility, and the PGP. LICS 2015: 462-474 - Simon Castellan, Pierre Clairambault, Glynn Winskel:
The Parallel Intensionally Fully Abstract Games Model of PCF. LICS 2015: 232-243 - Krishnendu Chatterjee, Monika Henzinger, Veronika Loitzenbauer:
Improved Algorithms for One-Pair and k-Pair Streett Objectives. LICS 2015: 269-280 - Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop:
Nested Weighted Automata. LICS 2015: 725-737 - Krishnendu Chatterjee, Zuzana Komárková, Jan Kretínský:
Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. LICS 2015: 244-256 - Lorenzo Clemente, Slawomir Lasota:
Timed Pushdown Automata Revisited. LICS 2015: 738-749 - Lorenzo Clemente, Jean-François Raskin:
Multidimensional beyond Worst-Case and Almost-Sure Problems for Mean-Payoff Objectives. LICS 2015: 257-268 - Raphaëlle Crubillé, Ugo Dal Lago:
Metric Reasoning about λ-Terms: The Affine Case. LICS 2015: 633-644 - Wojciech Czerwinski, Petr Jancar:
Branching Bisimilarity of Normed BPA Processes Is in NEXPTIME. LICS 2015: 168-179 - Víctor Dalmau, László Egri, Pavol Hell, Benoît Larose, Arash Rafiey:
Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy. LICS 2015: 487-498
skipping 37 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-05-24 03:19 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