Algorithms for the maximum subarray problem based on matrix multiplication
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Information Bounds Are Weak in the Shortest Distance Problem
Journal of the ACM (JACM)
Computing shortest paths with comparisons and additions
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
An &Ohgr;(n2 log n) lower bound to the shortest paths problem
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
The power of negative thinking in multiplying Boolean matrices
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Finding a maximum weight triangle in n3-Δ time, with applications
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
A Distributed Algorithm for Shortest Paths
IEEE Transactions on Computers
IBM Journal of Research and Development
Finding heaviest H-subgraphs in real weighted graphs, with applications
ACM Transactions on Algorithms (TALG)
Faster Algorithms for Max-Product Message-Passing
The Journal of Machine Learning Research
Networks cannot compute their diameter in sublinear time
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Space-round tradeoffs for MapReduce computations
Proceedings of the 26th ACM international conference on Supercomputing
Fast monotone summation over disjoint sets
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
| Hi-index | 0.00 |