Alfred H. Schatz

Professor Emeritus

Publications

  • Superconvergence in finite element methods and meshes which are locally symmetric with respect to a point (with I. Sloan and L. Wahlbin), SIAM Journal of Numerical Analysis, to appear.
  • Interior maximum norm estimates for Ritz Galerkin methods, part II (with L. Wahlbin), Mathematics of Computation, to appear.
  • Some new error estimates for Ritz Galerkin methods with minimal regularity assumptions (with J. Wang), Mathematics of Computation, submitted.
Klarman Hall
schatz@math.cornell.edu
607/255-2383

Education

  • Ph.D. (1964) New York University

Departments and programs

Mary Ann Huntley

Senior Lecturer

Publications

  • Mayer, J., Huntley, M. A., Fonger, N. L., & Terrell, M. S. (2018).  Professional learning through teacher-researcher collaborations.  Manuscript submitted for publication.
  • Thompson, D. R., Huntley, M. A., & Suurtamm, C. (Eds.).  (2018).  International perspectives on mathematics curriculum.  Charlotte, NC:  Information Age Publishing.
  • Suurtamm, C., Huntley, M. A., & Thompson, D. R. (2018).  What might be learned from examining curricular perspectives across countries?  In D. R. Thompson, M. A. Huntley, & C. Suurtamm (Eds.), International perspectives on mathematics curriculum (pp. 1-8).  Charlotte, NC:  Information Age Publishing.
  • Huntley, M. A., Suurtamm, C., & Thompson, D. R. (2018).  Transcending boundaries:  What have we learned?  In D. R. Thompson, M. A. Huntley, & C. Suurtamm (Eds.), International perspectives on mathematics curriculum (pp. 227-237).  Charlotte, NC:  Information Age Publishing.
  • Huntley, M. A., & Terrell, M. (2014).  One-step and multi-step linear equations:  A content analysis of five textbook series.  ZDM – The International Journal on Mathematics Education, 46, 751-766.
  • Huntley, M. A., & Heck, D. J. (2014).  Examining variations in enactment of a grade 7 mathematics lesson by a single teacher:  Implications for future research on mathematics curriculum enactment.  In D. R. Thompson & Z. Usiskin (Eds.), Enacted mathematics curriculum:  A conceptual framework and research needs (pp. 21-45).  Charlotte, NC:  Information Age Publishing.
  • Thompson, D. R., & Huntley, M. A. (2014).  Researching the enacted mathematics curriculum:  Learning from various perspectives on enactment [Editorial].  ZDM – The International Journal on Mathematics Education, 46, 701-704.
  • Huntley, M. A. (2012).  Developing tools to examine variations in mathematics textbook implementation.  In D. J. Heck, K. B. Chval, I. R. Weiss, & S. W. Ziebarth (Eds.), Approaches to studying the enacted mathematics curriculum (pp. 47-66).  Charlotte, NC:  Information Age Publishing.
  • Huntley, M. A., & Flores, A. (2011).  Student-made games to learn the history of mathematics.  PRIMUS, 21, 567-576.
  • Huntley, M. A., & Flores, A. (2010).  A history of mathematics course to develop prospective secondary mathematics teachers’ knowledge for teaching.  PRIMUS, 20, 603-616.
  • Huntley, M. A., & Chval, K. B. (2010).  Teachers’ perspectives on fidelity of implementation to textbooks.  In R. Reys & B. Reys (Eds.), The K–12 mathematics curriculum:  Issues, trends, and future directions (2010 National Council of Teachers of Mathematics Yearbook) (pp. 289-303).  Reston, VA:  National Council of Teachers of Mathematics.
  • Huntley, M. A. (2009).  Brief report:  Measuring curriculum implementation.  Journal for Research in Mathematics Education, 40, 355-362.
Klarman Hall
225 Malott Hall
huntley@math.cornell.edu
607/255-5529

Education

Ph.D. (1997) University of Maryland, College Park

Departments and programs

Gennady Samarodnitsky

Professor

Klarman Hall
204 Rhodes Hall
gs18@cornell.edu
607/255-9141

Departments and programs

Links

Keywords

 

 

Probability theory

 

James Renegar

Professor

Klarman Hall
204 Rhodes Hall
renegar@cornell.edu
607/255-9142

Departments and programs

Links

Keywords

Optimization algorithms

Leonard Gross

