Daniel S. Hirschberg

29 papers receiving 1.1k citations

Daniel S. Hirschberg's Hit Papers

Algorithms for the Longest Common Subsequence Problem 1977 · 500 citations
5000+16+32Years since publication100200300400500

Peers

Daniel S. Hirschberg
Comparison fields: 5 of 99
  • Hardware and Architecture 165
  • Artificial Intelligence 703
  • Computational Theory and Mathematics 314
  • Computer Networks and Communications 354
  • Signal Processing 140
Replace D. S. Hirschberg with:
D. S. Hirschberg United States
Ming‐Yang Kao United States
Giorgio Ausiello Italy
Yehoshua Perl United States
Jacques Cohen United States
Yahiko Kambayashi Japan
Wojciech Rytter Poland
Alan Gibbons United Kingdom
Derick Wood Canada
Harry B. Hunt United States
Daniel S. Hirschberg relative to D. S. Hirschberg United States D. S. Hirschberg's profile →
Citations per field
00.5×1.5×2.3×
D. S. Hirschberg · 1×
Citations per year

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-authors

The 13 scholars most cited alongside Daniel S. Hirschberg, 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 Daniel S. Hirschberg Line = papers co-authored together Daniel S. Hirschberg links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown

Showing the 20 most-cited of 29 papers — load more, or switch the sort, to bring in the rest.

#Work
1
Algorithms for the Longest Common Subsequence Problem
Hit paper breakdown →
1977500
2 1987261
3 199074
4 199156
5 197345
6 199045
7 200742
8 200039
9 200827
10 201023
11
Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis
200921
12 199021
13
Tight Bounds on the Number of String Subsequences
200016
14 200915
15
The longest common subsequence problem.
197514
16 19907
17 19977
18 19977
19
Parallel text compression
19936
20 20064

About Daniel S. Hirschberg

Daniel S. Hirschberg is a scholar working on Artificial Intelligence, Computational Theory and Mathematics, Computer Networks and Communications, Molecular Biology and Hardware and Architecture, having authored 29 papers that have together received 1.3k indexed citations. Recurring topics across this work include Algorithms and Data Compression (15 papers), Computational Drug Discovery Methods (4 papers), Analytical Chemistry and Chromatography (4 papers), Network Packet Processing and Optimization (3 papers), Advanced Data Storage Technologies (3 papers), Game Theory and Voting Systems (3 papers), Error Correcting Code Techniques (3 papers) and DNA and Biological Computing (3 papers). The work is most often cited by research in Hardware and Architecture (165 citations), Artificial Intelligence (703 citations), Computational Theory and Mathematics (314 citations), Computer Networks and Communications (354 citations) and Signal Processing (140 citations). Daniel S. Hirschberg has collaborated with scholars based in United States and France. Frequent co-authors include Debra A. Lelewer, Lawrence L. Larmore, Pierre Baldi, David Eppstein, Michael T. Goodrich, Michael B. Dillencourt, Ryan W. Benz, S. Joshua Swamidass, Mireille Régnier and Eugene W. Myers. Their work appears in journals such as Journal of Chemical Information and Modeling, Journal of the ACM, Communications of the ACM, SIAM Journal on Discrete Mathematics and Journal of Algorithms.

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