AAAAAA
Results:
1-7
|
Results: 7
Authors:
HENZINGER MR
FREDMAN ML
Citation: Mr. Henzinger et Ml. Fredman, LOWER BOUNDS FOR FULLY DYNAMIC CONNECTIVITY PROBLEMS IN GRAPHS, Algorithmica, 22(3), 1998, pp. 351-362
Authors:
ALBERTS D
HENZINGER MR
Citation: D. Alberts et Mr. Henzinger, AVERAGE-CASE ANALYSIS OF DYNAMIC GRAPH ALGORITHMS, Algorithmica, 20(1), 1998, pp. 31-60
Authors:
HENZINGER MR
THORUP M
Citation: Mr. Henzinger et M. Thorup, SAMPLING TO PROVIDE OR TO BOUND - WITH APPLICATIONS TO FULLY DYNAMIC GRAPH ALGORITHMS, Random structures & algorithms, 11(4), 1997, pp. 369-379
Authors:
ANDERSON JM
BERC LM
DEAN J
GHEMAWAT S
HENZINGER MR
LEUNG STA
SITES RL
VANDEVOORDE MT
WALDSPURGER CA
WEIHL WE
Citation: Jm. Anderson et al., CONTINUOUS PROFILING - WHERE HAVE ALL THE CYCLES GONE, ACM transactions on computer systems, 15(4), 1997, pp. 357-390
Authors:
HENZINGER MR
Citation: Mr. Henzinger, A STATIC 2-APPROXIMATION ALGORITHM FOR VERTEX CONNECTIVITY AND INCREMENTAL APPROXIMATION ALGORITHMS FOR EDGE AND VERTEX CONNECTIVITY, Journal of algorithms, 24(1), 1997, pp. 194-220
Authors:
HENZINGER MR
KLEIN P
RAO S
SUBRAMANIAN S
Citation: Mr. Henzinger et al., FASTER SHORTEST-PATH ALGORITHMS FOR PLANAR GRAPHS, Journal of computer and system sciences, 55(1), 1997, pp. 3-23
Authors:
HENZINGER MR
Citation: Mr. Henzinger, FULLY DYNAMIC BICONNECTIVITY IN GRAPHS, Algorithmica, 13(6), 1995, pp. 503-538
Risultati:
1-7
|