Остановите войну!
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 22 matches
- 1995
- Yossi Azar, Joseph Naor, Raphael Rom:
The Competitiveness of On-Line Assignments. J. Algorithms 18(2): 221-237 (1995) - Yosi Ben-Asher, Assaf Schuster:
The Complexity of Data Reduction on a Reconfigurable Linear Array. J. Algorithms 18(2): 322-357 (1995) - Mark de Berg, Marc J. van Kreveld, Jack Snoeyink:
Two- and Three-Dimensional Point Location in Rectangular Subdivisions. J. Algorithms 18(2): 256-277 (1995) - Bonnie Berger, Lenore Cowen:
Scheduling with Concurrency-Based Constraints. J. Algorithms 18(1): 98-123 (1995) - Hans L. Bodlaender, John R. Gilbert, Hjálmtyr Hafsteinsson, Ton Kloks:
Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree. J. Algorithms 18(2): 238-255 (1995) - Dany Breslauer:
Dictionary-Matching on Unbounded Alphabets: Uniform Length Dictionaries. J. Algorithms 18(2): 278-296 (1995) - Adam L. Buchsbaum, Robert Endre Tarjan:
Confluently Persistent Deques via Data-Structural Bootstrapping. J. Algorithms 18(3): 513-547 (1995) - Yuval Caspi, Eliezer Dekel:
Edge Coloring Series Parallel Graphs. J. Algorithms 18(2): 296-321 (1995) - Barun Chandra, Sundar Vishwanathan:
Constructing Reliable Communication Networks of Small Weight Online. J. Algorithms 18(1): 159-175 (1995) - Ka Wong Chong, Tak Wah Lam:
Finding Connected Components in O(log n log log n) Time on the EREW PRAM. J. Algorithms 18(3): 378-402 (1995) - Richard Cole, Ofer Zajicek:
An Asynchronous Parallel Algorithm for Undirected Graph Connectivity. J. Algorithms 18(1): 50-97 (1995) - Michael L. Fredman, David S. Johnson, Lyle A. McGeoch, G. Ostheimer:
Data Structures for Traveling Salesmen. J. Algorithms 18(3): 432-479 (1995) - Martin Fürer, Balaji Raghavachari:
An Efficient Parallel Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs. J. Algorithms 18(2): 203-220 (1995) - Harold N. Gabow:
Centroids, Representations, and Submodular Flows. J. Algorithms 18(3): 586-628 (1995) - Arvind Gupta, Naomi Nishimura:
The Parallel Complexity of Tree Embedding Problems. J. Algorithms 18(1): 176-200 (1995) - Torben Hagerup:
Fast Deterministic Processor Allocation. J. Algorithms 18(3): 629-649 (1995) - John Hershberger, Subhash Suri:
A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk. J. Algorithms 18(3): 403-431 (1995) - Pierre Kelsen, Vijaya Ramachandran:
On Finding Minimal Two-Connected Subgraphs. J. Algorithms 18(1): 1-49 (1995) - Ten-Hwang Lai, Shu-Shang Wei:
Algorithms for Page Retrieval and Hamiltonian Paths on Forward-Convex Line Graphs. J. Algorithms 18(2): 358-375 (1995) - H. Ramesh:
On Traversing Layered Graphs On-Line. J. Algorithms 18(3): 480-512 (1995) - Jim Ruppert:
A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation. J. Algorithms 18(3): 548-585 (1995) - Ulrich Schmid, Johann Blieberger:
On Nonpreemptive LCFS Scheduling with Deadlines. J. Algorithms 18(1): 124-158 (1995)
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-08-14 20:04 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