The distance approach to approximate combinatorial counting

Article Properties
Cite
Barvinok, A., and A. Samorodnitsky. “The Distance Approach to Approximate Combinatorial Counting”. Geometric and Functional Analysis, vol. 11, no. 5, 2001, pp. 871-99, https://doi.org/10.1007/s00039-001-8219-3.
Barvinok, A., & Samorodnitsky, A. (2001). The distance approach to approximate combinatorial counting. Geometric and Functional Analysis, 11(5), 871-899. https://doi.org/10.1007/s00039-001-8219-3
Barvinok, A., and A. Samorodnitsky. “The Distance Approach to Approximate Combinatorial Counting”. Geometric and Functional Analysis 11, no. 5 (2001): 871-99. https://doi.org/10.1007/s00039-001-8219-3.
Barvinok A, Samorodnitsky A. The distance approach to approximate combinatorial counting. Geometric and Functional Analysis. 2001;11(5):871-99.
Citations
Title Journal Journal Categories Citations Publication Date
Random weighting, asymptotic counting, and inverse isoperimetry Israel Journal of Mathematics
  • Science: Mathematics
12 2007
Nearest-neighbor-preserving embeddings

ACM Transactions on Algorithms
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
40 2007
Citations Analysis
The category Science: Mathematics 1 is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Nearest-neighbor-preserving embeddings and was published in 2007. The most recent citation comes from a 2007 study titled Nearest-neighbor-preserving embeddings. This article reached its peak citation in 2007, with 2 citations. It has been cited in 2 different journals. Among related journals, the ACM Transactions on Algorithms cited this research the most, with 1 citations. The chart below illustrates the annual citation trends for this article.
Citations used this article by year