From post

Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings

, , , и (Ред.) том 2764 из Lecture Notes in Computer Science, Springer, (2003)

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.

 

Другие публикации лиц с тем же именем

On the Parallel Computation of Boolean Functions on Unrelated inputs., , и . ISTCS, стр. 155-161. IEEE Computer Society, (1996)Low radiation paths in wireless networks pass along Voronoi diagram., , и . SoftCOM, стр. 1-5. IEEE, (2013)Energy Balance Mechanisms and Lifetime Optimization of Wireless Networks.. IC3, том 168 из Communications in Computer and Information Science, стр. 1. Springer, (2011)A Framework for Probabilistic Numerical Evaluation of Sensor Networks: A Case Study of a Localization Protocol., , , и . WEA, том 3503 из Lecture Notes in Computer Science, стр. 341-353. Springer, (2005)Hitting Sets Derandomize BPP., , и . ICALP, том 1099 из Lecture Notes in Computer Science, стр. 357-368. Springer, (1996)Optimal Bounds on the Approximation of Boolean Functions with Consequences on the Concept of Hardware., , и . STACS, том 1046 из Lecture Notes in Computer Science, стр. 319-330. Springer, (1996)Efficient Construction of Hitting Sets for Systems of Linear Functions., , и . STACS, том 1200 из Lecture Notes in Computer Science, стр. 387-398. Springer, (1997)E-Complete Sets Do Not Have Optimal Polynomial Time Approximations., и . MFCS, том 841 из Lecture Notes in Computer Science, стр. 38-51. Springer, (1994)VIVO: A secure, privacy-preserving, and real-time crowd-sensing framework for the Internet of Things., , , , , , , , , и 4 other автор(ы). Pervasive Mob. Comput., (2018)A Note on the Density of Oracle Decreasing Time-Space Complexity., и . Theor. Comput. Sci., 132 (2): 435-444 (1994)