8 citations · 15 across the 6 of their papers we have counts for
9 papers
The Art of the Fugue: Minimizing Interleaving in Collaborative Text Editing
Matthew Weidner, Martin Kleppmann
Most existing algorithms for replicated lists, which are widely used in collaborative text editors, suffer from a problem: when two users concurrently insert text at the same posit…
For-Each Operations in Collaborative Apps
Matthew Weidner, Ria Pradeep, Benito Geordie +1
Conflict-free Replicated Data Types (CRDTs) allow collaborative access to an app's data. We describe a novel CRDT operation, for-each on the list of CRDTs, and demonstrate its use…
Collabs: A Flexible and Performant CRDT Collaboration Framework
Matthew Weidner, Huairui Qi, Maxime Kjaer +7
A collaboration framework is a distributed system that serves as the data layer for a collaborative app. Conflict-free Replicated Data Types (CRDTs) are a promising theoretical tec…
Composing and Decomposing Op-Based CRDTs with Semidirect Products
Matthew Weidner, Heather Miller, Christopher Meiklejohn
Operation-based Conflict-free Replicated Data Types (CRDTs) are eventually consistent replicated data types that automatically resolve conflicts between concurrent operations. Op-b…
On Decoding Cohen-Haeupler-Schulman Tree Codes
Anand Kumar Narayanan, Matthew Weidner
Tree codes, introduced by Schulman, are combinatorial structures essential to coding for interactive communication. An infinite family of tree codes with both rate and distance bou…
Pseudocharacters of Classical Groups
Matthew Weidner
A -pseudocharacter is a function from a group to a ring satisfying polynomial relations which make it "look like" the character of a representation. When is an al…
On Conjectural Rank Parities of Quartic and Sextic Twists of Elliptic Curves
Matthew Weidner
We study the behavior under twisting of the Selmer rank parities of a self-dual prime-degree isogeny on a principally polarized abelian variety defined over a number field, subject…
On cycles of pairing-friendly elliptic curves
Alessandro Chiesa, Lynn Chua, Matthew Weidner
A cycle of elliptic curves is a list of elliptic curves over finite fields such that the number of points on one curve is equal to the size of the field of definition of the next,…
Subquadratic time encodable codes beating the Gilbert-Varshamov bound
Anand Kumar Narayanan, Matthew Weidner
We construct explicit algebraic geometry codes built from the Garcia-Stichtenoth function field tower beating the Gilbert-Varshamov bound for alphabet sizes at least 192. Messages…