Остановите войну!
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 168 matches
- 1999
- Ran Adler, Yossi Azar:
Beating the Logarithmic Lower Bound: Randomized Preemptive Disjoint Paths and Call Control Algorithms. SODA 1999: 1-10 - Pankaj K. Agarwal, Lars Arge, Gerth Stølting Brodal, Jeffrey Scott Vitter:
I/O-Efficient Dynamic Point Location in Monotone Planar Subdivisions. SODA 1999: 11-20 - Pankaj K. Agarwal, Micha Sharir:
Motion Planning of a Ball Amid Segments in Three Dimensions. SODA 1999: 21-30 - Richa Agarwala, Leslie G. Biesecker, Alejandro A. Schäffer:
Inverse Inbreeding Coefficient Problems with an Application to Linkage Analysis of Recessive Diseases in Inbred Populations. SODA 1999: 840-841 - Susanne Albers, Sanjeev Arora, Sanjeev Khanna:
Page Replacement for General Caching Problems. SODA 1999: 31-40 - Susanne Albers, Klaus Kursawe, Sven Schuierer:
Exploring Unknown Environments with Obstacles. SODA 1999: 842-843 - Andris Ambainis, Stephen A. Bloch, David L. Schweizer:
Playing Twenty Questions with a Procrastinator. SODA 1999: 844-845 - Gunnar Andersson, Lars Engebretsen, Johan Håstad:
A New Way to Use Semidefinite Programming with Applications to Linear Equations mod p. SODA 1999: 41-50 - Javed A. Aslam, Katya Pelekhov, Daniela Rus:
A Practical Clustering Algorithm for Static and Dynamic Information Organization. SODA 1999: 51-60 - Javed A. Aslam, April Rasala, Clifford Stein, Neal E. Young:
Improved Bicriteria Existence Theorems for Scheduling. SODA 1999: 846-847 - Giuseppe Ateniese, Gene Tsudik:
Group Signatures Á la carte. SODA 1999: 848-849 - Yonatan Aumann, Avivit Kapah-Levy:
Cooperative Sharing and Asynchronous Consensus Using Single-Reader Single-Writer Registers. SODA 1999: 61-70 - Ulrike Axen:
Computing Morse Functions on Triangulated Manifolds. SODA 1999: 850-851 - Ivan D. Baev, Waleed Meleis, Alexandre E. Eichenberger:
Algorithms for Total Weighted Completion Time Scheduling. SODA 1999: 852-853 - Brenda S. Baker:
Parameterized diff. SODA 1999: 854-855 - Reuven Bar-Yehuda:
Using Homogenous Weights for Approximating the Partial Cover Problem. SODA 1999: 71-75 - Gill Barequet:
A Lower Bound for Hellbronn's Triangle Problem in d Dimensions. SODA 1999: 76-81 - Gill Barequet, Sariel Har-Peled:
Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions. SODA 1999: 82-91 - Gill Barequet, Sariel Har-Peled:
Polygon-containment and Translational min-Hausdorff-Distance between segment Sets are 3SUM-hard. SODA 1999: 862-863 - Yair Bartal, Martin Farach-Colton, Shibu Yooseph, Lisa Zhang:
Fast, Fair, and Frugal Bandwidth Allocation in ATM Networks. SODA 1999: 92-101 - Julien Basch, Jeff Erickson, Leonidas J. Guibas, John Hershberger, Li Zhang:
Kinetic Collision Detection Between Two Simple Polygons. SODA 1999: 102-111 - Richard Beigel:
Finding Maximum Independent Sets in Sparse and General Graphs. SODA 1999: 856-857 - Petra Berenbrink, Christian Scheideler:
Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths. SODA 1999: 112-121 - Tanya Y. Berger-Wolf, Edward M. Reingold:
Optimal Multichannel Communication Under Failure. SODA 1999: 858-859 - Anne Berry:
A Wide-Range Efficient Algorithm for Minimal Triangulation. SODA 1999: 860-861 - Sergei Bespamyatnikh, Jack Snoeyink:
Queries with Segments in Voronoi Diagrams. SODA 1999: 122-129 - Randeep Bhatia, Samir Khuller, Robert Pless, Yoram J. Sussmann:
The Full Degree Spanning Tree Problem. SODA 1999: 864-865 - Therese C. Biedl, Prosenjit Bose, Erik D. Demaine, Anna Lubiw:
Efficient Algorithms for Petersen's Matching Theorem. SODA 1999: 130-139 - Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark H. Overmars, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides:
Locked and Unlocked Polygonal Chains in 3D. SODA 1999: 866-867 - Matt Blaze, Joan Feigenbaum, Moni Naor:
A Formal Treatment of Remotely Keyed Encryption. SODA 1999: 868-869
skipping 138 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 22:03 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