Author of the publication

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

E-Complete Sets Do Not Have Optimal Polynomial Time Approximations., and . MFCS, volume 841 of Lecture Notes in Computer Science, page 38-51. Springer, (1994)Path quality detection algorithms for near optimal geographic routing in sensor networks with obstacles., , , and . Wirel. Commun. Mob. Comput., 10 (5): 647-661 (2010)VIVO: A secure, privacy-preserving, and real-time crowd-sensing framework for the Internet of Things., , , , , , , , , and 4 other author(s). Pervasive Mob. Comput., (2018)A Note on the Density of Oracle Decreasing Time-Space Complexity., and . Theor. Comput. Sci., 132 (2): 435-444 (1994)On the Parallel Computation of Boolean Functions on Unrelated inputs., , and . ISTCS, page 155-161. IEEE Computer Society, (1996)Energy Balance Mechanisms and Lifetime Optimization of Wireless Networks.. IC3, volume 168 of Communications in Computer and Information Science, page 1. Springer, (2011)A Framework for Probabilistic Numerical Evaluation of Sensor Networks: A Case Study of a Localization Protocol., , , and . WEA, volume 3503 of Lecture Notes in Computer Science, page 341-353. Springer, (2005)A case study of de-randomization methods for combinatorial approximation algorithms., and . Network Design: Connectivity and Facilities Location, volume 40 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 319-334. DIMACS/AMS, (1997)An Analytical Model for Energy Minimization., and . WEA, volume 3059 of Lecture Notes in Computer Science, page 559-569. Springer, (2004)Hitting Sets Derandomize BPP., , and . ICALP, volume 1099 of Lecture Notes in Computer Science, page 357-368. Springer, (1996)