| 2006 |
| 17 | EE | Jon Feldman,
Matthias Ruhl:
The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals.
SIAM J. Comput. 36(2): 543-561 (2006) |
| 16 | EE | David R. Karger,
Matthias Ruhl:
Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems.
Theory Comput. Syst. 39(6): 787-804 (2006) |
| 2004 |
| 15 | EE | Gagan Aggarwal,
Mayur Datar,
Sridhar Rajagopalan,
Matthias Ruhl:
On the Streaming Model Augmented with a Sorting Primitive.
FOCS 2004: 540-549 |
| 14 | EE | David R. Karger,
Matthias Ruhl:
Simple Efficient Load Balancing Algorithms for Peer-to-Peer Systems.
IPTPS 2004: 131-140 |
| 13 | EE | David R. Karger,
Matthias Ruhl:
Diminished Chord: A Protocol for Heterogeneous Subgroup Formation in Peer-to-Peer Networks.
IPTPS 2004: 288-297 |
| 12 | EE | Alantha Newman,
Matthias Ruhl:
Combinatorial Problems on Strings with Applications to Protein Folding.
LATIN 2004: 369-378 |
| 11 | EE | David R. Karger,
Matthias Ruhl:
Simple efficient load balancing algorithms for peer-to-peer systems.
SPAA 2004: 36-43 |
| 2002 |
| 10 | EE | David R. Karger,
Matthias Ruhl:
Finding nearest neighbors in growth-restricted metrics.
STOC 2002: 741-750 |
| 2001 |
| 9 | EE | Krishna Bharat,
Bay-Wei Chang,
Monika Rauch Henzinger,
Matthias Ruhl:
Who Links to Whom: Mining Linkage between Web Sites.
ICDM 2001: 51-58 |
| 8 | EE | Daniel W. Engels,
Jon Feldman,
David R. Karger,
Matthias Ruhl:
Parallel processor scheduling with delay constraints.
SODA 2001: 577-585 |
| 2000 |
| 7 | EE | Hannes Hartenstein,
Matthias Ruhl,
Dietmar Saupe:
Region-based fractal image compression.
IEEE Transactions on Image Processing 9(7): 1171-1184 (2000) |
| 1999 |
| 6 | EE | Jon Feldman,
Matthias Ruhl:
The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals.
FOCS 1999: 299-308 |
| 5 | EE | Matthias Ruhl:
Counting and Addition Cannot Express Deterministic Transitive Closure.
LICS 1999: 326-334 |
| 1998 |
| 4 | | Dietmar Saupe,
Matthias Ruhl,
Raouf Hamzaoui,
Luigi Grandi,
Daniele Marini:
Optimal Hierarchical Partitions for Fractal Image Compression.
ICIP (1) 1998: 737-741 |
| 1997 |
| 3 | | Matthias Ruhl,
Hannes Hartenstein:
Optimal Fractal Coding is NP-Hard.
Data Compression Conference 1997: 261-270 |
| 2 | EE | Matthias Ruhl,
Hannes Hartenstein,
Dietmar Saupe:
Adaptive Partitionings for Fractal Image Compression.
ICIP (2) 1997: 310-313 |
| 1 | | Haripriya Rangan,
Matthias Ruhl,
Dietmar Saupe:
Interactive Visualization of Implicit Surfaces with Singularities.
Comput. Graph. Forum 16(5): 295-306 (1997) |