Остановите войну!
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 57 matches
- 2015
- Samson Abramsky, Radha Jagadeesan, Matthijs Vákár:
Games for Dependent Types. ICALP (2) 2015: 31-43 - Dimitris Achlioptas, Paris Siminelakis:
Symmetric Graph Properties Have Independent Edges. ICALP (2) 2015: 467-478 - James Aisenberg, Maria Luisa Bonet, Sam Buss, Adrian Craciun, Gabriel Istrate:
Short Proofs of the Kneser-Lovász Coloring Principle. ICALP (2) 2015: 44-55 - Dan Alistarh, Rati Gelashvili:
Polylogarithmic-Time Leader Election in Population Protocols. ICALP (2) 2015: 479-491 - Antoine Amarilli, Pierre Bourhis, Pierre Senellart:
Provenance Circuits for Trees and Treelike Instances. ICALP (2) 2015: 56-68 - Benjamin Aminof, Sasha Rubin, Florian Zuleger, Francesco Spegni:
Liveness of Parameterized Timed Networks. ICALP (2) 2015: 375-387 - Chen Avin, Zvi Lotker, Yinon Nahum, David Peleg:
Core Size and Densification in Preferential Attachment Networks. ICALP (2) 2015: 492-503 - Nikola Benes, Peter Bezdek, Kim Guldstrand Larsen, Jirí Srba:
Language Emptiness of Continuous-Time Parametric Timed Automata. ICALP (2) 2015: 69-81 - Sayan Bhattacharya, Martin Hoefer, Chien-Chung Huang, Telikepalli Kavitha, Lisa Wagner:
Maintaining Near-Popular Matchings. ICALP (2) 2015: 504-515 - Mikolaj Bojanczyk, Filip Murlak, Adam Witkowski:
Containment of Monadic Datalog Programs via Bounded Clique-Width. ICALP (2) 2015: 427-439 - Michele Boreale:
Analysis of Probabilistic Systems via Generating Functions and Padé Approximation. ICALP (2) 2015: 82-94 - Ahmed Bouajjani, Michael Emmi, Constantin Enea, Jad Hamza:
On Reducing Linearizability to State Reachability. ICALP (2) 2015: 95-107 - Karl Bringmann, Tobias Friedrich, Martin Hoefer, Ralf Rothenberger, Thomas Sauerwald:
Ultra-Fast Load Balancing on Scale-Free Networks. ICALP (2) 2015: 516-527 - Bernadette Charron-Bost, Matthias Függer, Thomas Nowak:
Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms. ICALP (2) 2015: 528-539 - Krishnendu Chatterjee, Laurent Doyen, Moshe Y. Vardi:
The Complexity of Synthesis from Probabilistic Components. ICALP (2) 2015: 108-120 - Krishnendu Chatterjee, Thomas A. Henzinger, Rasmus Ibsen-Jensen, Jan Otop:
Edit Distance for Pushdown Automata. ICALP (2) 2015: 121-133 - Arkadev Chattopadhyay, Atri Rudra:
The Range of Topological Effects on Communication. ICALP (2) 2015: 540-551 - Ning Chen, Martin Hoefer, Marvin Künnemann, Chengyu Lin, Peihan Miao:
Secretary Markets with Local Information. ICALP (2) 2015: 552-563 - Laura Ciobanu, Volker Diekert, Murray Elder:
Solution Sets for Equations over Free Groups are EDT0L Languages. ICALP (2) 2015: 134-145 - Thomas Colcombet, A. V. Sreejith:
Limited Set quantifiers over Countable Linear Orderings. ICALP (2) 2015: 146-158 - Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Noy Rotbart:
A Simple and Optimal Ancestry Labeling Scheme for Trees. ICALP (2) 2015: 564-574 - Varsha Dani, Mahnush Movahedi, Jared Saia, Maxwell Young:
Interactive Communication with Unknown Noise Rate. ICALP (2) 2015: 575-587 - Samir Datta, Raghav Kulkarni, Anish Mukherjee, Thomas Schwentick, Thomas Zeume:
Reachability is in DynFO. ICALP (2) 2015: 159-170 - Jérémy Dubut, Eric Goubault, Jean Goubault-Larrecq:
Natural Homology. ICALP (2) 2015: 171-183 - Kousha Etessami, Alistair Stewart, Mihalis Yannakakis:
Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes. ICALP (2) 2015: 184-196 - Michal Feldman, Ophir Friedler:
A Unified Framework for Strong Price of Anarchy in Clustering Games. ICALP (2) 2015: 601-613 - Andreas Emil Feldmann:
Fixed Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs. ICALP (2) 2015: 588-600 - Nathanaël Fijalkow, Florian Horn, Denis Kuperberg, Michal Skrzypczak:
Trading Bounds for Memory in Games with Counters. ICALP (2) 2015: 197-208 - Emmanuel Filiot, Sebastian Maneth, Pierre-Alain Reynier, Jean-Marc Talbot:
Decision Problems of Tree Transducers with Origin. ICALP (2) 2015: 209-221 - Olivier Finkel:
Incompleteness Theorems, Large Cardinals, and Automata over Infinite Words. ICALP (2) 2015: 222-233
skipping 27 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-25 19:36 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