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)
A fully dynamic algorithm for maintaining the transitive closure
Journal of Computer and System Sciences - STOC 1999
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Randomized Acceleration of Fundamental Matrix Computations
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Exact and Approximate Distances in Graphs - A Survey
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Detecting directed 4-cycles still faster
Information Processing Letters
Computer algebra handbook
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
Recognizing quasi-triangulated graphs
Discrete Applied Mathematics - Optimal discrete structure and algorithms (ODSA 2000)
The aggregation and cancellation techniques as a practical tool for faster matrix multiplication
Theoretical Computer Science - Algebraic and numerical algorithm
On the complexity of fixed parameter clique and dominating set
Theoretical Computer Science
Trade-offs for fully dynamic transitive closure on DAGs: breaking through the O(n2 barrier
Journal of the ACM (JACM)
An Efficient Basis Conversion Algorithm for Composite Fields with Given Representations
IEEE Transactions on Computers
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
Finding a maximum weight triangle in n3-Δ time, with applications
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
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
Faster inversion and other black box matrix computations using efficient block projections
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
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
Fast polynomial factorization and modular composition in small characteristic
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
A Path Cover Technique for LCAs in Dags
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
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
Numerical linear algebra in the streaming model
Proceedings of the forty-first annual ACM symposium on Theory of computing
Theoretical Computer Science
The Closest Pair Problem under the Hamming Metric
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Recognizing quasi-triangulated graphs
Discrete Applied Mathematics
Fast computation of special resultants
Journal of Symbolic Computation
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
Faster algorithms for all-pairs small stretch distances in weighted graphs
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Finding heaviest H-subgraphs in real weighted graphs, with applications
ACM Transactions on Algorithms (TALG)
On reducing computational overhead in multi-objective genetic Takagi-Sugeno fuzzy systems
Applied Soft Computing
Generating a d-dimensional linear subspace efficiently
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Algorithms and theory of computation handbook
Some Remarks on Testing Irreducibility of Polynomials and Normality of Bases in Finite Fields
Fundamenta Informaticae - Hardest Boolean Functions and O.B. Lupanov
More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
SIAM Journal on Computing
All-pairs shortest paths with a sublinear additive error
ACM Transactions on Algorithms (TALG)
Unique small subgraphs are not easier to find
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Dynamic Connectivity: Connecting to Networks and Geometry
SIAM Journal on Computing
Algorithms and constraint programming
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
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
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Fast matrix rank algorithms and applications
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Fast Polynomial Factorization and Modular Composition
SIAM Journal on Computing
Faster approximation of distances in graphs
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
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
Replacement Paths and Distance Sensitivity Oracles via Fast Matrix Multiplication
ACM Transactions on Algorithms (TALG)
On the complexity of solving bivariate systems: the case of non-singular solutions
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Fast matrix rank algorithms and applications
Journal of the ACM (JACM)
Modular Composition Modulo Triangular Sets and Applications
Computational Complexity
Nonuniform ACC Circuit Lower Bounds
Journal of the ACM (JACM)
| Hi-index | 0.01 |