|
|
Journals in DBLP
BIT
1991, volume: 31, number: 1
- Oliver Günther, Eugene Wong
A Dual Approach to Detect Polyhedral Intersections in Arbitrary Demensions. [Citation Graph (2, 0)][DBLP]
BIT, 1991, v:31, n:1, pp:3-14 [Journal]
- Ben Johnsen
Generating Binary Trees with Uniform Probability. [Citation Graph (0, 0)][DBLP]
BIT, 1991, v:31, n:1, pp:15-31 [Journal]
- John Konvalina, Yi-Hsin Liu
Bit Strings Without q-Separation. [Citation Graph (0, 0)][DBLP]
BIT, 1991, v:31, n:1, pp:32-35 [Journal]
- Vijay K. Vaishnavi, Timothy D. Korson
Height-Analysis of k-Dimensional Leaf and Node Height-Balanced Trees: A New Approach. [Citation Graph (0, 0)][DBLP]
BIT, 1991, v:31, n:1, pp:36-49 [Journal]
- H. Van de Vel, Sun Shijie
A Modification of Hochbaum and Shmoys' Algorithm for Scheduling Problems. [Citation Graph (0, 0)][DBLP]
BIT, 1991, v:31, n:1, pp:50-52 [Journal]
- Shyan-Ming Yuan
An Efficient Fault-Tolerant Decentralized Commit Protocol for Single Site Failure. [Citation Graph (0, 0)][DBLP]
BIT, 1991, v:31, n:1, pp:53-68 [Journal]
- Weixiong Zhang, Nageswara S. V. Rao
Optimal Parallel Quicksort on Erew Pram. [Citation Graph (0, 0)][DBLP]
BIT, 1991, v:31, n:1, pp:69-74 [Journal]
|
