The following pages link to Daniel S. Hirschberg (Q1336763):
Displaying 39 items.
- (Q689628) (redirect page) (← links)
- A bounded-space tree traversal algorithm (Q689629) (← links)
- The set LCS problem (Q1101215) (← links)
- An information-theoretic lower bound for the longest common subsequence problem (Q1241422) (← links)
- Finding succinct ordered minimal perfect hash functions (Q1336764) (← links)
- From discrepancy to majority (Q1751093) (← links)
- The set-set LCS problem (Q1825675) (← links)
- Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis (Q2426667) (← links)
- From Discrepancy to Majority (Q2802955) (← links)
- Combinatorial Pair Testing: Distinguishing Workers from Slackers (Q2842170) (← links)
- (Q3024802) (← links)
- (Q3138908) (← links)
- A class of dynamic memory allocation algorithms (Q3212648) (← links)
- (Q3270236) (← links)
- Three-Dimensional Stabl Matching Problems (Q3348423) (← links)
- Lower Bounds for the Stable Marriage Problem and Its Variants (Q3474282) (← links)
- A fast algorithm for optimal length-limited Huffman codes (Q3477965) (← links)
- An Efficient Implementation of Batcher's Odd-Even Merge Algorithm and Its Application in Parallel Sorting Schemes (Q3659156) (← links)
- Average Case Analysis of Marking Algorithms (Q3756521) (← links)
- Construction of optimal binary split trees in the presence of bounded access probabilities (Q3777470) (← links)
- Data compression (Q3792615) (← links)
- The Least Weight Subsequence Problem (Q3796786) (← links)
- Computing connected components on parallel computers (Q3867197) (← links)
- Decentralized extrema-finding in circular configurations of processors (Q3888516) (← links)
- On the Complexity of Searching a Set of Vectors (Q3891774) (← links)
- The Traveler's Problem (Q3990621) (← links)
- A linear space algorithm for computing maximal common subsequences (Q4055176) (← links)
- Bounds on the Complexity of the Longest Common Subsequence Problem (Q4077445) (← links)
- An insertion technique for one-sided height-balanced trees (Q4096431) (← links)
- (Q4139686) (← links)
- (Q4146249) (← links)
- Fast parallel sorting algorithms (Q4162670) (← links)
- Algorithms for the Longest Common Subsequence Problem (Q4187318) (← links)
- Choosing Subsets with Maximum Weighted Average (Q4349704) (← links)
- Geometric Thickness of Complete Graphs (Q4511256) (← links)
- Cache-Oblivious Dictionaries and Multimaps with Negligible Failure Probability (Q4916042) (← links)
- Algorithms and Data Structures (Q5394240) (← links)
- Improved Combinatorial Group Testing Algorithms for Real‐World Problem Sizes (Q5422490) (← links)
- (Q5445376) (← links)
