Search the dblp DataBase
Hans F. de Groote: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Hans F. de Groote, Joos Heintz
A Lower Bound for the Bilinear Complexity of Some Semisimple Lie Algebras. [Citation Graph (0, 0)][DBLP]
AAECC, 1985, pp:211-222 [Conf] - Hans F. de Groote, Joos Heintz, Stefan Möhler, Heinz Schmidt
On the Complexity of Lie Algebras. [Citation Graph (0, 0)][DBLP]
FCT, 1987, pp:172-179 [Conf] - Hans F. de Groote
On the Complexity of Quaternion Multiplication. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1975, v:3, n:6, pp:177-179 [Journal] - Hans F. de Groote
Characterization of Division Algebras of Minimal Rank and the Structure of Their Algorithm Varieties. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 1983, v:12, n:1, pp:101-117 [Journal] - Hans F. de Groote
On Varieties of Optimal Algorithms for the Computation of Bilinear Mappings I. The Isotropy Group of a Bilinear Mapping. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1978, v:7, n:, pp:1-24 [Journal] - Hans F. de Groote
On Varieties of Optimal Algorithms for the Computation of Bilinear Mappings. II. Optimal Algorithms for 2x2-Matrix Multiplication. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1978, v:7, n:, pp:127-148 [Journal] - Hans F. de Groote
On Varieties of Optimal Algorithms for the Computation of Bilinear Mappings. III. Optimal Algorithms for the Computation of xy and xy where x, y in M2(K). [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1978, v:7, n:, pp:239-249 [Journal]
Search in 0.003secs, Finished in 0.003secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002