Adam L. Buchsbaum

1.3k total citations
41 papers, 623 citations indexed

About

Adam L. Buchsbaum is a scholar working on Artificial Intelligence, Computer Networks and Communications and Computational Theory and Mathematics. According to data from OpenAlex, Adam L. Buchsbaum has authored 41 papers receiving a total of 623 indexed citations (citations by other indexed papers that have themselves been cited), including 29 papers in Artificial Intelligence, 16 papers in Computer Networks and Communications and 15 papers in Computational Theory and Mathematics. Recurrent topics in Adam L. Buchsbaum's work include Algorithms and Data Compression (16 papers), Machine Learning and Algorithms (8 papers) and Formal Methods in Verification (5 papers). Adam L. Buchsbaum is often cited by papers focused on Algorithms and Data Compression (16 papers), Machine Learning and Algorithms (8 papers) and Formal Methods in Verification (5 papers). Adam L. Buchsbaum collaborates with scholars based in United States, Italy and France. Adam L. Buchsbaum's co-authors include Jeffery Westbrook, Jan P. H. van Santen, Raffaele Giancarlo, Haim Kaplan, Anne Rogers, Robert E. Tarjan, Glenn S. Fowler, Suresh Venkatasubramanian, Michael H. Goldwasser and James S. Plank and has published in prestigious journals such as Journal of the ACM, SIAM Journal on Computing and IEEE Software.

In The Last Decade

Adam L. Buchsbaum

40 papers receiving 551 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Adam L. Buchsbaum United States 14 333 296 202 96 72 41 623
Eljas Soisalon-Soininen Finland 13 283 0.8× 286 1.0× 162 0.8× 108 1.1× 78 1.1× 70 624
Stephen Alstrup Denmark 14 281 0.8× 194 0.7× 300 1.5× 104 1.1× 94 1.3× 43 604
Funda Ergün United States 14 281 0.8× 251 0.8× 251 1.2× 43 0.4× 45 0.6× 31 565
Irene Finocchi Italy 15 186 0.6× 323 1.1× 131 0.6× 75 0.8× 127 1.8× 63 658
Desh Ranjan United States 10 182 0.5× 186 0.6× 187 0.9× 58 0.6× 21 0.3× 30 500
Rüdiger Reischuk Germany 10 372 1.1× 326 1.1× 396 2.0× 18 0.2× 83 1.2× 53 723
Alan Siegel United States 11 262 0.8× 220 0.7× 230 1.1× 48 0.5× 50 0.7× 34 521
Krzysztof Onak United States 16 364 1.1× 275 0.9× 401 2.0× 74 0.8× 29 0.4× 36 652
Flemming Friche Rodler Denmark 7 382 1.1× 599 2.0× 93 0.5× 71 0.7× 240 3.3× 7 888
Oren Weimann Israel 11 234 0.7× 131 0.4× 177 0.9× 62 0.6× 45 0.6× 40 423

Countries citing papers authored by Adam L. Buchsbaum

Since Specialization
Citations

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

Fields of papers citing papers by Adam L. Buchsbaum

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Adam L. Buchsbaum

