50 search results - page 5 / 10 » focs 2000 |
COCOON
2001
Springer
14 years 2 months ago
2001
Springer
We present a simple space saving trick that applies to many previous algorithms for transitive closure and shortest paths in dynamic directed graphs. In these problems, an update c...
FOCS
2000
IEEE
14 years 2 months ago
2000
IEEE
The data stream model has recently attracted attention for its applicability to numerous types of data, including telephone records, web documents and clickstreams. For analysis o...
FOCS
2000
IEEE
14 years 1 months ago
2000
IEEE
We formalize a notion of topological simplification within the framework of a filtration, which is the history of a growing complex. We classify a topological change that happens ...
FOCS
2000
IEEE
14 years 2 months ago
2000
IEEE
We show that the graph isomorphism problem is hard under DLOGTIME uniform AC0 many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space) for every loga...
FOCS
2000
IEEE
14 years 2 months ago
2000
IEEE
A probabilistic algorithm is presented to find the determinant of a nonsingular, integer matrix. For a matrix A ¡£¢ n¤ n the algorithm requires O¥ n3¦5 ¥ logn§ 4¦5§ bit...