An approximation algorithm for maximum packing of 3-edge paths. Gudmund S. Frandsen and Sven Skyum . Dynamic maintenance of majority information in constant time per update. Marek Chrobak , Lawrence L. Larmore , Carsten Lund , and Nick Reingold . A better lower bound on the competitive ratio of the randomized 2-server problem.
Impossibility results for weak threshold networks.
Recognizing Hamming graphs in linear time and space. Tiziana Calamoneri and Andrea Sterbini . Y. Afek , M. Cohen , and E. Haalman . The bit complexity of the predecessor problem. Performance bounds for modeling NUMA architectures.