This figure shows the co-authorship network connecting the top 25 collaborators of Adam L. Buchsbaum. A scholar is included among the top collaborators of Adam L. Buchsbaum 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 Adam L. Buchsbaum. Adam L. Buchsbaum 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.
Buchsbaum, Adam L., Raffaele Giancarlo, & Balázs Rácz. (2008). New results for finding common neighborhoods in massive graphs in the data stream model. Theoretical Computer Science. 407(1-3). 302–309. 2 indexed citations
2.
Buchsbaum, Adam L., Emden R. Gansner, Cecilia M. Procopiuc, & Suresh Venkatasubramanian. (2008). Rectangular layouts and contact graphs. ACM Transactions on Algorithms. 4(1). 1–28. 12 indexed citations
3.
Buchsbaum, Adam L., Haim Kaplan, Anne Rogers, & Jeffery Westbrook. (2005). Corrigendum: a new, simpler linear-time dominators algorithm. ACM Transactions on Programming Languages and Systems. 27(3). 383–387. 8 indexed citations
4.
Buchsbaum, Adam L., et al.. (2003). Fast Prefix Matching of Bounded Strings.. 128–140. 1 indexed citations
5.
Buchsbaum, Adam L., Raffaele Giancarlo, & Jeffery Westbrook. (2003). On finding common neighborhoods in massive graphs. Theoretical Computer Science. 299(1-3). 707–718. 13 indexed citations
6.
Buchsbaum, Adam L., Glenn S. Fowler, & Raffaele Giancarlo. (2003). Improving table compression with combinatorial optimization. Journal of the ACM. 50(6). 825–851. 28 indexed citations
7.
Buchsbaum, Adam L., Howard Karloff, Claire Kenyon, Nick Reingold, & Mikkel Thorup. (2003). OPT versus LOAD in dynamic storage allocation. 1 indexed citations
8.
Buchsbaum, Adam L., Haim Kaplan, Anne Rogers, & Jeffery Westbrook. (2002). Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification, and Dominators. arXiv (Cornell University). 1 indexed citations
9.
Buchsbaum, Adam L., Glenn S. Fowler, & Raffaele Giancarlo. (2002). Improving table compression with combinatorial optimization. Symposium on Discrete Algorithms. 213–222. 4 indexed citations
10.
Buchsbaum, Adam L., et al.. (2001). Visualizing and analyzing software infrastructures. IEEE Software. 18(5). 62–70. 10 indexed citations
11.
Buchsbaum, Adam L. & Jack Snoeyink. (2001). Algorithm Engineering and Experimentation. Lecture notes in computer science. 1 indexed citations
12.
Buchsbaum, Adam L., et al.. (2000). Engineering the compression of massive tables: an experimental approach. Symposium on Discrete Algorithms. 175–184. 37 indexed citations
13.
Buchsbaum, Adam L., et al.. (2000). Maintaining hierarchical graph views. Symposium on Discrete Algorithms. 566–575. 21 indexed citations
14.
Buchsbaum, Adam L., Michael H. Goldwasser, Suresh Venkatasubramanian, & Jeffery Westbrook. (2000). On external memory graph traversal. Symposium on Discrete Algorithms. 859–860. 65 indexed citations
15.
Bellovin, Steven M., Adam L. Buchsbaum, & S. Muthukrishnan. (1999). TCP Compression Filter. Columbia Academic Commons (Columbia University). 1 indexed citations
16.
Alshawi, Hiyan, Adam L. Buchsbaum, & Fei Xia. (1997). A comparison of head transducers and transfer for a limited domain translation application. 360–365. 12 indexed citations
17.
Buchsbaum, Adam L. & Jan P. H. van Santen. (1996). Selecting training inputs via greedy rank covering. Symposium on Discrete Algorithms. 288–295. 5 indexed citations
18.
Buchsbaum, Adam L., et al.. (1995). Data-Structural Bootstrapping, Linear Path Compression, and Catenable Heap-Ordered Double-Ended Queues. SIAM Journal on Computing. 24(6). 1190–1206. 9 indexed citations
19.
Buchsbaum, Adam L. & Robert E. Tarjan. (1993). Confluently persistent deques via data structuaral bootstrapping. Symposium on Discrete Algorithms. 18(3). 155–164. 16 indexed citations
20.
Buchsbaum, Adam L., Paris C. Kanellakis, & Jeffrey Scott Vitter. (1990). A data structure for arc insertion and regular path finding. Symposium on Discrete Algorithms. 22–31. 10 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

Breakdown of academic impact, for papers by Eljas Soisalon-Soininen Breakdown of academic impact, for papers by Stephen Alstrup Breakdown of academic impact, for papers by Funda Ergün Breakdown of academic impact, for papers by Irene Finocchi Breakdown of academic impact, for papers by Desh Ranjan Breakdown of academic impact, for papers by Rüdiger Reischuk Breakdown of academic impact, for papers by Alan Siegel Breakdown of academic impact, for papers by Krzysztof Onak Breakdown of academic impact, for papers by Flemming Friche Rodler Breakdown of academic impact, for papers by Oren Weimann
Rankless by CCL
2026