𝔖 Bobbio Scriptorium

✦ LIBER ✦

[IEEE 2013 IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS) - Berkeley, CA, USA (2013.10.26-2013.10.29)] 2013 IEEE 54th Annual Symposium on Foundations of Computer Science - Klee's Measure Problem Made Easy

✍ Scribed by Chan, Timothy M.

Book ID: 126618699
Publisher: IEEE
Year: 2013
Weight: 272 KB
Category: Article
ISBN: 0769551351
DOI: 10.1109/FOCS.2013.51

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[IEEE 2013 IEEE 54th Annual Symposium on

[IEEE 2013 IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS) - Berkeley, CA, USA (2013.10.26-2013.10.29)] 2013 IEEE 54th Annual Symposium on Foundations of Computer Science - Simultaneous Resettability from One-Way Functions

✍ Chung, Kai-Min; Ostrovsky, Rafail; Pass, Rafael; Visconti, Ivan 📂 Article 📅 2013 🏛 IEEE ⚖ 243 KB

[IEEE 2013 IEEE 54th Annual Symposium on

[IEEE 2013 IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS) - Berkeley, CA, USA (2013.10.26-2013.10.29)] 2013 IEEE 54th Annual Symposium on Foundations of Computer Science - Approximation Algorithms for Euler Genus and Related Problems

✍ Chekuri, Chandra; Sidiropoulos, Anastasios 📂 Article 📅 2013 🏛 IEEE ⚖ 322 KB

[IEEE 2013 IEEE 54th Annual Symposium on

[IEEE 2013 IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS) - Berkeley, CA, USA (2013.10.26-2013.10.29)] 2013 IEEE 54th Annual Symposium on Foundations of Computer Science - The Simple Economics of Approximately Optimal Auctions

✍ Alaei, Saeed; Fu, Hu; Haghpanah, Nima; Hartline, Jason 📂 Article 📅 2013 🏛 IEEE ⚖ 227 KB

[IEEE 2013 IEEE 54th Annual Symposium on

[IEEE 2013 IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS) - Berkeley, CA, USA (2013.10.26-2013.10.29)] 2013 IEEE 54th Annual Symposium on Foundations of Computer Science - The Moser-Tardos Framework with Partial Resampling

✍ Harris, David G.; Srinivasan, Aravind 📂 Article 📅 2013 🏛 IEEE ⚖ 260 KB

[IEEE 2013 IEEE 54th Annual Symposium on

[IEEE 2013 IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS) - Berkeley, CA, USA (2013.10.26-2013.10.29)] 2013 IEEE 54th Annual Symposium on Foundations of Computer Science - Approximating Minimum-Cost k-Node Connected Subgraphs via Independence-Free Graphs

✍ Cheriyan, Joseph; Vegh, Laszlo A. 📂 Article 📅 2013 🏛 IEEE ⚖ 266 KB

[IEEE 2006 47th Annual IEEE Symposium on

[IEEE 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) - Berkeley, CA, USA (2006.10.21-2006.10.24)] 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) - Accidental Algorthims

✍ Valiant, Leslie 📂 Article 📅 2006 🏛 IEEE ⚖ 172 KB