Hariharan Narayanan

43 papers A* 9A 1Journal 27Unranked 6

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Approximating mixed volumes to arbitrary accuracy. CoRR Hariharan Narayanan, Sourav Roy
2025	J	`jnl`	Deterministically approximating the volume of a Kostka polytope. CoRR Hariharan Narayanan, Piyush Srivastava
2025	—	`conf`	PRREACH: Probabilistic Risk Assessment Using Reachability for UAV Control. ITSC Nicole Fronda, Hariharan Narayanan, Sadia Afrin Ananna, Steven Weber, Houssam Abbas
2025	J	`jnl`	PRREACH: Probabilistic Risk Assessment Using Reachability for UAV Control. CoRR Nicole Fronda, Hariharan Narayanan, Sadia Afrin Ananna, Steven P. Weber, Houssam Abbas
2024	J	`jnl`	A Spectral Approach to Polytope Diameter. Discret. Comput. Geom. Hariharan Narayanan, Rikhav Shah, Nikhil Srivastava
2023	A*	`conf`	Sampling from Convex Sets with a Cold Start using Multiscale Decompositions. STOC Hariharan Narayanan, Amit Rajaraman, Piyush Srivastava
2022	A	`conf`	A Spectral Approach to Polytope Diameter. ITCS Hariharan Narayanan, Rikhav Shah, Nikhil Srivastava
2022	J	`jnl`	Generating an Equidistributed Net on a Sphere Using Random Rotations. Discret. Comput. Geom. Somnath Chakraborty, Hariharan Narayanan
2022	J	`jnl`	On Complete Versions of Thevenin-Norton and Maximum Power Transfer Theorems. Circuits Syst. Signal Process. Narayanan Harihar, Hariharan Narayanan
2022	J	`jnl`	On the mixing time of coordinate Hit-and-Run. Comb. Probab. Comput. Hariharan Narayanan, Piyush Srivastava
2022	J	`jnl`	Sampling from convex sets with a cold start using multiscale decompositions. CoRR Hariharan Narayanan, Amit Rajaraman, Piyush Srivastava
2021	J	`jnl`	A Spectral Approach to Polytope Diameter. CoRR Hariharan Narayanan, Rikhav Shah, Nikhil Srivastava
2021	J	`jnl`	On Thevenin-Norton and Maximum power transfer theorems. CoRR H. Narayanan, Hariharan Narayanan
2020	J	`jnl`	Higher Dimensional Electrical Circuits. Circuits Syst. Signal Process. Hariharan Narayanan
2020	J	`jnl`	Implicit Linear Algebra and Basic Circuit Theory. CoRR H. Narayanan, Hariharan Narayanan
2020	J	`jnl`	Learning Mixtures of Spherical Gaussians via Fourier Analysis. CoRR Somnath Chakraborty, Hariharan Narayanan
2020	J	`jnl`	On the mixing time of coordinate Hit-and-Run. CoRR Hariharan Narayanan, Piyush Srivastava
2020	J	`jnl`	Reconstruction and Interpolation of Manifolds. I: The Geometric Whitney Problem. Found. Comput. Math. Charles Fefferman, Sergei Ivanov, Yaroslav Kurylev, Matti Lassas, Hariharan Narayanan
2020	J	`jnl`	Reconstruction of a Riemannian Manifold from Noisy Intrinsic Distances. SIAM J. Math. Data Sci. Charles Fefferman, Sergei Ivanov, Matti Lassas, Hariharan Narayanan
2019	—	`conf`	Sum throughput on a random access erasure collision channel. Allerton Hariharan Narayanan, Steven Weber
2018	A*	`conf`	Fitting a Putative Manifold to Noisy Data. COLT Charles Fefferman, Sergei Ivanov, Yaroslav Kurylev, Matti Lassas, Hariharan Narayanan
2018	J	`jnl`	Generating an equidistributed net on a unit n-sphere using random rotations. CoRR Somnath Chakraborty, Hariharan Narayanan
2018	J	`jnl`	John's Walk. CoRR Adam Gustafson, Hariharan Narayanan
2017	J	`jnl`	Efficient Sampling from Time-Varying Log-Concave Distributions. J. Mach. Learn. Res. Hariharan Narayanan, Alexander Rakhlin
2015	A*	`conf`	Escaping the Local Minima via Simulated Annealing: Optimization of Approximately Convex Functions. COLT Alexandre Belloni, Tengyuan Liang, Hariharan Narayanan, Alexander Rakhlin
2015	J	`jnl`	Escaping the Local Minima via Simulated Annealing: Optimization of Approximately Convex Functions. CoRR Alexandre Belloni, Tengyuan Liang, Hariharan Narayanan, Alexander Rakhlin
2014	J	`jnl`	On Zeroth-Order Stochastic Convex Optimization via Random Walks. CoRR Tengyuan Liang, Hariharan Narayanan, Alexander Rakhlin
2013	J	`jnl`	Heat flow and a faster algorithm to compute the surface area of a convex body. Random Struct. Algorithms Mikhail Belkin, Hariharan Narayanan, Partha Niyogi
2012	J	`jnl`	Random Walks on Polytopes and an Affine Interior Point Method for Linear Programming. Math. Oper. Res. Ravindran Kannan, Hariharan Narayanan
2010	—	`conf`	Random Walk Approach to Regret Minimization. NIPS Hariharan Narayanan, Alexander Rakhlin
2010	—	`conf`	Sample Complexity of Testing the Manifold Hypothesis. NIPS Hariharan Narayanan, Sanjoy K. Mitter
2009	J	`jnl`	Learning with Spectral Kernels and Heavy-Tailed Data CoRR Michael W. Mahoney, Hariharan Narayanan
2009	A*	`conf`	On the Sample Complexity of Learning Smooth Cuts on a Manifold. COLT Hariharan Narayanan, Partha Niyogi
2009	A*	`conf`	Random walks on polytopes and an affine interior point method for linear programming. STOC Ravi Kannan, Hariharan Narayanan
2009	J	`jnl`	Randomized Interior Point methods for Sampling and Optimization CoRR Hariharan Narayanan
2008	J	`jnl`	Distributed Averaging using non-convex updates CoRR Hariharan Narayanan
2008	A*	`conf`	Distributed averaging in the presence of a sparse cut. PODC Hariharan Narayanan
2008	A*	`conf`	Minimizing average latency in oblivious routing. SODA Prahladh Harsha, Thomas P. Hayes, Hariharan Narayanan, Harald Räcke, Jaikumar Radhakrishnan
2008	—	`conf`	Sampling Hypersurfaces through Diffusion. APPROX-RANDOM Hariharan Narayanan, Partha Niyogi
2007	A*	`conf`	Geographic gossip on geometric random graphs via affine combinations. PODC Hariharan Narayanan
2006	J	`jnl`	Geographic Gossip on Geometric Random Graphs via Affine Combinations CoRR Hariharan Narayanan
2006	A*	`conf`	Heat Flow and a Faster Algorithm to Compute the Surface Area of a Convex Body. FOCS Mikhail Belkin, Hariharan Narayanan, Partha Niyogi
2006	—	`conf`	On the Relation Between Low Density Separation, Spectral Clustering and Graph Cuts. NIPS Hariharan Narayanan, Mikhail Belkin, Partha Niyogi