Vote for your favorite mineral in #MinCup25! - Titanite vs. Thortveitite
It's a pair of T-minerals with as versatile #titanite faces off against the home of rare earth elements #thortveitite.
Log InRegister
Quick Links : The Mindat ManualThe Rock H. Currier Digital LibraryMindat Newsletter [Free Download]
Home PageAbout MindatThe Mindat ManualHistory of MindatCopyright StatusWho We AreContact UsAdvertise on Mindat
Donate to MindatCorporate SponsorshipSponsor a PageSponsored PagesMindat AdvertisersAdvertise on Mindat
Learning CenterWhat is a mineral?The most common minerals on earthInformation for EducatorsMindat ArticlesThe ElementsThe Rock H. Currier Digital LibraryGeologic Time
Minerals by PropertiesMinerals by ChemistryAdvanced Locality SearchRandom MineralRandom LocalitySearch by minIDLocalities Near MeSearch ArticlesSearch GlossaryMore Search Options
Search For:
Mineral Name:
Locality Name:
Keyword(s):
 
The Mindat ManualAdd a New PhotoRate PhotosLocality Edit ReportCoordinate Completion ReportAdd Glossary Item
Mining CompaniesStatisticsUsersMineral MuseumsClubs & OrganizationsMineral Shows & EventsThe Mindat DirectoryDevice SettingsThe Mineral Quiz
Photo SearchPhoto GalleriesSearch by ColorNew Photos TodayNew Photos YesterdayMembers' Photo GalleriesPast Photo of the Day GalleryPhotography

Parker, D. Stott (1998) Erratum: Conditions for Optimality of the Huffman Algorithm. SIAM Journal on Computing, 27 (1). 317 doi:10.1137/s0097539797328550

Advanced
   -   Only viewable:
Reference TypeJournal (article/letter/editorial)
TitleErratum: Conditions for Optimality of the Huffman Algorithm
JournalSIAM Journal on Computing
AuthorsParker, D. StottAuthor
Year1998 (February)Volume27
Issue1
PublisherSociety for Industrial & Applied Mathematics (SIAM)
DOIdoi:10.1137/s0097539797328550Search in ResearchGate
Generate Citation Formats
Mindat Ref. ID11240170Long-form Identifiermindat:1:5:11240170:6
GUID0
Full ReferenceParker, D. Stott (1998) Erratum: Conditions for Optimality of the Huffman Algorithm. SIAM Journal on Computing, 27 (1). 317 doi:10.1137/s0097539797328550
Plain TextParker, D. Stott (1998) Erratum: Conditions for Optimality of the Huffman Algorithm. SIAM Journal on Computing, 27 (1). 317 doi:10.1137/s0097539797328550
In(1998, February) SIAM Journal on Computing Vol. 27 (1) Society for Industrial & Applied Mathematics (SIAM)

See Also

These are possibly similar items as determined by title/reference text matching only.

Parker, Jr., D. Stott (1980) Conditions for Optimality of the Huffman Algorithm. SIAM Journal on Computing, 9 (3). 470-489 doi:10.1137/0209035
Parker, D. Stott, Ram, Prasad (1999) The Construction of Huffman Codes is a Submodular ("Convex") Optimization Problem Over a Lattice of Binary Trees. SIAM Journal on Computing, 28 (5). 1875-1905 doi:10.1137/s0097539796311077
Brady, Martin L. (1998) A Fast Discrete Approximation Algorithm for the Radon Transform. SIAM Journal on Computing, 27 (1). 107-119 doi:10.1137/s0097539793256673
Ottmann, Thomas, Parker, D. Stott, Rosenberg, Arnold L., Six, Hans W., Wood, Derick (1984) Minimal-Cost Brother Trees. SIAM Journal on Computing, 13 (1). 197-217 doi:10.1137/0213015
Gander, Martin J., Kwok, Felix, Salomon, Julien (2020) PARAOPT: A Parareal Algorithm for Optimality Systems. SIAM Journal on Scientific Computing, 42 (5) doi:10.1137/19m1292291
Li, Rongheng, Shi, Lijie (1998) An On-Line Algorithm for Some Uniform Processor Scheduling. SIAM Journal on Computing, 27 (2). 414-422 doi:10.1137/s0097539799527969
Garay, Juan A., Kutten, Shay, Peleg, David (1998) A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees. SIAM Journal on Computing, 27 (1). 302-316 doi:10.1137/s0097539794261118
Bulatov, Andrei, Dalmau, Víctor (2006) A Simple Algorithm for Mal'tsev Constraints. SIAM Journal on Computing, 36 (1). 16-27 doi:10.1137/050628957
Zhang, Yanjun (1995) On the Optimality of Randomized $\alpha$-$\beta$ Search. SIAM Journal on Computing, 24 (1). 138-147 doi:10.1137/s009753979223037x
Lust, K., Roose, D. (1998) An Adaptive Newton--Picard Algorithm with Subspace Iteration for Computing Periodic Solutions. SIAM Journal on Scientific Computing, 19. 1188-1209 doi:10.1137/s1064827594277673
Heckler, C., Thiele, L. (1998) Complexity Analysis of a Parallel Lattice Basis Reduction Algorithm. SIAM Journal on Computing, 27 (5). 1295-1302 doi:10.1137/s0097539795295626
 
and/or  
Mindat.org is an outreach project of the Hudson Institute of Mineralogy, a 501(c)(3) not-for-profit organization.
Copyright © mindat.org and the Hudson Institute of Mineralogy 1993-2025, except where stated. Most political location boundaries are © OpenStreetMap contributors. Mindat.org relies on the contributions of thousands of members and supporters. Founded in 2000 by Jolyon Ralph.
To cite: Ralph, J., Von Bargen, D., Martynov, P., Zhang, J., Que, X., Prabhu, A., Morrison, S. M., Li, W., Chen, W., & Ma, X. (2025). Mindat.org: The open access mineralogy database to accelerate data-intensive geoscience research. American Mineralogist, 110(6), 833–844. doi:10.2138/am-2024-9486.
Privacy Policy - Terms & Conditions - Contact Us / DMCA issues - Report a bug/vulnerability Current server date and time: September 11, 2025 03:21:50
Go to top of page