default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthias Majuntke
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j1]Dan Dobre, Ghassan O. Karame
, Wenting Li, Matthias Majuntke, Neeraj Suri, Marko Vukolic:
Proofs of Writing for Robust Storage. IEEE Trans. Parallel Distributed Syst. 30(11): 2547-2566 (2019)- 2013
- [c15]Dan Dobre, Ghassan Karame, Wenting Li, Matthias Majuntke, Neeraj Suri, Marko Vukolic:
PoWerStore: proofs of writing for efficient and robust storage. CCS 2013: 285-298 - [c14]Vinay Sachidananda, Abdelmajid Khelil, Dhananjay Umap, Matthias Majuntke, Neeraj Suri:
Trading transport timeliness and reliability for efficiency in wireless sensor networks. ICNSC 2013: 720-727 - 2012
- [b1]Matthias Majuntke:
Data consistency and coordination for untrusted environments. Darmstadt University of Technology, Germany, 2012, pp. 1-165 - [i1]Dan Dobre, Ghassan Karame, Wenting Li, Matthias Majuntke, Neeraj Suri, Marko Vukolic:
Proofs of Writing for Efficient and Robust Storage. CoRR abs/1212.3555 (2012) - 2011
- [c13]Matthias Majuntke, Dan Dobre, Christian Cachin, Neeraj Suri:
Fork-Consistent Constructions from Registers. OPODIS 2011: 283-298 - [c12]Dan Dobre, Rachid Guerraoui, Matthias Majuntke, Neeraj Suri, Marko Vukolic:
The complexity of robust atomic storage. PODC 2011: 59-68 - [c11]Matthias Majuntke, Dan Dobre, Neeraj Suri:
Fork-consistent constructions from registers. PODC 2011: 209-210 - 2010
- [c10]Matthias Majuntke:
Large Scale Replication and Data Consistency. AlgoSyn 2010: 110 - [c9]Marco Serafini, Péter Bokor, Dan Dobre, Matthias Majuntke, Neeraj Suri:
Scrooge: Reducing the costs of fast Byzantine replication in presence of unresponsive replicas. DSN 2010: 353-362 - [c8]Dan Dobre, Matthias Majuntke, Marco Serafini, Neeraj Suri:
HP: Hybrid Paxos for WANs. EDCC 2010: 117-126 - [c7]Marco Serafini, Dan Dobre, Matthias Majuntke, Péter Bokor, Neeraj Suri:
Eventually linearizable shared objects. PODC 2010: 95-104
2000 – 2009
- 2009
- [c6]Matthias Majuntke, Dan Dobre, Marco Serafini, Neeraj Suri:
Abortable Fork-Linearizable Storage. OPODIS 2009: 255-269 - [c5]Dan Dobre, Matthias Majuntke, Marco Serafini, Neeraj Suri:
Efficient Robust Storage Using Secret Tokens. SSS 2009: 269-283 - 2008
- [c4]Dan Dobre, Matthias Majuntke, Neeraj Suri:
Low-latency access to robust amnesic storage. LADIS 2008: 12:1-12:3 - [c3]Dan Dobre, Matthias Majuntke, Neeraj Suri:
On the Time-Complexity of Robust and Amnesic Storage. OPODIS 2008: 197-216 - 2007
- [c2]Felix C. Freiling, Matthias Majuntke, Neeraj Mittal:
On Detecting Termination in the Crash-Recovery Model. Euro-Par 2007: 629-638 - 2006
- [c1]Felix C. Freiling, Matthias Majuntke, Neeraj Mittal:
Brief Announcement: Termination Detection in an Asynchronous Distributed System with Crash-Recovery Failures. SSS 2006: 572-573
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-11-28 21:24 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:
