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