Articles dans des revues sans comité de lecture (47)
  1. 22. Casanova, H., Iacono, J., Karsin, B., Sitchinava, N., & Weichert, V. (2017). An Efficient Multiway Mergesort for GPU Architectures. arXiv.org.
  2. 23. Iacono, J., Khramtcova, E., & Langerman, S. (2017). Searching edges in the overlap of two plane graphs. arXiv.org.
  3. 24. Iacono, J., & Yagnatinsky, M. (2016). A Linear Potential Function for Pairing Heaps. arXiv.org.
  4. 25. Allen, S. S., Barba Flores, L., Iacono, J., & Langerman, S. (2016). Randomized incremental construction for the hausdorff voronoi diagram revisited and extended. arXiv.org.
  5. 26. Barba Flores, L., Cardinal, J., Iacono, J., Langerman, S., Ooms, A., & Solomon, N. (2016). Subquadratic Algorithms for Algebraic Generalizations of 3SUM. arXiv.org.
  6. 27. Iacono, J., & Özkan, Ö. (2014). A Tight Lower Bound for Decrease-Key in the Pure Heap Mode. arXiv.org.
  7. 28. Davoodi, P., Fineman, J. J., & Iacono, J. (2014). Cache-Oblivious Persistence. arXiv.org. doi:http://arxiv.org/abs/1402.5492
  8. 29. Howat, J., Iacono, J., & Morin, P. (2013). The Fresh-Finger Property. arXiv.org.
  9. 30. Bose, P., Douieb, K., Iacono, J., & Langerman, S. (2013). The Power and Limitations of Static Binary Search Trees with Lazy Finger. arXiv.org.
  10. 31. Demaine, E. D., Iacono, J., Langerman, S., & Özkan, Ö. (2013). Combining Binary Search Trees. arXiv.org.
  11. 32. Iacono, J. (2013). Why some heaps support constant-amortized-time decrease-key operations, and others do not. arXiv.org.
  12. 33. Aloupis, G., Iacono, J., Langerman, S., & Özkan, Ö. (2013). The Complexity of Order Type Isomorphism. arXiv.org.
    13. << Précédent 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 Suivant >>