Остановите войну!
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 50 matches
- 2014
- Oliver Göbel, Martin Hoefer, Thomas Kesselheim, Thomas Schleiden, Berthold Vöcking:
Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods. ICALP (2) 2014: 508-519 - David Adjiashvili, Noy Rotbart:
Labeling Schemes for Bounded Degree Graphs. ICALP (2) 2014: 375-386 - Rom Aschner, Matthew J. Katz:
Bounded-Angle Spanning Tree: Modeling Networks with Angular Constraints. ICALP (2) 2014: 387-398 - Chen Avin, Michael Borokhovich, Zvi Lotker, David Peleg:
Distributed Computing on Core-Periphery Networks: Axiom-Based Design. ICALP (2) 2014: 399-410 - Jason P. Bell, Janusz A. Brzozowski, Nelma Moreira, Rogério Reis:
Symmetric Groups and Quotient Complexity of Boolean Operations. ICALP (2) 2014: 1-12 - Michael Blondin, Alain Finkel, Pierre McKenzie:
Handling Infinitely Branching WSTS. ICALP (2) 2014: 13-25 - Mikolaj Bojanczyk:
Transducers with Origin Information. ICALP (2) 2014: 26-37 - Mikolaj Bojanczyk:
Weak MSO+U with Path Quantifiers over Infinite Trees. ICALP (2) 2014: 38-49 - Mikolaj Bojanczyk, Tomasz Gogacz, Henryk Michalewski, Michal Skrzypczak:
On the Decidability of MSO+U on Infinite Trees. ICALP (2) 2014: 50-61 - Marcello M. Bonsangue, Jurriaan Rot, Davide Ancona, Frank S. de Boer, Jan J. M. M. Rutten:
A Coalgebraic Foundation for Coinductive Union Types. ICALP (2) 2014: 62-73 - Alex Borello, Julien Cervelle, Pascal Vanier:
Turing Degrees of Limit Sets of Cellular Automata. ICALP (2) 2014: 74-85 - Daniel Bundala, Joël Ouaknine:
On the Complexity of Temporal-Logic Path Checking. ICALP (2) 2014: 86-97 - Andrea Cerone, Alexey Gotsman, Hongseok Yang:
Parameterised Linearisability. ICALP (2) 2014: 98-109 - Jérémie Chalopin, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc:
Fault-Tolerant Rendezvous in Networks. ICALP (2) 2014: 411-422 - Jérémie Chalopin, Riko Jacob, Matús Mihalák, Peter Widmayer:
Data Delivery by Energy-Constrained Mobile Agents on a Line. ICALP (2) 2014: 423-434 - Krishnendu Chatterjee, Laurent Doyen:
Games with a Weak Adversary. ICALP (2) 2014: 110-121 - Krishnendu Chatterjee, Rasmus Ibsen-Jensen:
The Complexity of Ergodic Mean-payoff Games. ICALP (2) 2014: 122-133 - Namit Chaturvedi:
Toward a Structure Theory of Regular Infinitary Trace Languages. ICALP (2) 2014: 134-145 - Dmitry Chistikov, Rupak Majumdar:
Unary Pushdown Automata and Straight-Line Programs. ICALP (2) 2014: 146-157 - Colin Cooper, Robert Elsässer, Tomasz Radzik:
The Power of Two Choices in Distributed Voting. ICALP (2) 2014: 435-446 - Johannes Dams, Martin Hoefer, Thomas Kesselheim:
Jamming-Resistant Learning in Wireless Networks. ICALP (2) 2014: 447-458 - Egor Derevenetc, Roland Meyer:
Robustness against Power is PSpace-complete. ICALP (2) 2014: 158-170 - Manfred Droste, Vitaly Perevoshchikov:
A Nivat Theorem for Weighted Timed Automata and Weighted Relative Distance Logic. ICALP (2) 2014: 171-182 - David Eisenstat, Claire Mathieu, Nicolas Schabanel:
Facility Location in Evolving Metrics. ICALP (2) 2014: 459-470 - Yuval Emek, Tobias Langner, Jara Uitto, Roger Wattenhofer:
Solving the ANTS Problem with Asynchronous Finite State Machines. ICALP (2) 2014: 471-482 - Yuval Emek, Jochen Seidel, Roger Wattenhofer:
Computability in Anonymous Networks: Revocable vs. Irrecovable Outputs. ICALP (2) 2014: 183-195 - Mohsen Ghaffari:
Near-Optimal Distributed Approximation of Minimum-Weight Connected Dominating Set. ICALP (2) 2014: 483-494 - George Giakkoupis, Thomas Sauerwald, Alexandre Stauffer:
Randomized Rumor Spreading in Dynamic Graphs. ICALP (2) 2014: 495-507 - Tomasz Gogacz, Jerzy Marcinkowski:
All-Instances Termination of Chase is Undecidable. ICALP (2) 2014: 293-304 - Sergey Goncharov, Dirk Pattinson:
Coalgebraic Weak Bisimulation from Recursive Equations over Monads. ICALP (2) 2014: 196-207
skipping 20 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-19 22: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