Остановите войну!
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 82 matches
- 2007
- Ben Adida, Douglas Wikström:
Offline/Online Mixing. ICALP 2007: 484-495 - Noga Alon, Amin Coja-Oghlan, Hiêp Hàn, Mihyun Kang, Vojtech Rödl, Mathias Schacht:
Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions. ICALP 2007: 789-800 - Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh:
Parameterized Algorithms for Directed Maximum Leaf Problems. ICALP 2007: 352-362 - Noga Alon, Shai Gutner:
Balanced Families of Perfect Hash Functions and Their Applications. ICALP 2007: 435-446 - Marcelo Arenas, Pablo Barceló, Leonid Libkin:
Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization. ICALP 2007: 888-900 - Albert Atserias, Andrei A. Bulatov, Víctor Dalmau:
On the Power of k -Consistency. ICALP 2007: 279-290 - Albert Atserias, Andrei A. Bulatov, Anuj Dawar:
Affine Systems of Equations and Counting Infinitary Logic. ICALP 2007: 558-570 - Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs:
Competitive Algorithms for Due Date Scheduling. ICALP 2007: 28-39 - Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky, Shakhar Smorodinsky:
Online Conflict-Free Colorings for Hypergraphs. ICALP 2007: 219-230 - Paul Beame, Matei David, Toniann Pitassi, Philipp Woelfel:
Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity. ICALP 2007: 134-145 - Mihir Bellare, Chanathip Namprempre, Gregory Neven:
Unrestricted Aggregate Signatures. ICALP 2007: 411-422 - Mihir Bellare, Thomas Ristenpart:
Hash Functions in the Dedicated-Key Setting: Design Choices and MPP Transforms. ICALP 2007: 399-410 - André Berger, Michelangelo Grigni:
Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs. ICALP 2007: 90-101 - Laurent Bienvenu, Wolfgang Merkle:
Reconciling Data Compression and Kolmogorov Complexity. ICALP 2007: 643-654 - Henrik Björklund, Mikolaj Bojanczyk:
Bounded Depth Data Trees. ICALP 2007: 862-874 - Markus Bläser, Holger Dell:
Complexity of the Cover Polynomial. ICALP 2007: 801-812 - Johannes Blömer, Stefanie Naewe:
Sampling Methods for Shortest Vectors, Closest Vectors and Successive Minima. ICALP 2007: 65-77 - Manuel Bodirsky, Hubie Chen, Jan Kára, Timo von Oertzen:
Maximal Infinite-Valued Constraint Languages. ICALP 2007: 546-557 - Bernard Boigelot, Julien Brusten:
A Generalization of Cobham's Theorem to Automata over Real Numbers. ICALP 2007: 813-824 - Dragan Bosnacki, Edith Elkind, Blaise Genest, Doron A. Peled:
On Commutativity Based Edge Lean Search. ICALP 2007: 158-170 - Laura Bozzelli, Salvatore La Torre:
Decision Problems for Lower/Upper Bound Parametric Timed Automata. ICALP 2007: 925-936 - Thomas Brihaye, Thomas A. Henzinger, Vinayak S. Prabhu, Jean-François Raskin:
Minimum-Time Reachability in Timed Games. ICALP 2007: 825-837 - Peter Bürgisser, Felipe Cucker:
Exotic Quantifiers, Complexity Classes, and Complete Problems. ICALP 2007: 207-218 - Jin-yi Cai, Pinyan Lu:
Holographic Algorithms: The Power of Dimensionality Resolved. ICALP 2007: 631-642 - Ioannis Caragiannis, Michele Flammini, Luca Moscardelli:
An Exponential Improvement on the MST Heuristic for Minimum Energy Broadcasting in Ad Hoc Wireless Networks. ICALP 2007: 447-458 - Matthew Cary, Atri Rudra, Ashish Sabharwal:
Paper Retraction: On the Hardness of Embeddings Between Two Finite Metrics. ICALP 2007: 949 - Nishanth Chandran, Jens Groth, Amit Sahai:
Ring Signatures of Sub-linear Size Without Random Oracles. ICALP 2007: 423-434 - Bernard Chazelle:
Ushering in a New Era of Algorithm Design. ICALP 2007: 1 - George Christodoulou, Elias Koutsoupias, Annamária Kovács:
Mechanism Design for Fractional Scheduling on Unrelated Machines. ICALP 2007: 40-52 - Matthew Chu, Sampath Kannan, Andrew McGregor:
Checking and Spot-Checking the Correctness of Priority Queues. ICALP 2007: 728-739
skipping 52 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-05-14 05:08 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