![]() | ![]() |
2003 | ||
---|---|---|
2 | Lars Arge, Andrew Danner, Sha-Mayn Teh: I/O-efficient Point Location Using Persistent B-Trees. ALENEX 2003: 82-92 | |
1 | EE | Lars Arge, Andrew Danner, Sha-Mayn Teh: I/O-efficient point location using persistent B-trees. ACM Journal of Experimental Algorithmics 8: (2003) |
1 | Lars Arge | [1] [2] |
2 | Andrew Danner | [1] [2] |