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 60 matches
- 2013
- Susanne Albers:
Recent Advances for a Classical Scheduling Problem. ICALP (2) 2013: 4-14 - Susanne Albers, Achim Passen:
New Online Algorithms for Story Scheduling in Web Advertising. ICALP (2) 2013: 446-458 - Shaull Almagor, Udi Boker, Orna Kupferman:
Formalizing and Reasoning about Quality. ICALP (2) 2013: 15-27 - Rajeev Alur, Mukund Raghothaman:
Decision Problems for Additive Regular Functions. ICALP (2) 2013: 37-48 - Yoram Bachrach, Ely Porat:
Sketching for Big Data Recommender Systems Using Fast Pseudo-random Fingerprints. ICALP (2) 2013: 459-471 - Gilles Barthe, Federico Olmedo:
Beyond Differential Privacy: Composition Theorems and Relational Logic for f-divergences between Probabilistic Programs. ICALP (2) 2013: 49-60 - Nicolas Basset:
A Maximal Entropy Stochastic Process for a Timed Automaton, . ICALP (2) 2013: 61-73 - Luca Becchetti, Vincenzo Bonifaci, Michael Dirnberger, Andreas Karrenbauer, Kurt Mehlhorn:
Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds. ICALP (2) 2013: 472-483 - Saguy Benaim, Michael Benedikt, Witold Charatonik, Emanuel Kieronski, Rastislav Lenhardt, Filip Mazowiecki, James Worrell:
Complexity of Two-Variable Logic on Finite Trees. ICALP (2) 2013: 74-88 - Udi Boker, Denis Kuperberg, Orna Kupferman, Michal Skrzypczak:
Nondeterminism in the Presence of a Diverse or Unknown Future. ICALP (2) 2013: 89-100 - Facundo Carreiro, Daniel Gorín, Lutz Schröder:
Coalgebraic Announcement Logics. ICALP (2) 2013: 101-112 - L. Elisa Celis, Dimitrios C. Gklezakos, Anna R. Karlin:
On Revenue Maximization for Agents with Costly Information Acquisition - Extended Abstract. ICALP (2) 2013: 484-495 - Emilie Charlier, Teturo Kamae, Svetlana Puzynina, Luca Q. Zamboni:
Self-shuffling Words. ICALP (2) 2013: 113-124 - Hubie Chen, Dániel Marx:
Block-Sorted Quantified Conjunctive Queries. ICALP (2) 2013: 125-136 - Rémy Chrétien, Véronique Cortier, Stéphanie Delaune:
From Security Protocols to Pushdown Automata. ICALP (2) 2013: 137-149 - George Christodoulou, Martin Gairing:
Price of Stability in Polynomial Congestion Games. ICALP (2) 2013: 496-507 - Roberto Di Cosmo, Jacopo Mauro, Stefano Zacchiroli, Gianluigi Zavattaro:
Component Reconfiguration in the Presence of Conflicts. ICALP (2) 2013: 187-198 - Wojciech Czerwinski, Wim Martens, Tomás Masopust:
Efficient Separability of Regular Languages by Subsequences and Suffixes. ICALP (2) 2013: 150-161 - Jurek Czyzowicz, Evangelos Kranakis, Eduardo Pacheco:
Localization for a System of Colliding Robots. ICALP (2) 2013: 508-519 - Stéphane Demri, Amit Kumar Dhar, Arnaud Sangnier:
On the Complexity of Verifying Regular Properties on Flat Counter Systems, . ICALP (2) 2013: 162-173 - Pierre-Malo Deniélou, Nobuko Yoshida:
Multiparty Compatibility in Communicating Automata: Characterisation and Synthesis of Global Session Types. ICALP (2) 2013: 174-186 - Dariusz Dereniowski, Yann Disser, Adrian Kosowski, Dominik Pajak, Przemyslaw Uznanski:
Fast Collaborative Graph Exploration. ICALP (2) 2013: 520-532 - Yoann Dieudonné, Andrzej Pelc:
Deterministic Polynomial Approach in the Plane. ICALP (2) 2013: 533-544 - Kousha Etessami, Alistair Stewart, Mihalis Yannakakis:
Stochastic Context-Free Grammars, Regular Languages, and Newton's Method. ICALP (2) 2013: 199-211 - Sebastian Faust, Carmit Hazay, Daniele Venturi:
Outsourced Pattern Matching. ICALP (2) 2013: 545-556 - John Fearnley, Marcin Jurdzinski:
Reachability in Two-Clock Timed Automata Is PSPACE-Complete. ICALP (2) 2013: 212-223 - Oliver Friedmann, Felix Klaedtke, Martin Lange:
Ramsey Goes Visibly Pushdown. ICALP (2) 2013: 224-237 - Yuxi Fu:
Checking Equality and Regularity for Normed BPA with Silent Moves. ICALP (2) 2013: 238-249 - Emanuele G. Fusco, Andrzej Pelc, Rossella Petreschi:
Learning a Ring Cheaply and Fast. ICALP (2) 2013: 557-568 - Robert Ganian, Petr Hlinený, Daniel Král', Jan Obdrzálek, Jarett Schwartz, Jakub Teska:
FO Model Checking of Interval Graphs. ICALP (2) 2013: 250-262
skipping 30 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-11-06 04:30 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