Остановите войну!
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 44 matches
- 2009
- Thorsten Altenkirch, Peter Morris:
Indexed Containers. LICS 2009: 277-285 - John Baez:
Computation and the Periodic Table. LICS 2009: 211 - Michele Basaldella, Claudia Faggian:
Ludics with Repetitions (Exponentials, Interactive Types and Completeness). LICS 2009: 375-384 - Jesper Bengtson, Magnus Johansson, Joachim Parrow, Björn Victor:
Psi-calculi: Mobile Processes, Nominal Data, and Logic. LICS 2009: 39-48 - Nathalie Bertrand, Blaise Genest, Hugo Gimbert:
Qualitative Determinacy and Decidability of Stochastic Games with Signals. LICS 2009: 319-328 - Alessandro Bianco, Fabio Mogavero, Aniello Murano:
Graded Computation Tree Logic. LICS 2009: 342-351 - Mikolaj Bojanczyk, Howard Straubing, Igor Walukiewicz:
Wreath Products of Forest Algebras, with Applications to Tree Logics. LICS 2009: 255-263 - Udi Boker, Orna Kupferman:
Co-ing Büchi Made Tight and Useful. LICS 2009: 245-254 - Marcello M. Bonsangue, Jan J. M. M. Rutten, Alexandra Silva:
An Algebra for Kripke Polynomial Coalgebras. LICS 2009: 49-58 - Andrei A. Bulatov, Dániel Marx:
The Complexity of Global Cardinality Constraints. LICS 2009: 419-428 - Yang Cai, Ting Zhang, Haifeng Luo:
An Improved Lower Bound for the Complementation of Rabin Automata. LICS 2009: 167-176 - Alberto Carraro, Antonino Salibra:
Reflexive Scott Domains are Not Complete for the Extensional Lambda Calculus. LICS 2009: 91-100 - Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger:
Expressiveness and Closure Properties for Quantitative Languages. LICS 2009: 199-208 - Yijia Chen, Jörg Flum:
A Logic for PTIME and a Parameterized Halting Problem. LICS 2009: 397-406 - Taolue Chen, Tingting Han, Joost-Pieter Katoen, Alexandru Mereacre:
Quantitative Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications. LICS 2009: 309-318 - Edmund M. Clarke:
My 27-year Quest to Overcome the State Explosion Problem. LICS 2009: 3 - Carles Creus, Guillem Godoy, Francesc Massanes, Ashish Tiwari:
Non-linear Rewrite Closure and Weak Normalization. LICS 2009: 365-374 - Anuj Dawar, Martin Grohe, Bjarki Holm, Bastian Laubner:
Logics with Rank Operators. LICS 2009: 113-122 - Luís Dominguez:
Fully Abstract Logical Bisimilarity for a Polymorphic Object Calculus. LICS 2009: 81-90 - Derek Dreyer, Amal Ahmed, Lars Birkedal:
Logical Step-Indexed Logical Relations. LICS 2009: 71-80 - Arnaud Durand, Miki Hermann, Gustav Nordh:
Trichotomy in the Complexity of Minimal Inference. LICS 2009: 387-396 - Oliver Friedmann:
An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it. LICS 2009: 145-156 - Dan R. Ghica:
Applications of Game Semantics: From Program Analysis to Hardware Synthesis. LICS 2009: 17-26 - Dan R. Ghica, Adam Bakewell:
Clipping: A Semantics-Directed Syntactic Approximation. LICS 2009: 189-198 - Stefan Göller, Richard Mayr, Anthony Widjaja To:
On the Computational Complexity of Verifying One-Counter Processes. LICS 2009: 235-244 - Kristoffer Arnsfelt Hansen, Michal Koucký, Peter Bro Miltersen:
Winning Concurrent Reachability Games Requires Doubly-Exponential Patience. LICS 2009: 332-341 - Martin Hofmann, Ulrich Schöpp:
Pointer Programs and Undirected Reachability. LICS 2009: 133-142 - Vineet Kahlon:
Boundedness vs. Unboundedness of Lock Chains: Characterizing Decidability of Pairwise CFL-Reachability for Threads Communicating via Locks. LICS 2009: 27-36 - Yevgeny Kazakov, Ian Pratt-Hartmann:
A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics. LICS 2009: 407-416 - Emanuel Kieronski, Lidia Tendera:
On Finite Satisfiability of Two-Variable First-Order Logic with Equivalence Relations. LICS 2009: 123-132
skipping 14 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-25 17:41 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