Остановите войну!
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 182 matches
- 2018
- Shuchi Chawla, Kira Goldner, J. Benjamin Miller, Emmanouil Pountourakis:
Revenue Maximization with an Uncertainty-Averse Buyer. SODA 2018: 2050-2068 - David Kempe, Leonard J. Schulman, Omer Tamuz:
Quasi-regular sequences and optimal schedules for security games. SODA 2018: 1625-1644 - Amir Abboud, Greg Bodwin:
Reachability Preservers: New Extremal Bounds and Approximation Algorithms. SODA 2018: 1865-1883 - Amir Abboud, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Near-Optimal Compression for the Planar Graph Metric. SODA 2018: 530-549 - Ittai Abraham, Shiri Chechik, Michael Elkin, Arnold Filtser, Ofer Neiman:
Ramsey Spanning Trees and their Applications. SODA 2018: 1650-1664 - Louigi Addario-Berry, Omer Angel, Guillaume Chapuy, Éric Fusy, Christina Goldschmidt:
Voronoi tessellations in the CRT and continuum random maps of finite excess. SODA 2018: 933-946 - Peyman Afshani, Anne Driemel:
On the complexity of range searching among curves. SODA 2018: 898-917 - Kunal Agrawal, Joseph Devietti, Jeremy T. Fineman, I-Ting Angelina Lee, Robert Utterback, Changming Xu:
Race Detection and Reachability in Nearly Series-Parallel DAGs. SODA 2018: 156-171 - Hugo A. Akitaya, Radoslav Fulek, Csaba D. Tóth:
Recognizing Weak Embeddings of Graphs. SODA 2018: 274-292 - Dan Alistarh, James Aspnes, Rati Gelashvili:
Space-Optimal Majority in Population Protocols. SODA 2018: 2221-2239 - Stephen Alstrup, Agelos Georgakopoulos, Eva Rotenberg, Carsten Thomassen:
A Hamiltonian Cycle in the Square of a 2-connected Graph in Linear Time. SODA 2018: 1645-1649 - Nima Anari, Shayan Oveis Gharan, Amin Saberi, Nikhil Srivastava:
Approximating the Largest Root and Applications to Interlacing Families. SODA 2018: 1015-1028 - Nima Anari, Tung Mai, Shayan Oveis Gharan, Vijay V. Vazirani:
Nash Social Welfare for Indivisible Items under Separable, Piecewise-Linear Concave Utilities. SODA 2018: 2274-2290 - Mudabir Kabir Asathulla, Sanjeev Khanna, Nathaniel Lahn, Sharath Raghvendra:
A Faster Algorithm for Minimum-Cost Bipartite Perfect Matching in Planar Graphs. SODA 2018: 457-476 - Andrei Asinowski, Gill Barequet, Yufei Zheng:
Polycubes with Small Perimeter Defect. SODA 2018: 93-100 - Sepehr Assadi, Sanjeev Khanna:
Tight Bounds on the Round Complexity of the Distributed Maximum Coverage Problem. SODA 2018: 2412-2431 - Yossi Azar, Ilan Reuven Cohen, Debmalya Panigrahi:
Randomized Algorithms for Online Vector Load Balancing. SODA 2018: 980-991 - Ashwinkumar Badanidiyuru, Kshipra Bhawalkar, Haifeng Xu:
Targeting and Signaling in Ad Auctions. SODA 2018: 2545-2563 - Jørgen Bang-Jensen, Manu Basavaraju, Kristine Vitting Klinkby, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi:
Parameterized Algorithms for Survivable Network Design with Uniform Demands. SODA 2018: 2838-2850 - Nikhil Bansal, Marek Eliás, Grigorios Koumoutsos, Jesper Nederlof:
Competitive Algorithms for Generalized k-Server in Uniform Metrics. SODA 2018: 992-1001 - Nikhil Bansal, Martin Böhm, Marek Eliás, Grigorios Koumoutsos, Seeun William Umboh:
Nested Convex Bodies are Chaseable. SODA 2018: 1253-1260 - Surender Baswana, Keerti Choudhary, Moazzam Hussain, Liam Roditty:
Approximate Single Source Fault Tolerant Shortest Path. SODA 2018: 1901-1915 - Surender Baswana, Ayush Goel, Shahbaz Khan:
Incremental DFS algorithms: a theoretical and experimental study. SODA 2018: 53-72 - Soheil Behnezhad, Avrim Blum, Mahsa Derakhshan, Mohammad Taghi Hajiaghayi, Mohammad Mahdian, Christos H. Papadimitriou, Ronald L. Rivest, Saeed Seddighin, Philip B. Stark:
From Battlefields to Elections: Winning Strategies of Blotto and Auditing Games. SODA 2018: 2291-2310 - Omri Ben-Eliezer, Clément L. Canonne:
Improved Bounds for Testing Forbidden Order Patterns. SODA 2018: 2093-2112 - Anna Ben-Hamou, Eyal Lubetzky, Yuval Peres:
Comparing mixing times on sparse random graphs. SODA 2018: 1734-1740 - Anna Ben-Hamou, Roberto I. Oliveira, Yuval Peres:
Estimating graph parameters via random walks with restarts. SODA 2018: 1702-1714 - Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Vivek Madan:
A tight -approximation for Linear 3-Cut. SODA 2018: 1393-1406 - Petra Berenbrink, George Giakkoupis, Peter Kling:
Tight Bounds for Coalescing-Branching Random Walks on Regular Graphs. SODA 2018: 1715-1733 - Aaron Bernstein, Shiri Chechik:
Incremental Topological Sort and Cycle Detection in Expected Total Time. SODA 2018: 21-34
skipping 152 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 10:32 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