Research Output per year

## Fingerprint Dive into the research topics where Aaron Bernstein is active. These topic labels come from the works of this person. Together they form a unique fingerprint.

- 15 Similar Profiles

Directed graphs
Engineering & Materials Science

Shortest path
Mathematics

Deletion
Mathematics

Approximation algorithms
Engineering & Materials Science

Network protocols
Engineering & Materials Science

Graph in graph theory
Mathematics

Update
Mathematics

Bipartite Matching
Mathematics

##
Network
Recent external collaboration on country level. Dive into details by clicking on the dots.

## Research Output 2008 2019

## A deamortization approach for dynamic spanner and dynamic maximal matching

Bernstein, A., Jan 1 2019, p. 1899-1918. 20 p.Research output: Contribution to conference › Paper

Spanner

Update

Data structures

Dynamic Graph Algorithms

Data Structures

## Coresets meet EDCs: Algorithms for matching and vertex cover on massive graphs

Assadi, S. & Bernstein, A., Jan 1 2019, p. 1616-1635. 20 p.Research output: Contribution to conference › Paper

Vertex Cover

Parallel Computation

Graph in graph theory

Approximation

Streaming

1
Citation
(Scopus)

## Decremental strongly-connected components and single-source reachability in near-linear time

Bernstein, A., Jun 23 2019,*STOC 2019 - Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing.*Charikar, M. & Cohen, E. (eds.). Association for Computing Machinery, p. 365-376 12 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Polynomials

## Distance-preserving graph contractions^{∗}

Bernstein, A., Jan 1 2019, In : SIAM Journal on Discrete Mathematics. 33, 3, p. 1607-1636 30 p.Research output: Contribution to journal › Article

Contraction

Graph in graph theory

Hardness

Tolerance

Algorithmic Complexity

4
Citations
(Scopus)

## Distributed exact weighted all-pairs shortest paths in near-linear time

Bernstein, A., Jun 23 2019,*STOC 2019 - Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing.*Charikar, M. & Cohen, E. (eds.). Association for Computing Machinery, p. 334-342 9 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Communication

Directed graphs

Approximation algorithms

Broadcasting