STOC 2001 | Sciweavers

Let G = (V, E) be an undirected weighted graph with |V | = n and |E| = m. Let k 1 be an integer. We show that G = (V, E) can be preprocessed in O(kmn1/k ) expected time, construc...

Mikkel Thorup, Uri Zwick

claim paper

Read More »

72

click to vote

STOC
2001
ACM

134views Algorithms» more STOC 2001»

Fully-dynamic min-cut

15 years 10 months ago

Download cgi.di.uoa.gr

We show that we can maintain up to polylogarithmic edge connectivity for a fully-dynamic graph in ~O(pn) time per edge insertion or deletion. Within logarithmic factors, this matc...

Mikkel Thorup

claim paper

Read More »

76

click to vote

STOC
2001
ACM

137views Algorithms» more STOC 2001»

Computing with continuous-time Liapunov systems

15 years 10 months ago

Download www.tcs.hut.fi

Jirí Síma, Pekka Orponen

claim paper

Read More »

78

click to vote

STOC
2001
ACM

163views Algorithms» more STOC 2001»

Extractor codes

15 years 10 months ago

Download www.cs.tau.ac.il

We study error-correcting codes for highly noisy channels. For example, every received signal in the channel may originate from some half of the symbols in the alphabet. Our main c...

Amnon Ta-Shma, David Zuckerman

claim paper

Read More »

69

click to vote

STOC
2001
ACM

133views Algorithms» more STOC 2001»

Loss-less condensers, unbalanced expanders, and extractors

15 years 10 months ago