D. S. Hirschberg - Concepedia

Author

D. S. Hirschberg

University of California, Irvine

Also Known As

D. S. Hirschberg, D.S Hirschberg, D.S. Hirschberg, DanielS. Hirschberg

Publications

2.7K

Citations

H-Index

Concepts

All Affiliations

University of California, Irvine Rice University IBM Research - Thomas J. Watson Research Center Princeton University IBM (United States)

About

D. S. Hirschberg is an author at University of California, Irvine specializing in engineering, computational complexity, and computer science.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	16	20	2.4K
2	Computer Engineering	7	7	669
3	Education	2	2	97
4	Management	1	1	13
5	Natural Sciences	1	1	247

D. S. Hirschberg

Publications

2.5K

Citations

H-Index

Page 1

	Year	Citations
A linear space algorithm for computing maximal common subsequences D. S. Hirschberg Communications of the ACM Mathematical ProgrammingLongest Common SubsequenceLinear SpaceEngineeringData Mining	1975	1.1K
Computing connected components on parallel computers D. S. Hirschberg, Ashok K. Chandra, D.V. Sarwate Communications of the ACM Cluster ComputingDirected GraphEngineeringComputer ArchitectureComputational Complexity	1979	266
Bounds on the Complexity of the Longest Common Subsequence Problem Jeffrey D. Ullman, Alfred V. Aho, D. S. Hirschberg Journal of the ACM Computational Complexity TheoryEngineeringGeneral Lower BoundComputational ComplexitySequence Alignment	1976	247
Decentralized extrema-finding in circular configurations of processors D. S. Hirschberg, James B. Sinclair Communications of the ACM Mathematical ProgrammingComputational Complexity TheoryEngineeringAnalysis Of AlgorithmComputer Architecture	1980	191
Fast parallel sorting algorithms D. S. Hirschberg Communications of the ACM Cluster ComputingEngineeringTime OComputer ArchitectureParallel Implementation	1978	97
Approximate algorithms for some generalized knapsack problems Ashok K. Chandra, D. S. Hirschberg, C. K. Wong Theoretical Computer Science Mathematical ProgrammingApproximate AlgorithmsEngineeringKnapsack ProblemCombinatorial Problem	1976	88
The Least Weight Subsequence Problem D. S. Hirschberg, Lawrence L. Larmore SIAM Journal on Computing Mathematical ProgrammingDirected GraphEngineeringNetwork AnalysisEducation	1987	80
A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables D. S. Hirschberg, C. K. Wong Journal of the ACM Mathematical ProgrammingEngineeringInteger OptimizationOptimization ProblemKnapsack Problem	1976	67
Parallel algorithms for the transitive closure and the connected component problems D. S. Hirschberg Mathematical ProgrammingN2 ProcessorsEngineeringComputer ArchitectureParallel Implementation	1976	63
Small Sample Statistics for Classification Error Rates I: Error Rate Measurements J. Kent Martin, D. S. Hirschberg eScholarship (California Digital Library)	1995	43

Page 1