Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
ICALP
/
Paper
Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Worst-Case Time Barrier.
Moses Charikar
,
Shay Solomon
Venue
A*
ICALP
Year
2018
Proceedings
ICALP
DBLP record
conf/icalp/CharikarS18 ↗
Browse the full
ICALP paper archive
.