Dimitris Achlioptas

63 papers receiving 3.4k citations

Hit Papers

Explosive Percolation in Random Networks 2009 · 424 citations
4242003202620102018250500750

Peers

Dimitris Achlioptas
Comparison fields: 5 of 119
  • Computational Mathematics 63
  • Computational Theory and Mathematics 1.0k
  • Signal Processing 628
  • Computer Networks and Communications 1.3k
  • Discrete Mathematics and Combinatorics 179
Replace Daniel A. Spielman with:
Daniel A. Spielman United States
Santosh Vempala United States
Felipe Cucker Hong Kong
Don Coppersmith United States
Shang‐Hua Teng United States
Amos Ron United States
Ravi Kannan United States
Gábor Lugosi Spain
Mark Jerrum United Kingdom
Alistair Sinclair United States
Dimitris Achlioptas relative to Daniel A. Spielman United States Daniel A. Spielman's profile →
Citations per field
00.5×2.6×
Daniel A. Spielman · 1×
Citations per year

Countries citing papers authored by Dimitris Achlioptas

Since Specialization
Citations

This map shows the geographic impact of Dimitris Achlioptas's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Dimitris Achlioptas with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Dimitris Achlioptas more than expected).

Fields of papers citing papers by Dimitris Achlioptas

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Dimitris Achlioptas. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Dimitris Achlioptas. The network helps show where Dimitris Achlioptas may publish in the future.

Co-authors

The 25 scholars most cited alongside Dimitris Achlioptas, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.

Border = papers with Dimitris Achlioptas Line = papers co-authored together Dimitris Achlioptas links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown
#Work
1 20211
2
Bad Global Minima Exist and SGD Can Reach Them
20201
3
Local Computation Algorithms for the Lovász Local Lemma
20181
4 20180
5
Stochastic integration via error-correcting codes
20156
6
Flash on rails: consistent flash performance through redundancy
201438
7 20147
8 20131
9 201043
10 200913
11 200410
12 200481
13
Database-friendly random projections: Johnson-Lindenstrauss with binary coins
Hit paper breakdown →
2003756
14 200325
15 200218
16 200171
17 200131
18
Generating Satisfiable Problem Instances
200084
19 200068
20
The Analysis of a List-Coloring Algorithm on a Random Graph (Extended Abstract)
19970

About Dimitris Achlioptas

Dimitris Achlioptas is a scholar working on Discrete Mathematics and Combinatorics, Computational Mathematics, Computer Graphics and Computer-Aided Design, Computational Theory and Mathematics and Computer Networks and Communications, having authored 66 papers that have together received 3.7k indexed citations. Recurring topics across this work include Constraint Satisfaction and Optimization (27 papers), Advanced Graph Theory Research (18 papers), Data Management and Algorithms (14 papers), Limits and Structures in Graph Theory (11 papers), Logic, Reasoning, and Knowledge (10 papers), Complexity and Algorithms in Graphs (7 papers), Computational Geometry and Mesh Generation (7 papers) and semigroups and automata theory (6 papers). The work is most often cited by research in Computational Mathematics (63 citations), Computational Theory and Mathematics (1.0k citations), Signal Processing (628 citations), Computer Networks and Communications (1.3k citations) and Discrete Mathematics and Combinatorics (179 citations). Dimitris Achlioptas has collaborated with scholars based in United States, Canada and Greece. Frequent co-authors include Cristopher Moore, Joel Spencer, Raissa M. D’Souza, Frank McSherry, Yuval Peres, Assaf Naor, Michael Molloy, Federico Ricci‐Tersenghi, Aaron Clauset and David Kempe. Their work appears in journals such as Random Structures and Algorithms, SIAM Journal on Computing, Journal of the ACM, Journal of Computer and System Sciences and Theoretical Computer Science.

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026