Several variants of Bryant's ordered binary decision diagrams have been suggested in the literature to reason about discrete functions. In this paper, we introduce a generic ...
: In this paper we consider the vertex ranking problem of weighted trees. We show that this problem is strongly NP-hard. We also give a polynomial-time reduction from the problem o...
This paper addresses the problem of testing whether a Boolean-valued function f is a halfspace, i.e. a function of the form f(x) = sgn(w·x−θ). We consider halfspaces over the ...
Kevin Matulef, Ryan O'Donnell, Ronitt Rubinfeld, R...
We perform an exact analysis of the dynamic behavior of IGRP, an adaptive shortest-path routing algorithm widely used in the industry, on a simple ring network. The distance metri...
In this paper, we study the eigenvalue-based spectrum sensing techniques for multiple-antenna cognitive radio networks. First, we study the extreme eigenvalue distributions of a c...