Sciweavers

774 search results - page 97 / 155
» A New Graph Triconnectivity Algorithm and Its Parallelizatio...
Sort
View
PPOPP
2005
ACM
14 years 2 months ago
Teleport messaging for distributed stream programs
In this paper, we develop a new language construct to address one of the pitfalls of parallel programming: precise handling of events across parallel components. The construct, te...
William Thies, Michal Karczmarek, Janis Sermulins,...
TCS
2008
13 years 9 months ago
Digraph measures: Kelly decompositions, games, and orderings
We consider various well-known, equivalent complexity measures for graphs such as elimination orderings, k-trees and cops and robber games and study their natural translations to ...
Paul Hunter, Stephan Kreutzer
PODC
2010
ACM
14 years 27 days ago
Deterministic distributed vertex coloring in polylogarithmic time
Consider an n-vertex graph G = (V, E) of maximum degree ∆, and suppose that each vertex v ∈ V hosts a processor. The processors are allowed to communicate only with their neig...
Leonid Barenboim, Michael Elkin
LICS
1990
IEEE
14 years 1 months ago
Model-Checking for Real-Time Systems
E cient automatic model checking algorithms for real-time systems have been obtained in recent years based on the state region graph technique of Alur, Courcoubetis and Dill. Howev...
Rajeev Alur, Costas Courcoubetis, David L. Dill
RTSS
1995
IEEE
14 years 16 days ago
Compositional and Symbolic Model-Checking of Real-Time Systems
E cient automatic model-checking algorithms for real-time systems have been obtained in recent years based on the state-region graph technique of Alur, Courcoubetis and Dill. Howe...
Kim Guldstrand Larsen, Paul Pettersson, Wang Yi