Locating and Computing Arbitrarily Distributed Zeros. - Dimitris J. Kavvadias; Frosso S. Makri; Michael N. Vrahatis (SIAM J. Sci. Comput., 1999)

Efficiently Computing Many Roots of a Function. - Dimitris J. Kavvadias; Frosso S. Makri; Michael N. Vrahatis (SIAM J. Sci. Comput., 2005)

An Input Vector Monitoring Concurrent BIST Architecture Based on a Precomputed Test Set. - Ioannis Voyiatzis; Antonis M. Paschalis; Dimitris Gizopoulos; Constantin Halatsis; Frosso S. Makri; Miltiadis Hatzimihail (IEEE Trans. Computers, 2008)

On success runs of a fixed length in Bernoulli sequences: Exact and asymptotic results. - Frosso S. Makri; Zaharias M. Psillakis (Comput. Math. Appl., 2011)

Corrigendum to "On success runs of a fixed length in Bernoulli sequences: Exact and asymptotic results" [Comput. Math. Appl. 61(2011) 761-772]. - Frosso S. Makri; Zaharias M. Psillakis (Comput. Math. Appl., 2016)

Algorithm 987: MANBIS - A C++ Mathematical Software Package for Locating and Computing Efficiently Many Roots of a Function: Theoretical Issues. - Dimitra-Nefeli A. Zottou; Dimitris J. Kavvadias; Frosso S. Makri; Michael N. Vrahatis (ACM Trans. Math. Softw., 2018)

The reliability of a generalized consecutive system. - Spiros D. Dafnis; Frosso S. Makri; Andreas N. Philippou (Appl. Math. Comput., 2019)