Faster Counting in Anonymous Dynamic Networks.
(Joint work with A. Milani.)
In Proc. of the 19th International Conference On Principles Of
Distributed Systems (OPODIS 2015),
in Leibniz International Proceedings in Informatics (LIPIcs), 2015.
[
DOI,
bibtex,
pdf
]
Algorithmic Mechanisms for Reliable Crowdsourcing Computation under
Collusion
(Joint work with A. Fernández-Anta, C. Georgiou, and D. Pareja.)
In Public Library of Science One
(PLoS
ONE),
2015.
[DOI,
bibtex,
pdf]
Probabilistic Lower Bounds on the Length of a Longest Edge in Delaunay Graphs of Random Points in a d-Ball.
In Proceedings of the 28th European Workshop on Computational Geometry (EuroCG 2012).
[DOI,
bibtex,
pdf]
Probabilistic Bounds on the Length of a Longest Edge in Delaunay Graphs of Random Points in d-Dimensions.
(Joint work with E. M. Arkin, A. Fernández-Anta, and J. S. B. Mitchell)
In Proceedings of the 23rd Canadian Conference on Computational Geometry (CCCG 2011).
[DOI,
bibtex,
pdf]
Deterministic Recurrent Communication and Synchronization in Restricted Sensor Networks
(Joint work with A. Fernández-Anta and C. Thraves.)
In Discrete Mathematics and Theoretical Computer Science (DMTCS), 2011.
[DOI,
bibtex,
pdf]
The Length of the Longest Edge in Multidimensional Delaunay Graphs (Extended Abstract).
(Joint work with E. M. Arkin, A. Fernández-Anta, and J. S. B. Mitchell)
In Proceedings of the 20th Annual Fall Workshop on Computational Geometry (FWCG 2010).
[DOI,
bibtex,
pdf]
Insertion Sort is O(n log n).
(Joint work with M. A. Bender and M. Farach-Colton.)
In Proceedings of the 3rd International Conference on Fun with Algorithms (FUN 2004),
pages 16-23, 2004.
[pdf]