Algorithms & Complexity

Algorithm design, graph/streaming algorithms, computational complexity theory.

A topic in the Science corpus, drawn from 394 papers.

Trusted voices in Algorithms & Complexity

Ordered by the trust Algorithms & Complexity's own network concentrates on each researcher, most first.

  1. J. Ross Quinlan — trusted by 1,354 researchers here
  2. Anthony Dewayne Hunt — trusted by 480 researchers here
  3. Rakesh Agrawal — trusted by 467 researchers here
  4. William W. Cohen — trusted by 348 researchers here
  5. Alan M. Frieze — trusted by 366 researchers here
  6. Rayadurgam Srikant — trusted by 362 researchers here
  7. Steven H. Strogatz — trusted by 394 researchers here
  8. Duncan J. Watts — trusted by 392 researchers here
  9. Jeffrey Scott Vitter — trusted by 270 researchers here
  10. Dorin Comaniciu — trusted by 329 researchers here
  11. Peter Meer — trusted by 329 researchers here
  12. Santo Fortunato — trusted by 251 researchers here

Most-cited papers in Algorithms & Complexity

Ordered by the recorded citation count from the source corpus; a citation is not an endorsement.

  1. Fast unfolding of communities in large networks (2008) — 20,244 citations
  2. Classification and Regression by randomForest (2007) — 19,523 citations
  3. Induction of decision trees (2004) — 17,198 citations
  4. Mean Shift: A Robust Approach Toward Feature Space Analysis (2002) — 12,922 citations
  5. A tutorial on support vector regression (2004) — 12,903 citations
  6. Random graphs (2006) — 12,398 citations
  7. Community detection in graphs (2009) — 11,570 citations
  8. Classification and Regression Trees (2000) — 10,793 citations
  9. Cd-hit: a fast program for clustering and comparing large sets of protein or nucleotide sequences (2006) — 10,567 citations
  10. k-means++: the advantages of careful seeding (2007) — 10,497 citations
  11. Fast approximate energy minimization via graph cuts (2001) — 8,381 citations
  12. Dynamic Programming (2018) — 7,395 citations
  13. Top 10 algorithms in data mining (2007) — 5,999 citations
  14. College Admissions and the Stability of Marriage (2013) — 5,836 citations
  15. An Efficient k-Means Clustering Algorithm: Analysis and Implementation (2002) — 5,640 citations
  16. Dynamic Programming (2018) — 3,604 citations
  17. Computational Complexity: A Modern Approach (2009) — 3,126 citations
  18. Fast linear iterations for distributed averaging (2003) — 3,003 citations
  19. Introduction to Algorithms, third edition (2009) — 2,936 citations
  20. Spectra of Graphs (2011) — 2,935 citations
  21. Randomized gossip algorithms (2006) — 2,623 citations
  22. Probability and Computing: Randomized Algorithms and Probabilistic Analysis (2005) — 2,440 citations
  23. Network Applications of Bloom Filters: A Survey (2004) — 2,380 citations
  24. On the Surprising Behavior of Distance Metrics in High Dimensional Spaces (2001) — 2,357 citations
  25. Efficient RANSAC for Point‐Cloud Shape Detection (2007) — 2,286 citations
  26. The Boosting Approach to Machine Learning An Overview (2003) — 2,282 citations
  27. The small-world phenomenon: an algorithmic perspective (2000) — 2,245 citations
  28. Parameterized Complexity Theory (2006) — 2,184 citations
  29. Approximate Dynamic Programming (2007) — 2,143 citations
  30. Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters (2008) — 2,059 citations
  31. Finding frequent items in data streams (2002) — 2,037 citations
  32. Expander Graphs and their Applications (2006) — 2,009 citations
  33. Clustering with Bregman Divergences (2005) — 1,940 citations
  34. Pseudorandom Bits for Polynomials (2007) — 1,931 citations
  35. The Complexity of Decentralized Control of Markov Decision Processes (2000) — 1,758 citations
  36. Gossip-based computation of aggregate information (2003) — 1,713 citations
  37. Coordinate descent algorithms (2015) — 1,641 citations
  38. CMAR: accurate and efficient classification based on multiple class-association rules (2001) — 1,493 citations
  39. Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP (2012) — 1,387 citations
  40. Winnowing: local algorithms for document fingerprinting (2003) — 1,378 citations
  41. Classification and regression trees (2011) — 1,363 citations
  42. Communication Complexity (2016) — 1,331 citations
  43. Automorphisms of Order 2p in Binary Self-Dual Extremal Codes of Length a Multiple of 24 (2013) — 1,317 citations
  44. Opportunistic data structures with applications (2000) — 1,308 citations
  45. PREDICTIVE LEARNING VIA RULE ENSEMBLES (2008) — 1,280 citations
  46. Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs (2016) — 1,137 citations
  47. Informed RRT*: Optimal sampling-based path planning focused via direct sampling of an admissible ellipsoidal heuristic (2014) — 1,105 citations
  48. On the Complexity of Best-Arm Identification in Multi-Armed Bandit Models (2014) — 1,103 citations
  49. Weighted Graph Cuts without Eigenvectors A Multilevel Approach (2007) — 1,091 citations
  50. Introduction to Algorithms, 3rd Edition (2009) — 1,012 citations

Most active researchers

By papers in this topic: a volume measure, not trust.