A-212 (STCS Seminar Room)
Drainage Networks and the Brownian Web
A Deterministic Polynomial Time Algorithm for Word Problem Over the Free Skew Field
Dynamic Primal Dual Algorithms for Vertex Cover and Matching
Community Detection in Networks: SDP Relaxations and Computational Gaps
Fully Dynamic $(1+\epsilon)$-Approximate Matchings
Routing and Staffing when Servers are Strategic
Axiomatizing Equality of Expressions
Stochastic Averaging for Randomly Perturbed Hamiltonian Systems
Polygon Guarding With Orientation
Pages
