๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

[ACM Press the 42nd ACM symposium - Cambridge, Massachusetts, USA (2010.06.05-2010.06.08)] Proceedings of the 42nd ACM symposium on Theory of computing - STOC '10 - Local list-decoding and testing of random linear codes from high error

โœ Scribed by Kopparty, Swastik; Saraf, Shubhangi

Book ID
111876418
Publisher
ACM Press
Year
2010
Weight
592 KB
Volume
0
Category
Article
ISBN
1450300502

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

[ACM Press the 42nd ACM symposium - Camb
[ACM Press the 42nd ACM symposium - Cambridge, Massachusetts, USA (2010.06.05-2010.06.08)] Proceedings of the 42nd ACM symposium on Theory of computing - STOC '10 - Distributed computation in dynamic networks
โœ Kuhn, Fabian; Lynch, Nancy; Oshman, Rotem ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› ACM Press ๐ŸŒ English โš– 445 KB

In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the communication links for each round are chosen by an adversary, and nodes do not know who their neighbors for the current rou

[ACM Press the 42nd ACM symposium - Camb
[ACM Press the 42nd ACM symposium - Cambridge, Massachusetts, USA (2010.06.05-2010.06.08)] Proceedings of the 42nd ACM symposium on Theory of computing - STOC '10 - A shorter proof of the graph minor algorithm
โœ Kawarabayashi, Ken-ichi; Wollan, Paul ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› ACM Press ๐ŸŒ English โš– 481 KB

At the core of the seminal Graph Minor Theory of Robertson and Seymour is a powerful theorem which describes the structure of graphs excluding a fixed minor. This result is used to prove Wagner's conjecture and provide a polynomial time algorithm for the disjoint paths problem when the number of the