CURRICULUM VITAE
(as of December 31, 2009)

LESZEK PLASKOTA

leszekp@mimuw.edu.pl

Education
  1. June 1996, Habilitation Degree, University of Warsaw, Faculty of Mathematics, Informatics, and Mechanics. Habilitation thesis: ``Noisy Information and Computational Complexity'' was recognized as ``distinguished work'' by the Council of the Faculty of Mathematics, Informatics and Mechanics, University of Warsaw.
  2. June 1989, Ph.D., University of Warsaw, Faculty of Mathematics, Informatics, and Mechanics. Dissertation: ``Selected Topics in Analytic Computational Complexity''.
  3. June 1983, M.S., University of Warsaw, Faculty of Mathematics, Informatics, and Mechanics. Thesis: ``Optimal Linear Information for Finding Supremum.''.

Professional Experience
  1. Feb.16,1984 to present: University of Warsaw (Poland), Faculty of Mathematics, Informatics, and Mechanics
    Sep. 1, 2005 to present: Deputy Dean
    Oct. 1, 1998 to present: Associate Professor
    Oct. 1, 1996 to Sept. 30, 1998: Vice-Director of the Institute of Applied Mathematics and Mechanics
    Oct. 1, 1989 to Sept. 30, 1998: Assistant Professor (Adjunct)
    Feb. 16, 1984 to Sept. 30, 1989: Assistant.
  2. March 3 to April 3, 2009: City University of Hong Kong, Department of Mathematics, Visiting Associate Professor.
  3. June/July 2003, 2002, 2001, and Aug. 15, 1999 to July 31, 2000: University of Kentucky, Department of Computer Science, Visiting Associate Professor.
  4. Oct. 1, 1998 to June 30, 1999: Boston University, Department of Mathematics (Fulbright Fellowship)
  5. Aug. 1, 1995 to Sept. 30, 1995: International Computer Science Institute at Berkeley, Visiting Senior Scientist.
  6. Oct. 1, 1995 to Dec. 31, 1995: Columbia University Computer Science Department, Visiting Researcher.
  7. May 1, 1991 to July 31, 1992: Erlangen-Nuernberg University (Germany), Department of Mathematics (Humboldt Fellowship)
  8. Sept. 15, 1983 to Feb. 15, 1984, Institute of Nuclear Energy, Warsaw, Researcher.

Honors and Awards
  1. awarded the IBC Prize for 2006.
  2. 1997: Highest Degree Award from the Ministry of National Education of Poland, for the research monograph ``Noisy Information and Computational Complexity'', Cambridge University Press.
  3. 1997: Stanislaw Mazur Prize from the Polish Mathematical Society for the research achievements.
  4. 1997: awarded the 1998/1999 Senior Research Fulbright Fellowship by the Polish-U.S. Fulbright Commission.
  5. 1990: awarded a Research Fellowship by the Alexander von Humboldt Foundation, Germany.
  6. 1995: selected by an international committee for the Visiting Senior Scientist program at the International Computer Science Institute (ICSI) at Berkeley, USA.
  7. 1997: elected to the Polish Mathematical Society.
  8. One of the two members of the Committee to choose the 1999 Best Paper Award of Journal of Complexity.

Memberships

  1. Member of the Editorial Board of Journal of Complexity.
  2. Member of the Polish Mathematical Society.

Courses Taught

at the University of Warsaw

  1. Analytic Computational Complexity,
  2. Approximation Theory,
  3. Computational Mathematics,
  4. Introduction to Informatics,
  5. Linear Algebra,
  6. Mathematical Analysis,
  7. Numerical Analysis
  8. Numerical Methods in Finance

at the University of Kentucky

  1. Algorithm Design and Analysis (CS-315)
  2. Algorithm Design (CS-515)
  3. Theoretical Aspects of Computing (CS-575)
  4. Numerical Analysis (CS-537)

Publications

