We stand with Ukraine  

Michael B. Baer

According to our database1, Michael B. Baer authored at least 22 papers between 2006 and 2013.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2013
On the redundancy of Huffman codes with exponential objectives.
[BibTeX]
[DOI]
Michael B. Baer
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2011
Redundancy-Related Bounds for Generalized Huffman Codes.
[BibTeX]
[DOI]
Michael B. Baer
IEEE Trans. Inf. Theory, 2011

Minimum Redundancy Coding for Uncertain Sources
[BibTeX]
[DOI]
Michael B. Baer
,
Farzad Rezaei
,
Charalambos D. Charalambous
CoRR, 2011

Improved Redundancy Bounds for Exponential Objectives
[BibTeX]
[DOI]
Michael B. Baer
CoRR, 2011

2010
Alphabetic coding with exponential costs.
[BibTeX]
[DOI]
Michael B. Baer
Inf. Process. Lett., 2010

2009
Efficient implementation of the generalized Tunstall code generation algorithm.
[BibTeX]
[DOI]
Michael B. Baer
Proceedings of the IEEE International Symposium on Information Theory, 2009

2008
Optimal Prefix Codes for Infinite Alphabets With Nonlinear Costs.
[BibTeX]
[DOI]
Michael B. Baer
IEEE Trans. Inf. Theory, 2008

Reserved-length prefix coding.
[BibTeX]
[DOI]
Michael B. Baer
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Prefix codes for power laws.
[BibTeX]
[DOI]
Michael B. Baer
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Tight bounds on minimum maximum pointwise redundancy.
[BibTeX]
[DOI]
Michael B. Baer
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2007
Bounds on Generalized Huffman Codes
[BibTeX]
[DOI]
Michael B. Baer
CoRR, 2007

Infinite-Alphabet Prefix Codes Optimal for beta-Exponential Penalties
[BibTeX]
[DOI]
Michael B. Baer
CoRR, 2007

D-ary Bounded-Length Huffman Coding.
[BibTeX]
[DOI]
Michael B. Baer
Proceedings of the IEEE International Symposium on Information Theory, 2007

Infinite-Alphabet Prefix Codes Optimal for ß-Exponential Penalties.
[BibTeX]
[DOI]
Michael B. Baer
Proceedings of the IEEE International Symposium on Information Theory, 2007

On Conditional Branches in Optimal Decision Trees.
[BibTeX]
[DOI]
Michael B. Baer
Proceedings of the IEEE International Symposium on Information Theory, 2007

2006
Source Coding for Quasiarithmetic Penalties.
[BibTeX]
[DOI]
Michael B. Baer
IEEE Trans. Inf. Theory, 2006

A general framework for codes involving redundancy minimization.
[BibTeX]
[DOI]
Michael B. Baer
IEEE Trans. Inf. Theory, 2006

Prefix Codes for Power Laws with Countable Support
[BibTeX]
[DOI]
Michael B. Baer
CoRR, 2006

Prefix Coding under Siege
[BibTeX]
[DOI]
Michael B. Baer
CoRR, 2006

On Conditional Branches in Optimal Search Trees
[BibTeX]
[DOI]
Michael B. Baer
CoRR, 2006

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

Renyi to Renyi - Source Coding under Siege.
[BibTeX]
[DOI]
Michael B. Baer
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006


  Loading...