Остановите войну!
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 59 matches
- 2012
- Luca Aceto, Arnaud Carayol, Zoltán Ésik, Anna Ingólfsdóttir:
Algebraic Synchronization Trees and Processes. ICALP (2) 2012: 30-41 - Rajeev Alur, Loris D'Antoni:
Streaming Tree Transducers. ICALP (2) 2012: 42-53 - Pablo Arrighi, Gilles Dowek:
Causal Graph Dynamics. ICALP (2) 2012: 54-66 - Albert Atserias, Anuj Dawar:
Degree Lower Bounds of Tower-Type for Approximating Formulas with Parity Quantifiers. ICALP (2) 2012: 67-78 - Riccardo Colini-Baldeschi, Monika Henzinger, Stefano Leonardi, Martin Starnberger:
On Multiple Keyword Sponsored Search Auctions with Budgets. ICALP (2) 2012: 1-12 - Reuven Bar-Yehuda, Erez Kantor, Shay Kutten, Dror Rawitz:
Growing Half-Balls: Minimizing Storage and Communication Costs in CDNs. ICALP (2) 2012: 416-427 - Leonid Barenboim:
On the Locality of Some NP-Complete Problems. ICALP (2) 2012: 403-415 - Michael Benedikt, Pierre Bourhis, Pierre Senellart:
Monadic Datalog Containment. ICALP (2) 2012: 79-91 - Andrew Berns, James Hegeman, Sriram V. Pemmaraju:
Super-Fast Distributed Algorithms for Metric Facility Location. ICALP (2) 2012: 428-439 - Kshipra Bhawalkar, Jon M. Kleinberg, Kevin Lewi, Tim Roughgarden, Aneesh Sharma:
Preventing Unraveling in Social Networks: The Anchored k-Core Problem. ICALP (2) 2012: 440-451 - Mikolaj Bojanczyk, Slawomir Lasota:
A Machine-Independent Characterization of Timed Languages. ICALP (2) 2012: 92-103 - Mikolaj Bojanczyk, Thomas Place:
Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets. ICALP (2) 2012: 104-115 - Mikolaj Bojanczyk, Thomas Place:
Toward Model Theory with Data Values. ICALP (2) 2012: 116-127 - Patricia Bouyer, Nicolas Markey, Ocan Sankur:
Robust Reachability in Timed Automata: A Game-Based Approach. ICALP (2) 2012: 128-140 - Tomás Brázdil, Antonín Kucera, Petr Novotný, Dominik Wojtczak:
Minimizing Expected Termination Time in One-Counter Markov Decision Processes. ICALP (2) 2012: 141-152 - Christopher H. Broadbent:
Prefix Rewriting for Nested-Words and Collapsible Pushdown Automata. ICALP (2) 2012: 153-164 - Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Olivier Serre:
A Saturation Method for Collapsible Pushdown Systems. ICALP (2) 2012: 165-176 - Nishanth Chandran, Juan A. Garay, Rafail Ostrovsky:
Edge Fault Tolerance on Sparse Networks. ICALP (2) 2012: 452-463 - Ning Chen, Xiaotie Deng, Hongyang Zhang, Jie Zhang:
Incentive Ratios of Fisher Markets. ICALP (2) 2012: 464-475 - Marco Chiesa, Giuseppe Di Battista, Thomas Erlebach, Maurizio Patrignani:
Computational Complexity of Traffic Hijacking under BGP and S-BGP. ICALP (2) 2012: 476-487 - Anuj Dawar, Bjarki Holm:
Pebble Games with Algebraic Rules. ICALP (2) 2012: 251-262 - Ilias Diakonikolas, Christos H. Papadimitriou, George Pierrakos, Yaron Singer:
Efficiency-Revenue Trade-Offs in Auctions. ICALP (2) 2012: 488-499 - Volker Diekert, Manfred Kufleitner, Klaus Reinhardt, Tobias Walter:
Regular Languages Are Church-Rosser Congruential. ICALP (2) 2012: 177-188 - Yoann Dieudonné, Andrzej Pelc:
Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports. ICALP (2) 2012: 500-512 - Gilles Dowek:
A Theory Independent Curry-De Bruijn-Howard Correspondence. ICALP (2) 2012: 13-15 - Khaled M. Elbassioni:
A QPTAS for ε-Envy-Free Profit-Maximizing Pricing on Line Graphs. ICALP (2) 2012: 513-524 - John Fearnley, Sven Schewe:
Time and Parallelizability Results for Parity Games with Bounded Treewidth. ICALP (2) 2012: 189-200 - Maribel Fernández, Albert Rubio:
Nominal Completion for Rewrite Systems with Binders. ICALP (2) 2012: 201-213 - Marcelo P. Fiore:
Discrete Generalised Polynomial Functors - (Extended Abstract). ICALP (2) 2012: 214-226 - Fedor V. Fomin, Petr A. Golovach, Jesper Nederlof, Michal Pilipczuk:
Minimizing Rosenthal Potential in Multicast Games. ICALP (2) 2012: 525-536
skipping 29 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 14:44 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