Hariharan Narayanan

Orcid: 0000-0003-0568-7350

According to our database1, Hariharan Narayanan authored at least 31 papers between 2006 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Sampling from Convex Sets with a Cold Start using Multiscale Decompositions.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

2022
Generating an Equidistributed Net on a Sphere Using Random Rotations.
Discret. Comput. Geom., 2022

On Complete Versions of Thevenin-Norton and Maximum Power Transfer Theorems.
Circuits Syst. Signal Process., 2022

On the mixing time of coordinate Hit-and-Run.
Comb. Probab. Comput., 2022

A Spectral Approach to Polytope Diameter.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

2021
On Thevenin-Norton and Maximum power transfer theorems.
CoRR, 2021

2020
Reconstruction of a Riemannian Manifold from Noisy Intrinsic Distances.
SIAM J. Math. Data Sci., 2020

Reconstruction and Interpolation of Manifolds. I: The Geometric Whitney Problem.
Found. Comput. Math., 2020

Higher Dimensional Electrical Circuits.
Circuits Syst. Signal Process., 2020

Implicit Linear Algebra and Basic Circuit Theory.
CoRR, 2020

Learning Mixtures of Spherical Gaussians via Fourier Analysis.
CoRR, 2020

2019
Sum throughput on a random access erasure collision channel.
Proceedings of the 57th Annual Allerton Conference on Communication, 2019

2018
Generating an equidistributed net on a unit n-sphere using random rotations.
CoRR, 2018

John's Walk.
CoRR, 2018

Fitting a Putative Manifold to Noisy Data.
Proceedings of the Conference On Learning Theory, 2018

2017
Efficient Sampling from Time-Varying Log-Concave Distributions.
J. Mach. Learn. Res., 2017

2015
Escaping the Local Minima via Simulated Annealing: Optimization of Approximately Convex Functions.
Proceedings of The 28th Conference on Learning Theory, 2015

2014
On Zeroth-Order Stochastic Convex Optimization via Random Walks.
CoRR, 2014

2013
Heat flow and a faster algorithm to compute the surface area of a convex body.
Random Struct. Algorithms, 2013

2012
Random Walks on Polytopes and an Affine Interior Point Method for Linear Programming.
Math. Oper. Res., 2012

2010
Random Walk Approach to Regret Minimization.
Proceedings of the Advances in Neural Information Processing Systems 23: 24th Annual Conference on Neural Information Processing Systems 2010. Proceedings of a meeting held 6-9 December 2010, 2010

Sample Complexity of Testing the Manifold Hypothesis.
Proceedings of the Advances in Neural Information Processing Systems 23: 24th Annual Conference on Neural Information Processing Systems 2010. Proceedings of a meeting held 6-9 December 2010, 2010

2009
Randomized Interior Point methods for Sampling and Optimization
CoRR, 2009

Learning with Spectral Kernels and Heavy-Tailed Data
CoRR, 2009

On the Sample Complexity of Learning Smooth Cuts on a Manifold.
Proceedings of the COLT 2009, 2009

2008
Distributed Averaging using non-convex updates
CoRR, 2008

Minimizing average latency in oblivious routing.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Distributed averaging in the presence of a sparse cut.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

Sampling Hypersurfaces through Diffusion.
Proceedings of the Approximation, 2008

2007
Geographic gossip on geometric random graphs via affine combinations.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

2006
On the Relation Between Low Density Separation, Spectral Clustering and Graph Cuts.
Proceedings of the Advances in Neural Information Processing Systems 19, 2006


  Loading...