A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
A Self-stabilizing Algorithm For 3-Edge-Connectivity
[chapter]

2007
*
Lecture Notes in Computer Science
*

In this paper, we propose

doi:10.1007/978-3-540-74742-0_4
fatcat:arpwobyzb5b3bb7ytw2wxdsdd4
*a**self*-*stabilizing**algorithm**for**3*-*edge*-*connectivity*of an asynchronous distributed model of computation. ... Until now, this is the only*algorithm*to compute all the*3*-*edge*-*connected*components in the context of*self*-*stabilization*. ... Like all the existing*self*-*stabilizing**algorithms**for*graph*connectivity*[2,*3*, 5, [9] [10] [11] ,*a**self*-*stabilizing*depth-first search*algorithm*, such as that of Collin and Dolev [4] , is run concurrently ...##
###
A Self-Stabilizing Algorithm for Detecting Fundamental Cycles in a Graph

1999
*
Journal of computer and system sciences (Print)
*

In this paper,

doi:10.1006/jcss.1999.1622
fatcat:bntdy4m74ncmzja57qkjqocncy
*a**self*-*stabilizing**algorithm**for*detecting an SFC of*a**connected*undirected graph is presented. ... K CONCLUDING REMARKS We have presented*a**self*-*stabilizing**algorithm**for*detecting all fundamental cycles (an SFC), and as*a*by-product the bridges, of*a*given*connected*undirected graph. ...##
###
SELF-STABILIZING COMPUTATION OF 3-EDGE-CONNECTED COMPONENTS

2011
*
International Journal of Foundations of Computer Science
*

The only known

doi:10.1142/s0129054111008623
fatcat:akrx2eh5tvherofvb45m4ws4em
*self*-*stabilizing**algorithm**for**3*-*edge*-*connectivity*[17] is*a*composition of three*algorithms*that run concurrently. ... These time and space complexity are at least*a*factor of n better than those of the previously best-known*self*-*stabilizing**algorithm**for**3*-*edge*-*connectivity*. ... Conclusion We have presented*a**self*-*stabilizing**algorithm**for*the*3*-*edge*-*connectivity*problem. ...##
###
A Self-stabilizing and Local Delaunay Graph Construction
[chapter]

2009
*
Lecture Notes in Computer Science
*

In particular, we present

doi:10.1007/978-3-642-10631-6_78
fatcat:cn5mrvks2be5jjire42tr37czm
*a*local*self*-*stabilizing**algorithm*that constructs*a*Delaunay graph from any initial*connected*topology and in*a*distributed manner. ... This paper studies the construction of*self*-*stabilizing*topologies*for*distributed systems. ...*A*notable recent exception is [8] which describes*a*truly*self*-*stabilizing**algorithm**for*skip graphs. ...##
###
Linearization: Locally Self-Stabilizing Sorting in Graphs
[chapter]

2007
*
2007 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX)
*

We consider the problem of designing

doi:10.1137/1.9781611972870.10
dblp:conf/alenex/OnusRS07
fatcat:6ahnrchidzclndgedzxgxgt6ka
*a*distributed*algorithm*that, given an arbitrary*connected*graph G of nodes with unique labels, converts G into*a*sorted list of nodes. ... As shown in this paper, this technique transforms any*connected*graph into*a*sorted list, but there are graphs*for*which this can take*a*long time. ... Hence, if we can show that the PL*algorithm*converges to*a*sorted list*for*any*connected*graph, the PL*algorithm*is*self*-*stabilizing*. ...##
###
A Stabilizing Algorithm for Finding Biconnected Components

2002
*
Journal of Parallel and Distributed Computing
*

In this paper,

doi:10.1006/jpdc.2001.1833
fatcat:kqb6ofn6sve33j3ls67jf4hwuy
*a**self*-*stabilizing**algorithm*is presented*for*finding biconnected components of*a**connected*undirected graph on*a*distributed or network model of computation. ... The*algorithm*is resilient to transient faults, therefore, it does not require initialization. The proposed*algorithm*is based on*stabilizing*BFS construction and bridge-finding*algorithms*. ... General techniques*for*constructing*self*-*stabilizing**algorithms*are dealt with in [*3*, 4, 21] .*Self*-*stabilizing**algorithms*are able to withstand transient failures. ...##
###
Fast and Compact Distributed Verification and Self-Stabilization of a DFS Tree
[article]

2014
*
arXiv
*
pre-print

We present

arXiv:1408.0384v2
fatcat:4mr7c6yekjclbc4bivcnxrf54u
*algorithms**for*distributed verification and silent-*stabilization*of*a*DFS(Depth First Search) spanning tree of*a**connected*network. ... To demonstrate the simplicity of constructing efficient DFS*algorithms*using the modular approach, We also present*a*(non-sielnt)*self*-*stabilizing*DFS token circulation*algorithm**for*general networks based ... Acknowledgements This research was supported in part by*a*grant from ISF and Technion TASP center. ...##
###
Self-stabilizing robots in highly dynamic environments

2019
*
Theoretical Computer Science
*

Our main contribution is to show that this problem is deterministically solvable in this harsh environment by providing

doi:10.1016/j.tcs.2018.11.026
fatcat:7x5pv3gb6rhxlloo7plwfcprbe
*a**self*-*stabilizing**algorithm**for*three robots. ... Second, we aim at providing*a**self*-*stabilizing**algorithm*to the robots, i.e., the*algorithm*must guarantee an eventual correct behavior regardless of the initial state and positions of the robots. ... Lemma 15*Algorithm**3*is*a**self*-*stabilizing*perpetual exploration*algorithm**for*the class of connectedover-time but not*edge*-recurrent rings of arbitrary size using three robots. ...##
###
Self-Stabilizing De Bruijn Networks
[chapter]

