#### Filter Results:

- Full text PDF available (548)

#### Publication Year

1996

2017

- This year (25)
- Last 5 years (161)
- Last 10 years (334)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

Learn More

- Bodhi Priyantha, Hari Balakrishnan, Erik D. Demaine, Seth J. Teller
- SenSys
- 2003

Many sensor network applications require that each node’s sensor stream be annotated with its physical location in some common coordinate system. Manual measurement and configuration methods for obtaining location don’t scale and are error-prone, and equipping sensors with GPS is often expensive and does not work in indoor and urban deployments. Sensor… (More)

- David Benoit, Erik D. Demaine, J. Ian Munro, Venkatesh Raman
- Algorithmica
- 1999

This paper focuses on space efficient representations of rooted trees that permit basic navigation in constant time. While most of the previous work has focused on binary trees, we turn our attention to trees of higher degree. We consider both cardinal trees (or k-ary tries), where each node has k slots, labelled {1,...,k}, each of which may have a… (More)

We consider a router on the Internet analyzing the statistical properties of a TCP/IP packet stream. A fundamental difficulty with measuring traffic behavior on the Internet is that there is simply too much data to be recorded for later analysis, on the order of gigabytes a second. As a result, network routers can collect only relatively few statistics… (More)

We present dynamic search-tree data structures that perform well in the setting of a hierarchical memory (including various levels of cache, disk, etc.), 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. In particular, between any pair of levels in the memory… (More)

- Robert A. Hearn, Erik D. Demaine
- Theor. Comput. Sci.
- 2005

We present a nondeterministic model of computation based on reversing edge directions in weighted directed graphs with minimum in-flow constraints on vertices. Deciding whether this simple graph model can be manipulated in order to reverse the direction of a particular edge is shown to be PSPACEcomplete by a reduction from Quantified Boolean Formulas. We… (More)

- Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro
- SODA
- 2000

Motivated by boolean queries in text database systems, we consider the problems of finding the intersection, union, or difference of a collection of sorted sets. While the worst-case complexity of these problems is straightforward, we consider a not ion of complexity that depends on the particular instance. We develop the idea of a proof that a given set is… (More)

- Erik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann
- ACM Trans. Algorithms
- 2007

The <i>edit distance</i> between two ordered rooted trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations consisting of deleting and relabeling existing nodes, as well as inserting new nodes. In this article, we present a worst-case <i>O</i>(<i>n</i><sup>3</sup>)-time algorithm for the… (More)

- Erik D. Demaine, Dotan Emanuel, Amos Fiat, Nicole Immorlica
- Theor. Comput. Sci.
- 2006

We consider the following general correlation-clustering problem [1]: given a graph with real nonnegative edge weights and a 〈+〉/〈−〉 edge labeling, partition the vertices into clusters to minimize the total weight of cut 〈+〉 edges and uncut 〈−〉 edges. Thus, 〈+〉 edges with large weights (representing strong correlations between endpoints) encourage those… (More)

In the Order-Maintenance Problem, the objective is to maintain a total order subject to insertions, deletions, and precedence queries. Known optimal solutions, due to Dietz and Sleator, are complicated. We present new algorithms that match the bounds of Dietz and Sleator. Our solutions are simple, and we present experimental evidence that suggests that they… (More)

- Jonathan Bredin, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Daniela Rus
- MobiHoc
- 2005

We consider the problem of deploying or repairing a sensor network to guarantee a specified level of multi-path connectivity (<i>k</i>-connectivity) between all nodes. Such a guarantee simultaneously provides fault tolerance against node failures and high capacity through multi-path routing. We design and analyze the first algorithms that place an… (More)