Matthias Ruhl

发表

Evolutionary fractal image compression

Dietmar Saupe, Matthias Ruhl, 1996, Proceedings of 3rd IEEE International Conference on Image Processing.

The Capocelli Prize

Hannes Hartenstein, Khalid Sayood, Gregory W. Wornell, 2010 .

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

David R. Karger, Matthias Ruhl, D. Karger, 2006, Theory of Computing Systems.

The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals

Jon Feldman, Matthias Ruhl, 2006, SIAM J. Comput..

On the Inverse Problem of Fractal Compression

Edward R. Vrscay, Dietmar Saupe, Hannes Hartenstein, 2001 .

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

David R. Karger, Matthias Ruhl, 2004, IPTPS.

Optimal hierarchical partitions for fractal image compression

Dietmar Saupe, Raouf Hamzaoui, Daniele Marini, 1998, Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269).

Optimal fractal coding is NP-hard

Hannes Hartenstein, Matthias Ruhl, 1997, Proceedings DCC '97. Data Compression Conference.

The Cascading Analysts Algorithm

Mukund Sundararajan, Matthias Ruhl, Qiqi Yan, 2018, SIGMOD Conference.

Who links to whom: mining linkage between Web sites

Krishna Bharat, Monika Henzinger, Bay-Wei Chang, 2001, Proceedings 2001 IEEE International Conference on Data Mining.

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

David R. Karger, Matthias Ruhl, M. Ruhl, 2004, IPTPS.

Fraktale Bildkompression: Adaptive Partitionierungen und Komplexit¨ at

Matthias Ruhl, 1997 .

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

David R. Karger, Matthias Ruhl, D. Karger, 2004, SPAA '04.

Parallel processor scheduling with delay constraints

Jon Feldman, David R. Karger, Daniel W. Engels, 2001, SODA '01.

Adaptive partitionings for fractal image compression

Hannes Hartenstein, Dietmar Saupe, Matthias Ruhl, 1997, Proceedings of International Conference on Image Processing.

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

Jon Feldman, Matthias Ruhl, J. Feldman, 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

Combinatorial Problems on Strings with Applications to Protein Folding

Alantha Newman, Matthias Ruhl, 2004, LATIN.

Extending the Streaming Model: Sorting and Streaming Networks

Mayur Datar, Sridhar Rajagopalan, Matthias Ruhl, 2003 .

Finding nearest neighbors in growth-restricted metrics

David R. Karger, Matthias Ruhl, M. Ruhl, 2002, STOC '02.

Efficient algorithms for new computational models

Matthias Ruhl, M. Ruhl, 2003 .

Counting and addition cannot express deterministic transitive closure

Matthias Ruhl, M. Ruhl, 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

Region-based fractal image compression

Hannes Hartenstein, Dietmar Saupe, Matthias Ruhl, 2000, IEEE Trans. Image Process..

Hierarchical Summarization of Metric Changes pdf

Mukund Sundararajan, Matthias Ruhl, Qiqi Yan, 2017, ArXiv.

On the streaming model augmented with a sorting primitive

Mayur Datar, Sridhar Rajagopalan, Matthias Ruhl, 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

Interactive Visualization of Implicit Surfaces with Singularities

Dietmar Saupe, Matthias Ruhl, Haripriya Rangan, 1997, Comput. Graph. Forum.

Animation of Algebraic Surfaces

Dietmar Saupe, Matthias Ruhl, 1995, VisMath.

New Algorithms for Load Balancing in Peer-to-Peer Systems

David R. Karger, Matthias Ruhl, M. Ruhl, 2003 .

Secure notarization of paper text documents

David Goldberg, Matthias Ruhl, Marshall Bern, 2001, SODA '01.