✦ LIBER ✦

Tight Bounds on Parallel List Marking

✍ Scribed by Sandeep N. Bhatt; Gianfranco Bilardi; Kieran T. Herley; Geppino Pucci; Abhiram Ranade

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 432 KB
Volume: 51
Category: Article
ISSN: 0743-7315
DOI: 10.1006/jpdc.1998.1447

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Tight Bounds on Quantum Searching

✍ Michel Boyer; Gilles Brassard; Peter Høyer; Alain Tapp 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 210 KB

Tight Lower Bounds on the Size of Sweepi

Tight Lower Bounds on the Size of Sweeping Automata

✍ Hing Leung 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 124 KB

Tight bounds on the chromatic sum of a c

Tight bounds on the chromatic sum of a connected graph

✍ Carsten Thomassen; Paul Erdös; Yousef Alavi; Paresh J. Malde; Allen J. Schwenk 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 236 KB 👁 1 views

Tight Bound on Johnson's Algorithm for M

Tight Bound on Johnson's Algorithm for Maximum Satisfiability

✍ Jianer Chen; Donald K. Friesen; Hao Zheng 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 223 KB

We present new techniques that give a more thorough analysis on Johnson's classical algorithm for the Maximum Satisfiability problem. In contrast to the common belief for two decades that Johnson's Algorithm has performance ratio 1Â2, we show that the performance ratio is 2Â3 and that this bound is

Bin packing with discrete item sizes, pa

Bin packing with discrete item sizes, part II: Tight bounds on First Fit

✍ E. G. Coffman Jr.; D. S. Johnson; P. W. Shor; R. R. Weber 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 378 KB

⌰ n log k when k s o n and ⌰ n log n the bound for the continuous uni-. Ž . form case when k s ⍀ n .

Full configuration interaction algorithm

Full configuration interaction algorithm on a massively parallel architecture: Direct-list implementation

✍ Rossi, Elda; Bendazzoli, Gian Luigi; Evangelisti, Stefano 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 984 KB

A parallel full configuration interaction FCI code, implemented on a distributed memory MPP computer, has been modified in order to use a direct algorithm to compute the lists of mono-and biexcitations each time they are needed. We were able to perform FCI calculations on the ground state of the ace