32 citations
- Aarhus UniversityDK11 papers
- Korea Advanced Institute of Science and TechnologyKR5 papers
- Centre National de la Recherche ScientifiqueFR4 papers
- GAMBLE: Géométrie, Algorithmes et Modèles Bien au-delà du Linéaire et de l'EuclidienFR4 papers
- Institut national de recherche en sciences et technologies du numériqueFR4 papers
- Laboratoire Lorrain de Recherche en Informatique et ses ApplicationsFR4 papers
- National Institute for Mathematical SciencesKR4 papers
- Université de LorraineFR4 papers
- Aristotle University of ThessalonikiGR2 papers
- Chinese University of Hong KongHK2 papers
- Danish National Research FoundationDK2 papers
- Hong Kong University of Science and TechnologyHK2 papers
Showing 2013Show all
3 papers · 1 filter
cs.DS2013
RAM-Efficient External Memory Sorting
Lars Arge, Mikkel Thorup
In recent years a large number of problems have been considered in external memory models of computation, where the complexity measure is the number of blocks of data that are move…
q-bio.QM2013★ 1 cited
Computing the Skewness of the Phylogenetic Mean Pairwise Distance in Linear Time
Constantinos Tsirogiannis, Brody Sandel
The phylogenetic Mean Pairwise Distance (MPD) is one of the most popular measures for computing the phylogenetic distance between a given group of species. More specifically, for a…
cs.DS2013★ 2 cited
I/O-Efficient Planar Range Skyline and Attrition Priority Queues
Casper Kejlberg-Rasmussen, Yufei Tao, Konstantinos Tsakalidis +2
In the planar range skyline reporting problem, we store a set P of n 2D points in a structure such that, given a query rectangle Q = [a_1, a_2] x [b_1, b_2], the maxima (a.k.a. sky…