Security Types Preserving Compilation: (Extended Abstract). - Gilles Barthe; Amitabh Basu; Tamara Rezk (VMCAI, 2004)

Distributed localization using noisy distance and angle information. - Amitabh Basu; Jie Gao 001; Joseph S. B. Mitchell; Girishkumar Sabhnani (MobiHoc, 2006)

Security types preserving compilation. - Gilles Barthe; Tamara Rezk; Amitabh Basu (Comput. Lang. Syst. Struct., 2007)

Geometric algorithms for optimal airspace design and air traffic controller workload balancing. - Amitabh Basu; Joseph S. B. Mitchell; Girishkumar Sabhnani (ACM J. Exp. Algorithmics, 2009)

On Lifting Integer Variables in Minimal Inequalities. - Amitabh Basu; Manoel B. Campêlo; Michele Conforti; Gérard Cornuéjols; Giacomo Zambelli (IPCO, 2010)

Maximal Lattice-Free Convex Sets in Linear Subspaces. - Amitabh Basu; Michele Conforti; Gérard Cornuéjols; Giacomo Zambelli (Math. Oper. Res., 2010)

Minimal Inequalities for an Infinite Relaxation of Integer Programs. - Amitabh Basu; Michele Conforti; Gérard Cornuéjols; Giacomo Zambelli (SIAM J. Discret. Math., 2010)

A Probabilistic Analysis of the Strength of the Split and Triangle Closures. - Amitabh Basu; Gérard Cornuéjols; Marco Molinaro 001 (IPCO, 2011)

Algorithmic and Complexity Results for Cutting Planes Derived from Maximal Lattice-Free Convex Sets - Amitabh Basu; Robert Hildebrand; Matthias Köppe (CoRR, 2011)

Experiments with Two-Row Cuts from Degenerate Tableaux. - Amitabh Basu; Pierre Bonami; Gérard Cornuéjols; François Margot (INFORMS J. Comput., 2011)

On the relative strength of split, triangle and quadrilateral cuts. - Amitabh Basu; Pierre Bonami; Gérard Cornuéjols; François Margot (Math. Program., 2011)

Unique Minimal Liftings for Simplicial Polytopes. - Amitabh Basu; Gérard Cornuéjols; Matthias Köppe (Math. Oper. Res., 2012)

Intersection Cuts with Infinite Split Rank. - Amitabh Basu; Gérard Cornuéjols; François Margot (Math. Oper. Res., 2012)

A counterexample to a conjecture of Gomory and Johnson. - Amitabh Basu; Michele Conforti; Gérard Cornuéjols; Giacomo Zambelli (Math. Program., 2012)

Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem: II. The Unimodular Two-Dimensional Case. - Amitabh Basu; Robert Hildebrand; Matthias Köppe (IPCO, 2013)

Unique lifting of integer variables in minimal inequalities. - Amitabh Basu; Manoel B. Campêlo; Michele Conforti; Gérard Cornuéjols; Giacomo Zambelli (Math. Program., 2013)

A (k+1)-Slope Theorem for the k-Dimensional Infinite Group Relaxation. - Amitabh Basu; Robert Hildebrand; Matthias Köppe; Marco Molinaro 001 (SIAM J. Optim., 2013)

On the Unique-Lifting Property. - Gennadiy Averkov; Amitabh Basu (IPCO, 2014)

Light on the Infinite Group Relaxation. - Amitabh Basu; Robert Hildebrand; Matthias Köppe (CoRR, 2014)

On Chubanov's Method for Linear Programming. - Amitabh Basu; Jesús A. De Loera; Mark Junod (INFORMS J. Comput., 2014)

The triangle closure is a polyhedron. - Amitabh Basu; Robert Hildebrand; Matthias Köppe (Math. Program., 2014)

On the sufficiency of finite support duals in semi-infinite linear programming. - Amitabh Basu; R. Kipp Martin; Christopher Thomas Ryan (Oper. Res. Lett., 2014)

Characterization of the split closure via geometric lifting. - Amitabh Basu; Marco Molinaro 001 (Eur. J. Oper. Res., 2015)

Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. I. The One-Dimensional Case. - Amitabh Basu; Robert Hildebrand; Matthias Köppe (Math. Oper. Res., 2015)

Projection: A Unified Approach to Semi-Infinite Linear Programs and Duality in Convex Programming. - Amitabh Basu; R. Kipp Martin; Christopher Thomas Ryan (Math. Oper. Res., 2015)

Lifting properties of maximal lattice-free polyhedra. - Gennadiy Averkov; Amitabh Basu (Math. Program., 2015)

