- Piyush Kumar, Joseph S. B. Mitchell, E. Alper Yildirim:
Approximate minimum enclosing balls in high dimensions using core-sets.
- Lars Arge, Andrew Danner, Sha-Mayn Teh:
I/O-efficient point location using persistent B-trees.
- Adam L. Buchsbaum, Glenn S. Fowler, Balachander Krishnamurthy, Kiem-Phong Vo, Jia Wang:
Fast prefix matching of bounded strings.
- Eric Breimer, Mark K. Goldberg, Darren T. Lim:
A learning algorithm for the longest common subsequence problem.
- Gayathri Venkataraman, Sartaj Sahni, Srabani Mukhopadhyaya:
A blocked all-pairs shortest-paths algorithm.
- Jordi Petit:
Experiments on the minimum linear arrangement problem.
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.