Author of the publication

On Pollution Attacks in Fully Connected P2P Networks Using Trusted Peers.

, , , and . ISDA, volume 557 of Advances in Intelligent Systems and Computing, page 144-153. Springer, (2016)

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

Interval Branch and Bound Algorithm for Finding the First-Zero-Crossing-Point in One-Dimensional Functions., , and . Reliab. Comput., 6 (2): 179-191 (2000)On an Efficient Use of Gradient Information for Accelerating Interval Global Optimization Algorithms., , , , and . Numer. Algorithms, 37 (1-4): 61-69 (2004)On Bisecting the Unit Simplex Using Various Distance Norms., , and . Informatica, 27 (2): 351-366 (2016)Rendering (COMPLEX) algebraic surfaces., , and . VISAPP (1), page 139-146. INSTICC - Institute for Systems and Technologies of Information, Control and Communication, (2006)Key Management Schemes for Peer-to-Peer Multimedia Streaming Overlay Networks., , and . WISTP, volume 5746 of Lecture Notes in Computer Science, page 128-142. Springer, (2009)Lightweight User Access Control in Energy-Constrained Wireless Network Services., , , , and . UCAmI, volume 7656 of Lecture Notes in Computer Science, page 33-41. Springer, (2012)Adaptive Parallel Interval Global Optimization Algorithms Based on their Performance for Non-dedicated Multicore Architectures., , and . PDP, page 252-256. IEEE Computer Society, (2011)Interval Parallel Global Optimization with Charm++., , , and . PARA, volume 3732 of Lecture Notes in Computer Science, page 161-168. Springer, (2004)Heuristics to Reduce the Number of Simplices in Longest Edge Bisection Refinement of a Regular n-Simplex., , , , and . ICCSA (2), volume 8580 of Lecture Notes in Computer Science, page 115-125. Springer, (2014)On Pollution Attacks in Fully Connected P2P Networks Using Trusted Peers., , , and . ISDA, volume 557 of Advances in Intelligent Systems and Computing, page 144-153. Springer, (2016)