Navin Goyal

Available identifiers

Publication	Date of Publication	Type
Non-Gaussian component analysis using entropy methods	2020-01-30	Paper
Annotations for Sparse Data Streams	2019-06-20	Paper
Better analysis of binary search tree on decomposable sequences	2019-05-29	Paper
https://portal.mardi4nfdi.de/entity/Q4633869	2019-05-06	Paper
Near-Optimal Regret Bounds for Thompson Sampling	2018-05-17	Paper
Query Complexity of Sampling and Small Geometric Partitions	2017-10-04	Paper
https://portal.mardi4nfdi.de/entity/Q2957481	2017-01-26	Paper
Fourier PCA and robust tensor decomposition	2015-06-26	Paper
Rounds vs queries trade-off in noisy computation	2014-10-13	Paper
https://portal.mardi4nfdi.de/entity/Q3191602	2014-10-06	Paper
Expanders via Random Spanning Trees	2014-07-30	Paper
https://portal.mardi4nfdi.de/entity/Q5417683	2014-05-22	Paper
Deterministic Algorithms for the Lovász Local Lemma	2014-04-11	Paper
The VPN Conjecture Is True	2014-02-17	Paper
Dynamic vs. oblivious routing in network design	2011-08-16	Paper
https://portal.mardi4nfdi.de/entity/Q3002819	2011-05-24	Paper
Dynamic vs. oblivious routing in network design	2009-10-29	Paper
https://portal.mardi4nfdi.de/entity/Q3549729	2009-01-05	Paper
Lower Bounds for the Noisy Broadcast Problem	2008-12-22	Paper
An Efficient Approximation Algorithm for Point Pattern Matching Under Noise	2008-09-18	Paper
An algorithmic approach to the identification of rigid domains in proteins	2007-09-10	Paper
A parallel search game	2005-09-22	Paper
Combinatorial Pattern Matching	2005-09-07	Paper

This page was built for person: Navin Goyal