Other versions by this Author
| Foreword | |
| Program Committee | |
| Reviewers | |
| Game Theory and Mathematical Economics: A Theoretical Computer Scientists's Introduction | p. 4 |
| Algorithmic Applications of Low-Distortion Geometric Embeddings | p. 10 |
| Coding Theory: Tutorial and Survey | p. 36 |
| Almost Tight Upper Bounds for Vertical Decompositions in Four Dimensions | p. 56 |
| Approximate Shape Fitting via Linearization | p. 66 |
| On the Complexity of Many Faces in Arrangements of Circles | p. 74 |
| Clustering Motion | p. 84 |
| A Replacement for Voronoi Diagrams of Near Linear Size | p. 94 |
| How to Go Beyond the Black-Box Simulation Barrier | p. 106 |
| Resettably-Sound Zero-Knowledge and its Applications | p. 116 |
| On the Impossibility of Basing Trapdoor Functions on Trapdoor Predicates | p. 126 |
| Universally Composable Security: A New Paradigm for Cryptographic Protocols | p. 136 |
| Traveling with a Pez Dispenser (Or, Routing Issues in MPLS) | p. 148 |
| Simple Routing Strategies for A dversarial Systems | p. 158 |
| Source Routing and Scheduling in Packet Networks | p. 168 |
| The Natural Work-Stealing Algorithm is Stable | p. 178 |
| Lower Bounds for Polynomial Calculus: Non-Binomial Case | p. 190 |
| Counting Axioms Do Not Polynomially Simulate Counting Gates | p. 200 |
| Resolution in Not Automatizable Unless W[P] is Tractable | p. 210 |
| "Planar" Tautologies Hard for Resolution | p. 220 |
| Planar Graphs, Negative Weight Edges, Shortest Paths, and Near Linear Time | p. 232 |
| Compact Oracles for Reachability and Approximate Distances in Planar Digraphs | p. 242 |
| Vickrey Prices and Shortest Paths: What is an Edge Worth? | p. 252 |
| Fully Dynamic All Pairs Shortest Paths with Real Edge Weights | p. 260 |
| Informational Complexity and the Direct Sum Problem for Simultaneous Message Complexity | p. 270 |
| How Powerful is Adiabatic Quantum Computation? | p. 279 |
| Lower Bounds for Quantum Communication Complexity | p. 288 |
| The Confluence of Ground Term Rewrite Systems is Decidable in Polynomial Time | p. 298 |
| On the Average-Case Hardness of CVP | p. 308 |
| Approximating Directed Multicuts | p. 320 |
| Facility Location with Nonuniform Hard Capacities | p. 329 |
| An Iterative Rounding 2-Approximation Algorithm for the Element Connectivity Problem | p. 339 |
| Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems | p. 348 |
| Lower Bounds for Matrix Product | p. 358 |
| Deterministic Computation of the Frobenius Form | p. 368 |
| The Complexity of Factors of Multivariate Polynomials | p. 378 |
| Linear-time Recognition of Circular-arc Graphs | p. 386 |
| A Ramsey-type Theorem for Metric Spaces and its Applications for Metrical Task Systems and Related Problems | p. 396 |
| Designing Networks Incrementally | p. 406 |
| Sorting and Selection with Structured Costs | p. 416 |
| Online Facility Location | p. 426 |
| Testing Subgraphs in Large Graphs | p. 434 |
| Testing Random Variables for Independence and Identity | p. 442 |
| Fast Monte-Carlo Algorithms for Approximate Matrix Multiplication | p. 452 |
| Three Theorems Regarding Testing Graph Properties | p. 460 |
| Designing Networks for Selfish Users is Hard | p. 472 |
| Truthful Mechanisms for One-Parameter Agents | p. 482 |
| Building Low-Diameter P2P Networks | p. 492 |
| Web Search via Hub Synthesis | p. 500 |
| Random Evolution in Massive Graphs | p. 510 |
| Tight Approximation Results for General Covering Integer Programs | p. 522 |
| Spectral Partitioning of Random Graphs | p. 529 |
| Sequential and Parallel Algorithms for Mixed Packing and Covering | p. 538 |
| Unique Sink Orientations of Cubes | p. 547 |
| Arc-Disjoint Paths in Expander Digraphs | p. 558 |
| Glauber Dynamics on Trees and Hyperbolic Graphs | p. 568 |
| Randomly Colouring Graphs with Lower Bounds on Girth and Maximum Degree | p. 579 |
| Distributions on Level-Sets with Applications to Approximation Algorithms | p. 588 |
| Improved Inapproximability Results for MaxClique, Chromatic Number and Approximate Graph Coloring | p. 600 |
| Query Efficient PCPs with Perfect Completeness | p. 610 |
| S[superscript P[subscript 2]][actual symbol not reproducible]ZPP[superscript NP] | p. 620 |
| Semi-Direct Product in Groups and Zig-Zag Product in Graphs: Connections and Applications | p. 630 |
| Extractors from Reed-Muller Codes | p. 638 |
| Simple Extractors for All Min-Entropies and a New Pseudo-Random Generator | p. 648 |
| Expander-Based Constructions of Efficiently Decodable Codes | p. 658 |
| Author Index | p. 669 |
| Table of Contents provided by Blackwell. All Rights Reserved. |
42nd IEEE Symposium on Foundations of Computer Science: Proceedings, October 14-17, 2001, Las Vegas, Nevada, USA
by IEEE Computer SocietyFormat: Paperback
Pub. Date: 2001-12-01
Publisher(s): IEEE
-
This Item Qualifies for Free Shipping!*
*Excludes marketplace orders.
List Price: $195.30
Rent Textbook
Select for Price
New Textbook
We're Sorry
Sold Out
Used Textbook
We're Sorry
Sold Out
eTextbook
We're Sorry
Not Available
How Marketplace Works:
- This item is offered by an independent seller and not shipped from our warehouse
- Item details like edition and cover design may differ from our description; see seller's comments before ordering.
- Sellers much confirm and ship within two business days; otherwise, the order will be cancelled and refunded.
- Marketplace purchases cannot be returned to eCampus.com. Contact the seller directly for inquiries; if no response within two days, contact customer service.
- Additional shipping costs apply to Marketplace purchases. Review shipping costs at checkout.
Table of Contents
An electronic version of this book is available through VitalSource.
This book is viewable on PC, Mac, iPhone, iPad, iPod Touch, and most smartphones.
By purchasing, you will be able to view this book online, as well as download it, for the chosen number of days.
Digital License
You are licensing a digital product for a set duration. Durations are set forth in the product description, with "Lifetime" typically meaning five (5) years of online access and permanent download to a supported device. All licenses are non-transferable.
More details can be found here.
A downloadable version of this book is available through the eCampus Reader or compatible Adobe readers.
Applications are available on iOS, Android, PC, Mac, and Windows Mobile platforms.
Please view the compatibility matrix prior to purchase.