Research Monograph:

  1. "Noisy Information and Computational Complexity", Cambridge University Press, Cambridge, 1996.

Research (refereed) Publications:

  1. The power of adaptive algorithms for functions with singularities, with G.W. Wasilkowski, J. Fixed Point Theory and Appl., accepted.
  2. New averaging technique for approximating weighted integrals, with G.W. Wasilkowski and Y. Zhao, J. Complexity, 25 (2009), pp.268-291.
  3. Uniform approximation of piecewise r-smooth and globally continuous functions, with G.W. Wasilkowski, SIAM J. Numer. Analysis, 47 (2009), pp.762-785.
  4. The power of adaption for approximating functions with singularities, with G.W. Wasilkowski and Y. Zhao, Mathematics of Computation 77 (2008), pp.2309-2338.
  5. Adaption allows efficient integration of functions with unknown singularities, with G.W. Wasilkowski, Numerische Mathematik 102 (2005), pp.123-144.
  6. Statistical likelihood representations of prior knowledge in machine learning, with M. Kon and A. Przybyszewski, Artificial Intelligence and Applications, M.H.Hamza, Ed., Innsbruck (2005), pp.467-472.
  7. Machine learning and statistical MAP methods, with M. Kon and A. Przybyszewski, Intelligent Information Processing, Springer, Berlin (2005), pp.441-445.
  8. Information-based nonlinear approximation: an average case setting, with M. Kon, J. Complexity 21 (2005), pp.211-229.
  9. Smolyak's algorithm for integration and L1-approximation of multivariate functions with bounded mixed derivatives of second order, with G.W. Wasilkowski, Numerical Algorithms 36 (2004), pp.229-246.
  10. A Monte Carlo algorithm for the average case weighted integration over Rd, with P. Gajda, Y. Li, and G.W. Wasilkowski, Math. Comp. 73 (2004), pp.813-825.
  11. Optimal designs for weighted approximation and integration of stochastic processes on R+, with K. Ritter and G.W. Wasilkowski, J. Complexity 20 (2004), pp.108-131.
  12. Average case complexity of weighted approximation and integration over R, with K. Ritter and G.W. Wasilkowski, J. Complexity 18 (2002), pp.517-544.
  13. Average case complexity of weighted integration and approximation over Rd with isotropic weight, with K. Ritter and G.W. Wasilkowski, Proc. of MCQMC 2000 in Hong-Kong, eds. K.-T. Fang, F.J. Hickernell, H. Niederreiter, Springer 2002, pp.446-459.
  14. The exact exponent of sparse grid quadratures in the weighted case, with G.W. Wasilkowski, J. Complexity 17 (2001), pp.840-849.
  15. Complexity of neural network approximation with limited information: a worst case approach, with M. Kon, J. Complexity 17 (2001), pp.345-365.
  16. A new algorithm and worst case complexity for Feynman-Kac path integration, with G.W. Wasilkowski and H. Wozniakowski, J. Comput. Physics 164 (2000), pp.335-353.
  17. Information complexity of neural networks, with M. Kon, Neural Networks 13 (2000), pp.365-376.
  18. The exponent of discrepancy of sparse grids is at least 2.1933, Advances in Comput. Math. 12 (2000), pp.2-24.
  19. Average case uniform approximation in the presence of Gaussian noise, J. Approx. Theory 93 (1998), pp. 501-515.
  20. Neural networks, radial basis functions, and complexity, with M. Kon, in Statistical Physics Proceedings, Bialowieza, 1997, pp.322-335.
  21. Worst case complexity of problems with random information noise, J. Complexity 12 (1996), pp. 416-439.
  22. Survey of computational complexity with noisy information, in ``The Mathematics of Numerical Analysis'', vol. 32 (1996), Proc. of 1995 AMS-SIAM Summer Seminar in Appl. Math., Park City, Utah, ser. Lecture in Appl. Math., eds. J. Renegar, M. Shub, and S. Smale, pp. 651-664.
  23. How to benefit from noise, J. Complexity 12 (1996), pp. 175-184.
  24. Complexity of problems with noisy information, in ``Applied Stochastic and Optimization'', Special Issues of Zeitschrift für Angewandte Mathematik und Mechanik (ZAMM), Issue 3, O. Mohrenholtz, K. Morti, R. Mennicken (eds.), Proc. of ICIAM/JuneGAMM 95 Symposium in Hamburg, Germany, pp. 116-120.
  25. Average complexity for linear problems in a model with varying information noise, J. Complexity 11 (1995), pp. 240-264.
  26. Average case approximation of linear functionals based on information with deterministic noise, J. Computing and Information 4 (1994), pp. 21-39.
  27. A note on varying cardinality in the average case setting, J. Complexity 9 (1993), pp.458-470.
  28. Optimal approximation of linear operators based on noisy data on functionals, J. Approx. Theory 73 (1993), pp.93-105.
  29. The minimal cost of approximating linear operators using perturbed information, with B. Kacewicz, J. Complexity 9 (1993), pp.113-134.
  30. Function approximation and integration on the Wiener space with noisy data, J. Complexity 8 (1992), pp.301-323.
  31. Termination conditions for approximating linear problems with noisy information, with B. Kacewicz, Math. of Comput. 59 (1992), pp.503-513.
  32. Noisy information for linear problems in the asymptotic setting, with B. Kacewicz, J. Complexity 7 (1991), pp.35-57.
  33. On the minimal cost of approximating linear problems based on information with deterministic noise, with B. Kacewicz, Numer. Funct. Anal. and Optimiz. 11 (1990), pp.511-528.
  34. On average case complexity of linear problems with noisy information, J. Complexity 6 (1990), pp.199-230.
  35. Asymptotic error for the global maxima of functions in s dimensions, J. Complexity 5 (1989), pp.369-378.
  36. Optimal linear information for the search for the maximum of real functions (in Russian), Zh. Vychisl. Mat. i Mat. Fiz. 26 (1986), pp.934-938.

