Proc. 1st Symp. Discrete Algorithms
Incremental algorithms for minimal length paths, AusItaMar-SODA-90
Visibility with a moving point of view, BerDobEpp-SODA-90
Sparse dynamic programming, EppGalGia-SODA-90
Maintenance of a minimum spanning forest in a dynamic planar graph, EppItaTam-SODA-90
Superlinear bounds for matrix searching problems, Kla-SODA-90
On-line dynamic programming with applications to the prediction of RNA secondary structure, LarSch-SODA-90
[
D. Eppstein publications
] [
Citation database
] [
Locations
]
Fano
Experimental Web Server,
D. Eppstein
,
School of Information & Computer Science
,
UC Irvine