We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some non-trivial lower bounds on the tradeoff between time, spar...
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...
We introduce a simple liveness property for shared object implementations that is gracefully degrading depending on the degree of synchrony in each run. This property, called adapt...
— This video shows the investigation of a novel minimalistic, dynamic climbing robot which can climb up tubes of different shapes using a simple dc motor. The motor moves an ecce...
Amir Degani, Siyuan Feng, Howie Choset, Matthew T....
Distributed computing (DC) projects tackle large computational problems by exploiting the donated processing power of thousands of volunteered computers, connected through the Int...
Toni Giorgino, Matt J. Harvey, Gianni De Fabritiis