𝔖 Bobbio Scriptorium

✦ LIBER ✦

[IEEE Comput. Soc. Press 32nd Annual Symposium of Foundations of Computer Science - San Juan, Puerto Rico (1-4 Oct. 1991)] [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science - Low contention linearizable counting

✍ Scribed by Herlihy, M.; Shavit, N.; Waarts, O.

Book ID: 126600734
Publisher: IEEE Comput. Soc. Press
Year: 1991
Weight: 827 KB
Category: Article
ISBN-13: 9780818624452
DOI: 10.1109/SFCS.1991.185415

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[IEEE Comput. Soc. Press 32nd Annual Sym

[IEEE Comput. Soc. Press 32nd Annual Symposium of Foundations of Computer Science - San Juan, Puerto Rico (1-4 Oct. 1991)] [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science - Adaptive dictionary matching

✍ Amir, A.; Farach, M. 📂 Article 📅 1991 🏛 IEEE Comput. Soc. Press ⚖ 618 KB

[IEEE Comput. Soc. Press 32nd Annual Sym

[IEEE Comput. Soc. Press 32nd Annual Symposium of Foundations of Computer Science - San Juan, Puerto Rico (1-4 Oct. 1991)] [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science - Explicit construction of natural bounded concentrators

✍ Morgenstern, M. 📂 Article 📅 1991 🏛 IEEE Comput. Soc. Press ⚖ 406 KB

[IEEE Comput. Soc. Press 32nd Annual Sym

[IEEE Comput. Soc. Press 32nd Annual Symposium of Foundations of Computer Science - San Juan, Puerto Rico (1-4 Oct. 1991)] [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science - How to learn an unknown environment

✍ Deng, X.; Kameda, T.; Papadimitriou, C. 📂 Article 📅 1991 🏛 IEEE Comput. Soc. Press ⚖ 526 KB

[IEEE Comput. Soc. Press 32nd Annual Sym

[IEEE Comput. Soc. Press 32nd Annual Symposium of Foundations of Computer Science - San Juan, Puerto Rico (1-4 Oct. 1991)] [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science - Finding k-cuts within twice the optimal

✍ Saran, H.; Vazirani, V.V. 📂 Article 📅 1991 🏛 IEEE Comput. Soc. Press ⚖ 623 KB

[IEEE Comput. Soc. Press 32nd Annual Sym

[IEEE Comput. Soc. Press 32nd Annual Symposium of Foundations of Computer Science - San Juan, Puerto Rico (1-4 Oct. 1991)] [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science - The art gallery theorem for polygons with holes

✍ Hoffmann, F.; Kaufmann, M.; Kriegel, K. 📂 Article 📅 1991 🏛 IEEE Comput. Soc. Press ⚖ 703 KB

[IEEE Comput. Soc. Press 32nd Annual Sym

[IEEE Comput. Soc. Press 32nd Annual Symposium of Foundations of Computer Science - San Juan, Puerto Rico (1-4 Oct. 1991)] [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science - Finding the hidden path: time bounds for all-pairs shortest paths

✍ Karger, D.R.; Koller, D.; Phillips, S.J. 📂 Article 📅 1991 🏛 IEEE Comput. Soc. Press ⚖ 791 KB