Daniel S. Hirschberg

Daniel S. Hirschberg's AcademicInfluence.com Rankings

Mathematics

#7513

World Rank

#10203

Historical Rank

Measure Theory

#2240

World Rank

#2689

Historical Rank

mathematics Degrees

Daniel S. Hirschberg

Computer Science

#9930

World Rank

#10417

Historical Rank

computer-science Degrees

Download Badge

Mathematics
Computer Science

Daniel S. Hirschberg's Degrees

PhD Computer Science Stanford University
Masters Computer Science Stanford University

Similar Degrees You Can Earn

Why Is Daniel S. Hirschberg Influential?

(Suggest an Edit or Addition)

(See a Problem?)

Daniel S. Hirschberg's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

A linear space algorithm for computing maximal common subsequences (1975) (1211)
Algorithms for the Longest Common Subsequence Problem (1977) (805)
Data compression (1987) (467)
Bounds on the Complexity of the Longest Common Subsequence Problem (1974) (271)
Computing connected components on parallel computers (1979) (256)
Decentralized extrema-finding in circular configurations of processors (1980) (160)
Self-organizing linear search (1985) (141)
A fast algorithm for optimal length-limited Huffman codes (1990) (133)
Three-Dimensional Stable Matching Problems (1991) (106)
Fast parallel sorting algorithms (1978) (104)
Approximate Algorithms for Some Generalized Knapsack Problems (1976) (89)
The least weight subsequence problem (1987) (84)
An Efficient Implementation of Batcher's Odd-Even Merge Algorithm and Its Application in Parallel Sorting Schemes (1983) (84)
Geometric Thickness of Complete Graphs (1998) (80)
Efficient decoding of prefix codes (1990) (80)
Parallel algorithms for the transitive closure and the connected component problems (1976) (78)
Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes (2005) (65)
A class of dynamic memory allocation algorithms (1973) (63)
A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables (1976) (61)
Small Sample Statistics for Classification Error Rates I: Error Rate Measurements (1996) (54)
Lossless Compression of Chemical Fingerprints Using Integer Entropy Codes Improves Storage and Retrieval (2007) (49)
Lower bounds for the stable marriage problem and its variants (1989) (48)
An Information-Theoretic Lower Bound for the Longest Common Subsequence Problem (1977) (47)
Serial computations of Levenshtein distances (1997) (42)
Speeding Up Chemical Database Searches Using a Proximity Filter Based on the Logical Exclusive OR (2008) (40)
Low power address encoding using self-organizing lists (2001) (36)
Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis (2009) (35)
The Time Complexity of Decision Tree Induction (1995) (34)
Hashing Algorithms and Data Structures for Rapid Searches of Fingerprint Vectors (2010) (31)
Small sample statistics for classi cation error rates II: Con-dence intervals and signi cance tests (1995) (31)
Tight Bounds on the Number of String Subsequences DANIEL S (2000) (25)
Parsing algorithms for dictionary compression on the PRAM (1994) (23)
On the Complexity of Searching a Set of Vectors (1980) (21)
An Intersection Inequality Sharper than the Tanimoto Triangle Inequality for Efficiently Searching Large Databases (2009) (20)
On the Complexity of Learning Decision Trees (1996) (20)
Improved Combinatorial Group Testing for Real-World Problem Sizes (2005) (20)
Streamlining context models for data compression (1991) (19)
Faster Construction of Optimal Binary Split Trees (1986) (19)
Adaptive low-power address encoding techniques using self-organizing lists (2003) (17)
The longest common subsequence problem. (1975) (17)
An insertion technique for one-sided height-balanced trees (1976) (17)
Efficient optimal pagination of scrolls (1985) (16)
Choosing Subsets with Maximum Weighted Average (1997) (16)
Context Modeling for Text Compression (1992) (16)
Dictionary Compression on the PRAM (1997) (15)
Bounds on the Number of String Subsequences (1999) (15)
Bin Packing with Geometric Constraints in Computer Network Design (1978) (15)
PRAM algorithms for static dictionary compression (1994) (12)
New applications of failure functions (1987) (12)
Fully De-Amortized Cuckoo Hashing for Cache-Oblivious Dictionaries and Multimaps (2011) (11)
Complexity of Common Subsequence Problems (1977) (10)
Efficient parallel algorithms for dead sensor diagnosis and multiple access channels (2006) (10)
Average case analysis of a k-CNF learning algorithm (1991) (10)
Combinatorial Pair Testing: Distinguishing Workers from Slackers (2013) (9)
Length-limited coding (1990) (9)
From Discrepancy to Majority (2015) (9)
Subtree weight ratios for optimal binary search trees (1986) (9)
Cache-Oblivious Dictionaries and Multimaps with Negligible Failure Probability (2012) (8)
Small sample statistics for classification error rates (1995) (8)
Efficient power reduction techniques for time multiplexed address buses (2002) (8)
A Lower Worst-Case Complexity for Searching a Dictionary (1978) (8)
Self-organizing search lists using probabilistic back-pointers (1987) (7)
The set-set LCS problem (1989) (7)
Complexity of the stable marriage and stable roommate problems in three dimensions (1988) (7)
Finding Succinct Ordered Minimal Perfect Hash Functions (1994) (6)
Average case analysis of k -CNF and k -DNF learning algorithms (1994) (6)
Effective Compression of Monotone and Quasi-Monotone Sequences of Integers (2008) (5)
Tools for efficient analysis of conurrent software systems (1985) (5)
Average Case Analysis of Marking Algorithms (1986) (4)
Upper and lower bounds for graph-diameter problems with application to record allocation (1979) (4)
The set LCS problem (1987) (4)
Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching (1996) (4)
Average Case Analysis of Learning kappa-CNF Concepts (1992) (4)
Shortest paths in orthogonal graphs (1991) (3)
Combinatorial pattern matching : 7th Annual Symposium, CPM 96, Laguna Beach, California, June 10-12, 1996 : proceedings (1996) (3)
The minimum size required of a solitaire army (2006) (3)
Transpose coding on the systolic array (1992) (3)
A Bounded-Space Tree Traversal Algorithm (1993) (3)
The Least Weight Subsequence Problem (Extended Abstract) (1985) (3)
An Order-2 Context Model for Data Compression With Reduced Time and Space Requirements (1990) (3)
Parallel text compression (1993) (2)
A Parallel Graph Algorithm for Finding Connected Components (1975) (2)
On the Complexity of Vector Searching (1978) (2)
Improved Update/Query Algorithms for the Interval Valuation Problem (1987) (2)
Systolic implementations for transpose coding (1991) (1)
The Traveler's Problem (1992) (1)
Systolic Self-Organizing Lists Under Transpose (1995) (1)
Combinatorial Pattern Matching (1996) (1)
Construction of Optimal Binary Split Trees in the Presence of Bounded Access Probabilities (1988) (1)
THE LEAST WEIGHTSUBS~UENCEPROBLEl\1~ extended abstract (1985) (0)
From Discrepancy to Majority (2017) (0)
_ _Finding Succinct Ordered Minimal Perfect Hashing Function§_ (2015) (0)
Notice : This Materiaf may be protected by Copyright Law ( Title 17 U . S . C . ) Parallel Data Compression (2015) (0)
Self-organizing lists on the Xnet (1992) (0)
Permutations of the elements of matrix by column and row rotations (1972) (0)
An 9rder-2 Context Model for Data Compression With Reduced Time and Space Requirement~ (2015) (0)
Notice : This Material may be protected by Copyright Law ( Title 17 U . S . C . } The Set LCS (2014) (0)
Title 17 U . S . C . ) 0 Data Compression (2014) (0)

This paper list is powered by the following services:

What Schools Are Affiliated With Daniel S. Hirschberg?

Daniel S. Hirschberg is affiliated with the following schools:

Daniel S. Hirschberg's Academic­Influence.com Rankings

Daniel S. Hirschberg's Degrees

Similar Degrees You Can Earn

Why Is Daniel S. Hirschberg Influential?

Daniel S. Hirschberg's Published Works

Published Works

What Schools Are Affiliated With Daniel S. Hirschberg?

Daniel S. Hirschberg's AcademicInfluence.com Rankings