Charlie Carlson

Affiliations:
  • University of Colorado Boulder, Department of Computer Science, CO, USA
  • University of Illinois Urbana-Champaign, IL, USA (former)


According to our database1, Charlie Carlson authored at least 17 papers between 2016 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Algorithms for the ferromagnetic Potts model on expanders.
Comb. Probab. Comput., 2024

Flip Dynamics for Sampling Colorings: Improving (11/6-ε) Using a Simple Metric.
CoRR, 2024

Optimal Mixing for Randomly Sampling Edge Colorings on Trees Down to the Max Degree.
CoRR, 2024

A Spectral Approach to Approximately Counting Independent Sets in Dense Bipartite Graphs.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023
Approximation Algorithms for Norm Multiway Cut.
CoRR, 2023

Approximately counting independent sets in dense bipartite graphs via subspace enumeration.
CoRR, 2023

Improved Distributed Algorithms for Random Colorings.
Proceedings of the 27th International Conference on Principles of Distributed Systems, 2023

Approximation Algorithm for Norm Multiway Cut.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022
Computational thresholds for the fixed-magnetization Ising model.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

2021
Improving the Smoothed Complexity of FLIP for Max Cut Problems.
ACM Trans. Algorithms, 2021

Lower Bounds for Max-Cut in H-Free Graphs via Semidefinite Programming.
SIAM J. Discret. Math., 2021

2020
Spectral aspects of symmetric matrix signings.
Discret. Optim., 2020

Efficient algorithms for the Potts model on small-set expanders.
CoRR, 2020

Lower Bounds for Max-Cut via Semidefinite Programming.
Proceedings of the LATIN 2020: Theoretical Informatics, 2020

2019
Optimal Lower Bounds for Sketching Graph Cuts.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018
A Ramsey-type Theorem on the Max-Cut Value of d-Regular Graphs.
CoRR, 2018

2016
Largest Eigenvalue and Invertibility of Symmetric Matrix Signings.
CoRR, 2016


  Loading...