Остановите войну!
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 90 matches
- 2015
- Andreas Göbel, Leslie Ann Goldberg, David Richerby:
Counting Homomorphisms to Square-Free Graphs, Modulo 2. ICALP (1) 2015: 642-653 - Shweta Agrawal, Yuval Ishai, Dakshita Khurana, Anat Paskin-Cherniavsky:
Statistical Randomized Encodings: A Complexity Theoretic View. ICALP (1) 2015: 1-13 - Nir Ailon:
Tighter Fourier Transform Lower Bounds. ICALP (1) 2015: 14-25 - Susanne Albers, Dario Frascaria:
Quantifying Competitiveness in Paging with Locality of Reference. ICALP (1) 2015: 26-38 - Georgios Amanatidis, Evangelos Markakis, Afshin Nikzad, Amin Saberi:
Approximation Algorithms for Computing Maximin Share Allocations. ICALP (1) 2015: 39-51 - Elliot Anshelevich, Koushik Kar, Shreyas Sekar:
Envy-Free Pricing in Large Markets: Approximating Revenue and Welfare. ICALP (1) 2015: 52-64 - Boris Aronov, Matthew J. Katz:
Batched Point Location in SINR Diagrams via Algebraic Tools. ICALP (1) 2015: 65-77 - Noa Avigdor-Elgrabli, Sungjin Im, Benjamin Moseley, Yuval Rabani:
On the Randomized Competitive Ratio of Reordering Buffer Management with Non-Uniform Costs. ICALP (1) 2015: 78-90 - Yossi Azar, Ilan Reuven Cohen:
Serving in the Dark should be done Non-Uniformly. ICALP (1) 2015: 91-102 - Paul Beame, Vincent Liew, Mihai Patrascu:
Finding the Median (Obliviously) with Bounded Space. ICALP (1) 2015: 103-115 - Babak Behsaz, Zachary Friggstad, Mohammad R. Salavatipour, Rohit Sivakumar:
Approximation Algorithms for Min-Sum k-Clustering and Balanced k-Median. ICALP (1) 2015: 116-128 - Xiaohui Bei, Ning Chen, Shengyu Zhang:
Solving Linear Programming with Constraints Unknown. ICALP (1) 2015: 129-142 - Salman Beigi, Omid Etesami, Amin Gohari:
Deterministic Randomness Extraction from Generalized and Distributed Santha-Vazirani Sources. ICALP (1) 2015: 143-154 - Christoph Berkholz, Martin Grohe:
Limitations of Algebraic Approaches to Graph Isomorphism Testing. ICALP (1) 2015: 155-166 - Aaron Bernstein, Cliff Stein:
Fully Dynamic Matching in Bipartite Graphs. ICALP (1) 2015: 167-179 - Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla:
Feasible Interpolation for QBF Resolution Calculi. ICALP (1) 2015: 180-192 - Amey Bhangale, Swastik Kopparty, Sushant Sachdeva:
Simultaneous Approximation of Constraint Satisfaction Problems. ICALP (1) 2015: 193-205 - Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano:
Design of Dynamic Algorithms via Primal-Dual Method. ICALP (1) 2015: 206-218 - Laurent Bienvenu, Damien Desfontaines, Alexander Shen:
What Percentage of Programs Halt? ICALP (1) 2015: 219-230 - Andreas Björklund, Holger Dell, Thore Husfeldt:
The Parity of Set Systems Under Random Restrictions with Applications to Exponential Time Problems. ICALP (1) 2015: 231-242 - Andreas Björklund, Vikram Kamat, Lukasz Kowalik, Meirav Zehavi:
Spotting Trees with Few Leaves. ICALP (1) 2015: 243-255 - Manuel Bodirsky, Barnaby Martin, Antoine Mottet:
Constraint Satisfaction Problems over the Integers with Successor. ICALP (1) 2015: 256-267 - Mark Bun, Justin Thaler:
Hardness Amplification and the Approximate Degree of Constant-Depth Circuits. ICALP (1) 2015: 268-280 - Benjamin A. Burton, Clément Maria, Jonathan Spreer:
Algorithms and Complexity for Turaev-Viro Invariants. ICALP (1) 2015: 281-293 - Clément L. Canonne:
Big Data on the Rise? - Testing Monotonicity of Distributions. ICALP (1) 2015: 294-305 - Yixin Cao:
Unit Interval Editing is Fixed-Parameter Tractable. ICALP (1) 2015: 306-317 - Chandra Chekuri, Shalmoli Gupta, Kent Quanrud:
Streaming Algorithms for Submodular Function Maximization. ICALP (1) 2015: 318-330 - Aloni Cohen, Justin Holmgren:
Multilinear Pseudorandom Functions. ICALP (1) 2015: 331-342 - Gil Cohen, Igor Shinkar:
Zero-Fixing Extractors for Sub-Logarithmic Entropy. ICALP (1) 2015: 343-354 - Matthew Coudron, Thomas Vidick:
Interactive Proofs with Approximately Commuting Provers. ICALP (1) 2015: 355-366
skipping 60 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-23 20:18 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