Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Clayton D. Scott
muljowidodo kartidjo
Duzgun, H.Sebnem
Jean Jourdan
Roland Zumkeller
Fuangfar Pensiri
Maximilian Dürr
Hongye Su
Dan Graur
Amjad Saeed Khan
Home
/
Author
/
M. MITROULI
Author Info
Open Visualization
Name
Affiliation
Papers
M. MITROULI
Department of Mathematics, University of Athens Panepistemiopolis 15784, Athens, Greece
19
Collaborators
Citations
PageRank
19
33
10.12
Referers
Referees
References
39
54
33
Publications (19 rows)
Collaborators (19 rows)
Referers (39 rows)
Referees (54 rows)
Title
Citations
PageRank
Year
Numerical Analysis and Scientific Computation (NASCA18)
0
0.34
2020
The e-MoM approach for approximating matrix functionals
0
0.34
2020
Condition estimation for regression and feature selection
0
0.34
2020
Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials.
0
0.34
2014
Parallel QR processing of Generalized Sylvester matrices
1
0.39
2011
Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation
14
1.33
2006
Counting techniques specifying the existence of submatrices in weighing matrices
0
0.34
2005
Two resultant based methods computing the greatest common divisor of two polynomials
6
0.89
2004
On the computation of maximum minors of Hadamard matrices
0
0.34
2004
An algorithm to find values of minors of skew hadamard and conference matrices
0
0.34
2004
Values of Minors of an Infinite Family of D-Optimal Designs and Their Application to the Growth Problem: II
0
0.34
2003
Values of Minors of an Infinite Family of D-Optimal Designs and Their Application to the Growth Problem
0
0.34
2001
Values of Minors of (1, -1) Incidence Matrices of SBIBDs and Their Application to the Growth Problem
1
0.43
2001
On the Complete Pivoting Conjecture for Hadamard Matrices of Small Orders
1
0.55
2001
On the Complete Pivoting Conjecture for Hadamard Matrices of Order 16
1
0.55
2000
Matrices with Sparsity Structure in Control Problems
0
0.34
1999
On the computation of the Smith normal form of compound matrices
1
0.63
1997
On the Growth Problem for D-Optimal Designs
1
0.50
1996
A compound matrix algorithm for the computation of the Smith form of a polynomial matrix
7
1.47
1994
1