J
John Iacono
Researcher at Université libre de Bruxelles
Publications - 174
Citations - 2286
John Iacono is an academic researcher from Université libre de Bruxelles. The author has contributed to research in topics: Data structure & Amortized analysis. The author has an hindex of 24, co-authored 170 publications receiving 2130 citations. Previous affiliations of John Iacono include New York University & Aarhus University.
Papers
More filters
Efficient Reconfiguration for Lattice-Based Modular Robots
Greg Aloupis,Nadia M. Benbernou,Mirela Damian,Erik D. Demaine,Robin Flatland,John Iacono,Stefanie Wuhrer,Ivan Petrović,Achim J. Lilienthal +8 more
Book ChapterDOI
Cache-Oblivious Persistence
TL;DR: This work presents the first general transformation for making cache-oblivious model data structures partially persistent, which takes a data structure and allows queries to be executed on any past state of the structure.
Book ChapterDOI
Coverage with k-transmitters in the presence of obstacles
Brad Ballinger,Nadia M. Benbernou,Prosenjit Bose,Mirela Damian,Erik D. Demaine,Vida Dujmović,Robin Flatland,Ferran Hurtado,John Iacono,Anna Lubiw,Pat Morin,Vera Sacristán,Diane L. Souvaine,Ryuhei Uehara +13 more
TL;DR: Lower and upper bounds for the number of k-transmitters that are necessary and sufficient to cover a given collection of line segments, polygonal chains and polygons are developed.
Proceedings ArticleDOI
Dynamic Trees with Almost-Optimal Access Cost
TL;DR: In this article, an almost optimal weighted binary search tree was constructed for adaptive alphabetic codes in O(m) time, where m is the number of times an element was accessed and W is the length of the access sequence.
Posted Content
An Efficient Multiway Mergesort for GPU Architectures
TL;DR: GPU Multiway Mergesort is the first sorting algorithm for the GPU that is asymptotically optimal in terms of global memory accesses and that is completely free of shared memory bank conflicts, and outperforms the fastest comparison-based sorting implementations available to date.