𝔖 Bobbio Scriptorium

✦ LIBER ✦

[IEEE Comput. Soc 41st Annual Symposium on Foundations of Computer Science - Redondo Beach, CA, USA (12-14 Nov. 2000)] Proceedings 41st Annual Symposium on Foundations of Computer Science - New data structures for orthogonal range searching

✍ Scribed by Alstrup, S.; Stolting Brodal, G.; Rauhe, T.

Book ID: 111678107
Publisher: IEEE Comput. Soc
Year: 2000
Weight: 988 KB
Edition: 41st ed.
Volume: 0
Category: Article
ISBN-13: 9780769508504
DOI: 10.1109/sfcs.2000.892088

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[IEEE Comput. Soc. Press [1990] 31st Ann

[IEEE Comput. Soc. Press [1990] 31st Annual Symposium on Foundations of Computer Science - St. Louis, MO, USA (22-24 Oct. 1990)] Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science - Algebraic methods for interactive proof systems

✍ Lund, C.; Fortnow, L.; Karloff, H.; Nisan, N. 📂 Article 📅 1990 🏛 IEEE Comput. Soc. Press ⚖ 656 KB

[IEEE 19th Annual Symposium on Foundatio

[IEEE 19th Annual Symposium on Foundations of Computer Science (sfcs 1978) - Ann Arbor, MI, USA (1978.10.16-1978.10.18)] 19th Annual Symposium on Foundations of Computer Science (sfcs 1978) - A data structure for orthogonal range queries

✍ Lueker, George S. 📂 Article 📅 1978 🏛 IEEE ⚖ 645 KB

[IEEE Comput. Soc 38th Annual Symposium

[IEEE Comput. Soc 38th Annual Symposium on Foundations of Computer Science - Miami Beach, FL, USA (20-22 Oct. 1997)] Proceedings 38th Annual Symposium on Foundations of Computer Science - A 7/8-approximation algorithm for MAX 3SAT?

✍ Karloff, H.; Zwick, U. 📂 Article 📅 1997 🏛 IEEE Comput. Soc ⚖ 990 KB

[IEEE Comput. Soc. Press 35th Annual Sym

[IEEE Comput. Soc. Press 35th Annual Symposium on Foundations of Computer Science - Santa Fe, NM, USA (20-22 Nov. 1994)] Proceedings 35th Annual Symposium on Foundations of Computer Science - Algorithms for quantum computation: discrete logarithms and factoring

✍ Shor, P.W. 📂 Article 📅 1994 🏛 IEEE Comput. Soc. Press ⚖ 945 KB