On computing the determinant in small parallel time using a small number of processors
Information Processing Letters
Constructive combinatorics
Why is Boolean complexity theory difficult?
Poceedings of the London Mathematical Society symposium on Boolean function complexity
On the computation of Pfaffians
Discrete Applied Mathematics
Determinant: Old Algorithms, New Insights
SIAM Journal on Discrete Mathematics
Lattice paths and determinants
Computational Discrete Mathematics
A Combinatorial Algorithm for Pfaffians
A Combinatorial Algorithm for Pfaffians
The combinatorial approach yields an NC algorithm for computing Pfaffians
Discrete Applied Mathematics
Exact, efficient, and complete arrangement computation for cubic curves
Computational Geometry: Theory and Applications
Exact, efficient, and complete arrangement computation for cubic curves
Computational Geometry: Theory and Applications
A simple division-free algorithm for computing determinants
Information Processing Letters
EXACUS: efficient and exact algorithms for curves and surfaces
ESA'05 Proceedings of the 13th annual European conference on Algorithms
ACM Transactions on Mathematical Software (TOMS)
Faster geometric algorithms via dynamic determinant computation
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
| Hi-index | 0.00 |