`Travelled to:`

1 × Canada

1 × Germany

1 × Hungary

1 × Israel

1 × Sweden

`Collaborated with:`

N.E.Young V.S.Choi G.Rote P.Flajolet C.Kenyon

`Talks about:`

letter (3) unequ (3) cost (3) code (3) algorithm (2) construct (1) equiprob (1) asymptot (1) program (1) huffman (1)

## Person: Mordecai J. Golin

### DBLP: Golin:Mordecai_J=

### Contributed to:

### Wrote 5 papers:

- STOC-2002-GolinKY
- Huffman coding with unequal letter costs (MJG, CK, NEY), pp. 785–791.
- ICALP-1996-ChoiG #algorithm #analysis
- Lopsided Trees: Analyses, Algorithms, and Applications (VSNC, MJG), pp. 538–549.
- ICALP-1995-GolinR #algorithm #programming
- A Dynamic Programming Algorithm for Constructing Optimal Refix-Free Codes for Unequal Letter Costs (MJG, GR), pp. 256–267.
- ICALP-1994-GolinY #word
- Prefix Codes: Equiprobable Words, Unequal Letter Costs (MJG, NEY), pp. 605–617.
- ICALP-1993-FlajoletG #divide and conquer
- Exact Asymptotics of Divide-and-Conquer Recurrences (PF, MJG), pp. 137–149.