SIGN IN
SIGN UP
Randomness conductors and constant-degree lossless expanders
Full Text:
Pdf
Buy this Article
Authors:
Michael Capalbo
Institute for Advanced Study, Princeton, NJ
Omer Reingold
AT&T Labs - Research, Florham Park, NJ
Salil Vadhan
Harvard University, Cambridge, MA
Avi Wigderson
Hebrew University, Jerusalem and Institute for Advanced Study, Princeton, NJ
2002 Article
Bibliometrics
· Downloads (6 Weeks): 13
· Downloads (12 Months): 54
· Downloads (cumulative): 612
· Citation Count: 50
Published in:
· Proceeding
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Pages 659 - 668
ACM
New York, NY
, USA
©2002
table of contents
ISBN:1-58113-495-9
doi>
10.1145/509907.510003
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
STOC'13
Share:
|
Tags:
algorithms
condensers
expander graphs
extractors
graph products
graph theory
random number generation
theory
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder