5 papers:
ICALP-v1-2011-QianW #algorithm #online #problem- An O(logn)-Competitive Algorithm for Online Constrained Forest Problems (JQ, DPW), pp. 37–48.
TACAS-2010-ValmariF #markov- Simple O(m logn) Time Markov Chain Lumping (AV, GF), pp. 38–52.
- ICALP-v2-2010-EvenM #algorithm #online #random
- An O(logn)-Competitive Online Centralized Randomized Packet-Routing Algorithm for Lines (GE, MM), pp. 139–150.
- ICALP-v1-2009-WeimannY #graph
- Computing the Girth of a Planar Graph in O(n logn) Time (OW, RY), pp. 764–773.
DAC-1990-LoV #algorithm- An O(n1.5logn) 1-d Compaction Algorithm (CYL, RV), pp. 382–387.
