Suchergebnisse
Suchergebnisse:
Jan Vondrák is a Czech applied mathematician and theoretical computer scientist. He has been a professor of mathematics at Stanford University since 2015. He was a research staff member in the theory group at the IBM Almaden Research Center from 2009 to 2015.
Professor of Mathematics. Dept. of Mathematics Stanford University 450 Jane Lanthrop Way, building 380 Stanford, CA 94305 E-mail: jvondrak-at-stanford-dot-edu. Research interests. Discrete optimization. Matroids and submodular functions. Approximation algorithms. Algorithmic game theory. Probabilistic combinatorics. My papers. Some presentations.
Department of Mathematics Building 380, Stanford, California 94305 Phone: (650) 725-6284 mathwebsite [at] lists.stanford.edu (Email)
18. Aug. 2022 · Jan Vondrak. curriculum vitae. updated August 18, 2022. Current position. Stanford University, Stanford, CA. Professor, Department of Mathematics. Director of Graduate Studies in Mathematics. Previous employment. IBM Almaden Research Center, San Jose, CA. Research sta member, theory group, 2009-15. Princeton University, Princeton, NJ.
Jan Vondrak: Submodularity and curvature: the optimal algorithm in RIMS Kokyuroku Bessatsu B23, Kyoto, 2010, 253-266. Benny Sudakov and Jan Vondrak: A randomized embedding algorithm for trees Combinatorica 30:4 (2010), 445-470. Jan Vondrak: A note on concentration of submodular functions Manuscript, 2010, arXiv:1005.2791v1.
Wenzheng Li, Paul Liu, Jan Vondrák: A polynomial lower bound on adaptive complexity of submodular maximization. CoRR abs/2002.09130 ( 2020) 2010 – 2019. 2019. [c50] Vitaly Feldman, Jan Vondrák: High probability generalization bounds for uniformly stable algorithms with nearly optimal rate.
Jan Vondrak. professor, Stanford University. Jan Vondrak got his PhD in Applied Mathematics from MIT in 2005. He did postdocs at Microsoft Research and Princeton University, and was a Research Staff Member in the IBM Almaden Research Lab between 2009-15.
