A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
A Concurrency-Optimal Binary Search Tree
[chapter]
2017
Lecture Notes in Computer Science
Preserved Fulltext
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]
2017
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
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