1. Computation in networks of passively mobile finite-state sensors;Angluin;Distrib. Comput.,2006
2. Derandomized graph products;Alon;Comput. Complexity,1995
3. An O(logn/loglogn)-approximation algorithm for the asymmetric traveling salesman problem;Asadpour,2010
4. How to explore a fast-changing world (cover time of a simple random walk on evolving graphs);Avin,2008
5. A contractor based on convex interval Taylor;Araya,2012