Остановите войну!
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 38 matches
- 1992
- Noga Alon, Amotz Bar-Noy, Nathan Linial, David Peleg:
Single Round Simulation on Radio Networks. J. Algorithms 13(2): 188-210 (1992) - Amihood Amir, Gad M. Landau, Uzi Vishkin:
Efficient Pattern Matching with Scaling. J. Algorithms 13(1): 2-32 (1992) - Alberto Apostolico, Wojciech Szpankowski:
Self-Alignments in Words and Their Applications. J. Algorithms 13(3): 446-467 (1992) - Mikhail J. Atallah, S. Rao Kosaraju:
An Efficient Parallel Algorithm for the Row Minima of a Totally Monotone Matrix. J. Algorithms 13(3): 394-413 (1992) - Amir Averbuch, Nader H. Bshouty, Michael Kaminski:
A Classification of Algorithms for Multiplying Polynomials of Small Degree over Finite Fields. J. Algorithms 13(4): 577-588 (1992) - Peter Avery:
An Algorithmic Proof that Semiorders are Representable. J. Algorithms 13(1): 144-147 (1992) - Jørgen Bang-Jensen, Yannis Manoussakis, Carsten Thomassen:
A Polynomial Algorithm for Hamiltonian-Connectedness in Semicomplete Digraphs. J. Algorithms 13(1): 114-127 (1992) - Mark de Berg, Svante Carlsson, Mark H. Overmars:
A General Approach to Dominance in the Plane. J. Algorithms 13(2): 274-296 (1992) - Yitzhak Birk, Jeffrey B. Lotspiech:
On Finding Non-Intersecting Straightline Connections of Grid Points to the Boundary. J. Algorithms 13(4): 636-656 (1992) - Kenneth D. Blaha:
Minimum Bases for Permutation Groups: The Greedy Approximation. J. Algorithms 13(2): 297-306 (1992) - Paolo M. Camerini, Giulia Galbiati, Francesco Maffioli:
Random Pseudo-Polynomial Algorithms for Exact Matroid Problems. J. Algorithms 13(2): 258-273 (1992) - P. P. Chakrabarti, Sujoy Ghose:
A General Best First Search Algorithm in AND/OR Graphs. J. Algorithms 13(2): 177-187 (1992) - Siu-Wing Cheng, Ravi Janardan:
Algorithms for Ray-Shooting and Intersection Searching. J. Algorithms 13(4): 670-692 (1992) - Jeff Chu:
Optimal Algorithm for the Nearest Common Dominator Problem. J. Algorithms 13(4): 693-697 (1992) - Robert Cypher, Jorge L. C. Sanz:
Cubesort: A Parallel Algorithm for Sorting N Data Items with S-Sorters. J. Algorithms 13(2): 211-234 (1992) - David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery R. Westbrook, Moti Yung:
Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph. J. Algorithms 13(1): 33-54 (1992) - Sandra Fillebrown:
Faster Computation of Bernoulli Numbers. J. Algorithms 13(3): 431-445 (1992) - Anath Fischer, Itzhak Gilboa, Moshe Shpitalni:
A Polynomial Algorithm for Minimal Interval Representation. J. Algorithms 13(4): 546-563 (1992) - Leslie Ann Goldberg:
Efficient Algorithms for Listing Unlabeled Graphs. J. Algorithms 13(1): 128-143 (1992) - Daniel S. Hirschberg, Lawrence L. Larmore:
The Traveler's Problem. J. Algorithms 13(1): 148-160 (1992) - Frank K. Hwang, J. F. Weng:
The Shortest Network under a Given Topology. J. Algorithms 13(3): 468-488 (1992) - David S. Johnson:
The NP-Completeness Column: An Ongoing Guide. J. Algorithms 13(3): 502-524 (1992) - Toshinobu Kashiwabara, Sumio Masuda, Kazuo Nakajima, Toshio Fujisawa:
Generation of Maximum Independent Sets of a Bipartite Graph and Maximum Cliques of a Circular-Arc Graph. J. Algorithms 13(1): 161-174 (1992) - Maria M. Klawe:
Superlinear Bounds for Matrix Searching Problems. J. Algorithms 13(1): 55-78 (1992) - Hugo Krawczyk:
How to Predict Congruential Generators. J. Algorithms 13(4): 527-545 (1992) - Keqin Li, Kam-Hoi Cheng:
Heuristic Algorithms for On-Line Packing in Three Dimensions. J. Algorithms 13(4): 589-605 (1992) - Michael Lindenbaum, Alfred M. Bruckstein:
Parallel Strategies for Geometric Probing. J. Algorithms 13(2): 320-349 (1992) - Grazia Lotti:
Fast Solution of Linear Systems with Polynomial Coefficients over the Ring of Integers. J. Algorithms 13(4): 564-576 (1992) - Jirí Matousek, Emo Welzl:
Good Splitters for Counting Points in Triangles. J. Algorithms 13(2): 307-319 (1992) - J. Ian Munro, Venkatesh Raman:
Sorting with Minimum Data Movement. J. Algorithms 13(3): 374-393 (1992)
skipping 8 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-05-30 03:29 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