Computational Aspects Of Determining Optical Flow. - David Lee 001; Anargyros Papageorgiou; Grzegorz W. Wasilkowski (ICCV, 1988)

On the average complexity of multivariate problems. - Anargyros Papageorgiou; Grzegorz W. Wasilkowski (J. Complex., 1990)

Integration of Monotone Functions of Several Variables. - Anargyros Papageorgiou (J. Complex., 1993)

Faster Evaluation of Multidimensional Integrals - Anargyros Papageorgiou; Joseph F. Traub (CoRR, 2000)

Fast convergence of quasi-Monte Carlo for a class of isotropic integrals. - Anargyros Papageorgiou (Math. Comput., 2001)

The Brownian Bridge Does Not Offer a Consistent Advantage in Quasi-Monte Carlo Integration. - Anargyros Papageorgiou (J. Complex., 2002)

Sufficient conditions for fast quasi-Monte Carlo convergence. - Anargyros Papageorgiou (J. Complex., 2003)

Average case quantum lower bounds for computing the Boolean mean. - Anargyros Papageorgiou (J. Complex., 2004)

Classical and Quantum Complexity of the Sturm-Liouville Eigenvalue Problem. - Anargyros Papageorgiou; Henryk Wozniakowski (Quantum Inf. Process., 2005)

Exact cubature for a class of functions of maximum effective dimension. - Shu Tezuka; Anargyros Papageorgiou (J. Complex., 2006)

On the complexity of the multivariate Sturm-Liouville eigenvalue problem. - Anargyros Papageorgiou (J. Complex., 2007)

The Sturm-Liouville Eigenvalue Problem and NP-Complete Problems in the Quantum Setting with Queries. - Anargyros Papageorgiou; Henryk Wozniakowski (Quantum Inf. Process., 2007)

On the tractability of linear tensor product problems in the worst case. - Anargyros Papageorgiou; Iasonas Petras (J. Complex., 2009)

Quantum Algorithms and Complexity for Continuous Problems. - Anargyros Papageorgiou; Joseph F. Traub (Encyclopedia of Complexity and Systems Science, 2009)

Tractability through increasing smoothness. - Anargyros Papageorgiou; Henryk Wozniakowski (J. Complex., 2010)

Adiabatic quantum counting by geometric phase estimation. - Chi Zhang 059; Zhaohui Wei; Anargyros Papageorgiou (Quantum Inf. Process., 2010)

Tractability of tensor product problems in the average case setting. - Anargyros Papageorgiou; Iasonas Petras (J. Complex., 2011)

Average case tractability of non-homogeneous tensor product problems. - M. A. Lifshits; Anargyros Papageorgiou; Henryk Wozniakowski (J. Complex., 2012)

On the efficiency of quantum algorithms for Hamiltonian simulation. - Anargyros Papageorgiou; Chi Zhang 059 (Quantum Inf. Process., 2012)

A fast algorithm for approximating the ground state energy on a quantum computer. - Anargyros Papageorgiou; Iasonas Petras; Joseph F. Traub; Chi Zhang 059 (Math. Comput., 2013)

Estimating the ground state energy of the Schrödinger equation for convex potentials. - Anargyros Papageorgiou; Iasonas Petras (J. Complex., 2014)

A new criterion for tractability of multivariate problems. - Anargyros Papageorgiou; Iasonas Petras (J. Complex., 2014)

Approximating ground and excited state energies on a quantum computer. - Stuart Hadfield; Anargyros Papageorgiou (Quantum Inf. Process., 2015)

Quantum algorithms and circuits for scientific computing. - Mihir K. Bhaskar; Stuart Hadfield; Anargyros Papageorgiou; Iasonas Petras (Quantum Inf. Comput., 2016)

(s, lnκ)-weak tractability of linear problems. - Anargyros Papageorgiou; Iasonas Petras; Henryk Wozniakowski (J. Complex., 2017)

EC-(s, t)-weak tractability of multivariate linear problems in the average case setting. - Anargyros Papageorgiou; Iasonas Petras; Guiqiao Xu; Dong Yanqi (J. Complex., 2019)