Vedat Levi Alev

Orcid: 0009-0008-0340-6029

According to our database1, Vedat Levi Alev authored at least 9 papers between 2017 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Faster Mixing for Triangulations via Transport Flows.
CoRR, May, 2026

Hypergraph Samplers: Typical and Worst Case Behavior.
CoRR, January, 2026

2024
Expanderizing Higher Order Random Walks.
Proceedings of the Approximation, 2024

2023
Sequential Sweeps and High Dimensional Expansion.
CoRR, 2023

2020
Improved analysis of higher order random walks and applications.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

List Decoding of Direct Sum Codes.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019
Approximating Constraint Satisfaction Problems on High-Dimensional Expanders.
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2018
Graph Clustering using Effective Resistance.
Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

2017
Approximating Unique Games Using Low Diameter Graph Decomposition.
Proceedings of the Approximation, 2017


  Loading...