Faster multi-witnesses for Boolean matrix multiplication

Authors:
Leszek Gąsieniec;Mirosław Kowaluk;Andrzej Lingas
Affiliations:
Department of Computer Science, University of Liverpool, L69 3BX Liverpool, United Kingdom;Institute of Informatics, Warsaw University, Warsaw, Poland;Department of Computer Science, Lund University, 22100 Lund, Sweden
Venue:
Information Processing Letters
Year:
2009

Matrix multiplication via arithmetic progressions

Journal of Symbolic Computation - Special issue on computational algebraic complexity
Rectangular matrix multiplication revisited

Journal of Complexity
Fast rectangular matrix multiplication and applications

Journal of Complexity
Explicit constructions of selectors and related combinatorial structures, with applications

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Faster algorithms for finding lowest common ancestors in directed acyclic graphs

Theoretical Computer Science
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
Finding witnesses by peeling

CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching

Hi-index	0.89