Остановите войну!
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 137 matches
- 2014
- Anna Adamaszek, Andreas Wiese:
A QPTAS for Maximum Weight Independent Set of Polygons with Polylogarithmically Many Vertices. SODA 2014: 645-656 - Peyman Afshani:
Fast Computation of Output-Sensitive Maxima in a Word RAM. SODA 2014: 1414-1423 - Peyman Afshani, Cheng Sheng, Yufei Tao, Bryan T. Wilkinson:
Concurrent Range Reporting in Two-Dimensional Space. SODA 2014: 983-994 - Peyman Afshani, Konstantinos Tsakalidis:
Optimal Deterministic Shallow Cuttings for 3D Dominance Ranges. SODA 2014: 1389-1398 - Kook Jin Ahn, Sudipto Guha:
Near Linear Time Approximation Schemes for Uncapacitated and Capacitated b-Matching Problems in Nonbipartite Graphs. SODA 2014: 239-258 - Dan Alistarh, James Aspnes, Michael A. Bender, Rati Gelashvili, Seth Gilbert:
Dynamic Task Allocation in Asynchronous Shared Memory. SODA 2014: 416-435 - Noga Alon, Mohsen Ghaffari, Bernhard Haeupler, Majid Khabbazian:
Broadcast Throughput in Radio Networks: Routing vs. Network Coding. SODA 2014: 1831-1843 - Noga Alon, Sagi Snir, Raphael Yuster:
On the compatibility of quartet trees. SODA 2014: 535-545 - Greg Aloupis, John Iacono, Stefan Langerman, Özgür Özkan, Stefanie Wuhrer:
The Complexity of Order Type Isomorphism. SODA 2014: 405-415 - Stephen Alstrup, Esben Bistrup Halvorsen, Kasper Green Larsen:
Near-optimal labeling schemes for nearest common ancestors. SODA 2014: 972-982 - Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Andreas Wiese:
A Mazing 2+∊ Approximation for Unsplittable Flow on a Path. SODA 2014: 26-41 - Alexandr Andoni, Anupam Gupta, Robert Krauthgamer:
Towards (1 + ∊)-Approximate Flow Sparsifiers. SODA 2014: 279-293 - Alexandr Andoni, Piotr Indyk, Huy L. Nguyen, Ilya P. Razenshteyn:
Beyond Locality-Sensitive Hashing. SODA 2014: 1018-1028 - Alexandr Andoni, Rina Panigrahy, Gregory Valiant, Li Zhang:
Learning Sparse Polynomial Functions. SODA 2014: 500-510 - Antonios Antoniadis, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein:
Hallucination Helps: Energy Efficient Virtual Circuit Routing. SODA 2014: 1141-1153 - Pablo Daniel Azar, Robert Kleinberg, S. Matthew Weinberg:
Prophet Inequalities with Limited Information. SODA 2014: 1358-1377 - Ashwinkumar Badanidiyuru, Jan Vondrák:
Fast algorithms for maximizing submodular functions. SODA 2014: 1497-1514 - Bubacarr Bah, Luca Baldassarre, Volkan Cevher:
Model-based Sketching and Recovery with Expanders. SODA 2014: 1529-1543 - Nikhil Bansal, Moses Charikar, Ravishankar Krishnaswamy, Shi Li:
Better Algorithms and Hardness for Broadcast Scheduling via a Discrepancy Approach. SODA 2014: 55-71 - Nikhil Bansal, Arindam Khan:
Improved Approximation Algorithm for Two-Dimensional Bin Packing. SODA 2014: 13-25 - Raef Bassily, Adam D. Smith:
Causal Erasure Channels. SODA 2014: 1844-1857 - Michael A. Bender, Roozbeh Ebrahimi, Jeremy T. Fineman, Golnaz Ghasemiesfeh, Rob Johnson, Samuel McCauley:
Cache-Adaptive Algorithms. SODA 2014: 958-971 - Attila Bernáth, Yusuke Kobayashi:
The Generalized Terminal Backup Problem. SODA 2014: 1678-1686 - Prateek Bhakta, Sarah Miracle, Dana Randall:
Clustering and Mixing Times for Segregation Models on ℤ2. SODA 2014: 327-340 - Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Lukasz Jez, Dorian Nogneng, Jirí Sgall:
Better Approximation Bounds for the Joint Replenishment Problem. SODA 2014: 42-54 - Daniel Bienstock, Alexander Michalka:
Polynomial Solvability of Variants of the Trust-Region Subproblem. SODA 2014: 380-390 - Andreas Björklund, Petteri Kaski, Lukasz Kowalik:
Counting Thin Subgraphs via Packings Faster Than Meet-in-the-Middle Time. SODA 2014: 594-603 - Christian Borgs, Michael Brautbar, Jennifer T. Chayes, Brendan Lucier:
Maximizing Social Influence in Nearly Optimal Time. SODA 2014: 946-957 - Niv Buchbinder, Shahar Chen, Joseph Naor:
Competitive Analysis via Regularization. SODA 2014: 436-444 - Niv Buchbinder, Moran Feldman, Joseph Naor, Roy Schwartz:
Submodular Maximization with Cardinality Constraints. SODA 2014: 1433-1452
skipping 107 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-23 15:04 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