Computer Science Assistant

****@******.*****.***.***

Office:

**** ************ *******

Mountain View, CA 94043

Research Interests,

Complexity

Theory,, Logic and

Data Compression, including implementation issues.EducationMassachusetts Institute of

Technology, Cambridge, MA (September 1998-September 2003)

Ph.D. in Electrical Engineering

and Computer Science (GPA 5.0/5.0).

Albert-Ludwigs-Universität

Freiburg, Germany (October 1993-April 1998)

M.S. in,

M.S. in

(GPA 4.0/4.0).

Graduation with "highest honors" in both

subjects.Honors and AwardsWorld Champion ACM

International Collegiate Programming Contest, 1995.

Capocelli Award (Best Student Paper), IEEE Data Compression

Conference, 1997.

Master Thesis awarded prize at "Deutscher Studienpreis"

(German student research competition), 1998.

Kleene Award (Best Student Paper), IEEE Symposium on

Logic in Computer Science, 1999., 2001-2003., 2003.Experience, Mountain View,

CA (June 2004-present)

Research Scientist.

IBM Almaden Research

Center, San Jose, CA (September 2003-June 2004)

Josef

Raviv Memorial Postdoctoral Fellow.

Work in the "Foundations of

Computer Science" group on massive data set computations,

peer-to-peer networks, and network coding.

Massachusetts Institute of

Technology, Cambridge, MA (September 1998-August 2003)

Research Assistant in the .

Work on network design and scheduling algorithms (with ), complexity

theory, cryptography.

Massachusetts Institute of

Technology, Cambridge, MA (September 1999-January 2001)

Teaching Assistant for

6.046J/18.410J

Introduction to Algorithms, taught by and (Fall 1999)

6.856J/18.416J

Randomized Algorithms, taught by (Fall 2000)

IBM Almaden Research

Center, San Jose, CA (June 2001-August 2001, June 2002-August

2002)

Intern in the Theory group.

Work on Finite Model Theory,

On-Line and Streaming Algorithms with,

T.S. Jayram and Sridhar Rajagopalan., Mountain View,

CA (June 2000-August 2000)

Intern in the Research group.

Work on

Data Mining with Monika

Henzinger., Palo

Alto, CA (June 1999-August 1999)

Research Intern in the Theory

group.

Work on "Authentication of Paper Documents" with David

Goldberg and .

Albert-Ludwigs-Universität

Freiburg, Germany (October 1997-August 1998)

Research/Teaching Assistant in the mathematics

department under Professor Jörg

Flum.

Worked on problems in finite model theory,

esp. counting quantifiers, orderings. Taught recitations for course

in "Mathematical Logic".

Albert-Ludwigs-Universität

Freiburg, Germany (March 1994-December 1997)

Research

Assistant in the computer science department under Professor .

Design and implementation (C/C++) of programs for image

compression and visualization of algebraic surfaces. Proved

NP-hardness result for constructing optimal codes for 'fractal image

compression', and developed practical heuristic algorithms for the

same problem. Also partly responsible for system administration (SGI,

Sun).CourseworkComputer Science: Cryptography and

Cryptanalysis,,

Topics in Theoretical Computer Science, Natural Language Processing,

Complexity

Theory, Graduate Algorithms and Data Structures, Recursion Theory,

Information and Coding Theory, Computational Geometry, Computer

Graphics, Image Processing, Artificial Intelligence, Databases,

Systems Architecture, Human-Machine Interaction.

Mathematics: Logic (Model Theory, Descriptive Complexity

Theory), Probability Theory (Stochastics, Measure Theory, Stochastic

Processes), Algebra, Algebraic Topology, Differential Geometry, Linear

Algebra, Analysis, Numerical Analysis, Non-Standard Analysis, Number

Theory, Function Theory, Set Theory.SkillsProficient in C, C++, Scheme, Pascal, Assembly (and many other languages),

UNIX system administration, DOS/Windows, LaTeX, HTML.

Fluent in English and German; fair knowledge of French.

Journals, Matthias Ruhl,

The Directed Steiner Network problem is tractable for a constant number of terminals,

SIAM Journal on Computing, vol. 36, no. 2, pp. 543-561,

2006., Matthias Ruhl,

Simple Efficient Load Balancing Algorithms for Peer-to-Peer Systems,

