Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Analytic Combinatorics
20091.1k citationsPhilippe Flajolet, Robert Sedgewickprofile →
Countries citing papers authored by Robert Sedgewick
Since
Specialization
Citations
This map shows the geographic impact of Robert Sedgewick'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 Robert Sedgewick with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Robert Sedgewick more than expected).
Fields of papers citing papers by Robert Sedgewick
This network shows the impact of papers produced by Robert Sedgewick. 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 Robert Sedgewick. The network helps show where Robert Sedgewick may publish in the future.
Co-authorship network of co-authors of Robert Sedgewick
This figure shows the co-authorship network connecting the top 25 collaborators of Robert Sedgewick.
A scholar is included among the top collaborators of Robert Sedgewick 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 Robert Sedgewick. Robert Sedgewick is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Sedgewick, Robert & Kevin Wayne. (2015). Algorithms: 24-part Lecture Series.1 indexed citations
2.
Sedgewick, Robert. (2015). Algorithms In Java: Third Edition.
Dementiev, Roman, Lutz Kettner, Peter Sanders, et al.. (2004). Engineering a Sorted List Data Structure for 32 Bit Key. Max Planck Institute for Plasma Physics. 142–151.3 indexed citations
5.
Sedgewick, Robert. (2003). Algorithms in Java. Addison-Wesley eBooks.27 indexed citations
6.
Sedgewick, Robert. (2001). Algorithms in c, part 5: graph algorithms, third edition.27 indexed citations
7.
Sedgewick, Robert, et al.. (1998). Algorithms in Java, Third Edition, Parts 1-4: Fundamentals, Data Structures, Sorting, Searching. Addison-Wesley Longman Publishing Co., Inc. eBooks.24 indexed citations
8.
Sedgewick, Robert & Christopher J. Van Wyk. (1998). Algorithms in C++: Fundamentals, Data Structures, Sorting, Searching. Addison-Wesley Longman Publishing Co., Inc. eBooks.18 indexed citations
Sedgewick, Robert. (1985). Proceedings of the seventeenth annual ACM symposium on Theory of computing.24 indexed citations
17.
Incerpi, Janet & Robert Sedgewick. (1985). Improved upper bounds on shellsort. Journal of Computer and System Sciences. 31(2). 210–224.20 indexed citations
18.
Brown, Marc H. & Robert Sedgewick. (1984). Progress report. ACM SIGCSE Bulletin. 16(1). 91–101.13 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.