![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
ACM Journal of Experimental Algorithmics, Volume 8
Volume 8, 2003
- 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.
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.