Global routing for modern large-scale circuit designs has attracted much attention in the recent literature. Most of the state-of-the-art academic global routers just work on a sim...
A very general fading scenario is considered for which exact, closed-form formulas for the correlation coefficient of the instantaneous power at the output of a Maximal Ratio Combi...
Consider independent and identically distributed exponential random variables (r.vs) 1, 2, . . . , and positive scalars 1, 2, . . . , . In this letter, we present the probability...
We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove in...
We consider the problem of testing graph expansion (either vertex or edge) in the bounded degree model [10]. We give a property tester that given a graph with degree bound d, an ex...