Daniel S. Hirschberg

2.0k total citations
28 papers, 1.2k citations indexed

About

Daniel S. Hirschberg is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Daniel S. Hirschberg has authored 28 papers receiving a total of 1.2k indexed citations (citations by other indexed papers that have themselves been cited), including 16 papers in Artificial Intelligence, 15 papers in Computational Theory and Mathematics and 9 papers in Computer Networks and Communications. Recurrent topics in Daniel S. Hirschberg's work include Algorithms and Data Compression (15 papers), Analytical Chemistry and Chromatography (4 papers) and Computational Drug Discovery Methods (4 papers). Daniel S. Hirschberg is often cited by papers focused on Algorithms and Data Compression (15 papers), Analytical Chemistry and Chromatography (4 papers) and Computational Drug Discovery Methods (4 papers). Daniel S. Hirschberg collaborates with scholars based in United States. Daniel S. Hirschberg's co-authors include Debra A. Lelewer, Lawrence L. Larmore, Pierre Baldi, David Eppstein, Michael B. Dillencourt, S. Joshua Swamidass, Ryan W. Benz, Mireille Régnier, Eugene W. Myers and Michael T. Goodrich and has published in prestigious journals such as Communications of the ACM, ACM Computing Surveys and Journal of the ACM.

In The Last Decade

Daniel S. Hirschberg

27 papers receiving 1.1k citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Daniel S. Hirschberg United States 14 694 351 316 283 178 28 1.2k
Ming‐Yang Kao United States 23 502 0.7× 774 2.2× 418 1.3× 411 1.5× 127 0.7× 92 1.6k
Derick Wood Canada 21 927 1.3× 401 1.1× 725 2.3× 289 1.0× 233 1.3× 152 1.7k
Andrej Krevl Slovenia 3 767 1.1× 577 1.6× 194 0.6× 114 0.4× 527 3.0× 4 1.8k
Giorgio Ausiello Italy 18 485 0.7× 718 2.0× 733 2.3× 90 0.3× 94 0.5× 68 1.7k
Srinivasa Rao Satti South Korea 19 924 1.3× 749 2.1× 603 1.9× 286 1.0× 190 1.1× 70 1.6k
Jacques Cohen United States 19 556 0.8× 330 0.9× 259 0.8× 155 0.5× 28 0.2× 62 1.1k
Harry B. Hunt United States 21 559 0.8× 693 2.0× 1.0k 3.3× 213 0.8× 48 0.3× 97 1.8k
Torsten Schaub Germany 26 2.2k 3.2× 483 1.4× 456 1.4× 164 0.6× 72 0.4× 172 2.6k
Daniel P. Miranker United States 21 947 1.4× 682 1.9× 127 0.4× 255 0.9× 120 0.7× 100 1.5k
Friedhelm Meyer auf der Heide Germany 20 377 0.5× 725 2.1× 406 1.3× 54 0.2× 171 1.0× 116 1.3k

Countries citing papers authored by Daniel S. Hirschberg

Since Specialization
Citations

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

Fields of papers citing papers by Daniel S. Hirschberg

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Daniel S. Hirschberg

This figure shows the co-authorship network connecting the top 25 collaborators of Daniel S. Hirschberg. A scholar is included among the top collaborators of Daniel S. Hirschberg 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 Daniel S. Hirschberg. Daniel S. Hirschberg 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.
Hirschberg, Daniel S., et al.. (2010). Hashing Algorithms and Data Structures for Rapid Searches of Fingerprint Vectors. Journal of Chemical Information and Modeling. 50(8). 1358–1368. 23 indexed citations
2.
Baldi, Pierre & Daniel S. Hirschberg. (2009). An Intersection Inequality Sharper than the Tanimoto Triangle Inequality for Efficiently Searching Large Databases. Journal of Chemical Information and Modeling. 49(8). 1866–1870. 15 indexed citations
3.
Hirschberg, Daniel S., et al.. (2008). Effective Compression of Monotone and Quasi-Monotone Sequences of Integers. 520–520. 3 indexed citations
4.
Baldi, Pierre, et al.. (2008). Speeding Up Chemical Database Searches Using a Proximity Filter Based on the Logical Exclusive OR. Journal of Chemical Information and Modeling. 48(7). 1367–1378. 27 indexed citations
5.
Dillencourt, Michael B., David Eppstein, & Daniel S. Hirschberg. (2000). Geometric Thickness of Complete Graphs. Journal of Graph Algorithms and Applications. 4(3). 5–17. 38 indexed citations
6.
Hirschberg, Daniel S., et al.. (1997). Dictionary Compression on the Pram. Parallel Processing Letters. 7(3). 297–308. 7 indexed citations
7.
Seiden, Steven S. & Daniel S. Hirschberg. (1994). Finding succinct ordered minimal perfect hash functions. Information Processing Letters. 51(6). 283–288.
8.
Hirschberg, Daniel S., et al.. (1993). Parallel text compression. eScholarship (California Digital Library). 6 indexed citations
9.
Hirschberg, Daniel S., et al.. (1991). Systolic implementations for transpose coding. eScholarship (California Digital Library). 1 indexed citations
10.
Hirschberg, Daniel S. & Michael J. Pazzani. (1991). Average case analysis of a k-CNF learning algorithm. eScholarship (California Digital Library). 2 indexed citations
11.
Hirschberg, Daniel S., et al.. (1991). Three-Dimensional Stabl Matching Problems. SIAM Journal on Discrete Mathematics. 4(2). 245–252. 56 indexed citations
12.
Hirschberg, Daniel S., et al.. (1991). Parallel data compression. eScholarship (California Digital Library). 1 indexed citations
13.
Larmore, Lawrence L. & Daniel S. Hirschberg. (1990). Length-limited coding. Symposium on Discrete Algorithms. 310–318. 7 indexed citations
14.
Lelewer, Debra A. & Daniel S. Hirschberg. (1990). An order-2 context model for data compression with reduced time and space requirements. eScholarship (California Digital Library). 3 indexed citations
15.
Larmore, Lawrence L. & Daniel S. Hirschberg. (1990). A fast algorithm for optimal length-limited Huffman codes. Journal of the ACM. 37(3). 464–473. 74 indexed citations
16.
Hirschberg, Daniel S. & Debra A. Lelewer. (1990). Efficient decoding of prefix codes. Communications of the ACM. 33(4). 449–459. 45 indexed citations
17.
Hirschberg, Daniel S., et al.. (1990). Lower Bounds for the Stable Marriage Problem and Its Variants. SIAM Journal on Computing. 19(1). 71–77. 21 indexed citations
18.
Hirschberg, Daniel S., et al.. (1988). Complexity of the stable marriage and stable roommate problems in three dimensions. eScholarship (California Digital Library). 2 indexed citations
19.
Lelewer, Debra A. & Daniel S. Hirschberg. (1987). Data compression. ACM Computing Surveys. 19(3). 261–296. 257 indexed citations
20.
Hirschberg, Daniel S.. (1973). A class of dynamic memory allocation algorithms. Communications of the ACM. 16(10). 615–618. 45 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

Rankless by CCL
2026