Остановите войну!
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 71 matches
- 1995
- William Aiello, Sivaramakrishnan Rajagopalan, Ramarathnam Venkatesan:
Design of Practical and Provably Good Random Number Generators (Extended Abstract). SODA 1995: 1-9 - Miklós Ajtai, James Aspnes, Moni Naor, Yuval Rabani, Leonard J. Schulman, Orli Waarts:
Fairness in Scheduling. SODA 1995: 477-485 - Susanne Albers:
Improved Randomized On-Line Algorithms for the List Update Problem. SODA 1995: 412-419 - David Alberts, Monika Rauch Henzinger:
Average Case Analysis of Dynamic Graph Algorithms. SODA 1995: 312-321 - Arne Andersson, Ola Petersson:
On-line Approximate List Indexing with Applications. SODA 1995: 20-27 - Yonatan Aumann, Yuval Rabani:
Improved Bounds for All Optical Routing. SODA 1995: 567-576 - Vineet Bafna, Pavel A. Pevzner:
Sorting Permutations by Transpositions. SODA 1995: 614-623 - Brenda S. Baker:
Parameterized Pattern Matching by Boyer-Moore-Type Algorithms. SODA 1995: 541-550 - Amotz Bar-Noy, Alain J. Mayer, Baruch Schieber, Madhu Sudan:
Guaranteeing Fair Service to Persistent Dependent Tasks. SODA 1995: 243-252 - Bonnie Berger, David Bruce Wilson:
Improved Algorithms for Protein Motif Recognition. SODA 1995: 58-67 - Marshall W. Bern, L. Paul Chew, David Eppstein, Jim Ruppert:
Dihedral Bounds for Mesh Generation in High Dimensions. SODA 1995: 189-196 - Jonathan W. Berry, Mark K. Goldberg:
Path Optimization and Near-Greedy Analysis for Graph Partitioning: An Empirical Study. SODA 1995: 223-232 - Dimitris Bertsimas, Chung-Piaw Teo:
From Valid Inequalities to Heuristics: A Unified View of Primal-Dual Approximation Algorithms in Covering Problems. SODA 1995: 102-111 - Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Mariette Yvinec:
Circular Separability of Polygon. SODA 1995: 273-281 - Ernest F. Brickell, Peter Gemmell, David W. Kravitz:
Trustee-based Tracing Extensions to Anonymous Cash and the Making of Anonymous Change. SODA 1995: 457-466 - William R. Burley, Sandy Irani:
On Algorithm Design for Metrical Task Systems. SODA 1995: 420-429 - Paul B. Callahan, S. Rao Kosaraju:
Algorithms for Dynamic Closest Pair and n-Body Potential Fields. SODA 1995: 263-272 - Timothy M. Chan, Jack Snoeyink, Chee-Keng Yap:
Output-Sensitive Construction of Polytopes in Four Dimensions and Clipped Voronoi Diagrams in Three. SODA 1995: 282-291 - Vijay Chandru, Abhi Dattasharma, S. Sathiya Keerthi, N. K. Sancheti, V. Vinay:
Algorithms for the Optimal Loading of Recursive Neural Nets. SODA 1995: 342-349 - Danny Z. Chen:
On the All-Pairs Euclidean Short Path Problem. SODA 1995: 292-301 - L. Paul Chew, Klara Kedem, Micha Sharir, Boaz Tagansky, Emo Welzl:
Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions. SODA 1995: 197-204 - Yi-Jen Chiang, Michael T. Goodrich, Edward F. Grove, Roberto Tamassia, Darren Erik Vengroff, Jeffrey Scott Vitter:
External-Memory Graph Algorithms. SODA 1995: 139-149 - Andrew Chou, Jeremy R. Cooperstock, Ran El-Yaniv, Michael Klugerman, Frank Thomson Leighton:
The Statistical Adversary Allows Optimal Money-Making Trading Strategies. SODA 1995: 467-476 - Robert J. Cimikowski:
An Analysis of Some Heuristics for the Maximum Planar Subgraph Problem. SODA 1995: 322-331 - Olivier Coudert:
Doing Two-Level Logic Minimization 100 Times Faster. SODA 1995: 112-121 - Karen L. Daniels, Victor Milenkovic:
Multiple Translational Containment: Approximate and Exact Algorithms. SODA 1995: 205-214 - Gautam Das, Giri Narasimhan, Jeffrey S. Salowe:
A New Way to Weigh Malnourished Euclidean Graphs. SODA 1995: 215-222 - Yefim Dinitz, Alek Vainshtein:
Locally Orientable Graphs, Cell Structures, and a New Algorithm for the Incremental Maintenance of Connectivity Carcasses. SODA 1995: 302-311 - Dorit Dor, Uri Zwick:
Selecting the Median. SODA 1995: 28-37 - Gregory Dudek, Kathleen Romanik, Sue Whitesides:
Localizing a Robot with Minimum Travel. SODA 1995: 437-446
skipping 41 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-28 10:08 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