Anargyros Papageorgiou

According to our database1, Anargyros Papageorgiou authored at least 25 papers between 1988 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
EC-(s, t)-weak tractability of multivariate linear problems in the average case setting.
J. Complex., 2019

2017
(s, lnκ)-weak tractability of linear problems.
J. Complex., 2017

2016
Quantum algorithms and circuits for scientific computing.
Quantum Information & Computation, 2016

2015
Approximating ground and excited state energies on a quantum computer.
Quantum Information Processing, 2015

2014
A new criterion for tractability of multivariate problems.
J. Complex., 2014

Estimating the ground state energy of the Schrödinger equation for convex potentials.
J. Complex., 2014

2013
A fast algorithm for approximating the ground state energy on a quantum computer.
Math. Comput., 2013

2012
On the efficiency of quantum algorithms for Hamiltonian simulation.
Quantum Information Processing, 2012

Average case tractability of non-homogeneous tensor product problems.
J. Complex., 2012

2011
Tractability of tensor product problems in the average case setting.
J. Complex., 2011

2010
Adiabatic quantum counting by geometric phase estimation.
Quantum Information Processing, 2010

Tractability through increasing smoothness.
J. Complex., 2010

2009
Quantum Algorithms and Complexity for Continuous Problems.
Proceedings of the Encyclopedia of Complexity and Systems Science, 2009

On the tractability of linear tensor product problems in the worst case.
J. Complex., 2009

2007
The Sturm-Liouville Eigenvalue Problem and NP-Complete Problems in the Quantum Setting with Queries.
Quantum Information Processing, 2007

2006
Exact cubature for a class of functions of maximum effective dimension.
J. Complex., 2006

2005
Classical and Quantum Complexity of the Sturm-Liouville Eigenvalue Problem.
Quantum Information Processing, 2005

2004
Average case quantum lower bounds for computing the Boolean mean.
J. Complex., 2004

2003
Sufficient conditions for fast quasi-Monte Carlo convergence.
J. Complex., 2003

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

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

2000
Faster Evaluation of Multidimensional Integrals
CoRR, 2000

1993
Integration of Monotone Functions of Several Variables.
J. Complex., 1993

1990
On the average complexity of multivariate problems.
J. Complex., 1990

1988
Computational Aspects Of Determining Optical Flow.
Proceedings of the Second International Conference on Computer Vision, 1988


  Loading...