We show that every weighted connected graph G contains as a subgraph a spanning tree into which the edges of G can be embedded with average stretch O log2 n log log n . Moreover, w...
Michael Elkin, Yuval Emek, Daniel A. Spielman, Sha...
Range queries, retrieving all keys within a given range, is an important add-on for Distributed Hash Tables (DHTs), as they rely only on exact key matching lookup. In this paper we...
Event trees are a popular technique for modelling accidents in system safety analyses. Bayesian networks are a probabilistic modelling technique representing influences between unc...
This paper studies the system parameters that affect the total cost of managing the multicast group on a router. A Petri net model is first proposed to describe the states and tra...
Yongjun Li, Wenhui Zhou, James Zijun Wang, Deyu Qi
This paper presents our compilation strategy to produce efficient code for pattern matching in the CDuce compiler, taking into account static information provided by the type syst...