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.
- J. Ross Quinlan — trusted by 1,354 researchers here
- Anthony Dewayne Hunt — trusted by 480 researchers here
- Rakesh Agrawal — trusted by 467 researchers here
- William W. Cohen — trusted by 348 researchers here
- Alan M. Frieze — trusted by 366 researchers here
- Rayadurgam Srikant — trusted by 362 researchers here
- Steven H. Strogatz — trusted by 394 researchers here
- Duncan J. Watts — trusted by 392 researchers here
- Jeffrey Scott Vitter — trusted by 270 researchers here
- Dorin Comaniciu — trusted by 329 researchers here
- Peter Meer — trusted by 329 researchers here
- 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.
- Fast unfolding of communities in large networks (2008) — 20,244 citations
- Classification and Regression by randomForest (2007) — 19,523 citations
- Induction of decision trees (2004) — 17,198 citations
- Mean Shift: A Robust Approach Toward Feature Space Analysis (2002) — 12,922 citations
- A tutorial on support vector regression (2004) — 12,903 citations
- Random graphs (2006) — 12,398 citations
- Community detection in graphs (2009) — 11,570 citations
- Classification and Regression Trees (2000) — 10,793 citations
- Cd-hit: a fast program for clustering and comparing large sets of protein or nucleotide sequences (2006) — 10,567 citations
- k-means++: the advantages of careful seeding (2007) — 10,497 citations
- Fast approximate energy minimization via graph cuts (2001) — 8,381 citations
- Dynamic Programming (2018) — 7,395 citations
- Top 10 algorithms in data mining (2007) — 5,999 citations
- College Admissions and the Stability of Marriage (2013) — 5,836 citations
- An Efficient k-Means Clustering Algorithm: Analysis and Implementation (2002) — 5,640 citations
- Dynamic Programming (2018) — 3,604 citations
- Computational Complexity: A Modern Approach (2009) — 3,126 citations
- Fast linear iterations for distributed averaging (2003) — 3,003 citations
- Introduction to Algorithms, third edition (2009) — 2,936 citations
- Spectra of Graphs (2011) — 2,935 citations
- Randomized gossip algorithms (2006) — 2,623 citations
- Probability and Computing: Randomized Algorithms and Probabilistic Analysis (2005) — 2,440 citations
- Network Applications of Bloom Filters: A Survey (2004) — 2,380 citations
- On the Surprising Behavior of Distance Metrics in High Dimensional Spaces (2001) — 2,357 citations
- Efficient RANSAC for Point‐Cloud Shape Detection (2007) — 2,286 citations
- The Boosting Approach to Machine Learning An Overview (2003) — 2,282 citations
- The small-world phenomenon: an algorithmic perspective (2000) — 2,245 citations
- Parameterized Complexity Theory (2006) — 2,184 citations
- Approximate Dynamic Programming (2007) — 2,143 citations
- Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters (2008) — 2,059 citations
- Finding frequent items in data streams (2002) — 2,037 citations
- Expander Graphs and their Applications (2006) — 2,009 citations
- Clustering with Bregman Divergences (2005) — 1,940 citations
- Pseudorandom Bits for Polynomials (2007) — 1,931 citations
- The Complexity of Decentralized Control of Markov Decision Processes (2000) — 1,758 citations
- Gossip-based computation of aggregate information (2003) — 1,713 citations
- Coordinate descent algorithms (2015) — 1,641 citations
- CMAR: accurate and efficient classification based on multiple class-association rules (2001) — 1,493 citations
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP (2012) — 1,387 citations
- Winnowing: local algorithms for document fingerprinting (2003) — 1,378 citations
- Classification and regression trees (2011) — 1,363 citations
- Communication Complexity (2016) — 1,331 citations
- Automorphisms of Order 2p in Binary Self-Dual Extremal Codes of Length a Multiple of 24 (2013) — 1,317 citations
- Opportunistic data structures with applications (2000) — 1,308 citations
- PREDICTIVE LEARNING VIA RULE ENSEMBLES (2008) — 1,280 citations
- Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs (2016) — 1,137 citations
- Informed RRT*: Optimal sampling-based path planning focused via direct sampling of an admissible ellipsoidal heuristic (2014) — 1,105 citations
- On the Complexity of Best-Arm Identification in Multi-Armed Bandit Models (2014) — 1,103 citations
- Weighted Graph Cuts without Eigenvectors A Multilevel Approach (2007) — 1,091 citations
- Introduction to Algorithms, 3rd Edition (2009) — 1,012 citations
Most active researchers
By papers in this topic: a volume measure, not trust.
- Ping Li — 8 papers
- Edgar Chávez — 4 papers
- Amin Karbasi — 4 papers
- Siegfried Nijssen — 4 papers
- Vahab S. Mirrokni — 4 papers
- Sergei Vassilvitskii — 4 papers
- R. Rivest — 4 papers
- Eric Sadit Tellez — 4 papers
- Anshumali Shrivastava — 4 papers
- Shai Shalev-Shwartz — 3 papers
- Gonzalo Navarro — 3 papers
- Rakesh Agrawal — 3 papers