Add to ORKGInternational audienceWe study a state-of-the-art incremental cycle detection algorithm due to Bender, Fineman, Gilbert, and Tarjan. We propose a simple change that allows the algorithm to be regarded as genuinely online. Then, we exploit Separation Logic with Time Credits to simultaneously verify the correctness and the worst-case amortized asymptotic complexity of the modified algorithm
AbstractGiven a function f over a domain and an element x in the domain, the cycle detection problem...
International audienceThis article presents an algorithm that performs a decentralized detection of ...
International audienceDistributed property testing in networks has been introduced by Brakerski and ...
International audienceWe study a state-of-the-art incremental cycle detection algorithm due to Bende...
We study a state-of-the-art incremental cycle detection algorithm due to Bender, Fineman, Gilbert, a...
This dissertation is concerned with the question of formally verifying that the implementation of an...
AbstractA common way to evaluate the time complexity of an algorithm is to use asymptotic worst-case...
International audienceWe present a short implementation of the well-known Tortoise and Hare cycle fi...
Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018Interna...
We present two online algorithms for maintaining a topological order of a directed n-vertex acyclic ...
We consider the problem of incremental cycle detection and topological ordering in a directed graph ...
AbstractA certifying algorithm for a problem is an algorithm that provides a certificate with each a...
We present two online algorithms for maintaining a topological order of a directed acyclic graph as ...
We study a design framework for robust, independently verifiable, and workload-balanced distributed ...
A study of the general properties of incremental algorithms is presented. First, it is shown that wi...
AbstractGiven a function f over a domain and an element x in the domain, the cycle detection problem...
International audienceThis article presents an algorithm that performs a decentralized detection of ...
International audienceDistributed property testing in networks has been introduced by Brakerski and ...
International audienceWe study a state-of-the-art incremental cycle detection algorithm due to Bende...
We study a state-of-the-art incremental cycle detection algorithm due to Bender, Fineman, Gilbert, a...
This dissertation is concerned with the question of formally verifying that the implementation of an...
AbstractA common way to evaluate the time complexity of an algorithm is to use asymptotic worst-case...
International audienceWe present a short implementation of the well-known Tortoise and Hare cycle fi...
Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018Interna...
We present two online algorithms for maintaining a topological order of a directed n-vertex acyclic ...
We consider the problem of incremental cycle detection and topological ordering in a directed graph ...
AbstractA certifying algorithm for a problem is an algorithm that provides a certificate with each a...
We present two online algorithms for maintaining a topological order of a directed acyclic graph as ...
We study a design framework for robust, independently verifiable, and workload-balanced distributed ...
A study of the general properties of incremental algorithms is presented. First, it is shown that wi...
AbstractGiven a function f over a domain and an element x in the domain, the cycle detection problem...
International audienceThis article presents an algorithm that performs a decentralized detection of ...
International audienceDistributed property testing in networks has been introduced by Brakerski and ...