default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Rink 0001
Person information
- affiliation: Technische Universität Ilmenau, Germany
Other persons with the same name
- Michael Rink 0002 — Mainz, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[c9]Steffen Kläbe, Kai-Uwe Sattler, Stephan Baumann, Michael Rink:
Elastic Scaling in VectorH. EDBT 2020: 498-509
2010 – 2019
- 2017
- [c8]Silvia Krug
, Axl Schreiber, Michael Rink:
Poster: Beyond Static Sending Intervals for Sensor Node Energy Estimation. CHANTS@MOBICOM 2017: 39-41 - 2015
- [b1]Michael Rink:
Thresholds for Matchings in Random Bipartite Graphs with Applications to Hashing-Based Data Structures. Technische Universität Ilmenau, Germany, 2015 - [j1]Martin Dietzfelbinger, Michael Rink:
Towards Optimal Degree Distributions for Left-Perfect Matchings in Random Bipartite Graphs. Theory Comput. Syst. 56(4): 593-611 (2015) - 2013
- [c7]Michael Rink:
Mixed Hypergraphs for Linear-Time Construction of Denser Hashing-Based Data Structures. SOFSEM 2013: 356-368 - 2012
- [c6]Martin Dietzfelbinger, Michael Rink:
Towards Optimal Degree-Distributions for Left-Perfect Matchings in Random Bipartite Graphs. CSR 2012: 99-111 - [c5]Martin Dietzfelbinger, Hendrik Peilke, Michael Rink:
A More Reliable Greedy Heuristic for Maximum Matchings in Sparse Random Graphs. SEA 2012: 148-159 - [i5]Martin Dietzfelbinger, Michael Rink:
Towards Optimal Degree-distributions for Left-perfect Matchings in Random Bipartite Graphs. CoRR abs/1203.1506 (2012) - [i4]Martin Dietzfelbinger, Hendrik Peilke, Michael Rink:
A More Reliable Greedy Heuristic for Maximum Matchings in Sparse Random Graphs. CoRR abs/1203.4117 (2012) - [i3]Michael Rink:
On Thresholds for the Appearance of 2-cores in Mixed Hypergraphs. CoRR abs/1204.2131 (2012) - 2011
- [c4]Martin Dietzfelbinger, Michael Mitzenmacher, Michael Rink:
Cuckoo Hashing with Pages. ESA 2011: 615-627 - [i2]Martin Dietzfelbinger, Michael Mitzenmacher, Michael Rink:
Cuckoo Hashing with Pages. CoRR abs/1104.5111 (2011) - 2010
- [c3]Martin Dietzfelbinger, Andreas Goerdt, Michael Mitzenmacher, Andrea Montanari, Rasmus Pagh, Michael Rink:
Tight Thresholds for Cuckoo Hashing via XORSAT. ICALP (1) 2010: 213-225
2000 – 2009
- 2009
- [c2]Martin Aumüller, Martin Dietzfelbinger, Michael Rink:
Experimental Variations of a Theoretically Good Retrieval Data Structure. ESA 2009: 742-751 - [c1]Martin Dietzfelbinger, Michael Rink:
Applications of a Splitting Trick. ICALP (1) 2009: 354-365 - [i1]Martin Dietzfelbinger, Andreas Goerdt, Michael Mitzenmacher, Andrea Montanari, Rasmus Pagh, Michael Rink:
Tight Thresholds for Cuckoo Hashing via XORSAT. CoRR abs/0912.0287 (2009)
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 2025-01-09 13:21 CET 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:
