• Publications
  • Influence
Anchor-Free Distributed Localization in Sensor Networks
TLDR
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
PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
TLDR
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
Representing Trees of Higher Degree
TLDR
This paper focuses on space efficient representations of rooted trees of higher degree that permit basic navigation in constant time. Expand
Correlation clustering in general weighted graphs
TLDR
We give an O(log n)-approximation algorithm for the general case based on a linear-programming rounding and the "region-growing" technique. Expand
Frequency Estimation of Internet Packet Streams with Limited Space
TLDR
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
Deploying sensor networks with guaranteed capacity and fault tolerance
TLDR
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
Cache-oblivious B-trees
TLDR
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
Adaptive set intersections, unions, and differences
TLDR
We consider the problems of finding the intersection, union, or difference of a collection of sorted sets. Expand
EpiChord: parallelizing the chord lookup algorithm with reactive routing state management
TLDR
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
Geometric folding algorithms - linkages, origami, polyhedra
TLDR
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
...
1
2
3
4
5
...