Efficient algorithms on sets of permutations, dominance, and real-weighted APSP

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2009, Pages 950-957

  Yuster, Raphael ^a  

^a UNIVERSITY OF HAIFA   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; DIRECTED GRAPHS;

ALL PAIRS SHORTEST PATHS; FAST MATRIX MULTIPLICATION; FAST RECTANGULAR MATRIX MULTIPLICATIONS; MATRIX MULTIPLICATION; POLYNOMIAL IDENTITY TESTING; RANDOMIZED ALGORITHMS; REAL-WEIGHTED DIRECTED GRAPHS; TIME ALGORITHMS;

MATRIX ALGEBRA;

EID: 70349131974     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973068.103     Document Type: Conference Paper

References (16)

1. N. Alon, Generating pseudo-random permutations and maximum-flow algorithms, Information Processing Letters, 35 (1990), pp. 201-204. (Pubitemid 20733675)
2. N. Alon and M. Naor, Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions, Algorithmica, 16 (1996), pp. 434-449.
3. A. Z. Broder, M. Charikar, and M. Mitzenmacher, A derandomization using min-wise independent permutations, Journal of Discrete Algorithms, 1 (2003), pp. 11-20.
4. th Workshop on Algorithms and Data Structures (WADS), Lecture Notes in Computer Science, 3608 (2005), pp. 318-324. (Pubitemid 41450081)
5. th ACM Symposium on Theory of Computing (STOC), ACM Press (2007), pp. 590-598. (Pubitemid 47630777)
6. D. Coppersmith, Rectangular matrix multiplication revisited, Journal of Complexity, 13 (1997), pp. 42-49.
7. D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progressions, Journal of Symbolic Computation, 9 (1990), pp. 251-280.
8. M. L. Fredman, New bounds on the complexity of the shortest path problem, SIAM Journal on Computing, 5 (1976), pp. 49-60.
9. Z. Galil and O. Margalit, Witnesses for Boolean matrix multiplication and for transitive closure, Journal of Complexity, 9 (1993), pp. 201-221.
10. X. Huang and V. Y. Pan, Fast rectangular matrix multiplications and applications, Journal of Complexity, 14 (1998), pp. 257-299. (Pubitemid 128347318)
11. n, Information Processing Letters, 38 (1991), pp. 277-278.
12. J. T. Schwartz, Fast Probabilistic Algorithms for Verification of Polynomial Identities, Journal of the ACM, 27 (1980), pp. 701-717.
13. th ACM Symposium on Theory of Computing (STOC), ACM Press (2006), pp. 225-231.
14. th ACM Symposium on Theory of Computing (STOC), ACM Press (2007), pp. 585-589. (Pubitemid 350001038)
15. R. Zippel, Probabilistic algorithms for sparse polynomials, Proceedings of Symbolic and Algebraic Computation (EUROSAM), Lecture Notes in Computer Science 72 (1979), pp. 216-226.
16. U. Zwick, All-pairs shortest paths using bridging sets and rectangular matrix multiplication, Journal of the ACM, 49 (2002), pp. 289-317.