All pairs lightest shortest paths
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
All pairs shortest paths using bridging sets and rectangular matrix multiplication
Journal of the ACM (JACM)
Exact and Approximate Distances in Graphs - A Survey
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
An output-sensitive variant of the baby steps/giant steps determinant algorithm
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Computing the sign or the value of the determinant of an integer matrix, a complexity survey
Journal of Computational and Applied Mathematics - Special issue: Proceedings of the international conference on linear algebra and arithmetic, Rabat, Morocco, 28-31 May 2001
Detecting short directed cycles using rectangular matrix multiplication and dynamic programming
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
On the complexity of fixed parameter clique and dominating set
Theoretical Computer Science
Fast sparse matrix multiplication
ACM Transactions on Algorithms (TALG)
Answering distance queries in directed graphs using fast matrix multiplication
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
The shifted number system for fast linear algebra on integer matrices
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Quantum verification of matrix products
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Colored intersection searching via sparse rectangular matrix multiplication
Proceedings of the twenty-second annual symposium on Computational geometry
Faster algorithms for finding lowest common ancestors in directed acyclic graphs
Theoretical Computer Science
Dynamic programming and fast matrix multiplication
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
All-pairs bottleneck paths in vertex weighted graphs
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Finding a heaviest triangle is not harder than matrix multiplication
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Open problems around exact algorithms
Discrete Applied Mathematics
All-pairs disjoint paths from a common ancestor in Õ(nω) time
Theoretical Computer Science
A Path Cover Technique for LCAs in Dags
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Distributed, large-scale latent semantic analysis by index interpolation
Proceedings of the 3rd international conference on Scalable information systems
Faster multi-witnesses for Boolean matrix multiplication
Information Processing Letters
Fast algorithms for (max, min)-matrix multiplication and bottleneck shortest paths
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Efficient algorithms on sets of permutations, dominance, and real-weighted APSP
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Faster join-projects and sparse matrix multiplications
Proceedings of the 12th International Conference on Database Theory
A note on compressed sensing and the complexity of matrix multiplication
Information Processing Letters
Numerical linear algebra in the streaming model
Proceedings of the forty-first annual ACM symposium on Theory of computing
The Closest Pair Problem under the Hamming Metric
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
The shifted number system for fast linear algebra on integer matrices
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Unique lowest common ancestors in dags are almost as easy as matrix multiplication
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Fast lowest common ancestor computations in dags
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Faster combinatorial algorithms for determinant and Pfaffian
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Finding heaviest H-subgraphs in real weighted graphs, with applications
ACM Transactions on Algorithms (TALG)
On the possibility of faster SAT algorithms
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Graph expansion and communication costs of fast matrix multiplication: regular submission
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
All-pairs shortest paths with a sublinear additive error
ACM Transactions on Algorithms (TALG)
Dynamic Connectivity: Connecting to Networks and Geometry
SIAM Journal on Computing
Subquadratic algorithm for dynamic shortest distances
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Counting and detecting small subgraphs via equations and matrix multiplication
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Finding the smallest H-Subgraph in real weighted graphs and related problems
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Fast matrix rank algorithms and applications
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Faster approximation of distances in graphs
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
All-pairs ancestor problems inweighted dags
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Graph expansion analysis for communication costs of fast rectangular matrix multiplication
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Nonuniform ACC Circuit Lower Bounds
Journal of the ACM (JACM)
A scalable approach to computing representative lowest common ancestor in directed acyclic graphs
Theoretical Computer Science
| Hi-index | 0.00 |