Theory of Computing Systems (SPAA'04 special issue), vol. 39, no. 6, pp. 787-804,

November 2006., Matthias Ruhl,,,

IEEE Transactions on Image Processing, vol. 9, no. 7, pp. 1171-1184,

July 2000.

Angela Rösch, Matthias Ruhl,,,

Eurographics Computer Graphics Forum, vol. 16, no. 5, pp. 295-306,

December 1997.

Conference Proceedings,, Sridhar Rajagopalan, Matthias Ruhl,,

Proceedings IEEE Symposium on Foundations of Computer Science (FOCS), Rome,

October 2004., Matthias Ruhl,,

Proceedings ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), Barcelona,

June 2004., Matthias Ruhl,,

Proceedings Latin American Theoretical INformatics (LATIN), Buenos Aires, pp. 369-378,

April 2004., Matthias Ruhl,,

Proceedings ACM Symposium on Theory of Computing (STOC), Montréal, pp. 741-750,

May 2002., Bay-Wei Chang,, Matthias Ruhl,

Who Links to Whom: Mining Linkage between Web Sites,

Proceedings IEEE International Conference on Data Mining (ICDM), San Jose, pp. 51-58,

November 2001.

Daniel W. Engels,,, Matthias Ruhl,,

Proceedings ACM-SIAM Symposium on Discrete Algorithms (SODA), Washington D.C., pp. 577-585,

January 2001.

Matthias Ruhl,, David Goldberg,,

Proceedings ACM-SIAM Symposium on Discrete Algorithms (SODA), Washington D.C., pp. 437-438,

January 2001., Matthias Ruhl,,

Proceedings IEEE Symposium on Foundations of Computer Science (FOCS), New York, pp. 299-308,

October 1999.

Matthias Ruhl,,

Proceedings IEEE Symposium on Logic in Computer Science (LICS), Trento, pp. 326-334,

July 1999., Matthias Ruhl,, Luigi Grandi,,,

Proceedings IEEE International Conference on Image Processing (ICIP), Chicago, vol. 1, pp. 737-741,

October 1998.

Matthias Ruhl,,,,

Proceedings IEEE International Conference on Image Processing (ICIP), Santa Barbara, vol. 2, pp. 310-313,

October 1997., Matthias Ruhl,,

Visualization and Mathematics, H.-C. Hege, K. Polthier (eds.), Springer Verlag, pp. 83-92,

July 1997.

Matthias Ruhl,,,

Proceedings DCC'97 Data Compression Conference, James A. Storer, Martin Cohn (eds.), IEEE Computer Society Press, pp. 261-270,

March 1997., Matthias Ruhl,,

Proceedings IEEE International Conference on Image Processing (ICIP), Lausanne, vol. 1, pp. 129-132,

September 1996.

Workshops, Matthias Ruhl,,

International Workshop on Peer-to-Peer Systems (IPTPS), San Diego,

February 2004., Matthias Ruhl,

Diminished Chord: A Protocol for Heterogeneous Subgroup Formation in Peer-to-Peer Networks,

International Workshop on Peer-to-Peer Systems (IPTPS), San Diego,

February 2004., Matthias Ruhl,,

IRIS Student Workshop (ISW), Cambridge, MA,

August 2003.

Matthias Ruhl,,, Sridhar Rajagopalan,

Extending the Streaming Model: Sorting and Streaming Networks,

DIMACS Working Group Meeting on Streaming Data Analysis,

March 2003., Matthias Ruhl,

Interactive Animation of Algebraic Surfaces,

Proceedings Workshop "Visualisierung - Dynamik und Komplexität", Bremen,

September 1995.

Technical Reports, Matthias Ruhl,,

MIT Technical Report, LCS-TR-911,

July 2003.

Book Chapters, Matthias Ruhl,,,,

in: "Ergodic Theory, Analysis, and Efficient Simulation of Dynamical Systems", Bernold Fiedler (ed.), Springer Verlag, pp. 617-647,

August 2001.

Theses

Matthias Ruhl,,

PhD Thesis in Electrical Engineering and Computer Science, Massachusetts Institute of Technology (advisor ),

September 2003.

Matthias Ruhl,,

MS Thesis in Computer Science, Albert-Ludwigs-Universität Freiburg (advisor Jörg Flum),

April 1998.

Matthias Ruhl,

Fraktale Bildkompression - Adaptive Partitionierungen und Komplexität,

MS Thesis in Mathematics, Albert-Ludwigs-Universität Freiburg (advisor ),

April 1997.

Manuscripts

Matthias Ruhl,,

Manuscript,

August 2001., Matthias Ruhl,,

Manuscript,

November 2000., Matthias Ruhl,,

Manuscript,

February 1999.

Contact this candidate