ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Sampling lattice points
Full text PdfPdf (1.09 MB)
Source Annual ACM Symposium on Theory of Computing archive
Proceedings of the twenty-ninth annual ACM symposium on Theory of computing table of contents
El Paso, Texas, United States
Pages: 696 - 700  
Year of Publication: 1997
ISBN:0-89791-888-6
Authors
Ravi Kannan  school of Computer science, Carnegie Mellon University
Santosh Vempala  school of Computer science, Carnegie Mellon University
Sponsor
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 47,   Citation Count: 4
Additional Information:

cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/258533.258665
What is a DOI?

CITED BY  4
Ravi Kumar , D. Sivakumar, Roundness estimation via random sampling, Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, p.603-612, January 17-19, 1999, Baltimore, Maryland, United States
Ben J. Morris, Improved bounds for sampling contingency tables, Random Structures & Algorithms, v.21 n.2, p.135-146, September 2002
Mary Cryan , Martin Dyer , Dana Randall, Approximately counting integral flows and cell-bounded contingency tables, Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, May 22-24, 2005, Baltimore, MD, USA
Ravi Kannan , Hariharan Narayanan, Random walks on polytopes and an affine interior point method for linear programming, Proceedings of the 41st annual ACM symposium on Theory of computing, May 31-June 02, 2009, Bethesda, MD, USA

INDEX TERMS

Primary Classification:
  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS

Additional Classification:
  F. Theory of Computation
  F.1 COMPUTATION BY ABSTRACT DEVICES
      F.1.2 Modes of Computation
          Subjects: Probabilistic computation

  G. Mathematics of Computing


General Terms:
Algorithms, Design, Measurement, Performance, Theory, Verification

Collaborative Colleagues:
Ravi Kannan: colleagues
Santosh Vempala: colleagues

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

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player