Moti Yung
CertCo
moti@certco.com
Author, editor, or reviewer of:
Design and performance of convergence routing on multiple spanning trees
Efficient sequential and parallel algorithms for computing recovery points in trees and paths
Maintenance of a minimum spanning forest in a dynamic planar graph
Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time
[
D. Eppstein publications
] [
Citation database
] [
Authors
]
Fano
Experimental Web Server,
D. Eppstein
,
School of Information & Computer Science
,
UC Irvine