default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCharlie Carlson
Person information
- affiliation: University of Colorado Boulder, Department of Computer Science, CO, USA
- affiliation (former): University of Illinois Urbana-Champaign, IL, USA
Other persons with the same name
- Charles Carlson — disambiguation page
- Charles Carlson 0001
![[0000-0002-4293-3090]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-4293-3090")
— Kansas State University (KSU), Department of Electrical and Computer Engineering, Manhattan, KS, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c9]Charlie Carlson, Ewan Davies, Alexandra Kolla, Aditya Potukuchi:
A Spectral Approach to Approximately Counting Independent Sets in Dense Bipartite Graphs. ICALP 2024: 35:1-35:18- [i12]Charlie Carlson, Xiaoyu Chen, Weiming Feng, Eric Vigoda:
Optimal Mixing for Randomly Sampling Edge Colorings on Trees Down to the Max Degree. CoRR abs/2407.04576 (2024) - [i11]Charlie Carlson, Eric Vigoda:
Flip Dynamics for Sampling Colorings: Improving (11/6-ε) Using a Simple Metric. CoRR abs/2407.04870 (2024) - 2023
- [c8]Charlie Carlson, Jafar Jafarov, Konstantin Makarychev, Yury Makarychev, Liren Shan:
Approximation Algorithm for Norm Multiway Cut. ESA 2023: 32:1-32:14 - [c7]Charlie Carlson, Daniel Frishberg, Eric Vigoda:
Improved Distributed Algorithms for Random Colorings. OPODIS 2023: 13:1-13:18 - [i10]Charlie Carlson, Ewan Davies, Alexandra Kolla, Aditya Potukuchi:
Approximately counting independent sets in dense bipartite graphs via subspace enumeration. CoRR abs/2307.09533 (2023) - [i9]Charlie Carlson, Jafar Jafarov, Konstantin Makarychev, Yury Makarychev, Liren Shan:
Approximation Algorithms for Norm Multiway Cut. CoRR abs/2308.08373 (2023) - [i8]Charlie Carlson, Daniel Frishberg, Eric Vigoda:
Improved Distributed Algorithms for Random Colorings. CoRR abs/2309.07859 (2023) - 2022
- [c6]Charlie Carlson, Ewan Davies, Nicolas Fraiman, Alexandra Kolla, Aditya Potukuchi, Corrine Yap:
Algorithms for the ferromagnetic Potts model on expanders. FOCS 2022: 344-355 - [c5]Charlie Carlson, Ewan Davies, Alexandra Kolla, Will Perkins:
Computational thresholds for the fixed-magnetization Ising model. STOC 2022: 1459-1472 - [i7]Charlie Carlson, Ewan Davies, Nicolas Fraiman, Alexandra Kolla, Aditya Potukuchi, Corrine Yap:
Algorithms for the ferromagnetic Potts model on expanders. CoRR abs/2204.01923 (2022) - 2021
- [j3]Charles Carlson, Alexandra Kolla, Ray Li, Nitya Mani, Benny Sudakov, Luca Trevisan:
Lower Bounds for Max-Cut in H-Free Graphs via Semidefinite Programming. SIAM J. Discret. Math. 35(3): 1557-1568 (2021) - [j2]Ali Bibak, Charles Carlson, Karthekeyan Chandrasekaran:
Improving the Smoothed Complexity of FLIP for Max Cut Problems. ACM Trans. Algorithms 17(3): 19:1-19:38 (2021) - [i6]Charlie Carlson, Ewan Davies, Alexandra Kolla, Will Perkins:
Computational thresholds for the fixed-magnetization Ising model. CoRR abs/2111.03033 (2021) - 2020
- [j1]Charles Carlson, Karthekeyan Chandrasekaran, Hsien-Chih Chang, Naonori Kakimura, Alexandra Kolla:
Spectral aspects of symmetric matrix signings. Discret. Optim. 37: 100582 (2020) - [c4]Charles Carlson, Alexandra Kolla, Ray Li, Nitya Mani, Benny Sudakov, Luca Trevisan:
Lower Bounds for Max-Cut via Semidefinite Programming. LATIN 2020: 479-490 - [i5]Charles Carlson, Ewan Davies, Alexandra Kolla:
Efficient algorithms for the Potts model on small-set expanders. CoRR abs/2003.01154 (2020)
2010 – 2019
- 2019
- [c3]Charles Carlson, Karthekeyan Chandrasekaran, Hsien-Chih Chang, Naonori Kakimura, Alexandra Kolla:
Spectral Aspects of Symmetric Matrix Signings. MFCS 2019: 81:1-81:13 - [c2]Ali Bibak, Charles Carlson, Karthekeyan Chandrasekaran:
Improving the smoothed complexity of FLIP for max cut problems. SODA 2019: 897-916 - [c1]Charles Carlson, Alexandra Kolla, Nikhil Srivastava, Luca Trevisan:
Optimal Lower Bounds for Sketching Graph Cuts. SODA 2019: 2565-2569 - 2018
- [i4]Ali Bibak, Charles Carlson, Karthekeyan Chandrasekaran:
Improving the smoothed complexity of FLIP for max cut problems. CoRR abs/1807.05665 (2018) - [i3]Charles Carlson, Alexandra Kolla, Luca Trevisan:
A Ramsey-type Theorem on the Max-Cut Value of d-Regular Graphs. CoRR abs/1810.10044 (2018) - 2017
- [i2]Charles Carlson, Alexandra Kolla, Nikhil Srivastava, Luca Trevisan:
Optimal Lower Bounds for Sketching Graph Cuts. CoRR abs/1712.10261 (2017) - 2016
- [i1]Charles Carlson, Karthekeyan Chandrasekaran, Hsien-Chih Chang, Alexandra Kolla:
Largest Eigenvalue and Invertibility of Symmetric Matrix Signings. CoRR abs/1611.03624 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