A geometric approach to cut-generating functions. - Amitabh Basu; Michele Conforti; Marco Di Summa (Math. Program., 2015)

Operations that Preserve the Covering Property of the Lifting Region. - Amitabh Basu; Joseph Paat (SIAM J. Optim., 2015)

Computing Approximate PSD Factorizations. - Amitabh Basu; Michael Dinitz; Xin Li 006 (APPROX-RANDOM, 2016)

Light on the infinite group relaxation I: foundations and taxonomy. - Amitabh Basu; Robert Hildebrand; Matthias Köppe (4OR, 2016)

Light on the infinite group relaxation II: sufficient conditions for extremality, sequences, and algorithms. - Amitabh Basu; Robert Hildebrand; Matthias Köppe (4OR, 2016)

Mixed-Integer Linear Representability, Disjunctions, and Variable Elimination. - Amitabh Basu; R. Kipp Martin; Christopher Thomas Ryan; Guanyi Wang (IPCO, 2017)

Critical Points Of An Autoencoder Can Provably Recover Sparsely Used Overcomplete Dictionaries. - Akshay Rangamani; Anirbit Mukherjee; Ashish Arora; Tejaswini Ganapathy; Amitabh Basu; Sang (Peter) Chin; Trac D. Tran (CoRR, 2017)

Understanding Deep Neural Networks with Rectified Linear Units. - Raman Arora; Amitabh Basu; Poorya Mianjy; Anirbit Mukherjee (Electron. Colloquium Comput. Complex., 2017)

Lower bounds over Boolean inputs for deep neural networks with ReLU gates. - Anirbit Mukherjee; Amitabh Basu (Electron. Colloquium Comput. Complex., 2017)

Equivariant perturbation in Gomory and Johnson's infinite group problem - III: foundations for the k-dimensional case with applications to k=2. - Amitabh Basu; Robert Hildebrand; Matthias Köppe (Math. Program., 2017)

Strong duality and sensitivity analysis in semi-infinite linear programming. - Amitabh Basu; Richard Kipp Martin; Christopher Thomas Ryan (Math. Program., 2017)

Optimality certificates for convex minimization and Helly numbers. - Amitabh Basu; Michele Conforti; Gérard Cornuéjols; Robert Weismantel; Stefan Weltge (Oper. Res. Lett., 2017)

Centerpoints: A Link between Optimization and Convex Geometry. - Amitabh Basu; Timm Oertel (SIAM J. Optim., 2017)

Sparse Coding and Autoencoders. - Akshay Rangamani; Anirbit Mukherjee; Amitabh Basu; Ashish Arora; Tejaswini Ganapathi; Sang (Peter) Chin; Trac D. Tran (ISIT, 2018)

Convergence guarantees for RMSProp and ADAM in non-convex optimization and their comparison to Nesterov acceleration on autoencoders. - Amitabh Basu; Soham De; Anirbit Mukherjee; Enayat Ullah (CoRR, 2018)

Extreme functions with an arbitrary number of slopes. - Amitabh Basu; Michele Conforti; Marco Di Summa; Joseph Paat (Math. Program., 2018)

Minimal cut-generating functions are nearly extreme. - Amitabh Basu; Robert Hildebrand; Marco Molinaro 001 (Math. Program., 2018)

Approximation of Corner Polyhedra with Families of Intersection Cuts. - Gennadiy Averkov; Amitabh Basu; Joseph Paat (SIAM J. Optim., 2018)

Approximation of Minimal Functions by Extreme Functions. - Teresa M. Lebair; Amitabh Basu (SIAM J. Optim., 2018)

The Structure of the Infinite Models in Integer Programming. - Amitabh Basu; Michele Conforti; Marco Di Summa; Joseph Paat (Math. Oper. Res., 2019)

Optimal Cutting Planes from the Group Relaxations. - Amitabh Basu; Michele Conforti; Marco Di Summa; Giacomo Zambelli (Math. Oper. Res., 2019)

Mixed-Integer Linear Representability, Disjunctions, and Chvátal Functions - Modeling Implications. - Amitabh Basu; R. Kipp Martin; Christopher Thomas Ryan; Guanyi Wang (Math. Oper. Res., 2019)

Nonunique Lifting of Integer Variables in Minimal Inequalities. - Amitabh Basu; Santanu S. Dey; Joseph Paat (SIAM J. Discret. Math., 2019)

Can Cut-Generating Functions Be Good and Efficient? - Amitabh Basu; Sriram Sankaranarayanan 002 (SIAM J. Optim., 2019)

