STOC is Burning
Computational Complexity,
Bill and I are in Palo Alto this week for the co-located meetings of STOC and Complexity. In a new ACM policy, the STOC 2013…
Maintaining shortest paths under deletions in weighted directed graphs
Overview of attention for article published in this source, June 2013