Остановите войну!
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 63 matches
- 2010
- Klaus Ambos-Spies, Timur Bakibayev:
Weak Completeness Notions for Exponential Time. ICALP (1) 2010: 503-514 - Amihood Amir, Estrella Eisenberg, Avivit Levy, Ely Porat, Natalie Shapira:
Cycle Detection and Correction. ICALP (1) 2010: 43-54 - Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Piotr Sankowski:
Online Network Design with Outliers. ICALP (1) 2010: 114-126 - Benny Applebaum, Yuval Ishai, Eyal Kushilevitz:
From Secrecy to Soundness: Efficient Verification via Secure Computation. ICALP (1) 2010: 152-163 - Albert Atserias, Elitza N. Maneva:
Mean-Payoff Games and Propositional Proofs. ICALP (1) 2010: 102-113 - Nikhil Bansal, Niv Buchbinder, Joseph Naor:
Metrical Task Systems and the k-Server Problem on HSTs. ICALP (1) 2010: 287-298 - Nikhil Bansal, Subhash Khot:
Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems. ICALP (1) 2010: 250-261 - Nikhil Bansal, Ravishankar Krishnaswamy, Viswanath Nagarajan:
Better Scalable Algorithms for Broadcast Scheduling. ICALP (1) 2010: 324-335 - MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Nicole Immorlica, Hamid Mahini:
The Cooperative Game Theory Foundations of Network Bargaining Games. ICALP (1) 2010: 67-78 - Amos Beimel, Sebastian Ben Daniel, Eyal Kushilevitz, Enav Weinreb:
Choosing, Agreeing, and Eliminating in Communication Complexity. ICALP (1) 2010: 451-462 - Amitava Bhattacharya, Bhaskar DasGupta, Dhruv Mubayi, György Turán:
On Approximate Horn Formula Minimization. ICALP (1) 2010: 438-450 - Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto:
Covering and Packing in Linear Space. ICALP (1) 2010: 727-737 - Mikolaj Bojanczyk, Pawel Parys:
Efficient Evaluation of Nondeterministic Automata Using Factorization Forests. ICALP (1) 2010: 515-526 - Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic:
Plane Spanners of Maximum Degree Six. ICALP (1) 2010: 19-30 - Allan Borodin, Brendan Lucier:
On the Limitations of Greedy Mechanism Design for Truthful Combinatorial Auctions. ICALP (1) 2010: 90-101 - Jop Briët, Fernando Mário de Oliveira Filho, Frank Vallentin:
The Positive Semidefinite Grothendieck Problem with Rank Constraint. ICALP (1) 2010: 31-42 - Jin-yi Cai, Xi Chen, Pinyan Lu:
Graph Homomorphisms with Complex Values: A Dichotomy Theorem. ICALP (1) 2010: 275-286 - Mahdi Cheraghchi:
Improved Constructions for Non-adaptive Threshold Group Testing. ICALP (1) 2010: 552-564 - Richard Cole, Vijaya Ramachandran:
Resource Oblivious Sorting on Multicores. ICALP (1) 2010: 226-237 - Holger Dell, Thore Husfeldt, Martin Wahlen:
Exponential Time Complexity of the Permanent and the Tutte Polynomial. ICALP (1) 2010: 426-437 - Martin Dietzfelbinger, Andreas Goerdt, Michael Mitzenmacher, Andrea Montanari, Rasmus Pagh, Michael Rink:
Tight Thresholds for Cuckoo Hashing via XORSAT. ICALP (1) 2010: 213-225 - Ran Duan:
New Data Structures for Subgraph Connectivity. ICALP (1) 2010: 201-212 - Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier, Martin Skutella, José Verschae, Andreas Wiese:
Scheduling Periodic Tasks in a Hard Real-Time Environment. ICALP (1) 2010: 299-311 - Leah Epstein, Asaf Levin, Rob van Stee:
Max-min Online Allocations with a Reordering Buffer. ICALP (1) 2010: 336-347 - Jittat Fakcharoenphol, Bundit Laekhanukit, Danupon Nanongkai:
Faster Algorithms for Semi-matching Problems (Extended Abstract). ICALP (1) 2010: 176-187 - Nikolaos Fountoulakis, Konstantinos Panagiotou:
Orientability of Random Hypergraphs and the Power of Multiple Choices. ICALP (1) 2010: 348-359 - Iftah Gamzu, Danny Segev:
A Sublogarithmic Approximation for Highway and Tollbooth Pricing. ICALP (1) 2010: 582-593 - Loukas Georgiadis:
Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs. ICALP (1) 2010: 738-749 - Leslie Ann Goldberg, Mark Jerrum:
Approximating the Partition Function of the Ferromagnetic Potts Model. ICALP (1) 2010: 396-407 - Fabrizio Grandoni, Thomas Rothvoß:
Network Design via Core Detouring for Problems without a Core. ICALP (1) 2010: 490-502
skipping 33 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-11 23:06 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