1. |
- Aceto, Luca, et al.
(författare)
-
Algebraic properties for free!
- 2009
-
Ingår i: Bulletin of the European Association for Theoretical Computer Science. - : European Association for Theoretical Computer Science. - 0252-9742. ; 99, s. 81-103
-
Tidskriftsartikel (refereegranskat)abstract
- Algebraic properties specify some natural properties of programming and specification constructs. This paper provides an overview of techniques to guarantee or generate algebraic properties of language constructs by investigating the syntactic shape of the deduction rules defining their operational semantics.
|
|
2. |
|
|
3. |
- Brukman, Olga, et al.
(författare)
-
Self-stabilization from theory to practice
- 2008
-
Ingår i: Bulletin of the European Association for Theoretical Computer Science. - 0252-9742. ; 94:February 2007, s. 130-150
-
Tidskriftsartikel (övrigt vetenskapligt/konstnärligt)
|
|
4. |
- Drewes, Frank
(författare)
-
On DAG Languages and DAG Transducers
- 2017
-
Ingår i: Bulletin of the European Association for Theoretical Computer Science. - : European Association for Theoretical Computer Science. - 0252-9742. ; 121, s. 142-163
-
Tidskriftsartikel (övrigt vetenskapligt/konstnärligt)abstract
- We review recent results regarding DAG automata and regular DAG languages and point out some open problems that may be interesting to work on. Moreover, a notion of DAG transducers is suggested.
|
|
5. |
|
|
6. |
- Schmid, Stefan, et al.
(författare)
-
The Distributed Minimum Spanning Tree Problem
- 2018
-
Ingår i: Bulletin of the European Association for Theoretical Computer Science. - : EUROPEAN ASSOC THEORETICAL COMPUTER SCIENCE. - 0252-9742. ; :125, s. 51-80
-
Tidskriftsartikel (refereegranskat)abstract
- This article surveys the distributed minimum spanning tree (MST) problem, a central and one of the most studied problems in distributed computing. In this problem, we are given a network, represented as a weighted graph G = (v, E), and the nodes in the network communicate by message passing via the edges of G with the goal of constructing an MST of G in a distributed fashion, i.e., each node should identify the MST edges incident to itself. This article summarizes the long line of research in designing efficient distributed algorithms and showing lower bounds for the distributed MST problem, including the most recent developments which have focused on algorithms that are simultaneously round- and message-optimal.
|
|