Articles dans des revues sans comité de lecture (47)
10.
Cardinal, J., & Iacono, J. (2020). Modular Subset Sum, Dynamic Strings, and Zero-Sum Sets. arXiv.org.
11.
Demaine, E. D., Iacono, J., Koumoutsos, G., & Langerman, S. (2019). Belga B-trees. arXiv.org.
12.
Bose, P., Cardinael, J.-P., Iacono, J., Koumoutsos, G., & Langerman, S. (2019). Competitive Online Search Trees on Trees. arXiv.org.
13.
Iacono, J., Karsin, B., & Sitchinava, N. (2019). A parallel priority queue with fast updates for GPU architectures. arXiv.org.
14.
Iacono, J., Karsin, B., & Koumoutsos, G. (2019). External Memory Planar Point Location with Fast Updates. arXiv.org.
15.
Iacono, J., Varunkumar Jayapaul, V., & Karsin, B. (2019). Locality. arXiv.org.
16.
Iacono, J., Jacob, R., & Tsakalidis, K. (2019). External memory priority queues with decrease-key and applications to graph algorithms. arXiv.org.
17.
Cabello, S., Cardinal, J., Iacono, J., Langerman, S., Morin, P., & Ooms, A. (2019). Encoding 3SUM. arXiv.org.
18.
Iacono, J., & Langerman, S. (2018). Weighted dynamic finger in binary search trees. arXiv.org.
19.
Cardinal, J., Chan, T. M., Iacono, J., Langerman, S., & Ooms, A. (2018). Subquadratic Encodings for Point Configurations. arXiv.org.
20.
Golin, M., Iacono, J., Langerman, S., Munro, J. I., & Nekrich, Y. (2018). Dynamic Trees with Almost-Optimal Access Cost. arXiv.org.
21.
Damian, M., Iacono, J., & Winslow, A. (2018). Spanning Properties of Theta-Theta-6. arXiv.org.