Остановите войну!
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 148 matches
- 2016
- George Christodoulou, Alkmini Sgouritsa:
Designing Networks with Good Equilibria under Uncertainty. SODA 2016: 72-89 - Amir Abboud, Greg Bodwin:
Error Amplification for Pairwise Spanner Lower Bounds. SODA 2016: 841-854 - Amir Abboud, Arturs Backurs, Thomas Dueholm Hansen, Virginia Vassilevska Williams, Or Zamir:
Subtree Isomorphism Revisited. SODA 2016: 1256-1271 - Amir Abboud, Virginia Vassilevska Williams, Joshua R. Wang:
Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs. SODA 2016: 377-391 - Ittai Abraham, Shiri Chechik, Daniel Delling, Andrew V. Goldberg, Renato F. Werneck:
On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs. SODA 2016: 740-753 - Dimitris Achlioptas, Seyed Hamed Hassani, Nicolas Macris, Rüdiger L. Urbanke:
Bounds for Random Constraint Satisfaction Problems via Spatial Coupling. SODA 2016: 469-479 - Dimitris Achlioptas, Fotis Iliopoulos:
Focused Stochastic Local Search and the Lovász Local Lemma. SODA 2016: 2024-2038 - Pankaj K. Agarwal, Kyle Fox, Oren Salzman:
An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles. SODA 2016: 1179-1192 - Kunal Agrawal, Jing Li, Kefu Lu, Benjamin Moseley:
Scheduling Parallel DAG Jobs Online to Minimize Average Flow Time. SODA 2016: 176-189 - Zeyuan Allen Zhu, Yin Tat Lee, Lorenzo Orecchia:
Using Optimization to Obtain a Width-Independent, Parallel, Simpler, and Faster Positive SDP Solver. SODA 2016: 1824-1831 - Noga Alon, Humberto Naves, Benny Sudakov:
On the maximum quartet distance between phylogenetic trees. SODA 2016: 2095-2106 - Stephen Alstrup, Cyril Gavoille, Esben Bistrup Halvorsen, Holger Petersen:
Simpler, faster and shorter labels for distances in graphs. SODA 2016: 338-350 - Andris Ambainis, Aleksandrs Belovs, Oded Regev, Ronald de Wolf:
Efficient Quantum Algorithms for (Gapped) Group Testing and Junta Testing. SODA 2016: 903-922 - Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Valentino Di Donato, Philipp Kindermann, Günter Rote, Ignaz Rutter:
Windrose Planarity: Embedding Graphs with Direction-Constrained Edges. SODA 2016: 985-996 - Chidambaram Annamalai:
Finding Perfect Matchings in Bipartite Hypergraphs. SODA 2016: 1814-1823 - Sunil Arya, David M. Mount:
A Fast and Simple Algorithm for Computing Approximate Euclidean Minimum Spanning Trees. SODA 2016: 1220-1233 - Sepehr Assadi, Sanjeev Khanna, Yang Li, Grigory Yaroslavtsev:
Maximum Matchings in Dynamic Graph Streams and the Simultaneous Communication Model. SODA 2016: 1345-1364 - John Augustine, William K. Moses Jr., Amanda Redlich, Eli Upfal:
Balanced Allocation: Patience is not a Virtue. SODA 2016: 655-671 - Yossi Azar, Ilan Reuven Cohen, Amos Fiat, Alan Roytman:
Packing Small Vectors. SODA 2016: 1511-1525 - Yossi Azar, Amir Epstein, Lukasz Jez, Adi Vardi:
Make-to-Order Integrated Scheduling and Distribution. SODA 2016: 140-154 - Arturs Backurs, Piotr Indyk, Ilya P. Razenshteyn, David P. Woodruff:
Nearly-optimal bounds for sparse recovery in generic norms, with applications to k-median sketching. SODA 2016: 318-337 - Ashwinkumar Badanidiyuru, Christos H. Papadimitriou, Aviad Rubinstein, Lior Seeman, Yaron Singer:
Locally Adaptive Optimization: Adaptive Seeding for Monotone Submodular Functions. SODA 2016: 414-429 - Nikhil Bansal, Marek Eliás, Arindam Khan:
Improved Approximation for Vector Bin Packing. SODA 2016: 1561-1579 - Yair Bartal, Arnold Filtser, Ofer Neiman:
On Notions of Distortion and an Almost Minimum Spanning Tree with Constant Average Distortion. SODA 2016: 873-882 - Surender Baswana, Shreejit Ray Chaudhury, Keerti Choudhary, Shahbaz Khan:
Dynamic DFS in Undirected Graphs: breaking the O(m) barrier. SODA 2016: 730-739 - Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Luca Trevisan:
Stabilizing Consensus with Many Opinions. SODA 2016: 620-635 - Anja Becker, Léo Ducas, Nicolas Gama, Thijs Laarhoven:
New directions in nearest neighbor searching with applications to lattice sieving. SODA 2016: 10-24 - Djamal Belazzougui, Simon J. Puglisi:
Range Predecessor and Lempel-Ziv Parsing. SODA 2016: 2053-2071 - Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Maxwell Young:
How to Scale Exponential Backoff: Constant Throughput, Polylog Access Attempts, and Robustness. SODA 2016: 636-654 - Ross Berkowitz, Swastik Kopparty:
Robust positioning patterns. SODA 2016: 1937-1951
skipping 118 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-07 01:55 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