Heat Flow and a Faster Algorithm to Compute the Surface Area of a Convex Body. - Mikhail Belkin; Hariharan Narayanan 001; Partha Niyogi (FOCS, 2006)

On the Relation Between Low Density Separation, Spectral Clustering and Graph Cuts. - Hariharan Narayanan 001; Mikhail Belkin; Partha Niyogi (NIPS, 2006)

Geographic gossip on geometric random graphs via affine combinations. - Hariharan Narayanan 001 (PODC, 2007)

Sampling Hypersurfaces through Diffusion. - Hariharan Narayanan 001; Partha Niyogi (APPROX-RANDOM, 2008)

Distributed averaging in the presence of a sparse cut. - Hariharan Narayanan 001 (PODC, 2008)

Minimizing average latency in oblivious routing. - Prahladh Harsha; Thomas P. Hayes; Hariharan Narayanan 001; Harald Räcke; Jaikumar Radhakrishnan (SODA, 2008)

Distributed Averaging using non-convex updates - Hariharan Narayanan 001 (CoRR, 2008)

On the Sample Complexity of Learning Smooth Cuts on a Manifold. - Hariharan Narayanan 001; Partha Niyogi (COLT, 2009)

Random walks on polytopes and an affine interior point method for linear programming. - Ravi Kannan; Hariharan Narayanan 001 (STOC, 2009)

Learning with Spectral Kernels and Heavy-Tailed Data - Michael W. Mahoney; Hariharan Narayanan 001 (CoRR, 2009)

Randomized Interior Point methods for Sampling and Optimization - Hariharan Narayanan 001 (CoRR, 2009)

Sample Complexity of Testing the Manifold Hypothesis. - Hariharan Narayanan 001; Sanjoy K. Mitter (NIPS, 2010)

Random Walk Approach to Regret Minimization. - Hariharan Narayanan 001; Alexander Rakhlin (NIPS, 2010)

On Zeroth-Order Stochastic Convex Optimization via Random Walks. - Tengyuan Liang; Hariharan Narayanan 001; Alexander Rakhlin (CoRR, 2014)

Escaping the Local Minima via Simulated Annealing: Optimization of Approximately Convex Functions. - Alexandre Belloni; Tengyuan Liang; Hariharan Narayanan 001; Alexander Rakhlin (COLT, 2015)

Efficient Sampling from Time-Varying Log-Concave Distributions. - Hariharan Narayanan 001; Alexander Rakhlin (J. Mach. Learn. Res., 2017)

Fitting a Putative Manifold to Noisy Data. - Charles Fefferman; Sergei Ivanov 001; Yaroslav Kurylev; Matti Lassas; Hariharan Narayanan 001 (COLT, 2018)

John's Walk. - Adam Gustafson; Hariharan Narayanan 001 (CoRR, 2018)

Generating an equidistributed net on a unit n-sphere using random rotations. - Somnath Chakraborty 001; Hariharan Narayanan 001 (CoRR, 2018)

Learning Mixtures of Spherical Gaussians via Fourier Analysis. - Somnath Chakraborty 001; Hariharan Narayanan 001 (CoRR, 2020)

Implicit Linear Algebra and Basic Circuit Theory. - H. Narayanan; Hariharan Narayanan 001 (CoRR, 2020)

Higher Dimensional Electrical Circuits. - Hariharan Narayanan 001 (Circuits Syst. Signal Process., 2020)

Reconstruction and Interpolation of Manifolds. I: The Geometric Whitney Problem. - Charles Fefferman; Sergei Ivanov 001; Yaroslav Kurylev; Matti Lassas; Hariharan Narayanan 001 (Found. Comput. Math., 2020)

Reconstruction of a Riemannian Manifold from Noisy Intrinsic Distances. - Charles Fefferman; Sergei Ivanov 001; Matti Lassas; Hariharan Narayanan 001 (SIAM J. Math. Data Sci., 2020)

On Thevenin-Norton and Maximum power transfer theorems. - H. Narayanan; Hariharan Narayanan 001 (CoRR, 2021)

A Spectral Approach to Polytope Diameter. - Hariharan Narayanan 001; Rikhav Shah; Nikhil Srivastava (ITCS, 2022)

On the mixing time of coordinate Hit-and-Run. - Hariharan Narayanan 001; Piyush Srivastava 001 (Comb. Probab. Comput., 2022)

Generating an Equidistributed Net on a Sphere Using Random Rotations. - Somnath Chakraborty 001; Hariharan Narayanan 001 (Discret. Comput. Geom., 2022)

Sampling from Convex Sets with a Cold Start using Multiscale Decompositions. - Hariharan Narayanan 001; Amit Rajaraman; Piyush Srivastava 001 (STOC, 2023)

Deterministically approximating the volume of a Kostka polytope. - Hariharan Narayanan 001; Piyush Srivastava 001 (CoRR, 2025)

Approximating mixed volumes to arbitrary accuracy. - Hariharan Narayanan 001; Sourav Roy (CoRR, 2025)