Остановите войну!
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 23 matches
- 1989
- Lyudmil Aleksandrov, Hristo N. Djidjev:
Improved Bounds on the Size of Separators of Toroidal Graphs. Optimal Algorithms 1989: 126-138 - Arne Andersson:
Optimal Bounds on the Dictionary Problem. Optimal Algorithms 1989: 106-114 - Danilo Bruschi, Deborah Joseph, Paul Young:
A Structural Overview of NP Optimization Problems. Optimal Algorithms 1989: 205-231 - Didier Caucal:
A Fast Algorithm to Decide on Simple Grammars Equivalence. Optimal Algorithms 1989: 66-85 - Bogdan S. Chlebus:
Sorting within Distance Bound on a Mesh-Connected Processor Array. Optimal Algorithms 1989: 232-238 - Michel Cosnard, El Mostafa Daoudi, Yves Robert:
Complexity of the Parallel Givens Facotrization on Shared Memory Architectures. Optimal Algorithms 1989: 86-105 - Gautam Das, Deborah Joseph:
Which Triangulations Approximate the Complete Graph?. Optimal Algorithms 1989: 168-192 - Frank K. H. A. Dehne:
Computing Digitized Voronoi Diagrams on a Systolic Screen and Applications to Clustering. Optimal Algorithms 1989: 14-24 - Krzysztof Diks, Wojciech Rytter:
Optimal Parallel Computations for Halin Graphs. Optimal Algorithms 1989: 266-273 - Costas S. Iliopoulos, William F. Smyth:
PRAM Algorithms for Identifying Polygon Similarity. Optimal Algorithms 1989: 25-32 - Jyrki Katajainen, Christos Levcopoulos, Ola Petersson:
Local Insertion Sort Revisited. Optimal Algorithms 1989: 239-253 - Sam M. Kim, Robert McNaughton, Robert McCloskey:
An Upper Bound on the Order of Locally Testable Deterministic Finite Automata. Optimal Algorithms 1989: 48-65 - Manfred Kunde:
Packet Routing on Grids of Processors. Optimal Algorithms 1989: 254-265 - Christos Levcopoulos, Andrzej Lingas:
Ther Are Planar Graphs Almost as Good as the Complete Graphs and as Short as Minimum Spanning Trees. Optimal Algorithms 1989: 9-13 - Doron Nussbaum, Jörg-Rüdiger Sack:
Disassembling Two-Dimensional Composite Parts via Translations. Optimal Algorithms 1989: 153-167 - B. John Oommen, David T. H. Ng:
Optimal Constant Space Move-to-Rear List Organization. Optimal Algorithms 1989: 115-125 - Constantine N. K. Osiakwan, Selim G. Akl:
Optimal Parallel Algorithms for b-Matchings in Trees. Optimal Algorithms 1989: 274-308 - Theodore S. Papatheodorou, N. Tsantanis:
Fast Soliton Automata. Optimal Algorithms 1989: 41-47 - Vijaya Ramachandran:
A Framework for Parallel Graph Algorithm Design. Optimal Algorithms 1989: 33-40 - John H. Reif, Sandeep Sen:
Randomization in Parallel Algorithms and its Impact on Computational Geometry. Optimal Algorithms 1989: 1-8 - Maria J. Serna, Paul G. Spirakis:
The Approximability of Problems Complete for P. Optimal Algorithms 1989: 193-204 - Renzo Sprugnoli, Elena Barcucci, Alessandra Chiuderi, Renzo Pinzani:
On Some Properties of (a, b)-Trees. Optimal Algorithms 1989: 139-152 - Hristo N. Djidjev:
Optimal Algorithms, International Symposium, Varna, Bulgaria, May 29 - June 2, 1989, Proceedings. Lecture Notes in Computer Science 401, Springer 1989, ISBN 3-540-51859-2 [contents]
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-02 18: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