2011
*
Lecture Notes in Computer Science
*

Also, we show that there is

doi:10.1007/978-3-642-24550-3_31
fatcat:rsmriile7ncljm3eoamxxqrgsa
*a*simple local-control*algorithm*that can recover the LDB network from any network topology that is weakly*connected*. ... This paper presents*a*dynamic overlay network based on the De Bruijn graph which we call Linearized De Bruijn (LDB) network. ... So we know that the*self*-*stabilization**algorithms*will still be able to return the network to*a*proper state. Theorem*3*. Let G be an LDB network and let v be*a*real node in G. ...##
###
A SILENT SELF-STABILIZING ALGORITHM FOR FINDING CUT-NODES AND BRIDGES

2005
*
Parallel Processing Letters
*

The composition of these two

doi:10.1142/s0129626405002143
fatcat:yynmy55k2vbk5fqdgmd2zk2bhm
*algorithms*is*self*-*stabilizing*: starting from any arbitrary configuration, it requires*a*finite number of steps to converge to*a*legitimate configuration and the system state ... In this paper, we present*a*silent*algorithm**for*finding cut-nodes and bridges in arbitrary rooted networks. This*algorithm*must be composed with an*algorithm*from Collin and Dolev. ... In the same section, we also state what it means*for**a*composite*algorithm*to be*self*-*stabilizing*. In Section*3*, we explain how the*algorithm*from [4] works. ...##
###
Re-Chord

2011
*
Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA '11
*

We present

doi:10.1145/1989493.1989527
dblp:conf/spaa/KniesburgesKS11
fatcat:n756lgnt2vco3cj5246moyidmm
*a*slight extension of the Chord network, called Re-Chord (reactive Chord), that turns out to be locally checkable, and we present*a**self*-*stabilizing*distributed protocol*for*it that can recover ... Though Chord is known to be very efficient and scalable and it can handle churn quite well, no protocol is known yet that guarantees that Chord is*self*-*stabilizing*, i.e., the Chord network can be recovered ... In [*3*] the authors present*a*general framework*for*the*self*-*stabilizing*construction of any overlay network. ...##
###
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs

2009
*
Proceedings of the 28th ACM symposium on Principles of distributed computing - PODC '09
*

This is an exponential improvement compared to previously known

doi:10.1145/1582716.1582741
dblp:conf/podc/JacobRSST09
fatcat:vzmt55vkznhkzi2ujntej5prd4
*self*-*stabilizing**algorithms**for*overlay networks. In addition, individual joins and leaves are handled locally and require little work. ... Concretely, we present*a*distributed and*self*-*stabilizing**algorithm*that constructs*a*(variant of the) skip graph in polylogarithmic time from any initial state in which the overlay network is still weakly ... Our goal will be to find*a**self*-*stabilizing**algorithm*that needs as few rounds as possible*for*this. ...##
###
Re-Chord: A Self-stabilizing Chord Overlay Network

2012
*
Theory of Computing Systems
*

We present

doi:10.1007/s00224-012-9431-2
fatcat:vhng23kebfgvjo4yzfiw5ba4qi
*a*slight extension of the Chord network, called Re-Chord (reactive Chord), that turns out to be locally checkable, and we present*a**self*-*stabilizing*distributed protocol*for*it that can recover ... Though Chord is known to be very efficient and scalable and it can handle churn quite well, no protocol is known yet that guarantees that Chord is*self*-*stabilizing*, i.e., the Chord network can be recovered ... In [*3*] the authors present*a*general framework*for*the*self*-*stabilizing*construction of any overlay network. ...##
###
Network Scaffolding for Efficient Stabilization of the Chord Overlay Network
[article]

2021
*
arXiv
*
pre-print

*Self*-

*stabilizing*overlay networks offer one approach

*for*managing these faults, promising to build or restore

*a*particular topology from any weakly-

*connected*initial configuration. ... Designing efficient

*self*-

*stabilizing*

*algorithms*

*for*many topologies, however, is not an easy task. ...

*Algorithm*1, when combined with the

*self*-

*stabilizing*

*algorithm*

*for*Avatar(Cbt) from Berns [2] , is

*a*

*self*-

*stabilizing*

*algorithm*

*for*the network Avatar(Chord) with convergence time O(log 2 N ) in expectation ...

##
###
A Superstabilizing log(n)-Approximation Algorithm for Dynamic Steiner Trees
[chapter]

2009
*
Lecture Notes in Computer Science
*

In this paper we design and prove correct

doi:10.1007/978-3-642-05118-0_10
fatcat:dhwryldxbzhdtpoj3aopshfz74
*a*fully dynamic distributed*algorithm**for*maintaining an approximate Steiner tree that*connects*via*a*minimum-weight spanning tree*a*subset of nodes of*a*network ... Next, our*algorithm*is*self*-*stabilizing*, that is, it copes with nodes memory corruption. Last but not least, our*algorithm*is superstabilizing. ... In the following we propose*a**self*-*stabilizing*Steiner tree*algorithm*and extend it to*a*superstabilizing Steiner tree*algorithm*that copes with the Steiner members and tree*edges*removal. ...
« Previous

*Showing results 1 — 15 out of 87,858 results*