Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time

Sotiris E. Nikoletseas, John H. Reif, Paul G. Spirakis, and Moti Yung
Proc. 22nd Int. Coll. Automata, Languages, and Programming (ICALP 1995), Lecture Notes in Computer Science 944, Zoltán Fülöp and Ferenc Gécseg, ed., Springer-Verlag, 1995, pp. 159–170
http://citeseer.nj.nec.com/nikoletseas95stochastic.html

Cites:

Fano Experimental Web Server, D. Eppstein, School of Information & Computer Science, UC Irvine
Made on a Mac Valid XHTML 1.0!