The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Daniel S. Hirschberg: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Daniel S. Hirschberg
    A Linear Space Algorithm for Computing Maximal Common Subsequences. [Citation Graph (3, 0)][DBLP]
    Commun. ACM, 1975, v:18, n:6, pp:341-343 [Journal]
  2. Daniel S. Hirschberg
    Fast Parallel Sorting Algorithms. [Citation Graph (3, 0)][DBLP]
    Commun. ACM, 1978, v:21, n:8, pp:657-661 [Journal]
  3. Debra A. Lelewer, Daniel S. Hirschberg
    Data Compression. [Citation Graph (2, 0)][DBLP]
    ACM Comput. Surv., 1987, v:19, n:3, pp:261-296 [Journal]
  4. Daniel S. Hirschberg
    A Class of Dynamic Memory Allocation Algorithms. [Citation Graph (1, 0)][DBLP]
    Commun. ACM, 1973, v:16, n:10, pp:615-618 [Journal]
  5. Daniel S. Hirschberg, Debra A. Lelewer
    Efficient Decoding of Prefix Codes. [Citation Graph (1, 0)][DBLP]
    Commun. ACM, 1990, v:33, n:4, pp:449-459 [Journal]
  6. James H. Hester, Daniel S. Hirschberg
    Self-Organizing Linear Search. [Citation Graph (1, 0)][DBLP]
    ACM Comput. Surv., 1985, v:17, n:3, pp:295-311 [Journal]
  7. Alfred V. Aho, Daniel S. Hirschberg, Jeffrey D. Ullman
    Bounds on the Complexity of the Longest Common Subsequence Problem. [Citation Graph (1, 0)][DBLP]
    J. ACM, 1976, v:23, n:1, pp:1-12 [Journal]
  8. Daniel S. Hirschberg
    Algorithms for the Longest Common Subsequence Problem. [Citation Graph (1, 0)][DBLP]
    J. ACM, 1977, v:24, n:4, pp:664-675 [Journal]
  9. Daniel S. Hirschberg
    Bounds on the Number of String Subsequences. [Citation Graph (0, 0)][DBLP]
    CPM, 1999, pp:115-122 [Conf]
  10. Daniel S. Hirschberg, Lynn M. Stauffer
    Parsing Algorithms for Dictionary Compression on the PRAM. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 1994, pp:136-145 [Conf]
  11. Debra A. Lelewer, Daniel S. Hirschberg
    Streamlining Context Models for Data Compression. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 1991, pp:313-322 [Conf]
  12. Lynn M. Stauffer, Daniel S. Hirschberg
    Transpose Coding on the Systolic Array. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 1992, pp:162-171 [Conf]
  13. Daniel S. Hirschberg
    Complexity of Common Subsequence Problems. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:393-398 [Conf]
  14. Alfred V. Aho, Daniel S. Hirschberg, Jeffrey D. Ullman
    Bounds on the Complexity of the Longest Common Subsequence Problem (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1974, pp:104-109 [Conf]
  15. Daniel S. Hirschberg, Lawrence L. Larmore
    The Least Weight Subsequence Problem (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:137-143 [Conf]
  16. Michael B. Dillencourt, David Eppstein, Daniel S. Hirschberg
    Geometric Thickness of Complete Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1998, pp:101-110 [Conf]
  17. Daniel S. Hirschberg, Michael J. Pazzani
    Average Case Analysis of Learning kappa-CNF Concepts. [Citation Graph (0, 0)][DBLP]
    ML, 1992, pp:206-211 [Conf]
  18. Lynn M. Stauffer, Daniel S. Hirschberg
    PRAM Algorithms for Static Dictionary Compression. [Citation Graph (0, 0)][DBLP]
    IPPS, 1994, pp:344-348 [Conf]
  19. Mahesh Mamidipaka, Daniel S. Hirschberg, Nikil Dutt
    Low power address encoding using self-organizing lists. [Citation Graph (0, 0)][DBLP]
    ISLPED, 2001, pp:188-193 [Conf]
  20. Nikil D. Dutt, Daniel S. Hirschberg, Mahesh Mamidipaka
    Efficient Power Reduction Techniques for Time Multiplexed Address Buses. [Citation Graph (0, 0)][DBLP]
    ISSS, 2002, pp:207-212 [Conf]
  21. Lawrence L. Larmore, Daniel S. Hirschberg
    Length-Limited Coding. [Citation Graph (0, 0)][DBLP]
    SODA, 1990, pp:310-318 [Conf]
  22. Michael T. Goodrich, Daniel S. Hirschberg
    Efficient parallel algorithms for dead sensor diagnosis and multiple access channels. [Citation Graph (0, 0)][DBLP]
    SPAA, 2006, pp:118-127 [Conf]
  23. Daniel S. Hirschberg
    Parallel Algorithms for the Transitive Closure and the Connected Component Problems [Citation Graph (0, 0)][DBLP]
    STOC, 1976, pp:55-57 [Conf]
  24. David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg
    Improved Combinatorial Group Testing for Real-World Problem Sizes. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:86-98 [Conf]
  25. Daniel S. Hirschberg, Lawrence L. Larmore
    The Set LCS Problem. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1987, v:2, n:, pp:91-95 [Journal]
  26. Daniel S. Hirschberg, Lawrence L. Larmore
    The Set-Set LCS Problem. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1989, v:4, n:4, pp:503-510 [Journal]
  27. James H. Hester, Daniel S. Hirschberg
    Self-Organizing Search Lists Using Probabilistic Back-Pointers. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1987, v:30, n:12, pp:1074-1079 [Journal]
  28. Daniel S. Hirschberg
    An Insertion Technique for One-Sided Height-Balanced Trees. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1976, v:19, n:8, pp:471-473 [Journal]
  29. Daniel S. Hirschberg, Ashok K. Chandra, Dilip V. Sarwate
    Computing Connected Components on Parallel Computers. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1979, v:22, n:8, pp:461-464 [Journal]
  30. Daniel S. Hirschberg, J. B. Sinclair
    Decentralized Extrema-Finding in Circular Configurations of Processors. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1980, v:23, n:11, pp:627-628 [Journal]
  31. Lawrence L. Larmore, Daniel S. Hirschberg
    Efficient Optimal Pagination of Scrolls. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1985, v:28, n:8, pp:854-856 [Journal]
  32. Michael B. Dillencourt, David Eppstein, Daniel S. Hirschberg
    Geometric Thickness of Complete Graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  33. Daniel S. Hirschberg
    An Information-Theoretic Lower Bound for the Longest Common Subsequence Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1978, v:7, n:1, pp:40-41 [Journal]
  34. Daniel S. Hirschberg, Steven S. Seiden
    A Bounded-Space Tree Traversal Algorithm. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:47, n:4, pp:215-219 [Journal]
  35. Daniel S. Hirschberg, Dennis J. Volper
    Improved Update/Query Algorithms for the Interval Valuation Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:5, pp:307-310 [Journal]
  36. Steven S. Seiden, Daniel S. Hirschberg
    Finding Succinct Ordered Minimal Perfect Hash Functions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:51, n:6, pp:283-288 [Journal]
  37. Daniel S. Hirschberg, Lawrence L. Larmore
    New applications of failure functions. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1987, v:34, n:3, pp:616-625 [Journal]
  38. Daniel S. Hirschberg, C. K. Wong
    A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1976, v:23, n:1, pp:147-154 [Journal]
  39. Lawrence L. Larmore, Daniel S. Hirschberg
    A Fast Algorithm for Optimal Length-Limited Huffman Codes [Citation Graph (0, 0)][DBLP]
    J. ACM, 1990, v:37, n:3, pp:464-473 [Journal]
  40. David Eppstein, Daniel S. Hirschberg
    Choosing Subsets with Maximum Weighted Average. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:24, n:1, pp:177-193 [Journal]
  41. Daniel S. Hirschberg, Lawrence L. Larmore
    The Traveler's Problem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1992, v:13, n:1, pp:148-160 [Journal]
  42. James H. Hester, Daniel S. Hirschberg, S.-H. H. Huang, C. K. Wong
    Faster Construction of Optimal Binary Split Trees. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1986, v:7, n:3, pp:412-424 [Journal]
  43. James H. Hester, Daniel S. Hirschberg, Lawrence L. Larmore
    Construction of Optimal Binary Split Trees in the Presence of Bounded Access Probabilities. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1988, v:9, n:2, pp:245-253 [Journal]
  44. Daniel S. Hirschberg, C. K. Wong
    Upper and lower bounds for graph-diameter problems with application to record allocation. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1979, v:26, n:1, pp:66-74 [Journal]
  45. Michael B. Dillencourt, David Eppstein, Daniel S. Hirschberg
    Geometric Thickness of Complete Graphs. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2000, v:4, n:3, pp:5-17 [Journal]
  46. Daniel S. Hirschberg, Lynn M. Stauffer
    Dictionary Compression on the PRAM. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1997, v:7, n:3, pp:297-308 [Journal]
  47. Daniel S. Hirschberg, Lawrence L. Larmore
    The Least Weight Subsequence Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1987, v:16, n:4, pp:628-638 [Journal]
  48. Daniel S. Hirschberg, Lawrence L. Larmore
    Average Case Analysis of Marking Algorithms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:4, pp:1069-1074 [Journal]
  49. Daniel S. Hirschberg
    On the Complexity of Searching a Set of Vectors. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1980, v:9, n:1, pp:126-129 [Journal]
  50. Cheng Ng, Daniel S. Hirschberg
    Lower Bounds for the Stable Marriage Problem and its Variants. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1990, v:19, n:1, pp:71-77 [Journal]
  51. David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg
    Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:36, n:5, pp:1360-1375 [Journal]
  52. Cheng Ng, Daniel S. Hirschberg
    Three-Dimensional Stable Matching Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1991, v:4, n:2, pp:245-252 [Journal]
  53. Manoj Kumar, Daniel S. Hirschberg
    An Efficient Implementation of Batcher's Odd-Even Merge Algorithm and Its Application in Parallel Sorting Schemes. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1983, v:32, n:3, pp:254-264 [Journal]
  54. Ashok K. Chandra, Daniel S. Hirschberg, C. K. Wong
    Approximate Algorithms for Some Generalized Knapsack Problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1976, v:3, n:3, pp:293-304 [Journal]
  55. Lynn M. Stauffer, Daniel S. Hirschberg
    Systolic Self-Organizing Lists Under Transpose. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1995, v:6, n:1, pp:102-105 [Journal]
  56. George I. Bell, Daniel S. Hirschberg, Pablo Guerrero-García
    The minimum size required of a solitaire army [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  57. Mahesh Mamidipaka, Daniel S. Hirschberg, Nikil D. Dutt
    Adaptive low-power address encoding techniques using self-organizing lists. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. VLSI Syst., 2003, v:11, n:5, pp:827-834 [Journal]

  58. Effective Compression of Monotone and Quasi-Monotone Sequences of Integers. [Citation Graph (, )][DBLP]


  59. Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes [Citation Graph (, )][DBLP]


  60. Improved Adaptive Group Testing Algorithms with Applications to Multiple Access Channels and Dead Sensor Diagnosis [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.009secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002