SIGN IN
SIGN UP
An efficient sparse regularity concept
Full Text:
PDF
Buy this Article
Authors:
Amin Coja-Oghlan
University of Edinburgh, UK
Colin Cooper
University of London, UK
Alan Frieze
Carnegie Mellon University, Pittsburgh, PA
Published in:
· Proceeding
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Pages 207-216
Society for Industrial and Applied Mathematics
Philadelphia, PA
, USA
©2009
table of contents
2009 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 16
· Downloads (cumulative): 104
· Citation Count: 3
Tools and Resources
Buy this Article
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
analysis of algorithms
computations on matrices
sparse, structured, and very large systems
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