Matthew Weidner
CMU (current, PhD in CS)
Cambridge ('19, MPhil in CS)
Caltech ('18, BS in Math)
|
|
I am a
computer science PhD student at CMU, advised by
Heather Miller. For most of my PhD, I was supported by an
NDSEG Fellowship sponsored by the
US Office of Naval Research.
My current research focuses on tools for building decentralized systems, including conflict-free replicated data types (CRDTs) and secure group messaging protocols. Previously, I studied error-correcting code algorithms and algebraic number theory.
Blog
RSS Feed
Open-Source Software
- Collabs: A TypeScript collections library for collaborative data structures.
- position-strings: A source of lexicographically-ordered "position strings" for collaborative lists and text.
Talks
Demo Apps
Research Papers
Collaborative Apps / CRDTs
- Collabs: A Flexible and Performant CRDT Collaboration Framework.
M. Weidner, H. Qi, M. Kjaer, R. Pradeep, B. Geordie, Y. Zhang, G. Schare, X. Tang, S. Xing, and H. Miller. arXiv preprint, 2023.
arXiv
- Proposal: Versioned Collaborative Documents.
M. Weidner. PLF Workshop 2023.
preprint • slides
- The Art of the Fugue: Minimizing Interleaving in Collaborative Text Editing.
M. Weidner and M. Kleppmann. arXiv preprint, 2023.
arXiv
- For-Each Operations in Collaborative Apps.
M. Weidner, R. Pradeep, B. Geordie, and H. Miller. PaPoC 2023.
Official (open access) • arXiv (extended version) • Slides
- Programmer Experience When Using CRDTs to Build Collaborative Webapps: Initial Insights.
Y. Zhang, M. Weidner, and H. Miller. PLATEAU 2023.
Official (open access) • Slides
- An Oblivious Observed-Reset Embeddable Replicated Counter.
M. Weidner and P. S. Almeida. PaPoC 2022.
Official (open access) • Slides
- Composing and Decomposing Op-Based CRDTs with Semidirect Products.
M. Weidner, H. Miller, and C. Meiklejohn. ICFP 2020.
Official (open access) • Video • Slides (ICFP 2020) • Slides (SPLASH 2022)
Secure Messaging
Math and CS Theory (Older)
- On decoding Cohen-Haeupler-Schulman tree codes.
A. K. Narayanan and M. Weidner. SODA 2020.
Pdf • Official • Slides
- Subquadratic time encodable codes beating the Gilbert-Varshamov bound.
A. K. Narayanan and M. Weidner. IEEE Transactions on Information Theory, October 2019.
Pdf (authors' accepted manuscript) • Official
- On cycles of pairing-friendly elliptic curves.
A. Chiesa, L. Chua, and M. Weidner. SIAM Journal on Applied Algebra and Geometry, 2019.
Pdf • Official
- Pseudocharacters of homomorphisms into classical groups.
M. Weidner. Transformation Groups, 2020.
Pdf (author's accepted manuscript) • Offical
- On conjectural rank parities of quartic and sextic twists of elliptic curves.
M. Weidner. International Journal of Number Theory, June 2019.
arXiv • Official • Code
- Towards fast encoding of Garcia-Stichtenoth algebraic
geometry codes.
M. Weidner. Caltech SURF Final Report, 2018.
Advisors: A. K. Narayanan and C. Umans.
Pdf
- On Selmer rank parity of twists.
M. Hadian and M. Weidner. Journal of the Australian Mathematical Society, June 2017.
Pdf (preprint) • Official
Matthew Weidner
• PhD student at CMU CSD
• maweidne@andrew.cmu.edu
• @MatthewWeidner3