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

Time and space efficient net extractor

โœ Scribed by Surendra Nahar; Sartaj Sahni

Book ID
103047965
Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
963 KB
Volume
20
Category
Article
ISSN
0010-4485

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Time- and Space-Efficient Randomized Con
Time- and Space-Efficient Randomized Consensus
โœ J. Aspnes ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 751 KB

A protocol is presented which solves the randomized consensus problem [9] for shared memory. The protocol uses a total of \(O\left(p^{2}+n\right)\) worst-case expected increment, decrement, and read operations on a set of three shared \(O(\log n)\)-bit counters, where \(p\) is the number of active p

Time-efficient state space search
Time-efficient state space search
โœ Alexander Reinefeld; Peter Ridinger ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 628 KB

We present two time-efficient state space algorithms for searching minimax trees. Because they are based on SSS\* and Dual\*, both dominate Alpha-Beta on a node count basis. Moreover, one of them is always faster in searching random trees, even when the leaf node evaluation time is negligible. The f

Space and time-efficient hashing of garb
Space and time-efficient hashing of garbage-collected objects
โœ Agesen, Ole ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 80 KB

The hashCode() method found in the Java TM programming language, and similar methods in other languages, map an arbitrary object to an integer value that is constant for the lifetime of the object. We review existing implementations of the hash operation, specifying the kinds of memory systems for w