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

Hierarchies and Space Measures for Pointer Machines

โœ Scribed by D.R. Luginbuhl; M.C. Loui


Book ID
112252032
Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
770 KB
Volume
104
Category
Article
ISSN
0890-5401

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Lower Bounds for the Unionโ€“Find and the
โœ 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