| |
Henzinger, Monika R. |
 |
|
| |
|
Date Reviewed |
|
 |
|
|
|
| |
1 - 3
of 3 reviews |
|
|
|
|
|
|
| |
Scheduling multicasts on unit-capacity trees and meshes
Henzinger M., Leonardi S. Journal of Computer and System Sciences 66(3): 567-611, 2003. Type: Article
Future high-speed communication networks that use bandwidth reservation for quality-of-service guarantees depend greatly on multicast routing and admission control mechanisms. This paper presents a study of both the offline and the onl...... |
Sep 22 2003 |
|
|
|
|
|
| |
Improved data structures for fully dynamic bioconnectivity
Henzinger M. SIAM Journal on Computing 29(6): 1761-1815, 2000. Type: Article
A fully dynamic algorithm with O ( &sqrt;mlogn) amortized update time and constant query time for undirected graphs is presented. The author also provides an algorithm to determine all the bloc...... |
Feb 1 2001 |
|
|
|
|
|
| |
Randomized fully dynamic graph algorithms with polylogarithmic time per operation
Henzinger M., King V. Journal of the ACM 46(4): 502-516, 1999. Type: Article
The authors present a technique for designing fully dynamic algorithms with polylogarithmic time per operation for dynamically testing several graph properties. The technique combines a new graph decomposition and randomization. The ed...... |
Mar 1 2000 |
|
|
|
|
|
|
|
|
| |
|
|
