AAAAAA

   
Results: 1-12 |
Results: 12
Maintaining minimum spanning forests in dynamic graphs
Authors: Henzinger, MR King, V
Citation: Mr. Henzinger et V. King, Maintaining minimum spanning forests in dynamic graphs, SIAM J COMP, 31(2), 2001, pp. 364-374
On near-uniform URL sampling
Authors: Henzinger, MR Heydon, A Mitzenmacher, M Najork, M
Citation: Mr. Henzinger et al., On near-uniform URL sampling, COMPUT NET, 33(1-6), 2000, pp. 295-308
Computing vertex connectivity: New bounds from old techniques
Authors: Henzinger, MR Rao, S Gabow, HN
Citation: Mr. Henzinger et al., Computing vertex connectivity: New bounds from old techniques, J ALGORITHM, 34(2), 2000, pp. 222-250
Improved data structures for fully dynamic biconnectivity
Authors: Henzinger, MR
Citation: Mr. Henzinger, Improved data structures for fully dynamic biconnectivity, SIAM J COMP, 29(6), 2000, pp. 1761-1815
Exploring unknown environments
Authors: Albers, S Henzinger, MR
Citation: S. Albers et Mr. Henzinger, Exploring unknown environments, SIAM J COMP, 29(4), 2000, pp. 1164-1188
A comparison of techniques to find mirrored hosts on the WWW
Authors: Bharat, K Broder, A Dean, J Henzinger, MR
Citation: K. Bharat et al., A comparison of techniques to find mirrored hosts on the WWW, J AM S INFO, 51(12), 2000, pp. 1114-1122
Measuring index quality using random walks on the Web
Authors: Henzinger, MR Heydon, A Mitzenmacher, M Najork, M
Citation: Mr. Henzinger et al., Measuring index quality using random walks on the Web, COMPUT NET, 31(11-16), 1999, pp. 1291-1303
Finding related pages in the World Wide Web
Authors: Dean, J Henzinger, MR
Citation: J. Dean et Mr. Henzinger, Finding related pages in the World Wide Web, COMPUT NET, 31(11-16), 1999, pp. 1467-1479
Finding anything in the billion page Web: are algorithms the key?
Authors: Raghavan, P Broder, A Henzinger, MR Manber, U Pinkerton, B
Citation: P. Raghavan et al., Finding anything in the billion page Web: are algorithms the key?, COMPUT NET, 31(11-16), 1999, pp. 1760-1761
Randomized fully dynamic graph algorithms with polylogarithmic time per operation
Authors: Henzinger, MR King, V
Citation: Mr. Henzinger et V. King, Randomized fully dynamic graph algorithms with polylogarithmic time per operation, J ACM, 46(4), 1999, pp. 502-516
Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology
Authors: Henzinger, MR King, V Warnow, T
Citation: Mr. Henzinger et al., Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology, ALGORITHMIC, 24(1), 1999, pp. 1-13
Twenty-eighth Annual ACM Symposium on the Theory of Computing - Editors' foreword
Authors: Henzinger, MR Rubinfeld, R
Citation: Mr. Henzinger et R. Rubinfeld, Twenty-eighth Annual ACM Symposium on the Theory of Computing - Editors' foreword, J COMPUT SY, 58(1), 1999, pp. 100-100
Risultati: 1-12 |