Остановите войну!
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 136 matches
- 2010
- Zachary Abel, Nadia M. Benbernou, Mirela Damian, Erik D. Demaine, Martin L. Demaine, Robin Y. Flatland, Scott Duke Kominers, Robert T. Schweller:
Shape Replication through Self-Assembly and RNase Enzymes. SODA 2010: 1045-1064 - Ittai Abraham, Amos Fiat, Andrew V. Goldberg, Renato Fonseca F. Werneck:
Highway Dimension, Shortest Paths, and Provably Efficient Algorithms. SODA 2010: 782-793 - Michal Adamaszek, Artur Czumaj, Christian Sohler:
Testing Monotone Continuous Distributions on High-dimensional Real Cubes. SODA 2010: 56-65 - Pankaj K. Agarwal, R. Sharathkumar:
Streaming Algorithms for Extent Problems in High Dimensions. SODA 2010: 1481-1489 - Shipra Agrawal, Yichuan Ding, Amin Saberi, Yinyu Ye:
Correlation Robust Stochastic Optimization. SODA 2010: 1087-1096 - Noga Alon, Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo:
Solving MAX-r-SAT Above a Tight Lower Bound. SODA 2010: 511-517 - Alexandr Andoni, T. S. Jayram, Mihai Patrascu:
Lower Bounds for Edit Distance and Product Metrics via Poincaré-Type Inequalities. SODA 2010: 184-192 - Alexandr Andoni, Huy L. Nguyen:
Near-Optimal Sublinear Time Algorithms for Ulam Distance. SODA 2010: 76-86 - Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Vít Jelínek, Jan Kratochvíl, Maurizio Patrignani, Ignaz Rutter:
Testing Planarity of Partially Embedded Graphs. SODA 2010: 202-221 - Aaron Archer, Anna Blasiak:
Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls. SODA 2010: 429-447 - Arash Asadpour, Michel X. Goemans, Aleksander Madry, Shayan Oveis Gharan, Amin Saberi:
An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem. SODA 2010: 379-389 - Noa Avigdor-Elgrabli, Yuval Rabani:
An Improved Competitive Algorithm for Reordering Buffer Management. SODA 2010: 13-21 - Yossi Azar, Nikhil R. Devanur, Kamal Jain, Yuval Rabani:
Monotonicity in Bargaining Networks. SODA 2010: 817-826 - Khanh Do Ba, Piotr Indyk, Eric Price, David P. Woodruff:
Lower Bounds for Sparse Recovery. SODA 2010: 1190-1197 - Bahman Bahmani, Aranyak Mehta, Rajeev Motwani:
A 1.43-Competitive Online Graph Edge Coloring Algorithm in the Random Order Arrival Model. SODA 2010: 31-39 - Nikhil Bansal, Niv Buchbinder, Joseph Naor:
Towards the Randomized k-Server Conjecture: A Primal-Dual Approach. SODA 2010: 40-55 - Nikhil Bansal, Anupam Gupta, Ravishankar Krishnaswamy:
A Constant Factor Approximation Algorithm for Generalized Min-Sum Set Cover. SODA 2010: 1539-1545 - Siddharth Barman, Shuchi Chawla:
Region Growing for Multi-Route Cuts. SODA 2010: 404-418 - Sergey Bereg:
Orthogonal Ham-Sandwich Theorem in R3. SODA 2010: 1605-1612 - Petra Berenbrink, Colin Cooper, Robert Elsässer, Tomasz Radzik, Thomas Sauerwald:
Speeding Up Random Walks with Neighborhood Exploration. SODA 2010: 1422-1435 - Attila Bernáth, Roland Grappe, Zoltán Szigeti:
Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph. SODA 2010: 1512-1520 - Aaron Bernstein:
A Nearly Optimal Algorithm for Approximating Replacement Paths and k Shortest Simple Paths in General Graphs. SODA 2010: 742-755 - Sayan Bhattacharya, Vincent Conitzer, Kamesh Munagala, Lirong Xia:
Incentive Compatible Budget Elicitation in Multi-unit Auctions. SODA 2010: 554-572 - Arnab Bhattacharyya, Ning Xie:
Lower Bounds for Testing Triangle-freeness in Boolean Functions. SODA 2010: 87-98 - Philip Bille, Mikkel Thorup:
Regular Expression Matching with Multi-Strings and Intervals. SODA 2010: 1297-1308 - Vincenzo Bonifaci, Ho-Leung Chan, Alberto Marchetti-Spaccamela, Nicole Megow:
Algorithms and Complexity for Periodic Real-Time Scheduling. SODA 2010: 1350-1359 - Ciprian Borcea, Ileana Streinu:
How Far Can You Reach? SODA 2010: 928-937 - Charles Bordenave, Marc Lelarge:
The Rank of Diluted Random Graphs. SODA 2010: 1389-1402 - Milan Bradonjic, Robert Elsässer, Tobias Friedrich, Thomas Sauerwald, Alexandre Stauffer:
Efficient Broadcast on Random Geometric Graphs. SODA 2010: 1412-1421 - Tomás Brázdil, Václav Brozek, Kousha Etessami, Antonín Kucera, Dominik Wojtczak:
One-Counter Markov Decision Processes. SODA 2010: 863-874
skipping 106 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-29 08: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