( en | de | ru )

 

Disambiguation of "Rolim, José D. P."

Author of the publication

copydeleteadd this publication to your clipboard
Towards a holistic federation of secure crowd-enabled IoT facilities.

, , , , , , and . ICC, page 555-560. IEEE, (2015)

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.

Humberto Luis José D' Angelo

Humberto Luis José D' Angelo

Humberto Jorge José

Luís Guilherme Barbosa Rolim

Nadine José Gonzalez

 

Other publications of authors with the same name

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 Note on the Density of Oracle Decreasing Time-Space Complexity., and . Theor. Comput. Sci., 132 (2): 435-444 (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)An Analytical Model for Energy Minimization., and . WEA, volume 3059 of Lecture Notes in Computer Science, page 559-569. Springer, (2004)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)Optimal Bounds on the Approximation of Boolean Functions with Consequences on the Concept of Hardware., , and . STACS, volume 1046 of Lecture Notes in Computer Science, page 319-330. Springer, (1996)Efficient Construction of Hitting Sets for Systems of Linear Functions., , and . STACS, volume 1200 of Lecture Notes in Computer Science, page 387-398. Springer, (1997)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)