Professor Emeritus

Klarman Hall
gross@math.cornell.edu
607/255-4110

Education

  • Ph.D. (1958) University of Chicago

 

Departments and programs

Marten Wegkamp

Professor

Publications

  • Interpolation under latent factor regression models: Generalization via low-dimensional adaptation (with Florentina Bunea and Seth Strimas-Mackey). arXiv:2002.02525.

  • Prediction in latent factor regression: Adaptive PCR and beyond (with Xin Bing, Florentina Bunea and Seth Strimas-Mackey). Journal of Machine Learning Research (2021) To appear.

  • Inference in Interpretable Latent Factor Regression Models (with Xin Bing and Florentina Bunea). Bernoulli (2021) To appear.

  • Optimal estimation of sparse topic models (with Xin Bing and Florentina Bunea). Journal of Machine Learning Research 21, 1-45 (2020).

  • A fast algorithm with minimax optimal guarantees for topic models with an unknown number of topics (with Xin Bing and Florentina Bunea). Bernoulli 26(3), 1765-1796 (2020).  

  • Sparse Latent Factor Models with Pure Variables for Overlapping Clustering (Xin Bing, Florentina Bunea and Yang Ning). Annals of Statistics 48(4), 2055-2081 (2020).

  • Adaptive estimation of the rank of the coefficient matrix in high dimensional multivariate response regression models (with Xin Bing). Annals of Statistics, 47(6), 3157-3184 (2019).

  • Weak convergence of stationary empirical processes (with Dragan Radulovic). Journal of Statistical Planning and Inference, 149, 75-84 (2018).

  • Weak convergence of empirical copula processes indexed by functions (with Dragan Radulovic  and Yue Zhao). Bernoulli, 23(4B), 3346-3384 (2017).

Klarman Hall
432 Malott Hall
marten.wegkamp@cornell.edu

Education

PhD Mathematics Leiden University 1996

Departments and programs

Links

Alexander Vladimirsky

Professor

Publications

  • Optimal control with budget constraints and resets (with R. Takei, W. Chen, Z. Clawson, and S. Kirov), SIAM J. on Control and Optimization 53 no.2 (2015), 712–744.
  • Fast two-scale methods for Eikonal equations (with A. Chacon), SIAM J.on Scientific Computing 34 no.2 (2012), A547-A578.
  • An efficient method for multiobjective optimal control and optimal control subject to integral constraints (with A. Kumar), Journal of Computational Mathematics 28 no. 4 (2010), 517–551.
  • Homogenization of metric Hamilton-Jacobi equations (with A. M. Oberman and R. Takei), Multiscale Modeling and Simulation 8 no. 1 (2009), 269–295.
  • Label-setting methods for multimode stochastic shortest path problems on graphs, Mathematics of Operations Research 33 no. 4 (2008), 821–838.
  • A fast method for approximating invariant manifolds (with J. Guckenheimer), SIAM J. on Applied Dynamical Systems 3 no. 3 (2004), 232–260.
  • Ordered upwind methods for static Hamilton-Jacobi equations: theory & algorithms (with J. A. Sethian), SIAM Journal on Numerical Analysis 41 no. 1 (2003), 325–363.
  • Fast methods for the Eikonal and related Hamilton-Jacobi equations on unstructured meshes (with J. A. Sethian), Proc. Natl. Acad. Sci. USA 97 no. 11 (2000), 5699–5703.
Klarman Hall
561 Malott Hall
vladimirsky@cornell.edu
607/255-9871

Education

  • Ph.D., Applied Mathematics, University of California, Berkeley (2001).
  • B.A., Applied Mathematics (with high honors), University of California, Berkeley (1995).

Departments and programs

Links

Alex Townsend

Associate Professor, Stephen H. Weiss Junior Fellow

Publications

  • Dense networks that do not synchronize and sparse ones that do (with M. Stillman and S. H. Strogatz), Chaos, 30 (2020), 083142.
  • Fast algorithms using orthogonal polynomials (with S. Olver and R. M. Slevinsky), Acta Numerica, 29 (2020), pp. 573-699.
  • Stable extrapolation of analytic functions (with L. Demanet), Foundations of Computational Mathematics, 19 (2019), pp. 297-331.
  • Bounds on the singular values of matrices with displacement structure (with B. Beckermann), SIAM Review, 61 (2019), pp. 319-344.
  • Why are big data matrices approximately low rank? (with M. Udell), SIAM Journal on Mathematics of Data Science, 1 (2019), pp. 144-160.
