Renyi to Renyi - Source Coding under Siege. - Michael B. Baer (ISIT, 2006)

Twenty (or so) Questions: $D$-ary Length-Bounded Prefix Coding - Michael B. Baer (CoRR, 2006)

On Conditional Branches in Optimal Search Trees - Michael B. Baer (CoRR, 2006)

Prefix Coding under Siege - Michael B. Baer (CoRR, 2006)

Prefix Codes for Power Laws with Countable Support - Michael B. Baer (CoRR, 2006)

A general framework for codes involving redundancy minimization. - Michael B. Baer (IEEE Trans. Inf. Theory, 2006)

Source Coding for Quasiarithmetic Penalties. - Michael B. Baer (IEEE Trans. Inf. Theory, 2006)

On Conditional Branches in Optimal Decision Trees. - Michael B. Baer (ISIT, 2007)

Infinite-Alphabet Prefix Codes Optimal for ß-Exponential Penalties. - Michael B. Baer (ISIT, 2007)

D-ary Bounded-Length Huffman Coding. - Michael B. Baer (ISIT, 2007)

Infinite-Alphabet Prefix Codes Optimal for beta-Exponential Penalties - Michael B. Baer (CoRR, 2007)

Bounds on Generalized Huffman Codes - Michael B. Baer (CoRR, 2007)

Tight bounds on minimum maximum pointwise redundancy. - Michael B. Baer (ISIT, 2008)

Prefix codes for power laws. - Michael B. Baer (ISIT, 2008)

Reserved-length prefix coding. - Michael B. Baer (ISIT, 2008)

Optimal Prefix Codes for Infinite Alphabets With Nonlinear Costs. - Michael B. Baer (IEEE Trans. Inf. Theory, 2008)

Efficient implementation of the generalized Tunstall code generation algorithm. - Michael B. Baer (ISIT, 2009)

Alphabetic coding with exponential costs. - Michael B. Baer (Inf. Process. Lett., 2010)

Improved Redundancy Bounds for Exponential Objectives - Michael B. Baer (CoRR, 2011)

Minimum Redundancy Coding for Uncertain Sources - Michael B. Baer; Farzad Rezaei; Charalambos D. Charalambous (CoRR, 2011)

Redundancy-Related Bounds for Generalized Huffman Codes. - Michael B. Baer (IEEE Trans. Inf. Theory, 2011)

On the redundancy of Huffman codes with exponential objectives. - Michael B. Baer (ISIT, 2013)