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 167 matches
- 2018
- Alejandro Aguirre, Gilles Barthe, Justin Hsu, Alexandra Silva:
Almost Sure Productivity. ICALP 2018: 113:1-113:15 - Shantanu Das, Dariusz Dereniowski, Przemyslaw Uznanski:
Brief Announcement: Energy Constrained Depth First Search. ICALP 2018: 165:1-165:5 - George Christodoulou, Martin Gairing, Yiannis Giannakopoulos, Paul G. Spirakis:
The Price of Stability of Weighted Congestion Games. ICALP 2018: 150:1-150:16 - Heng Guo, Mark Jerrum:
A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability. ICALP 2018: 68:1-68:12 - Heng Guo, Mark Jerrum:
Perfect Simulation of the Hard Disks Model by Partial Rejection Sampling. ICALP 2018: 69:1-69:10 - Jing Chen, Bo Li, Yingkai Li, Pinyan Lu:
Brief Announcement: Bayesian Auctions with Efficient Queries. ICALP 2018: 108:1-108:4 - Daniel Graf, Karim Labib, Przemyslaw Uznanski:
Brief Announcement: Hamming Distance Completeness and Sparse Matrix Multiplication. ICALP 2018: 109:1-109:4 - Zhiyi Huang, Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang:
Online Vertex-Weighted Bipartite Matching: Beating 1-1/e with Random Arrivals. ICALP 2018: 79:1-79:14 - Andreas Schmid, Jens M. Schmidt:
Computing Tutte Paths. ICALP 2018: 98:1-98:14 - Anders Aamand, Niklas Hjuler, Jacob Holm, Eva Rotenberg:
One-Way Trail Orientations. ICALP 2018: 6:1-6:13 - Anders Aamand, Mathias Bæk Tejs Knudsen, Mikkel Thorup:
Power of d Choices with Simple Tabulation. ICALP 2018: 5:1-5:14 - Amir Abboud, Karl Bringmann:
Tighter Connections Between Formula-SAT and Shaving Logs. ICALP 2018: 8:1-8:18 - Anna Adamaszek, Matthias Mnich, Katarzyna Paluch:
New Approximation Algorithms for (1, 2)-TSP. ICALP 2018: 9:1-9:14 - Navneet Agarwal, Sanat Anand, Manoj Prabhakaran:
Brief Announcement: On Secure m-Party Computation, Commuting Permutation Systems and Unassisted Non-Interactive MPC. ICALP 2018: 103:1-103:4 - Pankaj K. Agarwal, Haim Kaplan, Micha Sharir:
Union of Hypercubes and 3D Minkowski Sums with Random Sizes. ICALP 2018: 10:1-10:15 - Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev:
Temporal Vertex Cover with a Sliding Time Window. ICALP 2018: 148:1-148:14 - Shaull Almagor, Dmitry Chistikov, Joël Ouaknine, James Worrell:
O-Minimal Invariants for Linear Loops. ICALP 2018: 114:1-114:14 - Antoine Amarilli, Charles Paperman:
Topological Sorting with Regular Constraints. ICALP 2018: 115:1-115:14 - Saeed Akhoondian Amiri, Szymon Dudycz, Stefan Schmid, Sebastian Wiederrecht:
Congestion-Free Rerouting of Flows on DAGs. ICALP 2018: 143:1-143:13 - Megumi Ando, Anna Lysyanskaya, Eli Upfal:
Practical and Provably Secure Onion Routing. ICALP 2018: 144:1-144:14 - Moab Arar, Shiri Chechik, Sarel Cohen, Cliff Stein, David Wajc:
Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms. ICALP 2018: 7:1-7:16 - Boris Aronov, Gali Bar-On, Matthew J. Katz:
Resolving SINR Queries in a Dynamic Setting. ICALP 2018: 145:1-145:13 - Albert Atserias, Stephan Kreutzer, Marc Noy:
On Zero-One and Convergence Laws for Graphs Embeddable on a Fixed Surface. ICALP 2018: 116:1-116:14 - Amy Babay, Michael Dinitz, Zeyu Zhang:
Brief Announcement: Characterizing Demand Graphs for (Fixed-Parameter) Shallow-Light Steiner Network. ICALP 2018: 104:1-104:4 - Miriam Backens:
A Complete Dichotomy for Complex-Valued Holantc. ICALP 2018: 12:1-12:14 - Achiya Bar-On, Itai Dinur, Orr Dunkelman, Rani Hod, Nathan Keller, Eyal Ronen, Adi Shamir:
Tight Bounds on Online Checkpointing Algorithms. ICALP 2018: 13:1-13:13 - Gill Barequet, David Eppstein, Michael T. Goodrich, Nil Mamano:
Stable-Matching Voronoi Diagrams: Combinatorial Complexity and Algorithms. ICALP 2018: 89:1-89:14 - MohammadHossein Bateni, Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Vahab S. Mirrokni:
Brief Announcement: MapReduce Algorithms for Massive Trees. ICALP 2018: 162:1-162:4 - Ran Ben-Basat, Gil Einziger, Roy Friedman:
Brief Announcement: Give Me Some Slack: Efficient Network Measurements. ICALP 2018: 163:1-163:5 - Eli Ben-Sasson, Iddo Bentov, Yinon Horesh, Michael Riabzev:
Fast Reed-Solomon Interactive Oracle Proofs of Proximity. ICALP 2018: 14:1-14:17
skipping 137 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-10-21 01:47 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