Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

DISC

Known as: WDAG, Workshop on Distributed Algorithms on Graphs 
The International Symposium on Distributed Computing (DISC) is an annual academic conference for refereed presentations, whose focus is the theory… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Business process modeling means to describe the set of activities either within the companies or organizations. A variety of… Expand
  • figure 1
  • figure 2
  • table 2
  • figure 4
  • figure 3
2015
2015
This paper introduces novel approaches to partitioning and mapping in terms of model-based embedded multicore system engineering… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
2013
2013
A large variety of distributed systems, like some classical synchronizers, routers, or schedulers, have been shown to have a… Expand
  • figure 1
  • figure 2
2004
2004
A self-stabilizing distributed protocol can recover from any state-corrupting fault. A self-stabilizing protocol is called… Expand
2003
2003
Loop agreement is a family of wait-free tasks that includes instances of set agreement and approximate agreement tasks. A task G… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2001
2001
In the current electronic-commerce literature, a commercial transaction is commonly viewed as an exchange between two autonomous… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2000
2000
Abstract Interval routing is a popular compact routing method for point-to-point networks which found industrial applications in… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
1996
1996
How to build a highly available system using consensus.- Distributed admission control algorithms for real-time communication… Expand
1994
1994
Examines the vertex deletion problem for weighted directed acyclic graphs (WDAGs). The objective is to delete the fewest number… Expand
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6