Остановите войну!
for scientists:
default search action
Daniel S. Hirschberg
- > Home > Persons > Daniel S. Hirschberg
Publications
- 1992
- [j32]Daniel S. Hirschberg, Lawrence L. Larmore:
The Traveler's Problem. J. Algorithms 13(1): 148-160 (1992) - 1990
- [j29]Lawrence L. Larmore, Daniel S. Hirschberg:
A Fast Algorithm for Optimal Length-Limited Huffman Codes. J. ACM 37(3): 464-473 (1990) - [c5]Lawrence L. Larmore, Daniel S. Hirschberg:
Length-Limited Coding. SODA 1990: 310-318 - 1989
- [j27]Daniel S. Hirschberg, Lawrence L. Larmore:
The Set-Set LCS Problem. Algorithmica 4(4): 503-510 (1989) - 1988
- [j26]James H. Hester, Daniel S. Hirschberg, Lawrence L. Larmore:
Construction of Optimal Binary Split Trees in the Presence of Bounded Access Probabilities. J. Algorithms 9(2): 245-253 (1988) - 1987
- [j25]Daniel S. Hirschberg, Lawrence L. Larmore:
The Set LCS Problem. Algorithmica 2: 91-95 (1987) - [j24]James H. Hester, Daniel S. Hirschberg:
Self-Organizing Search Lists Using Probabilistic Back-Pointers. Commun. ACM 30(12): 1074-1079 (1987) - [j22]Daniel S. Hirschberg, Dennis J. Volper:
Improved Update/Query Algorithms for the Interval Valuation Problem. Inf. Process. Lett. 24(5): 307-310 (1987) - [j21]Daniel S. Hirschberg, Lawrence L. Larmore:
New applications of failure functions. J. ACM 34(3): 616-625 (1987) - [j20]Daniel S. Hirschberg, Lawrence L. Larmore:
The Least Weight Subsequence Problem. SIAM J. Comput. 16(4): 628-638 (1987) - 1986
- [j19]James H. Hester, Daniel S. Hirschberg, S.-H. H. Huang, C. K. Wong:
Faster Construction of Optimal Binary Split Trees. J. Algorithms 7(3): 412-424 (1986) - [j18]Daniel S. Hirschberg, Lawrence L. Larmore:
Average Case Analysis of Marking Algorithms. SIAM J. Comput. 15(4): 1069-1074 (1986) - 1985
- [j17]Lawrence L. Larmore, Daniel S. Hirschberg:
Efficient Optimal Pagination of Scrolls. Commun. ACM 28(8): 854-856 (1985) - [j16]James H. Hester, Daniel S. Hirschberg:
Self-Organizing Linear Search. ACM Comput. Surv. 17(3): 295-311 (1985) - [c4]Daniel S. Hirschberg, Lawrence L. Larmore:
The Least Weight Subsequence Problem (Extended Abstract). FOCS 1985: 137-143 - 1979
- [j12]Daniel S. Hirschberg, Ashok K. Chandra, Dilip V. Sarwate:
Computing Connected Components on Parallel Computers. Commun. ACM 22(8): 461-464 (1979) - [j11]Daniel S. Hirschberg, C. K. Wong:
Upper and lower bounds for graph-diameter problems with application to record allocation. J. Comb. Theory, Ser. B 26(1): 66-74 (1979) - 1978
- [j9]A. K. Chandra, Daniel S. Hirschberg, C. K. Wong:
Bin Packing with Geometric Constraints in Computer Network Design. Oper. Res. 26(5): 760-772 (1978) - 1976
- [j4]Daniel S. Hirschberg, C. K. Wong:
A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables. J. ACM 23(1): 147-154 (1976) - [j3]Ashok K. Chandra, Daniel S. Hirschberg, C. K. Wong:
Approximate Algorithms for Some Generalized Knapsack Problems. Theor. Comput. Sci. 3(3): 293-304 (1976)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint