Author of the publication

Local Event Boundary Detection with Unreliable Sensors: Analysis of the Majority Vote Scheme.

, , and . CoRR, (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Covering Points with Convex Sets of Minimum Size., , , and . WALCOM, volume 9627 of Lecture Notes in Computer Science, page 166-178. Springer, (2016)Local Event Boundary Detection with Unreliable Sensors: Analysis of the Majority Vote Scheme., , and . AAIM, volume 8546 of Lecture Notes in Computer Science, page 1-12. Springer, (2014)Tight bounds for beacon-based coverage in simple rectilinear polygons., , and . Comput. Geom., (2019)Guest Editor's Foreword., and . Algorithmica, 76 (4): 1158-1159 (2016)Efficient Algorithms for Two-Center Problems for a Convex Polygon., and . COCOON, volume 1858 of Lecture Notes in Computer Science, page 299-309. Springer, (2000)Optimal Embedding of Multiple Directed Hamiltonian Rings into d-dimensional Meshes., , and . J. Parallel Distributed Comput., 60 (6): 775-783 (2000)Minimum Convex Container of Two Convex Polytopes under Translations., , , , and . CCCG, Carleton University, Ottawa, Canada, (2014)Directed Hamiltonian Packing in d-Dimensional Meshes and Its Application (Extended Abstract)., , and . ISAAC, volume 1178 of Lecture Notes in Computer Science, page 295-304. Springer, (1996)Area Bounds of Rectilinear Polygons Realized by Angle Sequences., , and . ISAAC, volume 7676 of Lecture Notes in Computer Science, page 629-638. Springer, (2012)Computing Farthest Neighbors on a Convex Polytope., , and . COCOON, volume 2108 of Lecture Notes in Computer Science, page 159-169. Springer, (2001)