2 papers
cs.DC2017
A Concurrency-Optimal Binary Search Tree
Vitaly Aksenov, Vincent Gramoli, Petr Kuznetsov +2
The paper presents the first \emph{concurrency-optimal} implementation of a binary search tree (BST). The implementation, based on a standard sequential implementation of an intern…
cs.CC2014
Tree-like resolution complexity of two planar problems
Dmitry Itsykson, Anna Malova, Vsevolod Oparin +1
We consider two CSP problems: the first CSP encodes 2D Sperner's lemma for the standard triangulation of the right triangle on small triangles; the second CSP encodes the fac…