The solution of some random NP-hard problems in polynomial expected time

Article Properties
Refrences
Title Journal Journal Categories Citations Publication Date
Almost all k-colorable graphs are easy to color Journal of Algorithms 44 1988
On the complexity of graph partitioning problems Discrete Applied Mathematics
  • Science: Mathematics
  • Technology: Engineering (General). Civil engineering (General)
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Technology: Engineering (General). Civil engineering (General)
 1983
Probability Inequalities for Sums of Bounded Random Variables Journal of the American Statistical Association
  • Science: Mathematics: Probabilities. Mathematical statistics
  • Science: Mathematics
 462 1963
Expected behaviour of graph colouring algorithms 1977
Graph bisection algorithms with good average case behaviour 1984
Citations
Title Journal Journal Categories Citations Publication Date
Breakdown of a concavity property of mutual information for non-Gaussian channels

 Information and Inference: A Journal of the IMA
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics
 2024
Mutual information for the sparse stochastic block model The Annals of Probability
  • Science: Mathematics: Probabilities. Mathematical statistics
  • Science: Mathematics
 2024
Asymptotic uncertainty quantification for communities in sparse planted bi-section models Journal of Statistical Planning and Inference
  • Science: Mathematics: Probabilities. Mathematical statistics
  • Science: Mathematics
 2023
A Spectral Method for Joint Community Detection and Orthogonal Group Synchronization SIAM Journal on Matrix Analysis and Applications
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics
 1 2023
Learning sparse graphons and the generalized Kesten–Stigum threshold The Annals of Statistics
  • Science: Mathematics: Probabilities. Mathematical statistics
  • Science: Mathematics
 2023
Citations Analysis
Category Category Repetition
Science: Mathematics33
Science: Mathematics: Instruments and machines: Electronic computers. Computer science18
Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods17
Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software15
Science: Mathematics: Probabilities. Mathematical statistics14
Science: Science (General): Cybernetics: Information theory9
Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware8
Technology: Technology (General): Industrial engineering. Management engineering: Information technology8
Technology: Electrical engineering. Electronics. Nuclear engineering: Telecommunication8
Technology: Electrical engineering. Electronics. Nuclear engineering: Electric apparatus and materials. Electric circuits. Electric networks6
Technology: Engineering (General). Civil engineering (General)4
Science: Physics4
Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics3
Science: Science (General)2
Medicine1
Science1
Technology: Engineering (General). Civil engineering (General): Mechanics of engineering. Applied mechanics1
Science: Physics: Electricity and magnetism: Electricity: Plasma physics. Ionized gases1
Science: Chemistry: Physical and theoretical chemistry1
Technology: Mechanical engineering and machinery1
The category Science: Mathematics 33 is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Foreground memory management in data path synthesis and was published in 1992. The most recent citation comes from a 2024 study titled Breakdown of a concavity property of mutual information for non-Gaussian channels. This article reached its peak citation in 2016, with 7 citations. It has been cited in 37 different journals, 5% of which are open access. Among related journals, the Random Structures & Algorithms cited this research the most, with 7 citations. The chart below illustrates the annual citation trends for this article.
Citations used this article by year