Other Publications:

  1. Floating point arithmetic and accuracy of computation (in Polish), Delta 10 (1998).
  2. On complexity of computations (in Polish), Delta 18 (1989).

Invited and/or Conference Presentations

  1. September 2009: conf. Algorithms and Complexity for Continuous Problems, Dagstuhl, Germany.
  2. September 2009: conf. Monte Carlo Methods, Brussels, Belgium.
  3. October 2008: Universitaet Bonn, Institut fuer Numerische Simulation.
  4. July 2008: conf. Monte Carlo and quasi-Monte Carlo Methods, Montreal, Canada.
  5. June 2008: conf. Foundations of Computational Mathematics, Hong Kong.
  6. September 2007: City Univ. of Hong Kong, Dept. of Math.
  7. August 2007: First Joint International Meeting between AMS and PTM, Warsaw, Poland.
  8. July 2007: 6th International Congress on Industrial and Applied Mathematics, Zurich, Switzerland.
  9. September 2006: conf. Algorithms and Complexity for Continuous Problems, Dagstuhl, Germany.
  10. August 2006: conf. Monte Carlo and quasi-Monte Carlo Methods, Ulm, Germany
  11. September 2005: conf. Computational Stochastic Differential Equations, Bedlewo, Poland.
  12. July 2005: conf. Foundations of Computational Mathematics, Santander, Spain.
  13. September 2004: conf. Algorithms and Complexity for Continuous Problems, Dagstuhl, Germany.
  14. September 2004: conf. Approximation and Probability, Bedlewo, Poland.
  15. June 2004: conf. Modern Computational Methods, Bedlewo, Poland.
  16. December 2003: University of Warsaw, Dept. of Physics, Poland.
  17. September 2003: conf. Monte Carlo Methods, Berlin, Germany.
  18. July 2003: 5th International Congress on Industrial and Applied Mathematics, Sydney, Australia.
  19. November 2002: conf. Monte Carlo and quasi-Monte Carlo Methods, Singapore.
  20. October 2002: conf. Algorithms and Complexity for Continuous Problems, Dagstuhl, Germany.
  21. August 2002: conf. Foundations of Computational Mathematics, Minneapolis, USA.
  22. June 2002: conf. Numerical Analysis, Krynica, Poland.
  23. November 2001: University of Jena, Math. Dept., Germany.
  24. November 2001: conf. Numerical Integration and its Complexity, Oberwolfach, Germany.
  25. September 2001: conf. Monte Carlo Methods, Salzburg, Austria.
  26. May 2001: conf. Mathematics in Technical and Natural Sciences, Krynica Gorska, Poland.
  27. September 2000: conf. Algorithms and Complexity for Continuous Problems, Dagstuhl, Germany.
  28. July 2000: conf. Algorithms and Complexity for Nonlinear and Multivariate Problems, Mount Holyoke, USA.
  29. October 1999: conf. Complexity of Multivariate Problems, Hong Kong, China.
  30. July 1999: conf. Foundations of Computational Mathematics, Oxford: England.
  31. November 1998: Complexity of Continuous and Algebraic Problems, Berkeley, California, USA.
  32. June 1998: Polish Mathematical Society, Warsaw, Poland.
  33. May 1998: conf. Algorithms and Complexity for Continuous Problems, Dagstuhl, Germany.
  34. April 1998: Maria-Curie Sklodowska University, Lublin, Poland.
  35. September 1997: Congress of the Polish Mathematical Society, Zielona Gora, Poland.
  36. May 1997: Approximation Theory, Warsaw, Poland.
  37. January 1997: conf. Foundations of Computational Mathematics, Rio de Janeiro, Brazil.
  38. October 1996: conf. Algorithms and Complexity for Continuous Problems, Dagstuhl, Germany.
  39. March 1996: conf. Computability, Complexity and Logic, Zinnowitz, Germany.
  40. Fall 1995: Columbia University Computer Science Department, New York.
  41. September 1995: International Computer Science Institute, Berkeley (California).
  42. July/August 1995: conf. Mathematics of Numerical Analysis: Real Number Algorithms, Park City, Utah, USA.
  43. July 1995: 3rd International Congress on Industrial and Applied Mathematics, Hamburg, Germany.
  44. June 1995: conf. Numerical Analysis, Warsaw, Poland.
  45. February 1995: Minisemester on Approximation and Complexity, Warsaw, Poland.
  46. October 1994: conf. Algorithms and Complexity for Continuous Problems, Dagstuhl, Germany.
  47. June 1994: conf. Continuous Algorithms and Complexity, Mount Holyoke, USA.
  48. May 1994: conf. Numerical Analysis, Warsaw, Poland.
  49. April 1994: Special Semester in Approximation Theory, Haifa, Israel.
  50. August 1993: 2nd Gauss Symposium, Conf. Computing and Information, Muenchen, Germany.
  51. June 1993: conf. Numerical Analysis, Warsaw, Poland.
  52. November 1992: Institut fuer Angewandte Analysis und Stochastic, Berlin, Germany.
  53. October 1992: conf. Algorithms and complexity for continuous problems, Dagstuhl, Germany.
  54. Spring 1992 and Fall 1991: Erlangen-Nuernberg Universitaet, Mathematisches Institut, Erlangen, Germany.
  55. April 1991: conf. Algorithms and Complexity for Continuous Problems, Dagstuhl, Germany.
  56. October 1990: conf. Methods, Languages and Tools of Programming, Baligród, Poland.
  57. November 1989: conf. Methods, Languages and Tools of Programming, Blazejewko, Poland.
  58. April 1989: conf. Complexity of Approximately Solved Problems III, Columbia University, New York, USA.