The DAG-based task graph model has been found effective in scheduling for performance prediction and optimization of parallel applications. However the scheduling complexity and s...
A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum ...
EventGraphs are social media network diagrams of conversations related to events, such as conferences. Many conferences now communicate a common “hashtag” or keyword to identi...
—The Internet AS level topology, upon which BGP4 runs, plays a vital role in the analysis and study of the global routing behavior. However, the study of the topology itself is n...
This paper presents an efficient modeling scheme and a partitioning heuristic for parallelizing VLSI post-placement timing optimization. Encoding the paths with timing violations...