Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time
Publication
, Conference
Nikoletseas, S; Reif, J; Spirakis, P; Yung, M
Published in: AUTOMATA, LANGUAGES AND PROGRAMMING
1995
Duke Scholars
Published In
AUTOMATA, LANGUAGES AND PROGRAMMING
ISSN
0302-9743
ISBN
3-540-60084-1
Publication Date
1995
Volume
944
Start / End Page
159 / 170
Related Subject Headings
- Artificial Intelligence & Image Processing
- 46 Information and computing sciences
Citation
APA
Chicago
ICMJE
MLA
NLM
Nikoletseas, S., Reif, J., Spirakis, P., & Yung, M. (1995). Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time. In AUTOMATA, LANGUAGES AND PROGRAMMING (Vol. 944, pp. 159–170).
Nikoletseas, S., J. Reif, P. Spirakis, and M. Yung. “Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time.” In AUTOMATA, LANGUAGES AND PROGRAMMING, 944:159–70, 1995.
Nikoletseas S, Reif J, Spirakis P, Yung M. Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time. In: AUTOMATA, LANGUAGES AND PROGRAMMING. 1995. p. 159–70.
Nikoletseas, S., et al. “Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time.” AUTOMATA, LANGUAGES AND PROGRAMMING, vol. 944, 1995, pp. 159–70.
Nikoletseas S, Reif J, Spirakis P, Yung M. Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time. AUTOMATA, LANGUAGES AND PROGRAMMING. 1995. p. 159–170.
Published In
AUTOMATA, LANGUAGES AND PROGRAMMING
ISSN
0302-9743
ISBN
3-540-60084-1
Publication Date
1995
Volume
944
Start / End Page
159 / 170
Related Subject Headings
- Artificial Intelligence & Image Processing
- 46 Information and computing sciences