Scaling algorithms for network problems
Journal of Computer and System Sciences
Matrix multiplication via arithmetic progressions
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Faster scaling algorithms for network problems
SIAM Journal on Computing
Introduction to algorithms
Scaling Algorithms for the Shortest Paths Problem
SIAM Journal on Computing
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Journal of the ACM (JACM)
Probabilistic algorithms for sparse polynomials
EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
High-order lifting and integrality certification
Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
Dynamic Transitive Closure via Dynamic Matrix Inverse (Extended Abstract)
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Answering distance queries in directed graphs using fast matrix multiplication
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Subquadratic algorithm for dynamic shortest distances
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
An O(n3 (loglogn/logn)5/4) time algorithm for all pairs shortest paths
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Maximum weight bipartite matching in matrix multiplication time
Theoretical Computer Science
Weighted bipartite matching in matrix multiplication time
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
An O(n3 log log n/ log2 n) time algorithm for all pairs shortest paths
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
| Hi-index | 0.00 |
In this paper we present an ${\tilde O}(W n^{\omega})$ time algorithm solving single source shortest path problem in graphs with integer weights from the set {–W,...,0,...,W}, where ω O(nm) time.