10 papers:
ICPR-2012-EdmundsonS #image #performance #retrieval #using- Fast JPEG image retrieval using optimised Huffman tables (DE, GS), pp. 3188–3191.
DATE-2006-KavousianosKN #multi #performance #testing #using- Efficient test-data compression for IP cores using multilevel Huffman coding (XK, EK, DN), pp. 1033–1038.
STOC-2002-GolinKY- Huffman coding with unequal letter costs (MJG, CK, NEY), pp. 785–791.
ICALP-2002-BermanKN #approximate #parallel- Approximating Huffman Codes in Parallel (PB, MK, YN), pp. 845–855.
HT-2001-CoulstonV #hypermedia #metric- A hypertext metric based on huffman coding (CC, TMV), pp. 243–244.
ITiCSE-2000-BarrosP- A versatile assignment in CS 2(poster session): a file compression utility based on the Huffman code (JPB, RP), p. 185.
- EDTC-1997-SurtiCT #automaton #design #encoding #power management #using
- Low power FSM design using Huffman-style encoding (PS, LFC, AT), pp. 521–525.
SIGIR-1993-BooksteinKR #question- Is Huffman Coding Dead? (AB, STK, TR), pp. 80–87.
- SIGIR-1985-ChouekaKP #performance
- Efficient Variants of Huffman Codes in High Level Languages (YC, STK, YP), pp. 122–130.
- ICALP-1976-Leeuwen #on the
- On the Construction of Huffman Trees (JvL), pp. 382–410.
