search
Get Started
search

Top Results for Randomized Algorithms

Filter by Tags

Rankings use category fit, feature coverage, pricing signals, public reception, and recency. Affiliate relationships do not affect scores.

0.0 - 10.0
31 Ravi Kannan

Ravi Kannan is an Indian computer scientist known for his contributions to theoretical computer science and applied mathematics. He is affiliated with Microsoft Research India and has held academic positions including at Carnegie Mellon University and Yale University. His work includes foundational...

8.42 Great
Why this score

Randomized algorithms, lattices, and learning theory contributions are substantial; major theoretical reputation.

Scoring methodology
32 Micha Sharir

Micha Sharir is an Israeli mathematician and computer scientist at Tel Aviv University. He is known for proving sharp bounds in combinatorial and computational geometry, including foundational results on Davenport-Schinzel sequences and their applications. His research has also contributed to algori...

8.41 Great
Why this score

Combinatorial and computational geometry work is highly regarded; elite specialist reputation.

Scoring methodology
33 Prabhakar Raghavan

Prabhakar Raghavan is an Indian-American computer scientist known for his research in algorithms, randomized methods, and information retrieval. He co-authored the textbook 'Randomized Algorithms' with Rajeev Motwani and has held senior leadership roles at Yahoo Research and Google. His academic wor...

8.41 Great
Why this score

Randomized algorithms, web search, and senior research leadership give broad influence; less singular than top algorithm theorists.

Scoring methodology
34 David Karger

David Karger is an American computer scientist at MIT known for his work in algorithms and graph theory. He developed Karger's algorithm for finding minimum cuts in graphs, a randomized approach that has become a standard topic in algorithm design courses. His research also includes contributions to...

8.39 Great
Why this score

Randomized min-cut and algorithms contributions are highly respected; strong but more specialized than top algorithms laureates.

Scoring methodology
35 Herbert Edelsbrunner

Herbert Edelsbrunner is an Austrian computer scientist known for founding topological data analysis and making fundamental contributions to computational geometry. His work includes algorithms for geometric computation, computational topology, and alpha shapes, a technique for representing the shape...

8.35 Great
Why this score

Computational geometry and topological data analysis contributions are highly respected; strong cross-disciplinary influence.

Scoring methodology
36 Ryan Williams

Ryan Williams is an American theoretical computer scientist at MIT. He is known for proving circuit complexity lower bounds and for revealing algorithmic connections between circuit complexity and algorithm design. His research has contributed to understanding the relationships between computational...

8.35 Great
Why this score

Circuit lower bounds and algorithms-complexity connections are major recent theory results; reputation strong but still maturing.

Scoring methodology
37 Venkatesan Guruswami

Venkatesan Guruswami is a computer scientist specializing in coding theory, computational complexity, and algorithms. His work with Madhu Sudan on list-decodable codes advanced error-correcting code theory by showing how to decode beyond the traditional error-correction radius. Guruswami serves as a...

8.33 Great
Why this score

Capacity-achieving list decoding and coding theory contributions are influential; strong theoretical reputation.

Scoring methodology
38 Virginia Vassilevska Williams

Virginia Vassilevska Williams is a computer scientist at MIT specializing in algorithm design and computational complexity theory. She has worked on the analysis of matrix multiplication algorithms, including improvements to upper bounds on their computational complexity. Williams has developed fine...

8.22 Great
Why this score

Fast matrix multiplication and fine-grained complexity work are highly regarded; strong modern theoretical impact.

Scoring methodology
39 Vijay Vazirani

Vijay Vazirani is a computer scientist who works on approximation algorithms, matching theory, and algorithmic game theory. He co-developed algorithms for finding maximum matchings in graphs and wrote the textbook "Approximation Algorithms." Vazirani's work has helped establish approximation algorit...

8.20 Great
Why this score

Approximation algorithms textbook and foundational results are widely respected; strong educational and research impact.

Scoring methodology
40 Erik Demaine

Erik Demaine is a computer scientist at MIT who works in computational geometry, algorithms, and the mathematics of origami. He joined MIT as a faculty member at age 20, making him the youngest professor in the institution's history at that time. Demaine has researched the computational complexity o...

8.18 Great
Why this score

Computational origami and algorithms work are highly visible and respected; broad outreach plus strong research.

Scoring methodology
41 Daniel Shiffman Nature of Code (YouTube)

Daniel Shiffman’s “Nature of Code” is a comprehensive instructional video series for learning creative coding using Processing. The series demonstrates fundamental programming concepts through visually engaging physics simulations. It teaches viewers how algorithms create dynamic movement and intera...

42 Mikkel Thorup

Mikkel Thorup is a Danish computer scientist and professor at the University of Copenhagen. He is recognized for his significant contributions to the design and analysis of algorithms, particularly in graph theory and hashing. In 1996, while working at Bell Labs, he developed a deterministic shortes...

8.09 Great
Why this score

Hashing, shortest paths, and algorithmic data structures work are highly cited; strong theory reputation.

Scoring methodology
43 Edsger Dijkstra

Edsger Dijkstra was a Dutch computer scientist whose work fundamentally shaped the field of computer science. He developed the seminal Dijkstra’s Algorithm for finding the shortest path between nodes in a graph, now widely taught globally. His innovations extended to programming methodology and dist...

44 Satish Rao
Satish Rao

Satish Rao is an American computer scientist and professor at UC Berkeley. He is known for foundational contributions to approximation algorithms for graph partitioning and multicommodity flow problems, including work with Tom Leighton on flow-based graph decomposition. His research has influenced a...

7.93 Good
Why this score

Graph partitioning and approximation algorithms contributions are respected; strong specialist reputation.

Scoring methodology
45 Pankaj Agarwal

