Mike's Home Page I'm a fourth year Ph.D. student in Computer Science at the University of Washington. I grew up in Seattle, then spent five years at Dartmouth College in Hanover, New Hampshire. At Dartmouth I earned a Bachelors in Mathematics (minor in Computer Science) in 1999 and a Masters in Computer Science in 2001. After college, I spent a year and a half working on compiler front ends(C, C++, and Fortran) and assemblers for Cray before heading to the UW. I am currently on leave (since March, 2006), and working as a Software Engineer at Cray, focusing on parallelizing compiler back-ends (primarily optimization and automatic parallelization). miker at cs dot washington dot edu

Publications

Journal Articles:

• Neva Cherniavsky, Gidon Shavit, Michael F. Ringenburg, Richard E. Ladner, and Eve A. Riskin. MultiStage: A MINMAX Bit Allocation Algorithm for Video Coders. IEEE Transactions on Circuits and Systems for Video Technology 17, 1 (2007), 59-67.

Refereed Conference and Workshop Papers:

• Michael F. Ringenburg and Dan Grossman. Preventing Format-String Attacks via Automatic and Efficient Dynamic Checking. Proceedings of the 12th ACM Conference on Computer and Communications Security (CCS 2005), Alexandria, Virginia, November 2005, pages 354-363.
  • See our website for an implementation.

• Michael F. Ringenburg and Dan Grossman. AtomCaml: First-Class Atomicity via Rollback. Proceedings of the 10th ACM SIGPLAN International Conference on Functional Programming (ICFP 2005), Tallinn, Estonia, September 2005, pages 92-104.
  • See our website to download a copy of AtomCaml, and some example AtomCaml programs.

• Michael F. Ringenburg and Dan Grossman. Types for Describing Coordinated Data Structures. Proceedings of TLDI '05: 2005 ACM SIGPLAN International Workshop on Types in Language Design and Implementation, Long Beach, California, January 2005, pages 25-36.
  • See our website for an implementation, some examples, and formal proofs of the theorems.

• Michael F. Ringenburg, Richard E. Ladner, and Eve A. Riskin. Global MINMAX Interframe Bit Allocation for Embedded Video Coding. In Proceedings of the 2004 IEEE Data Compression Conference (DCC '04), Snowbird, Utah, March 2004, pages 222-231.

• Gidon Shavit, Michael F. Ringenburg, Jeff West, Richard E. Ladner, and Eve A. Riskin. Group Testing for Video Compression. In Proceedings of the 2004 IEEE Data Compression Conference (DCC '04), Snowbird, Utah, March 2004, pages 212-221.

Theses:

• Michael F. Ringenburg. Applying the Vector Radix Method to Multidimensional, Multiprocessor, Out-of-Core Fast Fourier Transforms. Master's Thesis, Department of Computer Science, Dartmouth College, March 2001.

Research

• Past projects:

  • WASP: Washington Advanced Systems for Programming. Advisor: Dan Grossman

    As software systems become simultaneously more complex and more integrated into our daily lives, the need to eliminate errors and security vulnerabilities becomes more pronounced. My work aims to use programming language-based techniques to improve software quality. Some topics we have investigated include coordinated data structures, security white-listing, and enforcing strong atomicity guarantees in concurrent programs. Our current work focuses on invariant verification for concurrent programs with atomic synchronization.

  • Graphics, image & video compression, Advisors: Richard Ladner and Eve Riskin

    This project involved developing a new embedded video coder, and designing a global bit-allocation algorithm that achieves nearly constant quality across the entire video. We also looked briefly at image compression, animation compression, and 3D mesh compression. See the two DCC 2004 papers listed above for more details.

  • Out-of-core algorithms (my master's thesis). Advisor: Tom Cormen

    Out-of-core algorithms are algorithms designed to be efficient even when the size of the problem is greater than the size of the computer's main memory. We developed an out-of-core, parallel, high-dimensional vector radix FFT algorithm. We also analyzed our algorithm's complexity, as well as the communication complexity of a previously developed BMMC permutation algorithm that we used as a subroutine of the FFT algorithm. See my master's thesis for details.

  • Using simulated annealing to approximate crossing numbers of complete graphs. Advisor: John Mackey

• Summer schools:

  • Summer School on Software Security: Theory to Practice, June 17-25 2004, University of Oregon, Eugene, OR

Teaching

• In winter 2005, I was a teaching assistant for CSE 505: Concepts of Programming Languages.
• In autumn 2004, I was a guest lecturer for CSE 413: Programming Languages and their Implementation.
• In autumn 2003, I was a guest lecturer for CSE 322: Introduction to Formal Models in Computer Science.
• In winter 2003, I was a teaching assistant and guest lecturer for CSE 322: Introduction to Formal Models in Computer Science.

Department Activities

• 2005 Prospective Student (Visit Day) Committee
• 2004-05 Graduate Admissions Committee
• 2004-05 Graduate Mentoring Committee
• 2004 Holiday Party Coordinator
• 2004 New Graduate Student Orientation Committee Co-chair
• 2003 Pit Party Coordinator
• 2003 New Graduate Student Orientation Committee

Travel photos

• France and London, July '04
• Central Europe, June '03 - My pictures
• Central Europe, June '03 - Jenn and Tim's pictures
• Spain, March-April '01 and November '01
• Morocco, April '01
• Peru, June '00