✦ LIBER ✦

Lower Bounds for Randomized Exclusive Write PRAMs

✍ Scribed by P. D. MacKenzie

Book ID: 105915270
Publisher: Springer
Year: 1997
Tongue: English
Weight: 255 KB
Volume: 30
Category: Article
ISSN: 1433-0490
DOI: 10.1007/s002240000070

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower Bounds for Randomized Mutual Exclu

Lower Bounds for Randomized Mutual Exclusion

✍ Kushilevitz, Eyal; Mansour, Yishay; Rabin, Michael O.; Zuckerman, David 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 284 KB

Time lower bounds do not exist for CRCW

Time lower bounds do not exist for CRCW PRAMs

✍ Kazuo Iwama; Chuzo Iwamoto; Manzur Morshed 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 948 KB

Parallel Integer Sorting Is More Efficie

Parallel Integer Sorting Is More Efficient Than Parallel Comparison Sorting on Exclusive Write PRAMs

✍ Han, Yijie; Shen, Xiaojun 📂 Article 📅 2002 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 273 KB

A Lower-Bound for the Emulation of PRAM

A Lower-Bound for the Emulation of PRAM Memories on Processor Networks

✍ T. Hagerup 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 408 KB

Lower bounds for randomized algorithms f

Lower bounds for randomized algorithms for online chain partitioning

✍ Claire Mathieu; Olga Ohrimenko 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 159 KB

A time complexity lower bound for adapti

A time complexity lower bound for adaptive mutual exclusion

✍ Yong-Jik Kim; James H. Anderson 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 676 KB