Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
SODA
/
Paper
Improving the smoothed complexity of FLIP for max cut problems.
Ali Bibak
,
Charles Carlson
,
Karthekeyan Chandrasekaran
Venue
A*
SODA
Year
2019
Proceedings
SODA
DBLP record
conf/soda/BibakCC19 ↗
Browse the full
SODA paper archive
.