I/O-efficient Point Location Using Persistent B-Trees - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Lars Arge, Andrew Danner, Sha-Mayn Teh. I/O-efficient Point Location Using Persistent B-Trees. In Richard E. Ladner, editor, Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments, Baltimore, MD, USA, January 11, 2003. pages 82-92, SIAM, 2003.

The following publications are possibly variants of this publication:

I/O-efficient point location using persistent B-treesLars Arge, Andrew Danner, Sha-Mayn Teh. jea, 8, 2003. [doi]

runs on WebDSL