# Danny Dubé

According to our database

Collaborative distances:

^{1}, Danny Dubé authored at least 27 papers between 1994 and 2018.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2018

Arbitrarily Low Redundancy Construction of Balanced Codes Using Realistic Resources.

Proceedings of the International Symposium on Information Theory and Its Applications, 2018

Individually Optimal Single- and Multiple-Tree Almost Instantaneous Variable-to-Fixed Codes.

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Improving Marlin's Compression Ratio with Partially Overlapping Codewords.

Proceedings of the 2018 Data Compression Conference, 2018

Optimal Single- and Multiple-Tree Almost Instantaneous Variable-to-Fixed Codes.

Proceedings of the 2018 Data Compression Conference, 2018

2017

Almost minimum-redundancy construction of balanced codes using limited-precision integers.

Proceedings of the 15th Canadian Workshop on Information Theory, 2017

2015

A finite-precision adaptation of bit recycling to arithmetic coding.

Proceedings of the IEEE International Symposium on Signal Processing and Information Technology, 2015

Using bit recycling to reduce the redundancy in plurally parsable dictionaries.

Proceedings of the 14th IEEE Canadian Workshop on Information Theory, 2015

2014

Conservative groupoids recognize only regular languages.

Inf. Comput., 2014

Improving Compression via Substring Enumeration by Explicit Phase Awareness.

Proceedings of the Data Compression Conference, 2014

2013

Using bit recycling to reduce Knuth's balanced codes redundancy.

Proceedings of the 13th Canadian Workshop on Information Theory, 2013

2012

Conservative Groupoids Recognize Only Regular Languages.

Proceedings of the Language and Automata Theory and Applications, 2012

2011

The universality and linearity of compression by substring enumeration.

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

On the Use of Stronger Synchronization to Boost Compression by Substring Enumeration.

Proceedings of the 2011 Data Compression Conference (DCC 2011), 2011

2010

An Extended Proof-Carrying Code Framework for Security Enforcement.

Trans. Computational Science, 2010

Using synchronization bits to boost compression by substring enumeration.

Proceedings of the International Symposium on Information Theory and its Applications, 2010

Lossless Data Compression via Substring Enumeration.

Proceedings of the 2010 Data Compression Conference (DCC 2010), 2010

2009

Constructing optimal whole-bit recycling codes.

Proceedings of the 2009 IEEE Information Theory Workshop, 2009

2008

Encoding the Program Correctness Proofs as Programs in PCC Technology.

Proceedings of the Sixth Annual Conference on Privacy, Security and Trust, 2008

Improving LZ77 bit recycling using all matches.

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

All-Match LZ77 Bit Recycling.

Proceedings of the 2008 Data Compression Conference (DCC 2008), 2008

VEP: a virtual machine for extended proof-carrying code.

Proceedings of the 1st ACM Workshop on Virtual Machine Security, 2008

2007

Bit Recycling with Prefix Codes.

Proceedings of the 2007 Data Compression Conference (DCC 2007), 2007

2005

BIT: A Very Compact Scheme System for Microcontrollers.

Higher-Order and Symbolic Computation, 2005

2002

A demand-driven adaptive type analysis.

Proceedings of the Seventh ACM SIGPLAN International Conference on Functional Programming (ICFP '02), 2002

2000

Efficiently building a parse tree from a regular expression.

Acta Inf., 2000

1996

A Hybrid Approach to Vehicle Routing Using Neural Networks and Genetic Algorithms.

Appl. Intell., 1996

1994

Improving a Vehicle Routing Heuristic Through Genetic Search.

Proceedings of the First IEEE Conference on Evolutionary Computation, 1994