![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
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 22 matches
- 1997
- Ishai Ben-Aroya, Ilan Newman, Assaf Schuster:
Randomized Single-Target Hot-Potato Routing. J. Algorithms 23(1): 101-120 (1997) - Yair Bartal, Adi Rosén:
The Distributed k-Server Problem - A Competitive Distributed Translator for k-Server Algorithms. J. Algorithms 23(2): 241-264 (1997) - Phillip G. Bradford, Rudolf Fleischer, Michiel H. M. Smid:
More Efficient Parallel Totally Monotone Matrix Searching. J. Algorithms 23(2): 386-400 (1997) - Gunnar Brinkmann, Andreas W. M. Dress:
A Constructive Enumeration of Fullerenes. J. Algorithms 23(2): 345-358 (1997) - Artur Czumaj, Leszek Gasieniec, Marek Piotrów
, Wojciech Rytter:
Sequential and Parallel Approximation of Shortest Superstrings. J. Algorithms 23(1): 74-100 (1997) - David Eppstein:
Minimum Range Balanced Cuts via Dynamic Subset Sums. J. Algorithms 23(2): 375-385 (1997) - Juan A. Garay, Inder S. Gopal, Shay Kutten, Yishay Mansour, Moti Yung:
Efficient On-Line Call Control Algorithms. J. Algorithms 23(1): 180-194 (1997) - Michael T. Goodrich, Roberto Tamassia:
Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations. J. Algorithms 23(1): 51-73 (1997) - Magnús M. Halldórsson
:
Parallel and On-Line Graph Coloring. J. Algorithms 23(2): 265-280 (1997) - Lisa Higham, David G. Kirkpatrick, Karl R. Abrahamson, Andrew Adler:
Optimal Algorithms for Probabilistic Solitude Detection on Anonymous Rings. J. Algorithms 23(2): 291-328 (1997) - Samir Khuller:
Problems. J. Algorithms 23(2): 401-403 (1997) - Evangelos Kranakis
, Danny Krizanc:
Distributed Computing on Anonymous Hypercube Networks. J. Algorithms 23(1): 32-50 (1997) - Martin Loebl
, Jaroslav Nesetril
:
Linearity and Unprovability of Set Union Problem Strategies. I. Linearity of Strong Postorder. J. Algorithms 23(2): 207-220 (1997) - Boris G. Pittel, Robert S. Weishaar:
On-Line Coloring of Sparse Random Graphs and Random Trees. J. Algorithms 23(1): 195-205 (1997) - C. Greg Plaxton, Torsten Suel:
Lower Bounds for Shellsort. J. Algorithms 23(2): 221-240 (1997) - Vijaya Ramachandran:
Parallel Algorithms for Reducible Flow Graphs. J. Algorithms 23(1): 1-31 (1997) - Akiyoshi Shioura, Takeaki Uno:
A Linear Time Algorithm for Finding a k-Tree Core. J. Algorithms 23(2): 281-290 (1997) - Mikkel Thorup:
Parallel Shortcutting of Rooted Trees. J. Algorithms 23(1): 139-159 (1997) - Ramakrishna Thurimella:
Sub-Linear Distributed Algorithms for Sparse Certificates and Biconnected Components. J. Algorithms 23(1): 160-179 (1997) - Biing-Feng Wang:
Tighter Bounds on the Solution of a Divide-and-Conquer Maximin Recurrence. J. Algorithms 23(2): 329-344 (1997) - Karsten Weihe:
Edge-Disjoint (s, t)-Paths in Undirected Planar Graphs in Linear Time. J. Algorithms 23(1): 121-138 (1997) - Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki:
An NC Parallel Algorithm for Edge-Coloring Series-Parallel Multigraphs. J. Algorithms 23(2): 359-374 (1997)
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-15 12:02 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