6 citations · 7 across the 2 of their papers we have counts for
2 papers
cs.DC2012★ 6 cited
A Fast Distributed Approximation Algorithm for Minimum Spanning Trees in the SINR Model
Maleq Khan, V. S. Anil Kumar, Gopal Pandurangan +1
A fundamental problem in wireless networks is the \emph{minimum spanning tree} (MST) problem: given a set of wireless nodes, compute a spanning tree , so that the total cost…
math.DS2011★ 1 cited
Bifurcations in Boolean Networks
Chris J. Kuhlman, Henning S. Mortveit, David Murrugarra +1
This paper characterizes the attractor structure of synchronous and asynchronous Boolean networks induced by bi-threshold functions. Bi-threshold functions are generalizations of c…