Complexity of cutting planes and branch-and-bound in mixed-integer optimization. - Amitabh Basu; Michele Conforti; Marco Di Summa; Hongyi Jiang (CoRR, 2020)

Learning to rank via combining representations. - Hayden S. Helm; Amitabh Basu; Avanti Athreya; Youngser Park; Joshua T. Vogelstein; Michael Winding; Marta Zlatic; Albert Cardona; Patrick Bourke; Jonathan Larson; Christopher M. White; Carey E. Priebe (CoRR, 2020)

An extreme function which is nonnegative and discontinuous everywhere. - Amitabh Basu; Michele Conforti; Marco Di Summa (Math. Program., 2020)

Leveraging semantically similar queries for ranking via combining representations. - Hayden S. Helm; Marah Ihab Abdin; Benjamin D. Pedigo; Shweti Mahajan; Vince Lyzinski; Youngser Park; Amitabh Basu; Piali Choudhury; Christopher M. White; Weiwei Yang 004; Carey E. Priebe (CoRR, 2021)

Helly systems and certificates in optimization. - Amitabh Basu; Tongtong Chen; Michele Conforti; Hongyi Jiang (CoRR, 2021)

Mixed-integer bilevel representability. - Amitabh Basu; Christopher Thomas Ryan; Sriram Sankaranarayanan 002 (Math. Program., 2021)

Split Cuts in the Plane. - Amitabh Basu; Michele Conforti; Marco Di Summa; Hongyi Jiang (SIAM J. Optim., 2021)

Admissibility of Solution Estimators for Stochastic Optimization. - Amitabh Basu; Tu Nguyen; Ao Sun (SIAM J. Math. Data Sci., 2021)

Neural Networks with Linear Threshold Activations: Structure and Algorithms. - Sammy Khalife; Amitabh Basu (IPCO, 2022)

Enumerating Integer Points in Polytopes with Bounded Subdeterminants. - Hongyi Jiang; Amitabh Basu (SIAM J. Discret. Math., 2022)

Complexity of Branch-and-Bound and Cutting Planes in Mixed-Integer Optimization - II. - Amitabh Basu; Michele Conforti; Marco Di Summa; Hongyi Jiang (Comb., 2022)

On the power of graph neural networks and the role of the activation function. - Sammy Khalife; Amitabh Basu (CoRR, 2023)

Distance-based positive and unlabeled learning for ranking. - Hayden S. Helm; Amitabh Basu; Avanti Athreya; Youngser Park; Joshua T. Vogelstein; Carey E. Priebe; Michael Winding; Marta Zlatic; Albert Cardona; Patrick Bourke; Jonathan Larson; Marah Ihab Abdin; et al. (Pattern Recognit., 2023)

Two-halfspace closure. - Amitabh Basu; Hongyi Jiang (Math. Program., 2023)

Complexity of branch-and-bound and cutting planes in mixed-integer optimization. - Amitabh Basu; Michele Conforti; Marco Di Summa; Hongyi Jiang (Math. Program., 2023)

Towards Lower Bounds on the Depth of ReLU Neural Networks. - Christoph Hertrich; Amitabh Basu; Marco Di Summa; Martin Skutella (SIAM J. Discret. Math., 2023)

Complexity of optimizing over the integers. - Amitabh Basu (Math. Program., 2023)

A Universal Transfer Theorem for Convex Optimization Algorithms Using Inexact First-order Oracles. - Phillip A. Kerger; Marco Molinaro 001; Hongyi Jiang; Amitabh Basu (ICML, 2024)

Learning Cut Generating Functions for Integer Programming. - Hongyu Cheng 001; Amitabh Basu (NeurIPS, 2024)

Sample Complexity of Algorithm Selection Using Neural Networks and Its Applications to Branch-and-Cut. - Hongyu Cheng 001; Sammy Khalife; Barbara Fiedorowicz; Amitabh Basu (NeurIPS, 2024)

Data-driven algorithm design using neural networks with applications to branch-and-cut. - Hongyu Cheng 001; Sammy Khalife; Barbara Fiedorowicz; Amitabh Basu (CoRR, 2024)

Neural networks with linear threshold activations: structure and algorithms. - Sammy Khalife; Hongyu Cheng 001; Amitabh Basu (Math. Program., 2024)

Information complexity of mixed-integer convex optimization. - Amitabh Basu; Hongyi Jiang; Phillip A. Kerger; Marco Molinaro 001 (Math. Program., 2025)

Generalization Guarantees for Learning Branch-and-Cut Policies in Integer Programming. - Hongyu Cheng 001; Amitabh Basu (CoRR, 2025)