Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/258533.258665acmconferencesArticle/Chapter ViewAbstractPublication PagesstocConference Proceedingsconference-collections
Article
Free access

Sampling lattice points

Published: 04 May 1997 Publication History
First page of PDF

Cited By

View all
  • (2023)Sampling ex-post group-fair rankingsProceedings of the Thirty-Second International Joint Conference on Artificial Intelligence10.24963/ijcai.2023/46(409-417)Online publication date: 19-Aug-2023
  • (2022)Estimation of the Size of Union of Delphic Sets: Achieving Independence from Stream SizeProceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3517804.3526222(41-52)Online publication date: 12-Jun-2022
  • (2022)On the Error of Random SamplingProceedings of the 2022 International Symposium on Symbolic and Algebraic Computation10.1145/3476446.3536190(273-282)Online publication date: 4-Jul-2022
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
STOC '97: Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
May 1997
752 pages
ISBN:0897918886
DOI:10.1145/258533
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 04 May 1997

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Conference

STOC97
Sponsor:

Acceptance Rates

STOC '97 Paper Acceptance Rate 75 of 211 submissions, 36%;
Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Upcoming Conference

STOC '25
57th Annual ACM Symposium on Theory of Computing (STOC 2025)
June 23 - 27, 2025
Prague , Czech Republic

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)135
  • Downloads (Last 6 weeks)18
Reflects downloads up to 24 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2023)Sampling ex-post group-fair rankingsProceedings of the Thirty-Second International Joint Conference on Artificial Intelligence10.24963/ijcai.2023/46(409-417)Online publication date: 19-Aug-2023
  • (2022)Estimation of the Size of Union of Delphic Sets: Achieving Independence from Stream SizeProceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3517804.3526222(41-52)Online publication date: 12-Jun-2022
  • (2022)On the Error of Random SamplingProceedings of the 2022 International Symposium on Symbolic and Algebraic Computation10.1145/3476446.3536190(273-282)Online publication date: 4-Jul-2022
  • (2019)Approximating integer solution counting via space quantification for linear constraintsProceedings of the 28th International Joint Conference on Artificial Intelligence10.5555/3367243.3367274(1697-1703)Online publication date: 10-Aug-2019
  • (2018)Practical Polytope Volume ApproximationACM Transactions on Mathematical Software10.1145/319465644:4(1-21)Online publication date: 16-Jun-2018
  • (2017)A Visual Analytics Approach for Categorical Joint Distribution Reconstruction from Marginal ProjectionsIEEE Transactions on Visualization and Computer Graphics10.1109/TVCG.2016.259847923:1(51-60)Online publication date: 1-Jan-2017
  • (2015)An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programsComputational Optimization and Applications10.1007/s10589-014-9693-560:3(559-585)Online publication date: 1-Apr-2015
  • (2013)An empirical evaluation of walk-and-round heuristics for mixed integer linear programsComputational Optimization and Applications10.1007/s10589-013-9540-055:3(545-570)Online publication date: 1-Jul-2013
  • (2012)Random Walks on Polytopes and an Affine Interior Point Method for Linear ProgrammingMathematics of Operations Research10.1287/moor.1110.051937:1(1-20)Online publication date: 1-Feb-2012
  • (2009)Random walks on polytopes and an affine interior point method for linear programmingProceedings of the forty-first annual ACM symposium on Theory of computing10.1145/1536414.1536491(561-570)Online publication date: 31-May-2009
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media