Intl. Colloquium on Automata, Languages, and Programming, ICALP 2018


Article Details
Title: Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Worst-Case Time Barrier
Article URLs:
Alternative Article URLs:
Authors: Moses Charikar
  • Stanford University, Computer Science Department
Shay Solomon
  • IBM Research, T. J. Watson Research Center
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers: 1617577
DBLP Key: conf/icalp/CharikarS18
Author Comments:

Discuss this paper and its artifacts below