Faculty

Institution

Unit

Venue

Chee K. Yap

Professor of Computer Science

New York University

Affiliations

Arts & Science

Computer Science

Courant Institute of Mathematical Sciences

Computer Science

NYU Abu Dhabi

Division of Science

Chee K. Yap is currently serving as an Arts & Science Professor of Computer Science at New York University.

Honors

Create free account to unlock more features

Experiences

Create free account to unlock more features

Education

Create free account to unlock more features

Chee K. Yap

New York University

Professor of Computer Science

You can click a keyword to filter the displayed items

applied mathematics computer science mathematics computational geometry geometry geometric modeling numerical algorithms geometric algorithms theoretical computer science theory of computation mathematical sciences discrete algorithms discrete geometry scientific computing machine learning geometric topology path planning combinatorial optimization geometry processing mathematical optimization formal methods voronoi diagram computer-aided design computer vision data science computational optimization symbolic computation subdivision surfaces robotics automation trajectory planning geometric constraint solving polyhedron parallel programming computability theory numerical computation motion planning information visualization discrete differential geometry convex hulls route planning applied algebra machine vision parallel processing robot kinematics complexity analysis system science algorithm engineering exact geometric computation algorithmic information theory algorithm design computational visualization rectilinear geodesics adaptive isotopic approximation nonsingular curves complete subdivision algorithms wavelet theory algorithmic development complex root isolation robust geometric computation voronoi diagrams soft computing motion analysis shape analysis surface modeling information theory information controls theoretical analysis optical engineering shape optimization parallel computational geometry polynomial solution convex polytopes reversal complexity shortest paths pseudo approximation algorithms particle methods computational mathematics computational paradigm computer algebra computational model theory

Notable Scholarly Works

Notable Federal Grants

Collaborators

Robust Parameter Estimation for Rational Ordinary Differential Equations. Applied Mathematics and Computation (2025)

parameter estimationmathematical optimizationnonlinear systemsapplied mathematicsrobust statisticsparameter identificationrobust parameter estimationordinary differential equationsdifferential equations

An Effective and Certified Subdivision Algorithm for Isolating Real Zeros of Nonlinear Systems, With Complexity Analysis. (2023)

Juan XuChee Yap

facies analysiscertified subdivision algorithmsystems engineeringcomplexity analysiscomplex analysisreal zeros

Erratum for “Global Identifiability of Differential Models”. Communications on Pure and Applied Mathematics (2023)

Hoon HongAlexey OvchinnikovGleb PogudinChee Yap

differential modelsapplied mathematicspure mathematicsglobal identifiabilitymathematical analysiscommunicationapplied algebramathematicscommunication theory

Range Functions of Any Convergence Order and Their Amortized Complexity Analysis. Lecture notes in computer science (2023)

Kai HormannChee YapYa Shi Zhang

computer sciencerange functionstheoretical computer scienceamortized complexity analysisconvergence order

Foreword. Academic Studies Press eBooks (2022)

Paul Freedman

Certified Approximation Algorithms for the Fermat Point and N-Ellipses. European Symposium on Algorithms (2021)

Kolja JungingerIoannis MantasEvanthia PapadopoulouMartin SuderlandChee Yap

materials sciencefermat point

Complexity Analysis of Root Clustering for a Complex Polynomial. International Symposium on Symbolic and Algebraic Computation (2021)

Ruben BeckerMichael SagraloffVikram SharmaJuan XuChee Yap

complex polynomialmathematical optimizationsystems engineeringapplied mathematicscomplexity analysiscomputer sciencegraph theory

Novel Range Functions via Taylor Expansions and Recursive Lagrange Interpolation With Application to Real Root Isolation. (2021)

Kai HormannLucas KaniaChee Yap

applied mathematicsnovel range functionsreal root isolationrecursive lagrange interpolationtaylor expansionsgraph theory

On μ-Symmetric Polynomials. Journal of Algebra and Its Applications (2021)

Jing YangChee K. Yap

m-symmetric polynomialsalgebraapplied mathematicsmathematics

The D-Plus Discriminant and Complexity of Root Clustering. arXiv (Cornell University) (2021)

Jing YangChee K. Yap

applied mathematicsroot clusteringmachine learningclusteringd-plus discriminant

1
2
3
4
5
40
10 / page

Chee K. Yap

Professor of Computer Science

New York University

Affiliations

Arts & Science

Computer Science

Courant Institute of Mathematical Sciences

Computer Science

NYU Abu Dhabi

Division of Science

