𝔖 Bobbio Scriptorium

✦ LIBER ✦

[IEEE 2010 IEEE 51st Annual Symposium on Foundations of Computer Science (FOCS) - Las Vegas, NV, USA (2010.10.23-2010.10.26)] 2010 IEEE 51st Annual Symposium on Foundations of Computer Science - Black-Box, Round-Efficient Secure Computation via Non-malleability Amplification

✍ Scribed by Wee, Hoeteck

Book ID: 126644975
Publisher: IEEE
Year: 2010
Weight: 507 KB
Category: Article
ISBN: 1424485258
DOI: 10.1109/FOCS.2010.87

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[IEEE 2010 IEEE 51st Annual Symposium on

[IEEE 2010 IEEE 51st Annual Symposium on Foundations of Computer Science (FOCS) - Las Vegas, NV, USA (2010.10.23-2010.10.26)] 2010 IEEE 51st Annual Symposium on Foundations of Computer Science - Dependent Randomized Rounding via Exchange Properties of Combinatorial Structures

✍ Chekuri, Chandra; Vondrak, Jan; Zenklusen, Rico 📂 Article 📅 2010 🏛 IEEE ⚖ 617 KB

[IEEE 2010 IEEE 51st Annual Symposium on

[IEEE 2010 IEEE 51st Annual Symposium on Foundations of Computer Science (FOCS) - Las Vegas, NV, USA (2010.10.23-2010.10.26)] 2010 IEEE 51st Annual Symposium on Foundations of Computer Science - Determinant Sums for Undirected Hamiltonicity

✍ Bjorklund, Andreas 📂 Article 📅 2010 🏛 IEEE ⚖ 412 KB

[IEEE 2010 IEEE 51st Annual Symposium on

[IEEE 2010 IEEE 51st Annual Symposium on Foundations of Computer Science (FOCS) - Las Vegas, NV, USA (2010.10.23-2010.10.26)] 2010 IEEE 51st Annual Symposium on Foundations of Computer Science - A Separator Theorem in Minor-Closed Classes

✍ Kawarabayashi, Ken-ichi; Reed, Bruce 📂 Article 📅 2010 🏛 IEEE ⚖ 402 KB

[IEEE 2010 IEEE 51st Annual Symposium on

[IEEE 2010 IEEE 51st Annual Symposium on Foundations of Computer Science (FOCS) - Las Vegas, NV, USA (2010.10.23-2010.10.26)] 2010 IEEE 51st Annual Symposium on Foundations of Computer Science - Clustering with Spectral Norm and the k-Means Algorithm

✍ Kumar, Amit; Kannan, Ravindran 📂 Article 📅 2010 🏛 IEEE ⚖ 415 KB

[IEEE 2010 IEEE 51st Annual Symposium on

[IEEE 2010 IEEE 51st Annual Symposium on Foundations of Computer Science (FOCS) - Las Vegas, NV, USA (2010.10.23-2010.10.26)] 2010 IEEE 51st Annual Symposium on Foundations of Computer Science - Approximation Algorithms for the Edge-Disjoint Paths Problem via Raecke Decompositions

✍ Andrews, Matthew 📂 Article 📅 2010 🏛 IEEE ⚖ 369 KB

[IEEE 2010 IEEE 51st Annual Symposium on

[IEEE 2010 IEEE 51st Annual Symposium on Foundations of Computer Science (FOCS) - Las Vegas, NV, USA (2010.10.23-2010.10.26)] 2010 IEEE 51st Annual Symposium on Foundations of Computer Science - All-Pairs Shortest Paths in O(n²) Time with High Probability

✍ Peres, Yuval; Sotnikov, Dmitry; Sudakov, Benny; Zwick, Uri 📂 Article 📅 2010 🏛 IEEE ⚖ 453 KB