Articles dans des revues sans comité de lecture (18)
  1. 1. Bose, P., Cano Vila, M. D. P., Fagerberg, R., Iacono, J., Jacob, R., & Langerman, S. (2021). Fragile Complexity of Adaptive Algorithms. arXiv.org.
  2. 2. Arseneva, E., Iacono, J., Koumoutsos, G., Langerman, S., & Zolotov, B. (2020). Sublinear Explicit Incremental Planar Voro Sublinear Explicit Incremental Planar Voronoi Diagrams noi Diagrams. arXiv.org.
  3. 3. Demaine, E. D., Iacono, J., Koumoutsos, G., & Langerman, S. (2019). Belga B-trees. arXiv.org.
  4. 4. Bose, P., Cardinael, J.-P., Iacono, J., Koumoutsos, G., & Langerman, S. (2019). Competitive Online Search Trees on Trees. arXiv.org.
  5. 5. Cabello, S., Cardinal, J., Iacono, J., Langerman, S., Morin, P., & Ooms, A. (2019). Encoding 3SUM. arXiv.org.
  6. 6. Iacono, J., & Langerman, S. (2018). Weighted dynamic finger in binary search trees. arXiv.org.
  7. 7. Cardinal, J., Chan, T. M., Iacono, J., Langerman, S., & Ooms, A. (2018). Subquadratic Encodings for Point Configurations. arXiv.org.
  8. 8. Golin, M., Iacono, J., Langerman, S., Munro, J. I., & Nekrich, Y. (2018). Dynamic Trees with Almost-Optimal Access Cost. arXiv.org.
  9. 9. Iacono, J., Khramtcova, E., & Langerman, S. (2017). Searching edges in the overlap of two plane graphs. arXiv.org.
  10. 10. Allen, S. S., Barba Flores, L., Iacono, J., & Langerman, S. (2016). Randomized incremental construction for the hausdorff voronoi diagram revisited and extended. arXiv.org.
  11. 11. Barba Flores, L., Cardinal, J., Iacono, J., Langerman, S., Ooms, A., & Solomon, N. (2016). Subquadratic Algorithms for Algebraic Generalizations of 3SUM. arXiv.org.
  12. 12. Bose, P., Douieb, K., Iacono, J., & Langerman, S. (2013). The Power and Limitations of Static Binary Search Trees with Lazy Finger. arXiv.org.
    13. << Précédent 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 Suivant >>