Pankaj Agarwal is a Duke University professor known for range searching, geometric approximation algorithms, and co-authoring the comprehensive text Davenport-Schinzel Sequences and Their Geometric Applications.

7.91 Good
Why this score

Range searching and geometric algorithms textbook influence are strong; respected computational geometry reputation.

Scoring methodology
46 David Shmoys

David Shmoys is an American computer scientist and professor at Cornell University. He is known for foundational contributions to the design and analysis of approximation algorithms for combinatorial optimization problems, with applications to scheduling, network design, and facility location. He co...

7.88 Good
Why this score

Approximation algorithms and combinatorial optimization work are respected; strong specialist reputation.

Scoring methodology
47 Timothy Chan

Timothy Chan is a Canadian computer scientist and professor at the University of Illinois at Urbana-Champaign. He is known for contributions to computational geometry and algorithms, including output-sensitive algorithms for convex hull computation and improved bounds for geometric problems in two a...

7.83 Good
Why this score

Computational geometry algorithms and output-sensitive results are influential; strong specialist consensus.

Scoring methodology
48 Crazyhouse960

Crazyhouse960 is a hybrid chess variant that combines the mechanics of two distinct chess variations. It merges the drop mechanic of Crazyhouse, where captured pieces return to the board in the opponent's hand to be placed as their own, with the randomized starting positions of Chess960, also known...

49 Franco Preparata

Franco Preparata is an Italian-American computer scientist at Brown University who co-authored with Michael Shamos the foundational 1985 textbook "Computational Geometry: An Introduction," which helped establish computational geometry as a distinct field. His research spans computational geometry, a...

7.82 Good
Why this score

Computational geometry textbook and research helped define the field; strong specialist historical reputation.

Scoring methodology
50 Michael Scott

Michael Scott is a computer scientist and professor at the University of Rochester known for developing the Michael-Scott non-blocking queue algorithm, one of the first practical lock-free concurrent data structures to be widely implemented. This algorithm, published in 1996, has become a fundamenta...

7.82 Good
Why this score

Michael-Scott queue is canonical in lock-free concurrency; respected systems reputation with specialized impact.

Scoring methodology
51 Kunal Talwar

Kunal Talwar is a computer scientist who has worked at Microsoft Research and Google, making significant theoretical contributions to differential privacy and its applications. His research includes developing improved mechanisms for releasing high-dimensional statistical data while preserving priva...

7.78 Good
Why this score

Differential privacy mechanisms and theory contributions are respected; specialist impact is substantial.

Scoring methodology
52 David Eppstein

David Eppstein is an American computer scientist who currently serves as a Chancellor's Professor of Computer Science at the University of California, Irvine. He is widely recognized for his extensive academic contributions to the fields of computational geometry, graph drawing, and graph algorithms...

7.72 Good
Why this score

Graph algorithms, geometry, and expository influence are respected; broad but less award-dominant profile.

Scoring methodology
53 Michael Shamos

Michael Shamos is a computer scientist and attorney at Carnegie Mellon University who specializes in computational geometry, algorithms, and digital law. He is widely recognized for his foundational role in computational geometry, notably co-authoring the textbook "Computational Geometry: An Introdu...

7.70 Good
Why this score

Computational geometry founding dissertation and CMU work are respected; less broad recognition than later field leaders.

Scoring methodology
54 The Social Dilemma

While not solely focused on AI, The Social Dilemma powerfully illustrates how AI algorithms drive social media platforms and manipulate user behavior. The film features former employees of major tech companies who reveal the inner workings of these platforms and the addictive nature of their designs...

7.67 Good
Why this score

Critics and viewers praise its accessible warnings and expert interviews, while dramatized scenes and simplified arguments temper its documentary credibility.

Scoring methodology
55 Chess 480
Chess 480

Chess 480 is a chess variant developed by Reinhard Scharnagl as a more restricted starting-position system related to Chess960. Instead of permitting all 960 Chess960 arrangements, it uses 480 positions selected to preserve a symmetrical and balanced placement of the back-rank pieces. The game is fo...

7.48 Good
Why this score

Its curated starting positions address some Chess960 irregularities, but adoption, event support, and theoretical development remain comparatively small.

Scoring methodology
56 OpenEvolve
OpenEvolve

OpenEvolve is an open-source extension for LangChain that automates the process of fine-tuning large language models using reinforcement learning from human feedback (RLHF), optimizing them for specific tasks and datasets.

57 Mary Wootters

Mary Wootters is a theoretical computer scientist and associate professor at Stanford University, where she specializes in the field of electrical engineering and computer science. Her research focuses on coding theory, randomized algorithms, and list decoding, particularly their applications in err...

7.30 Good
Why this score

Coding theory and randomized algorithms work are respected; younger profile and narrower consensus impact.

Scoring methodology
58 Atri Rudra
Atri Rudra

Computer scientist at SUNY Buffalo known for research in coding theory and list decoding, and co-author of a comprehensive open textbook on essential coding theory.

7.23 Good
Why this score

Coding theory research and open textbook are valued; solid but specialized reputation.

Scoring methodology
59 Richard Karp

Richard Karp was a prominent American computer scientist whose research fundamentally impacted theoretical computer science. He demonstrated that numerous real-world problems, including many encountered in practical algorithm design, fall into the NP-complete category. This work established complexi...

60 AlphaEvolve

AlphaEvolve is a browser extension that enhances ChatGPT and other AI models by enabling users to create, manage, and execute complex, multi-step workflows called "evolutions" for more sophisticated tasks.

Loading more...

Save to your list

Save your favorites and follow how their scores change over time.

Save favorites
Track changes
Compare scores

Already have an account? Sign in

Compare Items

See how they stack up against each other

Comparing
VS
Select 1 more item to compare