-
1
-
-
0039227987
-
On sparse spanners of weighted graphs
-
I. ALTHÖFER, G. DAS, D. DOBKIN, D. JOSEPH, AND J. SOARES, On sparse spanners of weighted graphs, Discrete Comput. Geom., 9 (1993), pp. 81-100.
-
(1993)
Discrete Comput. Geom.
, vol.9
, pp. 81-100
-
-
Althöfer, I.1
Das, G.2
Dobkin, D.3
Joseph, D.4
Soares, J.5
-
2
-
-
0027806877
-
Near-linear cost sequential and distributed constructions of sparse neighborhood covers
-
IEEE, Piscataway, NJ
-
B. AWERBUCH, B. BERGER, L. COWEN, AND D. PELEG, Near-linear cost sequential and distributed constructions of sparse neighborhood covers, in Proc. 34th IEEE Annual Symposium on Foundations of Computer Science, IEEE, Piscataway, NJ, 1993, pp. 638-647.
-
(1993)
Proc. 34th IEEE Annual Symposium on Foundations of Computer Science
, pp. 638-647
-
-
Awerbuch, B.1
Berger, B.2
Cowen, L.3
Peleg, D.4
-
3
-
-
0025545223
-
Sparse partitions
-
IEEE, Piscataway, NJ
-
B. AWERBUCH AND D. PELEG, Sparse partitions, in Proc. 31st IEEE Annual Symposium on Foundations of Computer Science, IEEE, Piscataway, NJ, 1990, pp. 503-513.
-
(1990)
Proc. 31st IEEE Annual Symposium on Foundations of Computer Science
, pp. 503-513
-
-
Awerbuch, B.1
Peleg, D.2
-
4
-
-
0026971634
-
New sparseness results on graph spanners
-
Association for Computing Machinery, New York
-
B. CHANDRA, G. DAS, G. NARASINHAN, AND J. SOARES, New sparseness results on graph spanners, in Proc. 8th Annual ACM Symposium on Computational Geometry, Association for Computing Machinery, New York, 1992, pp. 192-201.
-
(1992)
Proc. 8th Annual ACM Symposium on Computational Geometry
, pp. 192-201
-
-
Chandra, B.1
Das, G.2
Narasinhan, G.3
Soares, J.4
-
5
-
-
0000182415
-
A measure of the asymptotic efficiency for test of a hypothesis based on the sum of observations
-
H. CHERNOFF, A measure of the asymptotic efficiency for test of a hypothesis based on the sum of observations, Ann. Math. Statist., 23 (1952), pp. 493-509.
-
(1952)
Ann. Math. Statist.
, vol.23
, pp. 493-509
-
-
Chernoff, H.1
-
6
-
-
1542580988
-
Using selective path-doubling for parallel shortest-path computations
-
IEEE, Piscataway, NJ
-
E. COHEN, Using selective path-doubling for parallel shortest-path computations, in Proc. of the 2nd Israeli Symposium on the Theory of Computing and Systems, IEEE, Piscataway, NJ, 1993, pp. 78-87.
-
(1993)
Proc. of the 2nd Israeli Symposium on the Theory of Computing and Systems
, pp. 78-87
-
-
Cohen, E.1
-
7
-
-
0028076569
-
Polylog-time and near-linear work approximation scheme for undirected shortest-paths
-
Association for Computing Machinery, New York
-
E. COHEN, Polylog-time and near-linear work approximation scheme for undirected shortest-paths, in Proc. 26th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, New York, 1994, pp. 16-26.
-
(1994)
Proc. 26th Annual ACM Symposium on Theory of Computing
, pp. 16-26
-
-
Cohen, E.1
-
8
-
-
0004116989
-
-
McGraw-Hill, New York
-
T. CORMEN, C. LEISERSON, AND R. RIVEST, Introduction to Algorithms, McGraw-Hill, New York, 1990.
-
(1990)
Introduction to Algorithms
-
-
Cormen, T.1
Leiserson, C.2
Rivest, R.3
-
9
-
-
0026390658
-
Finding the hidden path: Time bounds for allpairs shortest paths
-
IEEE, Piscataway, NJ
-
D. R. KARGER, D. KOLLER, AND S. PHILLIPS, Finding the hidden path: Time bounds for allpairs shortest paths, in Proc. 32nd IEEE Annual Symposium on Foundations of Computer Science, IEEE, Piscataway, NJ, 1991, pp. 560-568.
-
(1991)
Proc. 32nd IEEE Annual Symposium on Foundations of Computer Science
, pp. 560-568
-
-
Karger, D.R.1
Koller, D.2
Phillips, S.3
-
10
-
-
0026966836
-
A parallel randomized approximation scheme for shortest paths
-
Association for Computing Machinery, New York
-
P. N. KLEIN AND S. SAIRAM, A parallel randomized approximation scheme for shortest paths, in Proc. 24th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, New York, 1992, pp. 750-758.
-
(1992)
Proc. 24th Annual ACM Symposium on Theory of Computing
, pp. 750-758
-
-
Klein, P.N.1
Sairam, S.2
-
12
-
-
0024715435
-
An optimal synchronizer for the hypercube
-
D. PELEG AND J. D. ULLMAN, An optimal synchronizer for the hypercube, SIAM J. Comput., 18 (1989), pp. 740-747.
-
(1989)
SIAM J. Comput.
, vol.18
, pp. 740-747
-
-
Peleg, D.1
Ullman, J.D.2
-
13
-
-
0347011631
-
More time-work tradeoffs for parallel graph algorithms
-
Association for Computing Machinery, New York
-
T. H. SPENCER, More time-work tradeoffs for parallel graph algorithms, in Proc. 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, Association for Computing Machinery, New York, 1991, pp. 81-93.
-
(1991)
Proc. 3rd Annual ACM Symposium on Parallel Algorithms and Architectures
, pp. 81-93
-
-
Spencer, T.H.1
-
14
-
-
0026102973
-
High-probability parallel transitive closure algorithms
-
J. D. ULLMAN AND M. YANNAKAKIS, High-probability parallel transitive closure algorithms, SIAM J. Comput., 20 (1991), pp. 100-125.
-
(1991)
SIAM J. Comput.
, vol.20
, pp. 100-125
-
-
Ullman, J.D.1
Yannakakis, M.2
-
15
-
-
1542476396
-
-
personal communication
-
D. R. KARGER, personal communication, 1993.
-
(1993)
-
-
Karger, D.R.1
|