default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthias Ruhl
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[c16]Matthias Ruhl, Mukund Sundararajan, Qiqi Yan:
The Cascading Analysts Algorithm. SIGMOD Conference 2018: 1083-1096- 2017
- [i1]Matthias Ruhl, Mukund Sundararajan, Qiqi Yan:
Hierarchical Summarization of Metric Changes. CoRR abs/1703.07795 (2017)
2000 – 2009
- 2006
- [j4]David R. Karger
, Matthias Ruhl:
Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems. Theory Comput. Syst. 39(6): 787-804 (2006) - [j3]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) - 2004
- [c15]Gagan Aggarwal, Mayur Datar, Sridhar Rajagopalan, Matthias Ruhl:
On the Streaming Model Augmented with a Sorting Primitive. FOCS 2004: 540-549 - [c14]David R. Karger, Matthias Ruhl:
Simple Efficient Load Balancing Algorithms for Peer-to-Peer Systems. IPTPS 2004: 131-140 - [c13]David R. Karger, Matthias Ruhl:
Diminished Chord: A Protocol for Heterogeneous Subgroup Formation in Peer-to-Peer Networks. IPTPS 2004: 288-297 - [c12]Alantha Newman, Matthias Ruhl:
Combinatorial Problems on Strings with Applications to Protein Folding. LATIN 2004: 369-378 - [c11]David R. Karger, Matthias Ruhl:
Simple efficient load balancing algorithms for peer-to-peer systems. SPAA 2004: 36-43 - 2003
- [b1]Matthias Ruhl:
Efficient algorithms for new computational models. Massachusetts Institute of Technology, Cambridge, MA, USA, 2003 - 2002
- [c10]David R. Karger, Matthias Ruhl:
Finding nearest neighbors in growth-restricted metrics. STOC 2002: 741-750 - 2001
- [c9]Krishna Bharat, Bay-Wei Chang, Monika Henzinger, Matthias Ruhl:
Who Links to Whom: Mining Linkage between Web Sites. ICDM 2001: 51-58 - [c8]Daniel W. Engels, Jon Feldman, David R. Karger, Matthias Ruhl:
Parallel processor scheduling with delay constraints. SODA 2001: 577-585 - 2000
- [j2]Hannes Hartenstein, Matthias Ruhl, Dietmar Saupe:
Region-based fractal image compression. IEEE Trans. Image Process. 9(7): 1171-1184 (2000)
1990 – 1999
- 1999
- [c7]Jon Feldman, Matthias Ruhl:
The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals. FOCS 1999: 299-308 - [c6]Matthias Ruhl:
Counting and Addition Cannot Express Deterministic Transitive Closure. LICS 1999: 326-334 - 1998
- [c5]Dietmar Saupe, Matthias Ruhl, Raouf Hamzaoui, Luigi Grandi, Daniele Marini:
Optimal Hierarchical Partitions for Fractal Image Compression. ICIP (1) 1998: 737-741 - 1997
- [j1]Haripriya Rangan, Matthias Ruhl, Dietmar Saupe:
Interactive Visualization of Implicit Surfaces with Singularities. Comput. Graph. Forum 16(5): 295-306 (1997) - [c4]Matthias Ruhl, Hannes Hartenstein:
Optimal Fractal Coding is NP-Hard. Data Compression Conference 1997: 261-270 - [c3]Matthias Ruhl, Hannes Hartenstein, Dietmar Saupe:
Adaptive Partitionings for Fractal Image Compression. ICIP (2) 1997: 310-313 - 1996
- [c2]Dietmar Saupe, Matthias Ruhl:
Evolutionary fractal image compression. ICIP (1) 1996: 129-132 - 1995
- [c1]Dietmar Saupe, Matthias Ruhl:
Animation of Algebraic Surfaces. VisMath 1995: 83-92
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
