Articles dans des revues avec comité de lecture (99)
  1. 25. Barba Flores, L., Cardinal, J., Iacono, J., Langerman, S., Ooms, A., & Solomon, N. (2017). Subquadratic algorithms for algebraic generalizations of 3SUM. Leibniz international proceedings in informatics, 77, 131-1315. doi:10.4230/LIPIcs.SoCG.2017.13
  2. 26. Grossi, R., Iacono, J., Navarro, G., Raman, R., & Satti, S. R. (2017). Asymptotically Optimal Encodings of Range Data Structures for Selection and Top- k Queries. ACM transactions on algorithms, 13(2), 1-31. doi:10.1145/3012939
  3. 27. Iacono, J., Khramtcova, E., & Langerman, S. (2017). Searching edges in the overlap of two plane graphs. Lecture notes in computer science, 10389 LNCS, 473-484. doi:10.1007/978-3-319-62127-2_40
  4. 28. Aronov, B. B., Bose, P., Demaine, E. D., Gudmundsson, J., Iacono, J., Langerman, S., & Smid, M. M. (2017). Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams. Algorithmica, 80(11), 3316–-3334. doi:10.1007/s00453-017-0389-y
  5. 29. Bose, P., Douieb, K., Iacono, J., & Langerman, S. (2016). The Power and Limitations of Static Binary Search Trees with Lazy Finger. Algorithmica, 76(4), 1264-1275. doi:10.1007/s00453-016-0224-x
  6. 30. Allen, S. S., Barba Flores, L., Iacono, J., & Langerman, S. (2016). Incremental Voronoi diagrams. Leibniz international proceedings in informatics, 51, 15.1-15.16. doi:10.4230/LIPIcs.SoCG.2016.15
  7. 31. Golin, M., Iacono, J., Krizanc, D. D., Raman, R., Satti, S. R., & Shende, S. (2016). Encoding 2D range maximum queries. Theoretical computer science, 609, 316-327. doi:10.1016/j.tcs.2015.10.012
  8. 32. Iacono, J., & Yagnatinsky, M. (2016). A linear potential function for pairing heaps. Lecture notes in computer science, 10043 LNCS, 489-504. doi:10.1007/978-3-319-48749-6_36
  9. 33. Iacono, J., & Langerman, S. (2016). Weighted dynamic finger in binary search trees. Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms, 672-691. doi:10.1137/1.9781611974331.ch49
  10. 34. Demaine, E. D., Iacono, J., & Langerman, S. (2015). Worst-Case Optimal Tree Layout in External Memory. Algorithmica, 72(2), 369-378. doi:10.1007/s00453-013-9856-2
  11. 35. Davoodi, P., Iacono, J., Landau, G. G., & Lewenstein, M. (2015). Range minimum query indexes in higher dimensions. Lecture notes in computer science, 9133, 149-159. doi:10.1007/978-3-319-19929-0_13
  12. 36. Dehne, F., & Iacono, J. (2014). Foreword. Computational geometry, 47(2), 199. doi:10.1016/j.comgeo.2013.05.006
    13. << Précédent 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 Suivant >>