Klarman Hall
589 Malott Hall
ajt253@cornell.edu

Education

  • DPhil (2014) University of Oxford

Departments and programs

Links

Nicolas Templier

Professor

Publications

  • On the Ramanujan conjecture for automorphic forms over function fields I. Geometry. (with W. Sawin), Journal of the AMS, 34 no.3 (2021), 653—746.

  • Families of L-functions and their symmetry (with P. Sarnak and S.W. Shin), proceedings of Simons symposium on the trace formula,  Springer-Verlag (2016).
  • Sato-Tate theorem for families and low-lying zeros of automorphic L-functions (with S.W. Shin), Invent. Math., 203 no.1 (2016), 1-177.
  • Hybrid sup-norm bounds for Hecke-Maass cusp forms, J. Eur. Math. Soc. 17 no.8 (2015), 2069--2082.
  • Large values of modular forms, Cambridge Journal of Mathematics, 2 no.1 (2014), 91–116.
  • A non-split sum of coefficients of modular forms, Duke Math. J., 157 no.1 (2011), 109–165.
Klarman Hall
509 Malott Hall
npt27@cornell.edu
607/2553443

Education

  • Ph.D. (2008) Montpellier University

Departments and programs

Éva Tardos

Jacob Gould Schurman Professor

Publications

Network Games and extensions

Mechanism Design

Social Networks

Classification

Clustering and facility location

Network Design

Routing Disjoint Paths and Packets in Networks

Scheduling

Generalized Flow

  • A. Goldberg, S. Plotkin, E. Tardos: Combinatorial algorithms for the generalized circulation problem, Mathematics of Operations Research, 16/2, 1991, 351-381. Preliminary version has appeared in the Proceedings of the 29th Annual IEEE Symposium on the Foundations of Computer Science (1988), 432-443.
  • E. Tardos and K. Wayne. Simple Generalized Maximum Flow Algorithms. Proceedings of the 6th International Integer Programming and Combinatorial Optimization Conference   (IPCO'98), Houston, 1998, pp. 310-324.

Packing and Covering Algorithms

  • P. Klein, S. Plotkin, C. Stein and E. Tardos, Faster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts.  SIAM Journal on Computing, 23/3, 1994,. 466-487. Preliminary version has appeared in the proceedings of the 22nd Annual ACM Symposium on the Theory of Computing (1990), 310-321.
  • T. Leighton, F. Makedon, S. Plotkin, C. Stein, E. Tardos, S. Tragoudas: Fast Approximation Algorithms for Multicommodity Flow Problems, Journal of Computer and System Sciences, 50 (STOC'91 special issue), 1995, pp. 228--243. Preliminary version has appeared in the Proceedings of the 23rd Annual ACM Symposium on the Theory of Computing (1991), 101-110.
  • S.A. Plotkin, D. Shmoys, and E. Tardos, Fast approximation algorithms for fractional packing and covering problems, to appear in Mathematics of Operations Research. ORIE TR-999.  Preliminary version has appeared in the Proceedings of the 32nd Annual IEEE Symposium on the Foundations of Computer Science (1991), 495-505.

Networks with transit times

  • B. Hoppe and E. Tardos: Polynomial Time Algorithms for Some Evacuation Problems. In the proceeding of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, January 1994, pp. 433-441. .
  • B. Hoppe and E. Tardos: The Quickest Transshipment Problem, journal version of the paper in the proceeding of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, 1995 pp. 512-521.
  • L. Fleischer and E. Tardos. Efficient Continuous-Time Dynamic Network Flow Algorithms. Operations Research Letters 23 (1998) pp. 71-80.

Effective bandwidth

Finding cuts in graphs

Separating cutting planes

  • L. Fleischer and E. Tardos: Separating Maximally Violated Comb Inequalities in Planar Graphs, tech report version of the paper in the Proceedings of the 5th International Integer Programming and Combinatorial Optimization Conference (IPCO), June 1996, pp. 475-489.

Other Miscellaneous papers

Klarman Hall
402 Gates Hall
eva.tardos@cornell.edu
607/255-0984

Departments and programs

Links

Keywords

Algorithm design and algorithmic game theory

Subscribe to Applied Mathematics