๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Time-space trade-offs in a pebble game

โœ Scribed by W. J. Paul; R. E. Tarjan

Publisher
Springer-Verlag
Year
1978
Tongue
English
Weight
231 KB
Volume
10
Category
Article
ISSN
0001-5903

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Time-space trade-offs for compressed suf
Time-space trade-offs for compressed suffix arrays
โœ S.Srinivasa Rao ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 70 KB

Given a binary string of length n, we give a representation of its suffix array that takes O(nt (lg n) 1/t ) bits of space such that given i, 1 i n, the ith entry in the suffix array of the string can be retrieved in O(t) time, for any parameter 1 t lg lg n. For t = lg lg n, this gives a compressed

Time-Randomness Trade-offs in Parallel C
Time-Randomness Trade-offs in Parallel Computation
โœ Danny Krizanc ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 171 KB

In this paper we study two problems which have a provable gap between their randomized and deterministic complexity; oblivious routing on fixed connection ลฝ . networks and finding the median on a parallel comparison tree PCT . We prove a trade-off between the amount of randomness used by an algorith

A bicriterion approach to time/cost trad
A bicriterion approach to time/cost trade-offs in sequencing
โœ Luk N. Van Wassenhove; Kenneth R. Baker ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 363 KB

Tiffs paper discusses a bieriterion approach to sequencing with tlme/cost tnlde-offs, This approach, which produces an efficient frontier of possible schedules, has the fidv'mtage that it does not require tile sequencing criteria to be measurable in the sllnle ilnils as the resource allocation cost,