( en | de | ru )

 

Disambiguation of "Hirschberg, Daniel S."

Author of the publication

copydeleteadd this publication to your clipboard
Fast Parallel Sorting Algorithms.

. Commun. ACM, 21 (8): 657-661 (1978)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Daniel S Baum

Daniel S Mayfield

Daniel S Scholz

Daniel S Kraus

Daniel S. Weld

 

Other publications of authors with the same name

An Efficient Implementation of Batcher's Odd-Even Merge Algorithm and Its Application in Parallel Sorting Schemes., and . IEEE Trans. Computers, 32 (3): 254-264 (1983)An Intersection Inequality Sharper than the Tanimoto Triangle Inequality for Efficiently Searching Large Databases., and . Journal of Chemical Information and Modeling, 49 (8): 1866-1870 (2009)Speeding Up Chemical Database Searches Using a Proximity Filter Based on the Logical Exclusive OR., , and . Journal of Chemical Information and Modeling, 48 (7): 1367-1378 (2008)Bounds on the Complexity of the Longest Common Subsequence Problem., , and . J. ACM, 23 (1): 1-12 (1976)A Fast Algorithm for Optimal Length-Limited Huffman Codes, and . J. ACM, 37 (3): 464-473 (July 1990)Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes, , and . CoRR, (2005)A Class of Dynamic Memory Allocation Algorithms.. Commun. ACM, 16 (10): 615-618 (1973)Computing Connected Components on Parallel Computers., , and . Commun. ACM, 22 (8): 461-464 (1979)Transpose Coding on the Systolic Array., and . Data Compression Conference, page 162-171. IEEE Computer Society, (1992)Bin Packing with Geometric Constraints in Computer Network Design., , and . Operations Research, 26 (5): 760-772 (1978)