Shyam Narayanan

According to our database1, Shyam Narayanan authored at least 45 papers between 2018 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Massively Parallel Algorithms for High-Dimensional Euclidean Minimum Spanning Tree.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
Better and Simpler Lower Bounds for Differentially Private Statistical Estimation.
CoRR, 2023

A faster and simpler algorithm for learning shallow networks.
CoRR, 2023

Robustness Implies Privacy in Statistical Estimation.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Estimating the Effective Support Size in Constant Query Complexity.
Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023

Sampling an Edge in Sublinear Time Exactly and Optimally.
Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023

Differentially Private All-Pairs Shortest Path Distances: Improved Algorithms and Lower Bounds.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

k-Means Clustering with Distance-Based Privacy.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Differentially Private Approximate Near Neighbor Counting in High Dimensions.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Data Structures for Density Estimation.
Proceedings of the International Conference on Machine Learning, 2023

Query lower bounds for log-concave sampling.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

The Full Landscape of Robust Mean Testing: Sharp Separations between Oblivious and Adaptive Contamination.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Krylov Methods are (nearly) Optimal for Low-Rank Approximation.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

SPAIC: A sub-μW/Channel, 16-Channel General-Purpose Event-Based Analog Front-End with Dual-Mode Encoders.
Proceedings of the IEEE Biomedical Circuits and Systems Conference, 2023

Improved Diversity Maximization Algorithms for Matching and Pseudoforest.
Proceedings of the Approximation, 2023

Bias Reduction for Sum Estimation.
Proceedings of the Approximation, 2023

Learned Interpolation for Better Streaming Quantile Approximation with Worst-Case Guarantees.
Proceedings of the SIAM Conference on Applied and Computational Discrete Algorithms, 2023

2022
Three-wise independent random walks can be slightly unbounded.
Random Struct. Algorithms, 2022

Improved Approximations for Euclidean k-means and k-median, via Nested Quasi-Independent Sets.
CoRR, 2022

All-Pairs Shortest Path Distances with Differential Privacy: Improved Algorithms for Bounded and Unbounded Weights.
CoRR, 2022

Improved approximations for Euclidean <i>k</i>-means and <i>k</i>-median, via nested quasi-independent sets.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Frequency Estimation with One-Sided Error.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Almost Tight Approximation Algorithms for Explainable Clustering.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Near-Optimal Private and Scalable $k$-Clustering.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Exponentially Improving the Complexity of Simulating the Weisfeiler-Lehman Test with Graph Neural Networks.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

A 120dB Programmable-Range On-Chip Pulse Generator for Characterizing Ferroelectric Devices.
Proceedings of the IEEE International Symposium on Circuits and Systems, 2022

Stochastic dendrites enable online learning in mixed-signal neuromorphic processing systems.
Proceedings of the IEEE International Symposium on Circuits and Systems, 2022

Tight and Robust Private Mean Estimation with Few Users.
Proceedings of the International Conference on Machine Learning, 2022

Triangle and Four Cycle Counting with Predictions in Graph Streams.
Proceedings of the Tenth International Conference on Learning Representations, 2022

Optimal Time-Backlog Tradeoffs for the Variable-Processor Cup Game.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Private High-Dimensional Hypothesis Testing.
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

2021
Bounds on expected propagation time of probabilistic zero forcing.
Eur. J. Comb., 2021

Improved Algorithms for Population Recovery from the Deletion Channel.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

On Tolerant Distribution Testing in the Conditional Sampling Model.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Circular Trace Reconstruction.
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

Randomized Dimensionality Reduction for Facility Location and Single-Linkage Clustering.
Proceedings of the 38th International Conference on Machine Learning, 2021

Learning-based Support Estimation in Sublinear Time.
Proceedings of the 9th International Conference on Learning Representations, 2021

Stochastic and Worst-Case Generalized Sorting Revisited.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020
Functions on antipower prefix lengths of the Thue-Morse word.
Discret. Math., 2020

Functions that Preserve Manhattan Distances.
CoRR, 2020

Population Recovery from the Deletion Channel: Nearly Matching Trace Reconstruction Bounds.
CoRR, 2020

2019
Optimal terminal dimensionality reduction in Euclidean space.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Pairwise Independent Random Walks Can Be Slightly Unbounded.
Proceedings of the Approximation, 2019

2018
The 26 Wilf-equivalence classes of length five quasi-consecutive patterns.
Discret. Math. Theor. Comput. Sci., 2018

Deterministic O(1)-Approximation Algorithms to 1-Center Clustering with Outliers.
Proceedings of the Approximation, 2018


  Loading...