#### Filter Results:

- Full text PDF available (3)

#### Publication Year

2015

2017

- This year (2)
- Last 5 years (3)
- Last 10 years (3)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Shang-En Huang, Dawei Huang, Tsvi Kopelowitz, Seth Pettie
- SODA
- 2017

Dynamic connectivity is one of the most fundamental problems in dynamic graph algorithms. We present a new randomized dynamic connectivity structure with O(log n(log log n)) amortized expected update time and O(log n/ log log log n) query time, which comes within an O((log log n)) factor of a lower bound due to Pǎtraşcu and Demaine. The new structure is… (More)

- Shang-En Huang, Seth Pettie
- ArXiv
- 2017

A (β, )-hopset is, informally, a weighted edge set that, when added to a graph, allows one to get from point a to point b using a path with at most β edges (“hops”) and length (1 + ) dist(a, b). In this paper we observe that Thorup and Zwick’s sublinear additive emulators are also actually (O(k/ ), )hopsets for every > 0, and that with a small change to the… (More)

- Biaoshuai Tai, Wei Lee, Shang-En Huang
- 2015

Notations Notations in this lecture are pretty convoluted. In general, quantities with ·̂ indicates the empirical version of the corresponding quantity without ·̂. Given a loss function `, R` denote the expected loss under a certain distribution. For example, for 0-1 loss z, Rz is the expected 0-1 loss while R̂z is the empirical loss with n i.i.d. samples.… (More)

- ‹
- 1
- ›