𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Level-Ancestor problem on Pure Pointer Machines

✍ Scribed by Desh Ranjan; Enrico Pontelli

Book ID
104136871
Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
141 KB
Volume
85
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Lower Bounds for the Union–Find and the
Lower Bounds for the Union–Find and the Split–Find Problem on Pointer Machines
✍ Han La PoutrΓ© πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 490 KB

A well-known result of Tarjan states that for all n and m n there exists a sequence of n&1 Union and m Find operations that needs at least 0(m . :(m, n)) execution steps on a pointer machine that satisfies the separation condition. Later the bound was extended to 0(n+m. :(m, n)) for all m and n. In

The one-machine sequencing problem
The one-machine sequencing problem
✍ Jacques Carlier πŸ“‚ Article πŸ“… 1982 πŸ› Elsevier Science 🌐 English βš– 267 KB

Let M I and M~ be non-bonleneck macbi~les and M, Β’1 bonleneek machine proeessin~ only one job ;11 ~ dine, Suppose thai n jnbs have to be processed on M I. M: and M11in thai order) and lob i has to spend a time ~1, on M~, d, on M: and q~ on M3; we Wahl to minimize the nlakuspan. This problem is impo