Daniel S. Hirschberg

Available identifiers

zbMath Open hirschberg.daniel-sDBLPh/DanielSHirschbergWikidataQ5213689 ScholiaQ5213689MaRDI QIDQ1336763

List of research outcomes

Publication	Date of Publication	Type
From discrepancy to majority	2018-05-23	Paper
From discrepancy to majority	2016-05-03	Paper
Combinatorial pair testing: distinguishing workers from slackers	2013-08-12	Paper
Cache-oblivious dictionaries and multimaps with negligible failure probability	2013-04-19	Paper
Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis	2008-04-23	Paper
The minimum size required of a solitaire army	2008-03-04	Paper
Improved Combinatorial Group Testing Algorithms for Real‐World Problem Sizes	2007-10-22	Paper
Algorithms and Data Structures	2006-10-25	Paper
https://portal.mardi4nfdi.de/entity/Q3024802	2005-07-04	Paper
Geometric Thickness of Complete Graphs	2000-12-14	Paper
Choosing Subsets with Maximum Weighted Average	1997-08-25	Paper
Finding succinct ordered minimal perfect hash functions	1996-02-26	Paper
https://portal.mardi4nfdi.de/entity/Q3138908	1994-09-19	Paper
A bounded-space tree traversal algorithm	1993-11-15	Paper
The Traveler's Problem	1992-06-28	Paper
Three-Dimensional Stabl Matching Problems	1991-01-01	Paper
A fast algorithm for optimal length-limited Huffman codes	1990-01-01	Paper
Lower Bounds for the Stable Marriage Problem and Its Variants	1990-01-01	Paper
The set-set LCS problem	1989-01-01	Paper
Construction of optimal binary split trees in the presence of bounded access probabilities	1988-01-01	Paper
Data compression	1987-01-01	Paper
The Least Weight Subsequence Problem	1987-01-01	Paper
The set LCS problem	1987-01-01	Paper
Average Case Analysis of Marking Algorithms	1986-01-01	Paper
An Efficient Implementation of Batcher's Odd-Even Merge Algorithm and Its Application in Parallel Sorting Schemes	1983-01-01	Paper
Decentralized extrema-finding in circular configurations of processors	1980-01-01	Paper
On the Complexity of Searching a Set of Vectors	1980-01-01	Paper
Computing connected components on parallel computers	1979-01-01	Paper
An information-theoretic lower bound for the longest common subsequence problem	1978-01-01	Paper
Fast parallel sorting algorithms	1978-01-01	Paper
Algorithms for the Longest Common Subsequence Problem	1977-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4139686	1977-01-01	Paper
Bounds on the Complexity of the Longest Common Subsequence Problem	1976-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4146249	1976-01-01	Paper
An insertion technique for one-sided height-balanced trees	1976-01-01	Paper
A linear space algorithm for computing maximal common subsequences	1975-01-01	Paper
A class of dynamic memory allocation algorithms	1973-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3270236	1958-01-01	Paper

Research outcomes over time

This page was built for person: Daniel S. Hirschberg