Jason D. Linehan

Mathematics

Slides

• Slides, Axioms of normal compressors and applications to data analysis
• Slides, A universal information metric on finite binary strings
• Slides, Approximating Kolmogorov complexity for data analysis

Papers

• Paper, Introduction to compression methods for data clustering (draft)

Course Notes

• Notes, MHF6306 Mathematical Logic I
• Notes, MAT6932 Descriptive Set Theory I

LaTeX

• LaTeX, Homework template

Software

• plm-1, data compressor
• mqtc, solves minimum quartet tree cost problem
• ytree, a phylogenetic tree data structure
• cloth, a toy HTTP server
• basic-coin, fair and biased coins and dice
• basic-prng, a "Mersenne twister" PRNG
• basic-bloom, a Bloom filter
• basic-list, a circular linked list
• basic-fifo, a basic circular buffer

Miscellaneous

• In C, or not in C
• Some photos

About Me

I currently study mathematics at Dartmouth College in Hanover, New Hampshire. I received my B.Sc. in mathematics from University of Florida. I hold programming positions at Pathway Systems Inc. and Geometeor, LLC. My research interests include algorithmically random structures, topological data analysis, machine learning, data compression, dynamical systems, and descriptive set theory.

Curriculum vitae (PDF)