Остановите войну!
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 139 matches
- 2008
- Ittai Abraham, Yair Bartal, Ofer Neiman:
Embedding metric spaces in their intrinsic dimension. SODA 2008: 363-372 - Marcel R. Ackermann, Johannes Blömer, Christian Sohler:
Clustering for metric and non-metric distance measures. SODA 2008: 799-808 - Isolde Adler, Martin Grohe, Stephan Kreutzer:
Computing excluded minors. SODA 2008: 641-650 - Nir Ailon, Edo Liberty:
Fast dimension reduction using Rademacher series on dual BCH codes. SODA 2008: 1-9 - Susanne Albers:
On the value of coordination in network design. SODA 2008: 294-303 - Noga Alon, Michael R. Capalbo:
Optimal universal graphs with deterministic embedding. SODA 2008: 373-378 - Noga Alon, Haim Kaplan, Gabriel Nivasch, Micha Sharir, Shakhar Smorodinsky:
Weak ε-nets and interval chains. SODA 2008: 1194-1203 - Amihood Amir, Igor Nor:
Real-time indexing over fixed finite alphabets. SODA 2008: 1086-1095 - Reid Andersen:
A local algorithm for finding dense subgraphs. SODA 2008: 1003-1009 - Reid Andersen, Kevin J. Lang:
An algorithm for improving graph partitions. SODA 2008: 651-660 - Alexandr Andoni, Piotr Indyk, Robert Krauthgamer:
Earth mover distance over high-dimensional spaces. SODA 2008: 343-352 - Barbara M. Anthony, Vineet Goyal, Anupam Gupta, Viswanath Nagarajan:
A plant location guide for the unsure. SODA 2008: 1164-1173 - Boris Aronov, Mark de Berg, Chris Gray, Elena Mumford:
Cutting cycles of rods in space: hardness and approximation. SODA 2008: 1241-1248 - James Aspnes, Muli Safra, Yitong Yin:
Ranged hash functions and the price of churn. SODA 2008: 1066-1075 - Baruch Awerbuch, Yossi Azar, Rohit Khandekar:
Fast load balancing via bounded best response. SODA 2008: 314-322 - Yossi Azar, Kamal Jain, Vahab S. Mirrokni:
(Almost) optimal coordination mechanisms for unrelated machine scheduling. SODA 2008: 323-332 - László Babai, Nikolay Nikolov, László Pyber:
Product growth and mixing in finite groups. SODA 2008: 248-257 - Surender Baswana, Soumojit Sarkar:
Fully dynamic algorithm for graph spanners with poly-logarithmic update time. SODA 2008: 1125-1134 - Ido Ben-Eliezer, Tali Kaufman, Michael Krivelevich, Dana Ron:
Comparing the strength of query types in property testing: the case of testing k-colorability. SODA 2008: 1213-1222 - Bonnie Berger, Rohit Singh, Jinbo Xu:
Graph algorithms for biological systems analysis. SODA 2008: 142-151 - Nicla Bernasconi, Konstantinos Panagiotou, Angelika Steger:
On properties of random dissections and triangulations. SODA 2008: 132-141 - Aaron Bernstein, David R. Karger:
Improved distance sensitivity oracles via random sampling. SODA 2008: 34-43 - Anand Bhalgat, Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi:
Fast edge splitting and Edmonds' arborescence construction for unweighted graphs. SODA 2008: 455-464 - Nayantara Bhatnagar, Sam Greenberg, Dana Randall:
Sampling stable marriages: why spouse-swapping won't work. SODA 2008: 1223-1232 - Sushil Bikhchandani, Sven de Vries, James Schummer, Rakesh V. Vohra:
Ascending auctions for integral (poly)matroids with concave nondecreasing separable values. SODA 2008: 864-873 - Guy E. Blelloch:
Space-efficient dynamic orthogonal point location, segment intersection, and range reporting. SODA 2008: 894-903 - Guy E. Blelloch, Rezaul Alam Chowdhury, Phillip B. Gibbons, Vijaya Ramachandran, Shimin Chen, Michael Kozuch:
Provably good multicore cache performance for divide-and-conquer algorithms. SODA 2008: 501-510 - Prosenjit Bose, Karim Douïeb, Stefan Langerman:
Dynamic optimality for skip lists and B-trees. SODA 2008: 1106-1114 - Mark Braverman, Elchanan Mossel:
Noisy sorting without resampling. SODA 2008: 268-276 - Andrei Z. Broder:
Computational advertising. SODA 2008: 992
skipping 109 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:29 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