Lower bounds for polynomial evaluation and interpolation problems Victor ShoupRoman Smolensky OriginalPaper Pages: 301 - 311
The electrical resistance of a graph captures its commute and cover times Ashok K. ChandraPrabhakar RaghavanPrasoon Tiwari OriginalPaper Pages: 312 - 340
Collecting coupons on trees, and the cover time of random walks Uriel Feige OriginalPaper Pages: 341 - 356
A lower bound for randomized algebraic decision trees Dima GrigorievMarek KarpinskiRoman Smolensky OriginalPaper Pages: 357 - 375
Randomization and the computational power of analytic and algebraic decision trees Dima GrigorievMarek KarpinskiRoman Smolensky OriginalPaper Pages: 376 - 388