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 28 matches
- 1990
- Nils Andersen:
A General Transposition Method for a Matrix on Auxiliary Store. BIT 30(1): 2-16 (1990) - Bruce L. Bauslaugh, Frank Ruskey:
Generating Alternating Permutations Lexicographically. BIT 30(1): 17-26 (1990) - Chin-Chen Chang, Chu-Hsing Lin:
A Reciprocal Confluence Tree Unit and Its Applications. BIT 30(1): 27-33 (1990) - Chiuyuan Chen, Ruei-Chuan Chang:
On the Minimality of Polygon Triangualtion. BIT 30(4): 570-582 (1990) - Craig C. Douglas, Willard L. Miranker:
The Multilevel Principle Applied to Sorting. BIT 30(2): 177-195 (1990) - Per-Olof Fjällström, Jyrki Katajainen, Christos Levcopoulos, Ola Petersson:
A Sublogarithmic Convex Hull Algorithm. BIT 30(3): 378-384 (1990) - Nen-Fu Huang:
A Divide-and-Conquer Algorithm for Constructing Relative Neighborhood Graph. BIT 30(2): 196-206 (1990) - Shou-Hsuan Stephen Huang, Venkatraman Viswanathan:
On the Construction of Weighted Time-Optimal B-Trees. BIT 30(2): 207-215 (1990) - Sushil Jajodia, Frederick N. Springsteel:
Lossless Outer Joins with Incomplete Information. BIT 30(1): 34-41 (1990) - Zbigniew Kokosinski:
On Generation of Permutations Through Decomposition of Symmetric Groups Into Cosets. BIT 30(4): 583-591 (1990) - R. T. Kuo, S. S. Tseng:
On the Invariance of Male Optimal Stable Matching. BIT 30(4): 592-598 (1990) - Sheau-Dong Lang:
Analysis of Recursive Batched Interpolation Search. BIT 30(1): 42-50 (1990) - Heikki Mannila, Esko Ukkonen:
Unifications, Deunifications, and Their Complexity. BIT 30(4): 599-619 (1990) - Yannis Manolopoulos, Christos Faloutsos:
Analysis for the End of Block Wasted Space. BIT 30(4): 620-630 (1990) - Yannis Manolopoulos, John G. Kollias:
Optimal Data Placement in Two-Headed Disk Systems. BIT 30(2): 216-219 (1990) - J. Ian Munro, Venkatesh Raman, Jeffrey S. Salowe:
Stable in Situ Sorting and Minimum Data Movement. BIT 30(2): 220-234 (1990) - Mark H. Overmars, Haijo Schipper, Micha Sharir:
Storing Line Segments in Partition Trees. BIT 30(3): 385-403 (1990) - Kotagiri Ramamohanarao, John Shepherd, Ron Sacks-Davis:
Multi-Attribute Hashing with Multiple File Copies for High Performance Partial-Match Retrieval. BIT 30(3): 404-423 (1990) - Arch Douglas Robison:
An Improved Rewriting-Number Algorithm. BIT 30(1): 51-61 (1990) - Renzo Sprugnoli:
Counting Labels in Binary Trees. BIT 30(1): 62-69 (1990) - Alan Stewart:
An Axiomatic Treatment of SIMD Assignment. BIT 30(1): 70-82 (1990) - Ivan Stojmenovic:
An Optimal Algorithm for Generating Equivalence Relations on a Linear Array of Processors. BIT 30(3): 424-436 (1990) - Maciej M. Syslo, Pawel Winter:
In-Trees and Plane Embeddings of Outerplanar Graphs. BIT 30(1): 83-90 (1990) - Jimmy J. M. Tan:
A Maximum Stable Matching for the Roommates Problem. BIT 30(4): 631-640 (1990) - Jorma Tarhio:
Uncle-Atrributed Grammars. BIT 30(3): 437-449 (1990) - Ravi Varadarajan:
Partitioning Multi-Edge Graphs. BIT 30(3): 450-463 (1990) - Vincent G. Winters:
Minimal Perfect Hashing in Polynomial Time. BIT 30(2): 235-244 (1990) - Mohammad Zubair, S. N. Gupta:
Embeddings on a Boolean Cube. BIT 30(2): 245-256 (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-09-20 13:23 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