A randomized algorithm for computing the minimum spanning forest of a weighted graph with no isolated vertices. It was developed by David Karger… (More)

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- Insu Han, Dmitry Malioutov, Haim Avron, Jinwoo Shin
- SIAM J. Scientific Computing
- 2017

Computation of the trace of a matrix function plays an important role in many scientific computing applications, including… (More)

Is this relevant?

2016

2016

- Insu Han, Dmitry Malioutov, Haim Avron, Jinwoo Shin
- ArXiv
- 2016

Computation of the trace of a matrix function plays an important role in many scientific computing applications, including… (More)

Is this relevant?

2015

2015

- Insu Han, Dmitry Malioutov, Jinwoo Shin
- ICML
- 2015

Logarithms of determinants of large positive definite matrices appear ubiquitously in machine learning applications including… (More)

Is this relevant?

2014

2014

- Kevin Verbeek, Subhash Suri
- Symposium on Computational Geometry
- 2014

We consider the problem of embedding an undirected graph into hyperbolic space with minimum distortion. A fundamental problem in… (More)

Is this relevant?

Highly Cited

2007

Highly Cited

2007

- Surender Baswana, Sandeep Sen
- Random Struct. Algorithms
- 2007

Let G = (V, E) be an undirected weighted graph on |V | = n vertices, and |E| = m edges. A t-spanner of the graph G, for any t ≥ 1… (More)

Is this relevant?

2006

2006

- V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan, Sibylle Zust
- J. Parallel Distrib. Comput.
- 2006

We present provably efficient parallel algorithms for sweep scheduling, which is a commonly used technique in Radiation Transport… (More)

Is this relevant?

2005

2005

- V. S. Anil Kumar, Srinivasan Parthasarathy, Madhav V. Marathe, Aravind Srinivasan, Sibylle Zust
- 19th IEEE International Parallel and Distributed…
- 2005

We present provably efficient parallel algorithms for sweep scheduling on unstructured meshes. Sweep scheduling is a commonly… (More)

Is this relevant?

2003

2003

- Surender Baswanay, Sandeep Senz
- 2003

Let G(V;E) be an undirected weighted graph with jV j = n, and jEj = m. A t-spanner of the graph G(V;E) is a sub-graph G(V;ES), ES… (More)

Is this relevant?

1993

1993

- Rolf Klein, Andrzej Lingas
- Symposium on Computational Geometry
- 1993

For a polygon <italic>P</italic>, the bounded Voronoi diagram of <italic>P</italic> is a partition of <italic>P</italic> into… (More)

Is this relevant?

Highly Cited

1992

Highly Cited

1992

- Brandon Dixon, Monika Henzinger, Robert E. Tarjan
- SIAM J. Comput.
- 1992

Koml os has devised a way to use a linear number of binary comparisons to test whether a given spanning tree of a graph with edge… (More)

Is this relevant?