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 28 matches
- 2015
- Antonis Achilleos:
NEXP-Completeness and Universal Hardness Results for Justification Logic. CSR 2015: 27-52 - Maxim A. Babenko, Alexander V. Karzanov:
A Combinatorial Algorithm for the Planar Multiflow Problem with Demands Located on Three Holes. CSR 2015: 53-66 - Mikhail Barash, Alexander Okhotin:
Generalized LR Parsing for Grammars with Contexts. CSR 2015: 67-79 - Christoph Benzmüller, Bruno Woltzenlogel Paleo:
Interacting with Modal Logics in the Coq Proof Assistant. CSR 2015: 398-411 - Simone Bova, Friedrich Slivovsky:
On Compiling Structured CNFs to OBDDs. CSR 2015: 80-93 - Sam Buss:
Propositional Proofs in Frege and Extended Frege Systems (Abstract). CSR 2015: 1-6 - Claudia Carapelle, Shiguang Feng, Alexander Kartzow, Markus Lohrey:
Satisfiability of ECTL* with Tree Constraints. CSR 2015: 94-108 - Julien Cassaigne, Juhani Karhumäki, Aleksi Saarela:
On Growth and Fluctuation of k-Abelian Complexity. CSR 2015: 109-122 - Nathann Cohen, Daniel Gonçalves, Eunjung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller:
A Polynomial-Time Algorithm for Outerplanar Diameter Improvement. CSR 2015: 123-142 - Konrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma, Dimitrios M. Thilikos:
Editing to a Planar Graph of Given Degrees. CSR 2015: 143-156 - Volker Diekert, Florent Martin, Géraud Sénizergues, Pedro V. Silva:
Equations over Free Inverse Monoids with Idempotent Variables. CSR 2015: 173-188 - Manfred Droste, Vitaly Perevoshchikov:
A Logical Characterization of Timed Pushdown Languages. CSR 2015: 189-203 - Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen:
An In-Place Priority Queue with O(1) Time for Push and lg n + O ( 1 ) Comparisons for Pop. CSR 2015: 204-218 - Dmitry Itsykson, Mikhail Slabodkin, Dmitry Sokolov:
Resolution Complexity of Perfect Matching Principles for Sparse Graphs. CSR 2015: 219-230 - Jozef Stefan Jirásek, Galina Jirásková, Alexander Szabari:
Operations on Self-Verifying Finite Automata. CSR 2015: 231-261 - Fairouz Kamareddine, Joe B. Wells, Daniel Lima Ventura:
Automath Type Inclusion in Barendregt's Cube. CSR 2015: 262-282 - Alexander Knop:
Circuit Lower Bounds for Average-Case MA. CSR 2015: 283-295 - Alexander Kozachinskiy:
Making Randomness Public in Unbounded-Round Information Complexity. CSR 2015: 296-309 - Violetta Lonati, Dino Mandrioli, Federica Panella, Matteo Pradella:
First-Order Logic Definability of Free Languages. CSR 2015: 310-324 - Marina I. Maslennikova, Emanuele Rodaro:
Representation of (Left) Ideal Regular Languages by Synchronizing Automata. CSR 2015: 325-338 - Alexey Milovanov:
Some Properties of Antistochastic Strings. CSR 2015: 339-349 - N. S. Narayanaswamy, C. S. Rahul:
Approximation and Exact Algorithms for Special Cases of Connected f-Factors. CSR 2015: 350-363 - Mateus de Oliveira Oliveira:
On the Satisfiability of Quantum Circuits of Small Treewidth. CSR 2015: 157-172 - Vincent Penelle:
Rewriting Higher-Order Stack Trees. CSR 2015: 364-397 - Vladimir V. Podolskii:
Circuit Complexity Meets Ontology-Based Data Access. CSR 2015: 7-26 - Martin Zimmermann:
Delay Games with WMSO+U Winning Conditions. CSR 2015: 412-425 - Florian Zuleger:
Asymptotically Precise Ranking Functions for Deterministic Size-Change Systems. CSR 2015: 426-442 - Lev D. Beklemishev, Daniil V. Musatov:
Computer Science - Theory and Applications - 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 13-17, 2015, Proceedings. Lecture Notes in Computer Science 9139, Springer 2015, ISBN 978-3-319-20296-9 [contents]
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-11-18 23:06 CET 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