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