default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Kleppmann
Person information
- affiliation: TU Munich, Germany
- affiliation (former): University of Cambridge, Computer Laboratory
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c15]Leo Stewen
, Martin Kleppmann:
Undo and Redo Support for Replicated Registers. PaPoC@EuroSys 2024: 1-7- [c14]Liangrun Da, Martin Kleppmann:
Extending JSON CRDTs with Move Operations. PaPoC@EuroSys 2024: 8-14 - [c13]Ceren Kocaogullar, Daniel Hugenroth, Martin Kleppmann, Alastair R. Beresford:
Pudding: Private User Discovery in Anonymity Networks. SP 2024: 3203-3220 - [i12]Martin Kleppmann, Paul Frazee, Jake Gold, Jay Graber, Daniel Holmgren, Devin Ivy, Jeromy Johnson, Bryan Newbold, Jaz Volpert:
Bluesky and the AT Protocol: Usable Decentralized Social Media. CoRR abs/2402.03239 (2024) - [i11]Leo Stewen, Martin Kleppmann:
Undo and Redo Support for Replicated Registers. CoRR abs/2404.11308 (2024) - [i10]Joseph Gentle, Martin Kleppmann:
Collaborative Text Editing with Eg-walker: Better, Faster, Smaller. CoRR abs/2409.14252 (2024) - 2023
- [i9]Matthew Weidner, Joseph Gentle, Martin Kleppmann:
The Art of the Fugue: Minimizing Interleaving in Collaborative Text Editing. CoRR abs/2305.00583 (2023) - [i8]Ceren Kocaogullar, Daniel Hugenroth, Martin Kleppmann, Alastair R. Beresford:
Pudding: Private User Discovery in Anonymity Networks. CoRR abs/2311.10825 (2023) - [i7]Liangrun Da, Martin Kleppmann:
Extending JSON CRDT with Move Operations. CoRR abs/2311.14007 (2023) - 2022
- [j12]Martin Kleppmann, Peter Alvaro:
Research for practice: convergence. Commun. ACM 65(11): 104-106 (2022) - [j11]Geoffrey Litt, Sarah Lim, Martin Kleppmann, Peter van Hardenberg:
Peritext: A CRDT for Collaborative Rich Text Editing. Proc. ACM Hum. Comput. Interact. 6(CSCW2): 1-36 (2022) - [j10]Martin Kleppmann, Peter Alvaro:
Covergence: Research for Practice reboot. ACM Queue 20(3): 88-95 (2022) - [j9]Martin Kleppmann, Dominic P. Mulligan, Victor B. F. Gomes, Alastair R. Beresford:
A Highly-Available Move Operation for Replicated Trees. IEEE Trans. Parallel Distributed Syst. 33(7): 1711-1724 (2022) - [c12]Martin Kleppmann:
Making CRDTs Byzantine fault tolerant. PaPoC@EuroSys 2022: 8-15 - 2021
- [c11]Matthew Weidner, Martin Kleppmann, Daniel Hugenroth, Alastair R. Beresford:
Key Agreement for Decentralized Secure Group Messaging with Strong Security Guarantees. CCS 2021: 2024-2045 - [c10]Martin Kleppmann:
Thinking in events: from databases to distributed collaboration software: keynote at the 15th ACM International Conference on Distributed and Event-Based Systems (DEBS). DEBS 2021: 15-24 - [c9]Daniel Hugenroth, Martin Kleppmann, Alastair R. Beresford:
Rollercoaster: An Efficient Group-Multicast Scheme for Mix Networks. USENIX Security Symposium 2021: 3433-3450 - 2020
- [c8]Martin Kleppmann:
Moving elements in list CRDTs. PaPoC@EuroSys 2020: 4:1-4:6 - [c7]Peter van Hardenberg, Martin Kleppmann:
PushPin: towards production-quality peer-to-peer collaboration. PaPoC@EuroSys 2020: 10:1-10:10 - [e1]Alan D. Fekete, Martin Kleppmann:
7th Workshop on Principles and Practice of Consistency for Distributed Data, PaPoC@EuroSys 2020, Heraklion, Greece, April 27, 2020. ACM 2020, ISBN 978-1-4503-7524-5 [contents] - [i6]Martin Kleppmann, Heidi Howard:
Byzantine Eventual Consistency and the Fundamental Limits of Peer-to-Peer Databases. CoRR abs/2012.00472 (2020) - [i5]Matthew Weidner, Martin Kleppmann, Daniel Hugenroth, Alastair R. Beresford:
Key Agreement for Decentralized Secure Group Messaging with Strong Security Guarantees. IACR Cryptol. ePrint Arch. 2020: 1281 (2020)
2010 – 2019
- 2019
- [j8]Martin Kleppmann, Alastair R. Beresford, Boerge Svingen:
Online event processing. Commun. ACM 62(5): 43-49 (2019) - [j7]Stephan A. Kollmann, Martin Kleppmann, Alastair R. Beresford:
Snapdoc: Authenticated snapshots with history privacy in peer-to-peer collaborative editing. Proc. Priv. Enhancing Technol. 2019(3): 210-232 (2019) - [j6]Martin Kleppmann, Alastair R. Beresford, Boerge Svingen:
Online Event Processing. ACM Queue 17(1): 40 (2019) - [c6]Martin Kleppmann, Victor B. F. Gomes, Dominic P. Mulligan, Alastair R. Beresford:
Interleaving anomalies in collaborative text editors. PaPoC@EuroSys 2019: 6:1-6:7 - [c5]Martin Kleppmann, Adam Wiggins, Peter van Hardenberg, Mark McGranaghan:
Local-first software: you own your data, in spite of the cloud. Onward! 2019: 154-178 - [c4]Diana A. Vasile, Martin Kleppmann, Daniel R. Thomas, Alastair R. Beresford:
Ghost Trace on the Wire? Using Key Evidence for Informed Decisions. Security Protocols Workshop 2019: 245-257 - [r1]Martin Kleppmann:
Apache Samza. Encyclopedia of Big Data Technologies 2019 - 2018
- [j5]Martin Kleppmann, Victor B. F. Gomes, Dominic P. Mulligan, Alastair R. Beresford:
OpSets: Sequential Specifications for Replicated Datatypes. Arch. Formal Proofs 2018 (2018) - [c3]Martin Kleppmann, Stephan A. Kollmann, Diana A. Vasile, Alastair R. Beresford:
From Secure Messaging to Secure Collaboration. Security Protocols Workshop 2018: 179-185 - [c2]Martin Kleppmann:
From Secure Messaging to Secure Collaboration (Transcript of Discussion). Security Protocols Workshop 2018: 186-191 - [i4]Martin Kleppmann, Victor B. F. Gomes, Dominic P. Mulligan, Alastair R. Beresford:
OpSets: Sequential Specifications for Replicated Datatypes (Extended Version). CoRR abs/1805.04263 (2018) - 2017
- [j4]Victor B. F. Gomes, Martin Kleppmann, Dominic P. Mulligan, Alastair R. Beresford:
A framework for establishing Strong Eventual Consistency for Conflict-free Replicated Datatypes. Arch. Formal Proofs 2017 (2017) - [j3]Victor B. F. Gomes, Martin Kleppmann, Dominic P. Mulligan, Alastair R. Beresford:
Verifying strong eventual consistency in distributed systems. Proc. ACM Program. Lang. 1(OOPSLA): 109:1-109:28 (2017) - [j2]Martin Kleppmann, Alastair R. Beresford:
A Conflict-Free Replicated JSON Datatype. IEEE Trans. Parallel Distributed Syst. 28(10): 2733-2746 (2017) - [i3]Victor B. F. Gomes, Martin Kleppmann, Dominic P. Mulligan, Alastair R. Beresford:
Verifying Strong Eventual Consistency in Distributed Systems. CoRR abs/1707.01747 (2017) - 2016
- [b1]Martin Kleppmann:
Designing Data-Intensive Applications: The Big Ideas Behind Reliable, Scalable, and Maintainable Systems. O'Reilly 2016, ISBN 978-1-4493-7332-0, pp. I-XIX, 1-590 - [i2]Martin Kleppmann, Alastair R. Beresford:
A Conflict-Free Replicated JSON Datatype. CoRR abs/1608.03960 (2016) - 2015
- [j1]Martin Kleppmann, Jay Kreps:
Kafka, Samza and the Unix Philosophy of Distributed Data. IEEE Data Eng. Bull. 38(4): 4-14 (2015) - [c1]Martin Kleppmann, Conrad Irwin:
Strengthening Public Key Authentication Against Key Theft (Short Paper). PASSWORDS 2015: 144-150 - [i1]Martin Kleppmann:
A Critique of the CAP Theorem. CoRR abs/1509.05393 (2015)
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-10-16 20:32 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:
