Navin Goyal

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Non-Gaussian component analysis using entropy methods
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing
2020-01-30Paper
Annotations for Sparse Data Streams
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms
2019-06-20Paper
Annotations for Sparse Data Streams
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms
2019-06-20Paper
Better analysis of binary search tree on decomposable sequences
Theoretical Computer Science
2019-05-29Paper
Expanders via random spanning trees2019-05-06Paper
Near-optimal regret bounds for Thompson sampling
Journal of the ACM
2018-05-17Paper
Query complexity of sampling and small geometric partitions
Combinatorics, Probability and Computing
2017-10-04Paper
scientific article; zbMATH DE number 6678440 (Why is no real title available?)2017-01-26Paper
Fourier PCA and robust tensor decomposition
Proceedings of the forty-sixth annual ACM symposium on Theory of computing
2015-06-26Paper
Rounds vs queries trade-off in noisy computation2014-10-13Paper
Lower bounds for the average and smoothed number of Pareto-optima
Theory of Computing
2014-10-06Paper
Expanders via Random Spanning Trees
SIAM Journal on Computing
2014-07-30Paper
Deterministic algorithms for the Lovász local lemma2014-05-22Paper
Deterministic algorithms for the Lovász local lemma
SIAM Journal on Computing
2014-04-11Paper
The VPN conjecture is true
Journal of the ACM
2014-02-17Paper
Dynamic vs. oblivious routing in network design
Algorithmica
2011-08-16Paper
scientific article; zbMATH DE number 5899292 (Why is no real title available?)
Theory of Computing
2011-05-24Paper
Dynamic vs. oblivious routing in network design
Lecture Notes in Computer Science
2009-10-29Paper
scientific article; zbMATH DE number 5485556 (Why is no real title available?)2009-01-05Paper
Lower Bounds for the Noisy Broadcast Problem
SIAM Journal on Computing
2008-12-22Paper
An Efficient Approximation Algorithm for Point Pattern Matching Under Noise
LATIN 2006: Theoretical Informatics
2008-09-18Paper
An algorithmic approach to the identification of rigid domains in proteins
Algorithmica
2007-09-10Paper
A parallel search game
Random Structures & Algorithms
2005-09-22Paper
Combinatorial Pattern Matching
Lecture Notes in Computer Science
2005-09-07Paper


Research outcomes over time


This page was built for person: Navin Goyal