Reconstructing visibility graphs with simple robots.
Theor. Comput. Sci., 2012
Optimal Sparse Matrix Dense Vector Multiplication in the I/O-Model.
Theory Comput. Syst., 2010
Optimal Transitions for Targeted Protein Quantification: Best Conditioned Submatrix Selection.
Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009
On locality and related problems: Communicating, computing, exploring.
PhD thesis, 2008
Simple Robots with Minimal Sensing: From Local Visibility to Global Geometry.
Int. J. Robotics Res., 2008
A Faster Distributed Approximation Scheme for the Connected Dominating Set Problem for Growth-Bounded Graphs.
Ad Hoc Sens. Wirel. Networks, 2008
Angle Optimization in Target Tracking.
Proceedings of the Algorithm Theory, 2008
Distributed Algorithmic Mechanism Design and Algebraic Communication Complexity.
Proceedings of the Algorithmic Game Theory, First International Symposium, 2008
Rendezvous of Mobile Agents When Tokens Fail Anytime.
Proceedings of the Principles of Distributed Systems, 12th International Conference, 2008
Simple Robots in Polygonal Environments: A Hierarchy.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2008
A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007
Counting Targets with Mobile Sensors in an Unknown Environment.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2007