Filters








2 Hits in 6.1 sec

A Concurrency-Optimal Binary Search Tree [chapter]

Vitaly Aksenov, Vincent Gramoli, Petr Kuznetsov, Anna Malova, Srivatsan Ravi
2017 Lecture Notes in Computer Science  
The paper presents the first concurrency-optimal implementation of a binary search tree (BST).  ...  The implementation, based on a standard sequential implementation of an internal tree, ensures that every schedule is accepted, i.e., interleaving of steps of the sequential code, unless linearizability  ...  In Structural Information and Communication Complexity -23rd International Colloquium, SIROCCO 2016, Helsinki, Finland, July 19-21, 2016, Revised Selected Papers, pages 143-158, 2016.  ... 
doi:10.1007/978-3-319-64203-1_42 fatcat:ywsglklzyngo5acewlmrzltdli

Structural graph theory meets algorithms: covering and connectivity problems in graphs [article]

Saeed Akhoondian Amiri, Technische Universität Berlin, Technische Universität Berlin, Stephan Kreutzer
2017
We exploit structural graph theory to provide novel techniques and algorithms for covering and connectivity problems. First, we focus on the Local model of distributed computing.  ...  It follows that the time complexity of our algorithms are almost optimal. We [...]  ...  In Structural Information and Communication Complexity -23rd International Colloquium, SIROCCO 2016, Helsinki, Finland, July 19-21, 2016, Revised Selected Papers, pages 391-406, 2016. 2. 1 . 1 Fixed  ... 
doi:10.14279/depositonce-6538 fatcat:yc6w5ouqcjby5nt4fs64kemo4q