Proceedings 2001 IEEE International Conference on Cluster Computing (2001)
Las Vegas, Nevada
Oct. 14, 2001 to Oct. 17, 2001
ISBN: 0-7695-1390-5
TABLE OF CONTENTS
Introduction
Forward (PDF)
pp. xi
Program Committee (PDF)
pp. xii
Reviewers (PDF)
pp. xiii
Tutorial 1 - Chair: Jon Kleinberg
Tutorial 2 - Chair: David Eppstein
Tutorial 3 - Chair: Daniele Micciancio
Session 1 - Chair: Bernard Chazelle
Session 2 - Chair: Cynthia Dwork
Session 3 - Chair: Jon Kleinberg
Traveling with a Pez Dispenser (Or, Routing Issues in MPLS) (Abstract)
pp. 148
Source Routing and Scheduling in Packet Networks (Abstract)
pp. 168
The Natural Work-Stealing Algorithm is Stable (Abstract)
pp. 178
Session 4 - Chair: Ran Raz
Lower Bounds for Polynomial Calculus: Non-Binomial Case (Abstract)
pp. 190
Resolution is Not Automatizable Unless W[P] is Tractable (Abstract)
pp. 210
"Planar" Tautologies Hard for Resolution (Abstract)
Stefan Dantchev , University of Aarhus and University of London
S? Riis , University of London
pp. 220
Session 5 - Chair: David Eppstein
Session 6 - Chair: D. Sivakumar
Session 7 - Chair: Susanne Albers
Session 8 - Chair: Peter Bro Miltersen
Session 9 - Chair: Moses Charikar
Session 10 - Chair: Moni Naor
Fast Monte-Carlo Algorithms for Approximate Matrix Multiplication (Abstract)
pp. 452
Session 11 - Chair: James Aspnes
Session 12 - Chair: Daniele Micciancio
Session 13 - Chair: Alistair Sinclair
Session 14 - Chair: Madhu Sudan
S^p _2 \subseteq ZPP^{NP} (Abstract)
pp. 620
Session 15 - Chair: Salil Vadhan
Expander-Based Constructions of Efficiently Decodable Codes (Abstract)
pp. 658
Author Index (PDF)
pp. 0669