From approximate factorization to root isolation. - Kurt Mehlhorn; Michael Sagraloff; Pengming Wang 001 (ISSAC, 2013)

A Definability Dichotomy for Finite Valued CSPs. - Anuj Dawar; Pengming Wang 001 (CSL, 2015)

From approximate factorization to root isolation with application to cylindrical algebraic decomposition. - Kurt Mehlhorn; Michael Sagraloff; Pengming Wang 001 (J. Symb. Comput., 2015)

Lasserre Lower Bounds and Definability of Semidefinite Programming. - Anuj Dawar; Pengming Wang 001 (CoRR, 2016)

The pebbling comonad in Finite Model Theory. - Samson Abramsky; Anuj Dawar; Pengming Wang 001 (LICS, 2017)

Definability of semidefinite programming and lasserre lower bounds for CSPs. - Anuj Dawar; Pengming Wang 001 (LICS, 2017)

Descriptive complexity of constraint problems. - Pengming Wang 001 (2018)

Solving Mixed Integer Programs Using Neural Networks. - Vinod Nair; Sergey Bartunov; Felix Gimeno; Ingrid von Glehn; Pawel Lichocki; Ivan Lobov; Brendan O'Donoghue; Nicolas Sonnerat; Christian Tjandraatmadja; Pengming Wang 001; Ravichandra Addanki; Tharindi Hapuarachchi; et al. (CoRR, 2020)

Learning a Large Neighborhood Search Algorithm for Mixed Integer Programs. - Nicolas Sonnerat; Pengming Wang 001; Ira Ktena; Sergey Bartunov; Vinod Nair (CoRR, 2021)

Optimizing Memory Mapping Using Deep Reinforcement Learning. - Pengming Wang 001; Mikita Sazanovich; Berkin Ilbeyi; Phitchaya Mangpo Phothilimthana; Manish Purohit; Han Yang Tay; Ngân Vu; Miaosen Wang; Cosmin Paduraru; Edouard Leurent; Anton Zhernov; Julian Schrittwieser; et al. (CoRR, 2023)

Mathematical discoveries from program search with large language models. - Bernardino Romera-Paredes; Mohammadamin Barekatain; Alexander Novikov 001; Matej Balog; M. Pawan Kumar; Emilien Dupont; Francisco J. R. Ruiz; Jordan S. Ellenberg; Pengming Wang 001; Omar Fawzi; Pushmeet Kohli; Alhussein Fawzi (Nat., 2024)