Остановите войну!
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 41 matches
- 1985
- Valery B. Alekseyev:
On the Complexity of Some Algorithms of Matrix Multiplication. J. Algorithms 6(1): 71-85 (1985) - Richard P. Anstee:
An Algorithmic Proof of Tutte's f-Factor Theorem. J. Algorithms 6(1): 112-131 (1985) - A. Bagchi, Pradip K. Srimani:
Weighted Heuristic Search in Networks. J. Algorithms 6(4): 550-576 (1985) - Brenda S. Baker:
A New Proof for the First-Fit Decreasing Bin-Packing Algorithm. J. Algorithms 6(1): 49-70 (1985) - Edward A. Bender, Herbert S. Wilf:
A Theoretical Analysis of Backtracking in the Graph Coloring Problem. J. Algorithms 6(2): 275-282 (1985) - Béla Bollobás, István Simon:
Repeated Random Insertion into a Priority Queue. J. Algorithms 6(4): 466-477 (1985) - Peter B. Borwein:
On the Complexity of Calculating Factorials. J. Algorithms 6(3): 376-380 (1985) - Luc Devroye:
The Expected Length of the Longest Probe Sequence for Bucket Searching when the Distribution is Not Uniform. J. Algorithms 6(1): 1-9 (1985) - David P. Dobkin, David G. Kirkpatrick:
A Linear Algorithm for Determining the Separation of Convex Polyhedra. J. Algorithms 6(3): 381-392 (1985) - David P. Dobkin, J. Ian Munro:
Efficient Uses of the Past. J. Algorithms 6(4): 455-465 (1985) - Bernard Domanski, M. Anshel:
The Complexity of Dehn's Algorithm for Word Problems in Groups. J. Algorithms 6(4): 543-549 (1985) - Herbert Edelsbrunner:
Computing the Extreme Distances Between Two Convex Polygons. J. Algorithms 6(2): 213-224 (1985) - Herbert Edelsbrunner, Mark H. Overmars:
Batched Dynamic Solutions to Decomposable Searching Problems. J. Algorithms 6(4): 515-542 (1985) - M. C. Er:
The Complexity of the Generalised Cyclic Towers of Hanoi Problem. J. Algorithms 6(3): 351-358 (1985) - Martin Farber, J. Mark Keil:
Domination in Permutation Graphs. J. Algorithms 6(3): 309-321 (1985) - Fanica Gavril, Johanan Schönheim:
Constructing Trees with Prescribed Cardinalities for the Components of Their Vertex Deleted Subgraphs. J. Algorithms 6(2): 239-252 (1985) - Leonidas J. Guibas:
Problems. J. Algorithms 6(2): 283-290 (1985) - Refael Hassin, Nimrod Megiddo:
An Optimal Algorithm for Finding all the Jumps of a Monotone Step-Function. J. Algorithms 6(2): 265-274 (1985) - Robert W. Irving:
An Efficient Algorithm for the "Stable Roommates" Problem. J. Algorithms 6(4): 577-595 (1985) - Alon Itai, Michael Rodeh:
Scheduling Transmissions in a Network. J. Algorithms 6(3): 409-429 (1985) - David S. Johnson:
The NP-Completeness Column: An Ongoing Guide. J. Algorithms 6(1): 145-159 (1985) - David S. Johnson:
The NP-Completeness Column: An Ongoing Guide. J. Algorithms 6(2): 291-305 (1985) - David S. Johnson:
The NP-Completeness Column: An Ongoing Guide. J. Algorithms 6(3): 434-451 (1985) - William M. Kantor:
Polynomial-Time Algorithms for Finding Elements of Prime Order and Sylow Subgroups. J. Algorithms 6(4): 478-514 (1985) - Victor Klee, Michael C. Laskowski:
Finding the Smallest Triangles Containing a Given Convex Polygon. J. Algorithms 6(3): 359-375 (1985) - Donald E. Knuth:
Dynamic Huffman Coding. J. Algorithms 6(2): 163-180 (1985) - Donald E. Knuth:
An Analysis of Optimum Caching. J. Algorithms 6(2): 181-199 (1985) - Nathan Linial, Michael E. Saks:
Searching Ordered Structures. J. Algorithms 6(1): 86-103 (1985) - Nimrod Megiddo:
Partitioning with Two Lines in the Plane. J. Algorithms 6(3): 430-433 (1985) - Zevi Miller, James B. Orlin:
NP-Completeness for Minimizing Maximum Edge Length in Grid Embeddings. J. Algorithms 6(1): 10-16 (1985)
skipping 11 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-08-16 13:15 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