Jeff Edmonds

2.0k total citations
55 papers, 1.1k citations indexed

About

Jeff Edmonds is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Artificial Intelligence. According to data from OpenAlex, Jeff Edmonds has authored 55 papers receiving a total of 1.1k indexed citations (citations by other indexed papers that have themselves been cited), including 38 papers in Computer Networks and Communications, 27 papers in Computational Theory and Mathematics and 16 papers in Artificial Intelligence. Recurrent topics in Jeff Edmonds's work include Optimization and Search Problems (31 papers), Complexity and Algorithms in Graphs (21 papers) and Distributed systems and fault tolerance (8 papers). Jeff Edmonds is often cited by papers focused on Optimization and Search Problems (31 papers), Complexity and Algorithms in Graphs (21 papers) and Distributed systems and fault tolerance (8 papers). Jeff Edmonds collaborates with scholars based in Canada, United States and United Kingdom. Jeff Edmonds's co-authors include Kirk Pruhs, Michael Luby, Angela A. Albanese, Johannes Blömer, Madhu Sudan, Russell Impagliazzo, Toniann Pitassi, Stephen Cook, Paul Beame and Noga Alon and has published in prestigious journals such as IEEE Transactions on Information Theory, SIAM Journal on Computing and Theoretical Computer Science.

In The Last Decade

Jeff Edmonds

51 papers receiving 1.0k citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Jeff Edmonds Canada	17	659	233	230	221	211	55	1.1k
Harald Räcke United States	16	904 1.4×	279 1.2×	525 2.3×	133 0.6×	43 0.2×	50	1.3k
Lefteris M. Kirousis Greece	17	850 1.3×	100 0.4×	543 2.4×	103 0.5×	127 0.6×	47	1.2k
Irène Charon France	17	393 0.6×	252 1.1×	415 1.8×	42 0.2×	41 0.2×	47	879
Marco Protasi Italy	8	373 0.6×	74 0.3×	500 2.2×	51 0.2×	60 0.3×	29	979
Giorgio Gambosi Italy	13	362 0.5×	71 0.3×	322 1.4×	59 0.3×	41 0.2×	58	878
Liam Roditty Israel	19	471 0.7×	48 0.2×	533 2.3×	132 0.6×	127 0.6×	68	942
Jeffery Westbrook United States	17	479 0.7×	60 0.3×	356 1.5×	71 0.3×	61 0.3×	34	766
Torben Hagerup Germany	19	502 0.8×	117 0.5×	627 2.7×	134 0.6×	101 0.5×	65	1.3k
Shmuel Zaks Israel	18	691 1.0×	310 1.3×	407 1.8×	26 0.1×	59 0.3×	109	1.2k
Satish Rao United States	14	466 0.7×	156 0.7×	607 2.6×	65 0.3×	80 0.4×	30	956

Countries citing papers authored by Jeff Edmonds

Since Specialization

Citations

This map shows the geographic impact of Jeff Edmonds'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 Jeff Edmonds with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jeff Edmonds more than expected).

Fields of papers citing papers by Jeff Edmonds

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Jeff Edmonds. 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 Jeff Edmonds. The network helps show where Jeff Edmonds may publish in the future.

Co-authorship network of co-authors of Jeff Edmonds

This figure shows the co-authorship network connecting the top 25 collaborators of Jeff Edmonds. A scholar is included among the top collaborators of Jeff Edmonds based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Jeff Edmonds. Jeff Edmonds is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Dobrev, Stefan, Jeff Edmonds, Dennis Komm, et al.. (2017). Improved analysis of the online set cover problem with advice. Theoretical Computer Science. 689. 96–107. 2 indexed citations

Edmonds, Jeff & Michael Luby. (2017). Erasure Codes with a Hierarchical Bundle Structure. IEEE Transactions on Information Theory. 1–1. 2 indexed citations

Edmonds, Jeff & José Medina. (2015). Epistemologies of Resistance: Pluralism and Communities of Epistemic Criticism. Philosophy of education. 71. 457–460. 1 indexed citations

Chattopadhyay, Arkadev, Jeff Edmonds, Faith Ellen, & Toniann Pitassi. (2012). A little advice can be very helpful. Symposium on Discrete Algorithms. 615–625. 3 indexed citations

Edmonds, Jeff. (2012). On the competitiveness of AIMD-TCP within a general network. Theoretical Computer Science. 462. 12–22. 3 indexed citations

Edmonds, Jeff, Sungjin Im, & Benjamin Moseley. (2011). Online scalable scheduling for the lk-norms of flow time without conservation of work. Symposium on Discrete Algorithms. 109–119. 15 indexed citations

Chan, Ho-Leung, Jeff Edmonds, & Kirk Pruhs. (2011). Speed Scaling of Processes with Arbitrary Speedup Curves on a Multiprocessor. Theory of Computing Systems. 49(4). 817–833. 17 indexed citations

Edmonds, Jeff & Kirk Pruhs. (2009). Scalably scheduling processes with arbitrary speedup curves. Symposium on Discrete Algorithms. 685–692. 32 indexed citations

Chan, Ho-Leung, Jeff Edmonds, Tak‐Wah Lam, et al.. (2009). Nonclairvoyant Speed Scaling for Flow and Energy. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 15 indexed citations

10.

Edmonds, Jeff. (2008). How to Think About Algorithms. Cambridge University Press eBooks. 10 indexed citations

11.

Edmonds, Jeff & Kirk Pruhs. (2006). Cake cutting really is not a piece of cake. Symposium on Discrete Algorithms. 271–278. 21 indexed citations

12.

Edmonds, Jeff & Kirk Pruhs. (2004). A maiden analysis of Longest Wait First. Symposium on Discrete Algorithms. 818–827. 5 indexed citations

13.

Edmonds, Jeff, et al.. (2003). Mining for empty spaces in large data sets. Theoretical Computer Science. 296(3). 435–452. 34 indexed citations

14.

Edmonds, Jeff, Suprakash Datta, & Patrick Dymond. (2003). TCP is competitive against a limited adversary. 174–183. 4 indexed citations

15.

Edmonds, Jeff & Kirk Pruhs. (2002). Broadcast scheduling: when fairness is fine. Symposium on Discrete Algorithms. 421–430. 18 indexed citations

16.

Edmonds, Jeff, et al.. (2002). Time-space lower bounds for directed s-t connectivity on JAG models. 17. 228–237. 3 indexed citations

17.

Beame, Paul, Stephen Cook, Jeff Edmonds, Russell Impagliazzo, & Toniann Pitassi. (1998). The Relative Complexity of NP Search Problems. Journal of Computer and System Sciences. 57(1). 3–19. 60 indexed citations

18.

Edmonds, Jeff. (1997). Removing Ramsey theory: Lower bounds with smaller domain size. Theoretical Computer Science. 172(1-2). 1–41. 1 indexed citations

19.

Albanese, Angela A., Johannes Blömer, Jeff Edmonds, Michael Luby, & Madhu Sudan. (1996). Priority encoding transmission. IEEE Transactions on Information Theory. 42(6). 1737–1744. 375 indexed citations

20.

Alon, Noga, Jeff Edmonds, & Michael Luby. (1995). Linear Time Erasure Codes with Nearly Optimal Recovery (Extended Abstract).. 512–519. 2 indexed citations

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