This paper describes a fully decentralized algorithm called AFL (Anchor-Free Localization) where nodes start from a random initial coordinate assignment and converge to a consistent solution using only local node interactions.Expand

We illustrate the importance of our model of computation by giving simple reductions to show that several motion-planning problems are PSPACE-hard, even if the pieces are restricted to be all dominoes.Expand

We present an algorithm that deterministically finds (in particular) all categories having a frequency above 1/(m+1) using m counters, which we prove is best possible in the worst case.Expand

We design and analyze the first algorithms that place an almost-minimum number of additional sensors to augment an existing network into a k-connected network, for any desired parameter k.Expand

We present dynamic search-tree data structures that perform well in the setting of a hierarchical memory hierarchy, but do not depend on the number of memory levels, the block sizes and number of blocks at each level, or the relative speeds of memory access.Expand

EpiChord is a DHT lookup algorithm that demonstrates that we can remove the O(logn)-state-per-node restriction on existing DHT topologies to achieve significantly better lookup performance and resilience using a novel reactive routing state maintenance strategy that amortizes network maintenance costs into existing lookups and by issuing parallel queries.Expand

We present hundreds of results and over 60 unsolved 'open problems' in this comprehensive look at the mathematics of folding, with an emphasis on algorithmic or computational aspects.Expand