Matthew Weidner

Orcid: 0000-0003-0701-7676

According to our database1, Matthew Weidner authored at least 12 papers between 2017 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
The Art of the Fugue: Minimizing Interleaving in Collaborative Text Editing.
IEEE Trans. Parallel Distributed Syst., November, 2025

2023
The Art of the Fugue: Minimizing Interleaving in Collaborative Text Editing.
CoRR, 2023

For-Each Operations in Collaborative Apps.
Proceedings of the 10th Workshop on Principles and Practice of Consistency for Distributed Data, 2023

2022
Collabs: Composable Collaborative Data Structures.
CoRR, 2022

An oblivious observed-reset embeddable replicated counter.
Proceedings of the PaPoC@EuroSys 2022: Proceedings of the 9th Workshop on Principles and Practice of Consistency for Distributed Data, Rennes, France, April 5, 2022

2021
Key Agreement for Decentralized Secure Group Messaging with Strong Security Guarantees.
Proceedings of the CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15, 2021

2020
Composing and decomposing op-based CRDTs with semidirect products.
Proc. ACM Program. Lang., 2020

On Decoding Cohen-Haeupler-Schulman Tree Codes.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Composing and decomposing op-based CRDTs with semidirect products: (summary).
Proceedings of the 7th Workshop on Principles and Practice of Consistency for Distributed Data, 2020

2019
Subquadratic Time Encodable Codes Beating the Gilbert-Varshamov Bound.
IEEE Trans. Inf. Theory, 2019

On Cycles of Pairing-Friendly Elliptic Curves.
SIAM J. Appl. Algebra Geom., 2019

2017
Nearly linear time encodable codes beating the Gilbert-Varshamov bound.
CoRR, 2017


  Loading...