#### Filter Results:

- Full text PDF available (14)

#### Publication Year

1995

2017

- This year (1)
- Last 5 years (4)
- Last 10 years (18)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

#### Organism

Learn More

- Michael T. Goodrich, Jonathan Z. Sun, Roberto Tamassia
- CRYPTO
- 2004

We study the problem of broadcasting confidential information to a collection of n devices while providing the ability to revoke an arbitrary subset of those devices (and tolerating collusion among the revoked devices). In this paper, we restrict our attention to low-memory devices, that is, devices that can store at most O(log n) keys. We consider… (More)

- David Eppstein, Michael T. Goodrich, Jonathan Z. Sun
- Symposium on Computational Geometry
- 2005

We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R<sup>2</sup>) or the skip octree (for point data in R<sup>d</sup>, with constant d > 2). Our data structure combines the best features of two well-known data structures, in that it has the well-defined "box"-shaped regions of region quadtrees and the… (More)

We present a distributed data structure, which we call the <i>rainbow skip graph</i>. To our knowledge, this is the first peer-to-peer data structure that simultaneously achieves high fault-tolerance, constant-sized nodes, and fast update and query times for ordered data. It is a non-trivial adaptation of the SkipNet/skip-graph structures of Harvey <i>et… (More)

- Jonathan Z. Sun
- IBM Journal of Research and Development
- 2006

- David Eppstein, Michael T. Goodrich, Jonathan Z. Sun
- Int. J. Comput. Geometry Appl.
- 2008

- Jonathan Z. Sun, Rui Xu, Jianhua Yin
- FCS
- 2008

In this paper, we show that a simple graph G satisfying Ore-condition with |V (G)| ≥ 3 is A-connected if and only if G is not a 4-cycle, where A is an abelian group of order at least 4.

- Lei Cao, Andrew Strelzoff, Jonathan Z. Sun
- 2009 10th International Symposium on Pervasive…
- 2009

Geometric greedy routing uses (virtual) geographic point locations as addresses for the purposes of routing, while routing decisions are made by each node individually based only on local information. It requires that the network topology is greedily embedded in a metric space through assigning virtual coordinates to the nodes in the network. Recent… (More)

- Michael T. Goodrich, Michael J. Nelson, Jonathan Z. Sun
- ArXiv
- 2009

We present a distributed data structure, which we call the rainbow skip graph. To our knowledge, this is the first peer-to-peer data structure that simultaneously achieves high faulttolerance, constant-sized nodes, and fast update and query times for ordered data. It is a non-trivial adaptation of the SkipNet/skip-graph structures of Harvey et al. and… (More)

- Michael T. Goodrich, George S. Lueker, Jonathan Z. Sun
- Graph Drawing
- 2005

A clustered graph has its vertices grouped into clusters in a hierarchical way via subset inclusion, thereby imposing a tree structure on the clustering relationship. The c-planarity problem is to determine if such a graph can be drawn in a planar way, with clusters drawn as nested regions and with each edge (drawn as a curve between vertex points) crossing… (More)

The transfer of spin angular momentum from a spin-polarized current to a ferromagnet can generate sufficient torque to reorient the magnet’s moment. This torque could enable the development of efficient electrically actuated magnetic memories and nanoscale microwave oscillators. Yet difficulties in making quantitative measurements of the spin-torque vector… (More)