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 20 matches
- 1984
- Donald C. S. Allison, Mark T. Noga:
Some Performance Tests of Convex Hull Algorithms. BIT 24(1): 2-13 (1984) - Svante Carlsson:
Improving Worst-Case Behavior of Heaps. BIT 24(1): 14-18 (1984) - Mee Yee Chan:
Multidisk File Design: An Analysis of Folding Buckets to Disks. BIT 24(3): 261-268 (1984) - R. C. Chang, Richard C. T. Lee:
On the Average Length of Delaunay Triangulations. BIT 24(3): 269-273 (1984) - Jarmo Ernvall, Olli Nevalainen:
Estimating the Length of Minimal Spanning Trees in Compression of Files. BIT 24(1): 19-32 (1984) - Trevor I. Fenner, George Loizou:
Loop-Free Algorithms for Traversing Binary Trees. BIT 24(1): 33-44 (1984) - Ratan K. Ghosh, G. P. Bhattacharjee:
A Parallel Search Algorithm for Directed Acyclic Graphs. BIT 24(2): 133-150 (1984) - P. Gupta, G. P. Bhattacharjee:
A Parallel Selection Algorithm. BIT 24(3): 274-287 (1984) - W. J. Hsu, M. W. Du:
Computing a Longest Common Subsequence for a Set of Strings. BIT 24(1): 45-59 (1984) - Erkki Mäkinen:
On Context-Free and Szilard Languages. BIT 24(2): 164-170 (1984) - Johann P. Malmquist, Edward L. Robertson:
On the Complexity of Partitioning Sparse Matrix Representations. BIT 24(1): 60-68 (1984) - Arne Maus:
Delaunay Triangulation and the Convex Hull of n Points in Expected Linear Time. BIT 24(2): 151-163 (1984) - Timo Niemi:
Specification of a Query Language by the Attribute Method. BIT 24(2): 171-186 (1984) - Bengt Nordström, Jan M. Smith:
Propositions and Specifications of Programs in Martin-Löfs Type Theory. BIT 24(3): 288-301 (1984) - G. M. Prabhu, Narsingh Deo:
On the Power of a Perturbation for Testing Non-Isomorphism of Graphs. BIT 24(3): 302-307 (1984) - Aimo A. Törn:
Hashing with Overflow Indexing. BIT 24(3): 317-332 (1984) - S. S. Tseng, Richard C. T. Lee:
A New Parallel Sorting Algorithm Based Upon Min-Mid-Max Operations. BIT 24(2): 187-195 (1984) - S. S. Tseng, Richard C. T. Lee:
A Parallel Algorithm to Solve the Stable Marriage Problem. BIT 24(3): 308-316 (1984) - Der-Yun Yeh, D. T. Lee:
Graph Algorithms on a Tree-Structured Parallel Computer. BIT 24(3): 333-340 (1984) - Shmuel Zaks:
A New Algorithm for Generation of Permutations. BIT 24(2): 196-204 (1984)
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-10-05 17:51 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