Остановите войну!
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 30 matches
- 1990
- Gur Saran Adhar, Shietung Peng:
Parallel Algorithms for Cographs and Parity Graphs with Applications. J. Algorithms 11(2): 252-284 (1990) - James Aspnes, Maurice Herlihy:
Fast Randomized Consensus Using Shared Memory. J. Algorithms 11(3): 441-461 (1990) - Baruch Awerbuch:
On the Effects of Feedback in Dynamic Network Protocols. J. Algorithms 11(3): 342-373 (1990) - Baruch Awerbuch, Amotz Bar-Noy, Nathan Linial, David Peleg:
Improved Routing Strategies with Succinct Tables. J. Algorithms 11(3): 307-341 (1990) - Francine Berman, David S. Johnson, Frank Thomson Leighton, Peter W. Shor, Larry Snyder:
Generalized Planar Matching. J. Algorithms 11(2): 153-184 (1990) - Ofer Biran, Shlomo Moran, Shmuel Zaks:
A Combinatorial Characterization of the Distributed 1-Solvable Tasks. J. Algorithms 11(3): 420-440 (1990) - Hans L. Bodlaender:
Polynomial Algorithms for Graph Isomorphism and Chromatic Index on Partial k-Trees. J. Algorithms 11(4): 631-643 (1990) - Marek Chrobak, Takao Nishizeki:
Improved Edge-Coloring Algorithms for Planar Graphs. J. Algorithms 11(1): 102-116 (1990) - David Eppstein:
Sequence Comparison with Mixed Convex and Concave Costs. J. Algorithms 11(1): 85-101 (1990) - Hazel Everett, Derek G. Corneil:
Recognizing Visibility Graphs of Spiral Polygons. J. Algorithms 11(1): 1-26 (1990) - Johan Håstad:
Tensor Rank is NP-Complete. J. Algorithms 11(4): 644-654 (1990) - Yuejiang Huang:
A New Algorithm for the Generation of Binary de Bruijn Sequences. J. Algorithms 11(1): 44-51 (1990) - Ming-Deh A. Huang, Shang-Hua Teng:
Security, Verifiability, and Universality in Distributed Computing. J. Algorithms 11(3): 492-521 (1990) - David S. Johnson:
The NP-Completeness Column: An Ongoing Guide. J. Algorithms 11(1): 144-151 (1990) - David B. Johnson, Willy Zwaenepoel:
Recovery in Distributed Systems Using Optimistic Message Logging and Checkpointing. J. Algorithms 11(3): 462-491 (1990) - William M. Kantor:
Finding Sylow Normalizers in Polynomial Time. J. Algorithms 11(4): 523-563 (1990) - Vidyadhar G. Kulkarni:
Generating Random Combinatorial Objects. J. Algorithms 11(2): 185-207 (1990) - Liwu Li, T. Anthony Marsland:
Probability-Based Game Tree Pruning. J. Algorithms 11(1): 27-43 (1990) - Mark S. Manasse, Lyle A. McGeoch, Daniel Dominic Sleator:
Competitive Algorithms for Server Problems. J. Algorithms 11(2): 208-230 (1990) - Yishay Mansour, Leonard J. Schulman:
Sorting on a Ring of Processors. J. Algorithms 11(4): 622-630 (1990) - Brendan D. McKay, Nicholas C. Wormald:
Uniform Generation of Random Regular Graphs of Moderate Degree. J. Algorithms 11(1): 52-67 (1990) - H. R. Morton, H. B. Short:
Calculating the 2-Variable Polynomial for Knots Presented as Closed Braids. J. Algorithms 11(1): 117-131 (1990) - David M. Mount, Ruth Silverman:
Packing and Covering the Plane with Translates of a Convex Polygon. J. Algorithms 11(4): 564-580 (1990) - Joseph Naor, Mark B. Novick:
An Efficient Reconstruction of a Graph from its Line Graph in Parallel. J. Algorithms 11(1): 132-143 (1990) - Gil Neiger, Sam Toueg:
Automatically Increasing the Fault-Tolerance of Distributed Algorithms. J. Algorithms 11(3): 374-419 (1990) - Eytan Ronn:
NP-Complete Stable Matching Problems. J. Algorithms 11(2): 285-304 (1990) - Frank Ruskey, Andrzej Proskurowski:
Generating Binary Trees by Transpositions. J. Algorithms 11(1): 68-84 (1990) - Edward F. Schmeichel, S. Louis Hakimi, M. Otsuka, Geoff Sullivan:
A Parallel Fault Identification Algorithm. J. Algorithms 11(2): 231-241 (1990) - Dennis E. Shasha, Kaizhong Zhang:
Fast Algorithms for the Unit Cost Editing Distance Between Trees. J. Algorithms 11(4): 581-621 (1990) - Mark Allen Weiss, Robert Sedgewick:
Tight Lower Bounds for Shellsort. J. Algorithms 11(2): 242-251 (1990)
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-27 17:47 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