Sandpile transience on the grid is polynomially bounded

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: László Babai University of Chicago
Igor Gorodezky University of Chicago
Published in:
· Proceeding
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Pages 627-636
Society for Industrial and Applied Mathematics Philadelphia, PA, USA ©2007
table of contents ISBN: 978-0-898716-24-5
Sandpile transience on the grid is polynomially bounded 2007 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 14
· Downloads (cumulative): 141
· Citation Count: 3


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder