Остановите войну!
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 19 matches
- 1997
- Yehuda Afek, Gideon Stupp:
Optimal Time-Space Tradeoff for Shared Memory Leader Election. J. Algorithms 25(1): 95-117 (1997) - Noga Alon, Dmitry N. Kozlov:
Coins with Arbitrary Weights. J. Algorithms 25(1): 162-176 (1997) - Yossi Azar, Leah Epstein:
On Two Dimensional Packing. J. Algorithms 25(2): 290-310 (1997) - Michel Barbeau, Froduald Kabanza, Richard St-Denis:
An Efficient Algorithm for Controller Synthesis under Full Observation. J. Algorithms 25(1): 144-161 (1997) - József Békési, Gábor Galambos, Ulrich Pferschy, Gerhard J. Woeginger:
Greedy Algorithms for On-Line Data Compression. J. Algorithms 25(2): 274-289 (1997) - Bonnie Berger, Peter W. Shor:
Tight Bounds for the Maximum Acyclic Subgraph Problem. J. Algorithms 25(1): 1-18 (1997) - Binay K. Bhattacharya, Damon Kaller:
An O(m + n log n) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs. J. Algorithms 25(2): 336-358 (1997) - Binay K. Bhattacharya, Sandeep Sen:
On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm. J. Algorithms 25(1): 177-193 (1997) - Martin Dietzfelbinger, Torben Hagerup, Jyrki Katajainen, Martti Penttonen:
A Reliable Randomized Algorithm for the Closest-Pair Problem. J. Algorithms 25(1): 19-51 (1997) - Michel Habib, Lhouari Nourine, George Steiner:
Gray Codes for the Ideals of Interval Orders. J. Algorithms 25(1): 52-66 (1997) - D. E. G. Hare:
Computing the Principal Branch of log-Gamma. J. Algorithms 25(2): 221-236 (1997) - Mohammad Hossain Heydari, Ivan Hal Sudborough:
On the Diameter of the Pancake Network. J. Algorithms 25(1): 67-94 (1997) - Philip N. Klein, Sairam Subramanian:
A Randomized Parallel Algorithm for Single-Source Shortest Paths. J. Algorithms 25(2): 205-220 (1997) - James F. Korsh, Seymour Lipschutz:
Generating Multiset Permutations in Constant Time. J. Algorithms 25(2): 321-335 (1997) - Michael Krivelevich:
Approximate Set Covering in Uniform Hypergraphs. J. Algorithms 25(1): 118-143 (1997) - Tomasz Luczak, Edyta Szymanska:
A Parallel Randomized Algorithm for Finding a Maximal Independent Set in a Linear Hypergraph. J. Algorithms 25(2): 311-320 (1997) - Peter Slavík:
A Tight Analysis of the Greedy Algorithm for Set Cover. J. Algorithms 25(2): 237-254 (1997) - Lusheng Wang, Dan Gusfield:
Improved Approximation Algorithms for Tree Alignment. J. Algorithms 25(2): 255-273 (1997) - Andrew Chi-Chih Yao, Frances F. Yao:
Dictionary Look-Up with One Error. J. Algorithms 25(1): 194-202 (1997)
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-06-10 01:23 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