Chee K. Yap is currently serving as an Arts & Science Professor of Computer Science at New York University.

Honors

Create free account to unlock more features

Experiences

Create free account to unlock more features

Education

Create free account to unlock more features

Chee K. Yap

New York University

Professor of Computer Science

You can click a keyword to filter the displayed items

Notable Scholarly Works

Notable Federal Grants

Collaborators

Robust Parameter Estimation for Rational Ordinary Differential Equations. Applied Mathematics and Computation (2025)

An Effective and Certified Subdivision Algorithm for Isolating Real Zeros of Nonlinear Systems, With Complexity Analysis. (2023)

Juan XuChee Yap

facies analysiscertified subdivision algorithmsystems engineeringcomplexity analysiscomplex analysisreal zeros

Erratum for “Global Identifiability of Differential Models”. Communications on Pure and Applied Mathematics (2023)

Hoon HongAlexey OvchinnikovGleb PogudinChee Yap

differential modelsapplied mathematicspure mathematicsglobal identifiabilitymathematical analysiscommunicationapplied algebramathematicscommunication theory

Range Functions of Any Convergence Order and Their Amortized Complexity Analysis. Lecture notes in computer science (2023)

Kai HormannChee YapYa Shi Zhang

computer sciencerange functionstheoretical computer scienceamortized complexity analysisconvergence order

Foreword. Academic Studies Press eBooks (2022)

Paul Freedman

Certified Approximation Algorithms for the Fermat Point and N-Ellipses. European Symposium on Algorithms (2021)

Kolja JungingerIoannis MantasEvanthia PapadopoulouMartin SuderlandChee Yap

materials sciencefermat point

Complexity Analysis of Root Clustering for a Complex Polynomial. International Symposium on Symbolic and Algebraic Computation (2021)

Ruben BeckerMichael SagraloffVikram SharmaJuan XuChee Yap

complex polynomialmathematical optimizationsystems engineeringapplied mathematicscomplexity analysiscomputer sciencegraph theory

Novel Range Functions via Taylor Expansions and Recursive Lagrange Interpolation With Application to Real Root Isolation. (2021)

Kai HormannLucas KaniaChee Yap

applied mathematicsnovel range functionsreal root isolationrecursive lagrange interpolationtaylor expansionsgraph theory

On μ-Symmetric Polynomials. Journal of Algebra and Its Applications (2021)

Jing YangChee K. Yap

m-symmetric polynomialsalgebraapplied mathematicsmathematics

The D-Plus Discriminant and Complexity of Root Clustering. arXiv (Cornell University) (2021)

Jing YangChee K. Yap

applied mathematicsroot clusteringmachine learningclusteringd-plus discriminant

1
2
3
4
5
40
10 / page

Similar Faculty Members

Bhubaneswar Mishra

Institution

New York University

biological computation

computational biology

John Iacono

Institution

New York University

algorithm design

geometry

Timothy Moon-Yew Chan

Institution

University of Illinois Urbana-Champaign

applied mathematics

geometry processing

Anupam Gupta

Institution

New York University

computational optimization

mathematical optimization

Sariel Har-Peled

Institution

University of Illinois Urbana-Champaign

applied mathematics

mathematics

Boris Aronov

Institution

New York University

algorithm design

discrete algorithm

Stephen Kobourov

Institution

University of Arizona

algorithm design

discrete algorithm

Jeff Erickson

Institution

University of Illinois Urbana-Champaign

computer science education

applied mathematics

David Eppstein

Institution

University of California, Irvine

discrete algorithm

planar graph

Randal Bryant

Institution

Carnegie Mellon University

reliability

formal verification

Similar Faculty Members

Bhubaneswar Mishra

Institution

New York University

biological computation

computational biology

John Iacono

Institution

New York University

algorithm design

geometry

Timothy Moon-Yew Chan

Institution

University of Illinois Urbana-Champaign

applied mathematics

geometry processing

Anupam Gupta

Institution

New York University

computational optimization

mathematical optimization

Sariel Har-Peled

Institution

University of Illinois Urbana-Champaign

applied mathematics

mathematics

Boris Aronov

Institution

New York University

algorithm design

discrete algorithm

Stephen Kobourov

Institution

University of Arizona

algorithm design

discrete algorithm

Jeff Erickson

Institution

University of Illinois Urbana-Champaign

computer science education

applied mathematics

David Eppstein

Institution

University of California, Irvine

discrete algorithm

planar graph

Randal Bryant

Institution

Carnegie Mellon University

reliability

formal verification