D. Donato, L. Laura, S. Leonardi and S. Millozzi: Modeling the Webgraph: how far we are. In G. Caldarelli and A. Vespignani (eds) "Large structure and Dynamics of Complex Networks", World Scientific pp. 133-161. 2007.
S. Leonardi. A simpler proof of preemptive total flow time approximation on parallel machines. In Efficient Approximation and On-line Algorithms, Bampis, Evripidis; Jansen, Klaus; Kenyon, Claire (Eds.), Lecture Notes in Computer Science, pp. 203 - 212, Springer, 2006.
S. Leonardi. On-line network routing. In Online Algorithms: the state of the art, A. Fiat and G. Woeginger eds., Lecture Notes in Computer Science 1442, pp. 242-267, Springer-Verlag, 1998.
Page was generated in 0.0697 seconds