Daniel S. Hirschberg

79 papers A* 3A 2B 11Journal 55Unranked 7

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Combinatorial Drone Searching. CoRR Ofek Gila, Michael T. Goodrich, Zahra Hadizadeh, Daniel S. Hirschberg, Shayan Taherijam
2025	—	`conf`	The Marco Polo Problem: A Combinatorial Approach to Geometric Localization. CCCG Ofek Gila, Michael T. Goodrich, Zahra Hadizadeh, Daniel S. Hirschberg, Shayan Taherijam
2025	—	`conf`	The Rectilinear Marco Polo Problem. CCCG Ofek Gila, Michael T. Goodrich, Zahra Hadizadeh, Daniel S. Hirschberg, Shayan Taherijam
2025	J	`jnl`	The Rectilinear Marco Polo Problem. CoRR Ofek Gila, Michael T. Goodrich, Zahra Hadizadeh, Daniel S. Hirschberg, Shayan Taherijam
2018	J	`jnl`	From Discrepancy to Majority. Algorithmica David Eppstein, Daniel S. Hirschberg
2016	B	`conf`	From Discrepancy to Majority. LATIN David Eppstein, Daniel S. Hirschberg
2015	J	`jnl`	From Discrepancy to Majority. CoRR David Eppstein, Daniel S. Hirschberg
2013	J	`jnl`	Combinatorial Pair Testing: Distinguishing Workers from Slackers CoRR David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg
2013	B	`conf`	Combinatorial Pair Testing: Distinguishing Workers from Slackers. WADS David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg
2012	—	`conf`	Cache-Oblivious Dictionaries and Multimaps with Negligible Failure Probability. MedAlg Michael T. Goodrich, Daniel S. Hirschberg, Michael Mitzenmacher, Justin Thaler
2011	J	`jnl`	Fully De-Amortized Cuckoo Hashing for Cache-Oblivious Dictionaries and Multimaps CoRR Michael T. Goodrich, Daniel S. Hirschberg, Michael Mitzenmacher, Justin Thaler
2010	J	`jnl`	Hashing Algorithms and Data Structures for Rapid Searches of Fingerprint Vectors. J. Chem. Inf. Model. Ramzi Nasr, Daniel S. Hirschberg, Pierre Baldi
2009	J	`jnl`	An Intersection Inequality Sharper than the Tanimoto Triangle Inequality for Efficiently Searching Large Databases. J. Chem. Inf. Model. Pierre Baldi, Daniel S. Hirschberg
2009	J	`jnl`	Improved Adaptive Group Testing Algorithms with Applications to Multiple Access Channels and Dead Sensor Diagnosis CoRR Michael T. Goodrich, Daniel S. Hirschberg
2008	B	`conf`	Effective Compression of Monotone and Quasi-Monotone Sequences of Integers. DCC Daniel S. Hirschberg, Pierre Baldi
2008	J	`jnl`	Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis. J. Comb. Optim. Michael T. Goodrich, Daniel S. Hirschberg
2008	J	`jnl`	Speeding Up Chemical Database Searches Using a Proximity Filter Based on the Logical Exclusive OR. J. Chem. Inf. Model. Pierre Baldi, Daniel S. Hirschberg, Ramzi Nasr
2007	J	`jnl`	Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes. SIAM J. Comput. David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg
2007	J	`jnl`	Lossless Compression of Chemical Fingerprints Using Integer Entropy Codes Improves Storage and Retrieval. J. Chem. Inf. Model. Pierre Baldi, Ryan W. Benz, Daniel S. Hirschberg, S. Joshua Swamidass
2006	B	`conf`	Efficient parallel algorithms for dead sensor diagnosis and multiple access channels. SPAA Michael T. Goodrich, Daniel S. Hirschberg
2006	J	`jnl`	The minimum size required of a solitaire army CoRR George I. Bell, Daniel S. Hirschberg, Pablo Guerrero-García
2005	J	`jnl`	Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes CoRR David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg
2005	B	`conf`	Improved Combinatorial Group Testing for Real-World Problem Sizes. WADS David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg
2003	J	`jnl`	Adaptive low-power address encoding techniques using self-organizing lists. IEEE Trans. Very Large Scale Integr. Syst. Mahesh Mamidipaka, Daniel S. Hirschberg, Nikil D. Dutt
2002	—	`conf`	Efficient Power Reduction Techniques for Time Multiplexed Address Buses. ISSS Nikil D. Dutt, Daniel S. Hirschberg, Mahesh Mamidipaka
2001	A	`conf`	Low power address encoding using self-organizing lists. ISLPED Mahesh Mamidipaka, Daniel S. Hirschberg, Nikil D. Dutt
2000	J	`jnl`	Geometric Thickness of Complete Graphs. J. Graph Algorithms Appl. Michael B. Dillencourt, David Eppstein, Daniel S. Hirschberg
1999	B	`conf`	Bounds on the Number of String Subsequences. CPM Daniel S. Hirschberg
1999	J	`jnl`	Geometric Thickness of Complete Graphs CoRR Michael B. Dillencourt, David Eppstein, Daniel S. Hirschberg
1998	A	`conf`	Geometric Thickness of Complete Graphs. GD Michael B. Dillencourt, David Eppstein, Daniel S. Hirschberg
1997	J	`jnl`	Choosing Subsets with Maximum Weighted Average. J. Algorithms David Eppstein, Daniel S. Hirschberg
1997	J	`jnl`	Dictionary Compression on the PRAM. Parallel Process. Lett. Daniel S. Hirschberg, Lynn M. Stauffer
1997	—	`ch.`	Serial computations of Levenshtein distances. Pattern Matching Algorithms Daniel S. Hirschberg
1996	B	`ed.`	Combinatorial Pattern Matching, 7th Annual Symposium, CPM 96, Laguna Beach, California, USA, June 10-12, 1996, Proceedings CPM Daniel S. Hirschberg, Eugene W. Myers
1995	J	`jnl`	Systolic Self-Organizing Lists Under Transpose. IEEE Trans. Parallel Distributed Syst. Lynn M. Stauffer, Daniel S. Hirschberg
1994	J	`jnl`	Finding Succinct Ordered Minimal Perfect Hash Functions. Inf. Process. Lett. Steven S. Seiden, Daniel S. Hirschberg
1994	—	`conf`	PRAM Algorithms for Static Dictionary Compression. IPPS Lynn M. Stauffer, Daniel S. Hirschberg
1994	B	`conf`	Parsing Algorithms for Dictionary Compression on the PRAM. Data Compression Conference Daniel S. Hirschberg, Lynn M. Stauffer
1993	J	`jnl`	A Bounded-Space Tree Traversal Algorithm. Inf. Process. Lett. Daniel S. Hirschberg, Steven S. Seiden
1992	—	`conf`	Average Case Analysis of Learning kappa-CNF Concepts. ML Daniel S. Hirschberg, Michael J. Pazzani
1992	J	`jnl`	The Traveler's Problem. J. Algorithms Daniel S. Hirschberg, Lawrence L. Larmore
1992	B	`conf`	Transpose Coding on the Systolic Array. Data Compression Conference Lynn M. Stauffer, Daniel S. Hirschberg
1991	B	`conf`	Streamlining Context Models for Data Compression. Data Compression Conference Debra A. Lelewer, Daniel S. Hirschberg
1991	J	`jnl`	Three-Dimensional Stable Matching Problems. SIAM J. Discret. Math. Cheng Ng, Daniel S. Hirschberg
1990	J	`jnl`	A Fast Algorithm for Optimal Length-Limited Huffman Codes J. ACM Lawrence L. Larmore, Daniel S. Hirschberg
1990	J	`jnl`	Efficient Decoding of Prefix Codes. Commun. ACM Daniel S. Hirschberg, Debra A. Lelewer
1990	A*	`conf`	Length-Limited Coding. SODA Lawrence L. Larmore, Daniel S. Hirschberg
1990	J	`jnl`	Lower Bounds for the Stable Marriage Problem and its Variants. SIAM J. Comput. Cheng Ng, Daniel S. Hirschberg
1989	J	`jnl`	The Set-Set LCS Problem. Algorithmica Daniel S. Hirschberg, Lawrence L. Larmore
1988	J	`jnl`	Construction of Optimal Binary Split Trees in the Presence of Bounded Access Probabilities. J. Algorithms James H. Hester, Daniel S. Hirschberg, Lawrence L. Larmore
1987	J	`jnl`	Data Compression. ACM Comput. Surv. Debra A. Lelewer, Daniel S. Hirschberg
1987	J	`jnl`	Improved Update/Query Algorithms for the Interval Valuation Problem. Inf. Process. Lett. Daniel S. Hirschberg, Dennis J. Volper
1987	J	`jnl`	New applications of failure functions. J. ACM Daniel S. Hirschberg, Lawrence L. Larmore
1987	J	`jnl`	Self-Organizing Search Lists Using Probabilistic Back-Pointers. Commun. ACM James H. Hester, Daniel S. Hirschberg
1987	J	`jnl`	The Least Weight Subsequence Problem. SIAM J. Comput. Daniel S. Hirschberg, Lawrence L. Larmore
1987	J	`jnl`	The Set LCS Problem. Algorithmica Daniel S. Hirschberg, Lawrence L. Larmore
1986	J	`jnl`	Average Case Analysis of Marking Algorithms. SIAM J. Comput. Daniel S. Hirschberg, Lawrence L. Larmore
1986	J	`jnl`	Faster Construction of Optimal Binary Split Trees. J. Algorithms James H. Hester, Daniel S. Hirschberg, S.-H. H. Huang, C. K. Wong
1985	J	`jnl`	Efficient Optimal Pagination of Scrolls. Commun. ACM Lawrence L. Larmore, Daniel S. Hirschberg
1985	J	`jnl`	Self-Organizing Linear Search. ACM Comput. Surv. James H. Hester, Daniel S. Hirschberg
1985	A*	`conf`	The Least Weight Subsequence Problem (Extended Abstract) FOCS Daniel S. Hirschberg, Lawrence L. Larmore
1983	J	`jnl`	An Efficient Implementation of Batcher's Odd-Even Merge Algorithm and Its Application in Parallel Sorting Schemes. IEEE Trans. Computers Manoj Kumar, Daniel S. Hirschberg
1980	J	`jnl`	Decentralized Extrema-Finding in Circular Configurations of Processors. Commun. ACM Daniel S. Hirschberg, James B. Sinclair
1980	J	`jnl`	On the Complexity of Searching a Set of Vectors. SIAM J. Comput. Daniel S. Hirschberg
1979	J	`jnl`	Computing Connected Components on Parallel Computers. Commun. ACM Daniel S. Hirschberg, Ashok K. Chandra, Dilip V. Sarwate
1979	J	`jnl`	Upper and lower bounds for graph-diameter problems with application to record allocation. J. Comb. Theory B Daniel S. Hirschberg, C. K. Wong
1978	J	`jnl`	An Information-Theoretic Lower Bound for the Longest Common Subsequence Problem. Inf. Process. Lett. Daniel S. Hirschberg
1978	J	`jnl`	Bin Packing with Geometric Constraints in Computer Network Design. Oper. Res. A. K. Chandra, Daniel S. Hirschberg, C. K. Wong
1978	J	`jnl`	Fast Parallel Sorting Algorithms. Commun. ACM Daniel S. Hirschberg
1977	J	`jnl`	Algorithms for the Longest Common Subsequence Problem. J. ACM Daniel S. Hirschberg
1977	B	`conf`	Complexity of Common Subsequence Problems. FCT Daniel S. Hirschberg
1976	J	`jnl`	A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables. J. ACM Daniel S. Hirschberg, C. K. Wong
1976	J	`jnl`	An Insertion Technique for One-Sided Height-Balanced Trees. Commun. ACM Daniel S. Hirschberg
1976	J	`jnl`	Approximate Algorithms for Some Generalized Knapsack Problems. Theor. Comput. Sci. Ashok K. Chandra, Daniel S. Hirschberg, C. K. Wong
1976	J	`jnl`	Bounds on the Complexity of the Longest Common Subsequence Problem. J. ACM Alfred V. Aho, Daniel S. Hirschberg, Jeffrey D. Ullman
1976	A*	`conf`	Parallel Algorithms for the Transitive Closure and the Connected Component Problems STOC Daniel S. Hirschberg
1975	J	`jnl`	A Linear Space Algorithm for Computing Maximal Common Subsequences. Commun. ACM Daniel S. Hirschberg
1974	—	`conf`	Bounds on the Complexity of the Longest Common Subsequence Problem (Extended Abstract) SWAT Alfred V. Aho, Daniel S. Hirschberg, Jeffrey D. Ullman
1973	J	`jnl`	A Class of Dynamic Memory Allocation Algorithms. Commun. ACM Daniel S. Hirschberg