Sayantan Sen

Orcid: 0000-0001-5875-5252

According to our database1, Sayantan Sen authored at least 19 papers between 2020 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Testing Sparse Functions over the Reals.
CoRR, March, 2026

Near uniform triangle sampling over adjacency list graph streams.
Theor. Comput. Sci., 2026

Instance Dependent Testing of Samplers Using Interval Conditioning.
Proceedings of the Fortieth AAAI Conference on Artificial Intelligence, 2026

2025
Testing (Conditional) Mutual Information.
Electron. Colloquium Comput. Complex., 2025

Testing vs Estimation for Index-Invariant Properties in the Huge Object Model.
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Settling the Complexity of Testing Grainedness of Distributions, and Application to Uniformity Testing in the Huge Object Model.
Proceedings of the 16th Innovations in Theoretical Computer Science Conference, 2025

Testing (Conditional) Mutual Information - Extended Abstract.
Proceedings of the Thirty Eighth Annual Conference on Learning Theory, 2025

Quantum Property Testing in Sparse Directed Graphs.
Proceedings of the Approximation, 2025

2024
Efficient Sample-optimal Learning of Gaussian Tree Models via Sample-optimal Testing of Gaussian Mutual Information.
CoRR, 2024

Distribution Learning Meets Graph Structure Sampling.
CoRR, 2024

Testing Self-Reducible Samplers.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
A (simple) classical algorithm for estimating Betti numbers.
Quantum, December, 2023

Testing of Index-Invariant Properties in the Huge Object Model.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

Testing of Horn Samplers.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022
A (simple) classical algorithm for estimating Betti numbers.
CoRR, 2022

Tolerant Bipartiteness Testing in Dense Graphs.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Exploring the Gap Between Tolerant and Non-Tolerant Distribution Testing.
Proceedings of the Approximation, 2022

2021
Interplay Between Graph Isomorphism and Earth Mover's Distance in the Query and Communication Worlds.
Proceedings of the Approximation, 2021

2020
Estimation of Graph Isomorphism Distance in the Query World.
Electron. Colloquium Comput. Complex., 2020


  Loading...