default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHariharan Narayanan 0001
Person information
- affiliation: Tata Institute for Fundamental Research, School of Technology and Computer Science, Mumbai, India
- affiliation: Unversity of Chicago, Department of Computer Science, Chicago, IL, USA
Other persons with the same name
- Hariharan Narayanan — disambiguation page
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2025
[i16]Hariharan Narayanan
, Piyush Srivastava:
Deterministically approximating the volume of a Kostka polytope. CoRR abs/2503.06459 (2025)- [i15]Hariharan Narayanan, Sourav Roy:
Approximating mixed volumes to arbitrary accuracy. CoRR abs/2508.19582 (2025) - 2024
- [j9]Hariharan Narayanan, Rikhav Shah, Nikhil Srivastava:
A Spectral Approach to Polytope Diameter. Discret. Comput. Geom. 72(4): 1647-1674 (2024) - 2023
- [c14]Hariharan Narayanan, Amit Rajaraman, Piyush Srivastava:
Sampling from Convex Sets with a Cold Start using Multiscale Decompositions. STOC 2023: 117-130 - 2022
- [j8]Hariharan Narayanan, Piyush Srivastava:
On the mixing time of coordinate Hit-and-Run. Comb. Probab. Comput. 31(2): 320-332 (2022) - [j7]Somnath Chakraborty, Hariharan Narayanan:
Generating an Equidistributed Net on a Sphere Using Random Rotations. Discret. Comput. Geom. 67(1): 231-257 (2022) - [c13]Hariharan Narayanan, Rikhav Shah, Nikhil Srivastava:
A Spectral Approach to Polytope Diameter. ITCS 2022: 108:1-108:22 - [i14]Hariharan Narayanan, Amit Rajaraman, Piyush Srivastava:
Sampling from convex sets with a cold start using multiscale decompositions. CoRR abs/2211.04439 (2022) - 2021
- [i13]Hariharan Narayanan, Rikhav Shah, Nikhil Srivastava:
A Spectral Approach to Polytope Diameter. CoRR abs/2101.12198 (2021) - [i12]H. Narayanan, Hariharan Narayanan:
On Thevenin-Norton and Maximum power transfer theorems. CoRR abs/2104.05202 (2021) - 2020
- [j6]Hariharan Narayanan:
Higher Dimensional Electrical Circuits. Circuits Syst. Signal Process. 39(4): 1770-1796 (2020) - [j5]Charles Fefferman, Sergei Ivanov, Yaroslav Kurylev, Matti Lassas, Hariharan Narayanan:
Reconstruction and Interpolation of Manifolds. I: The Geometric Whitney Problem. Found. Comput. Math. 20(5): 1035-1133 (2020) - [j4]Charles Fefferman, Sergei Ivanov, Matti Lassas, Hariharan Narayanan:
Reconstruction of a Riemannian Manifold from Noisy Intrinsic Distances. SIAM J. Math. Data Sci. 2(3): 770-808 (2020) - [i11]Somnath Chakraborty, Hariharan Narayanan:
Learning Mixtures of Spherical Gaussians via Fourier Analysis. CoRR abs/2004.05813 (2020) - [i10]H. Narayanan, Hariharan Narayanan:
Implicit Linear Algebra and Basic Circuit Theory. CoRR abs/2005.00838 (2020) - [i9]Hariharan Narayanan, Piyush Srivastava:
On the mixing time of coordinate Hit-and-Run. CoRR abs/2009.14004 (2020)
2010 – 2019
- 2018
- [c12]Charles Fefferman, Sergei Ivanov, Yaroslav Kurylev, Matti Lassas, Hariharan Narayanan:
Fitting a Putative Manifold to Noisy Data. COLT 2018: 688-720 - [i8]Adam Gustafson, Hariharan Narayanan:
John's Walk. CoRR abs/1803.02032 (2018) - [i7]Somnath Chakraborty, Hariharan Narayanan:
Generating an equidistributed net on a unit n-sphere using random rotations. CoRR abs/1812.01845 (2018) - 2017
- [j3]Hariharan Narayanan, Alexander Rakhlin:
Efficient Sampling from Time-Varying Log-Concave Distributions. J. Mach. Learn. Res. 18: 112:1-112:29 (2017) - 2015
- [c11]Alexandre Belloni, Tengyuan Liang, Hariharan Narayanan, Alexander Rakhlin:
Escaping the Local Minima via Simulated Annealing: Optimization of Approximately Convex Functions. COLT 2015: 240-265 - [i6]Alexandre Belloni, Tengyuan Liang, Hariharan Narayanan, Alexander Rakhlin:
Escaping the Local Minima via Simulated Annealing: Optimization of Approximately Convex Functions. CoRR abs/1501.07242 (2015) - 2014
- [i5]Tengyuan Liang, Hariharan Narayanan, Alexander Rakhlin:
On Zeroth-Order Stochastic Convex Optimization via Random Walks. CoRR abs/1402.2667 (2014) - 2013
- [j2]Mikhail Belkin, Hariharan Narayanan, Partha Niyogi:
Heat flow and a faster algorithm to compute the surface area of a convex body. Random Struct. Algorithms 43(4): 407-428 (2013) - 2012
- [j1]Ravindran Kannan, Hariharan Narayanan:
Random Walks on Polytopes and an Affine Interior Point Method for Linear Programming. Math. Oper. Res. 37(1): 1-20 (2012) - 2010
- [c10]Hariharan Narayanan, Alexander Rakhlin:
Random Walk Approach to Regret Minimization. NIPS 2010: 1777-1785 - [c9]Hariharan Narayanan, Sanjoy K. Mitter:
Sample Complexity of Testing the Manifold Hypothesis. NIPS 2010: 1786-1794
2000 – 2009
- 2009
- [c8]Hariharan Narayanan, Partha Niyogi:
On the Sample Complexity of Learning Smooth Cuts on a Manifold. COLT 2009 - [c7]Ravi Kannan, Hariharan Narayanan:
Random walks on polytopes and an affine interior point method for linear programming. STOC 2009: 561-570 - [i4]Michael W. Mahoney, Hariharan Narayanan:
Learning with Spectral Kernels and Heavy-Tailed Data. CoRR abs/0906.4539 (2009) - [i3]Hariharan Narayanan:
Randomized Interior Point methods for Sampling and Optimization. CoRR abs/0911.3950 (2009) - 2008
- [c6]Hariharan Narayanan, Partha Niyogi:
Sampling Hypersurfaces through Diffusion. APPROX-RANDOM 2008: 535-548 - [c5]Hariharan Narayanan:
Distributed averaging in the presence of a sparse cut. PODC 2008: 441 - [c4]Prahladh Harsha, Thomas P. Hayes, Hariharan Narayanan, Harald Räcke, Jaikumar Radhakrishnan:
Minimizing average latency in oblivious routing. SODA 2008: 200-207 - [i2]Hariharan Narayanan:
Distributed Averaging using non-convex updates. CoRR abs/0803.3642 (2008) - 2007
- [c3]Hariharan Narayanan:
Geographic gossip on geometric random graphs via affine combinations. PODC 2007: 388-389 - 2006
- [c2]Mikhail Belkin, Hariharan Narayanan, Partha Niyogi:
Heat Flow and a Faster Algorithm to Compute the Surface Area of a Convex Body. FOCS 2006: 47-56 - [c1]Hariharan Narayanan, Mikhail Belkin, Partha Niyogi:
On the Relation Between Low Density Separation, Spectral Clustering and Graph Cuts. NIPS 2006: 1025-1032 - [i1]Hariharan Narayanan:
Geographic Gossip on Geometric Random Graphs via Affine Combinations. CoRR abs/cs/0612012 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-06-03 02:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
