Thuy-Duong Vuong

Orcid: 0000-0003-0271-9687

Affiliations:
  • Stanford University, CA, USA


According to our database1, Thuy-Duong Vuong authored at least 29 papers between 2019 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Fast parallel sampling under isoperimetry.
CoRR, 2024

Universality of Spectral Independence with Applications to Fast Mixing in Spin Glasses.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
Fairness in Submodular Maximization over a Matroid Constraint.
CoRR, 2023

Sampling Multimodal Distributions with the Vanilla Score: Benefits of Data-Based Initialization.
CoRR, 2023

Parallel Discrete Sampling via Continuous Walks.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Quadratic Speedups in Parallel Sampling from Determinantal Distributions.
Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

Optimal mixing of the down-up walk on independent sets of a given size.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022
Spectral independence, coupling, and the spectral gap of the Glauber dynamics.
Inf. Process. Lett., 2022

Composable Coresets for Constrained Determinant Maximization and Beyond.
CoRR, 2022

On the Complexity of Sampling Redistricting Plans.
CoRR, 2022

Improved Sampling-to-Counting Reductions in High-Dimensional Expanders and Faster Parallel Determinantal Sampling.
CoRR, 2022

Dimension reduction for maximum matchings and the Fastest Mixing Markov Chain.
CoRR, 2022

Entropic independence: optimal mixing of down-up random walks.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Domain Sparsification of Discrete Distributions Using Entropic Independence.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Optimal Sublinear Sampling of Spanning Trees and Determinantal Point Processes via Average-Case Entropic Independence.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

From Sampling to Optimization on Discrete Domains with Applications to Determinant Maximization.
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

2021
Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles.
SIAM J. Comput., 2021

Entropic Independence II: Optimal Sampling and Concentration via Restricted Modified Log-Sobolev Inequalities.
CoRR, 2021

Entropic Independence in High-Dimensional Expanders: Modified Log-Sobolev Inequalities for Fractionally Log-Concave Polynomials and the Ising Model.
CoRR, 2021

Spectral independence, coupling with the stationary distribution, and the spectral gap of the Glauber dynamics.
CoRR, 2021

On the sampling Lovász Local Lemma for atomic constraint satisfaction problems.
CoRR, 2021

Simple and Near-Optimal MAP Inference for Nonsymmetric DPPs.
CoRR, 2021

Log-concave polynomials IV: approximate exchange, tight mixing times, and near-optimal sampling of forests.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Fractionally log-concave and sector-stable polynomials: counting planar matchings and more.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Towards the sampling Lovász Local Lemma.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020
An Extension of Plücker Relations with Applications to Subdeterminant Maximization.
Proceedings of the Approximation, 2020

2019
Lattice Trapdoors and IBE from Middle-Product LWE.
IACR Cryptol. ePrint Arch., 2019

Toric Mutations in the dP<sub>2</sub> Quiver and Subgraphs of the dP<sub>2</sub> Brane Tiling.
Electron. J. Comb., 2019

Graph pattern detection: hardness for all induced patterns and faster non-induced cycles.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019


  Loading...