PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Campos, Javier"

Author of the publication

copydeleteadd this publication to your clipboard
HOP: Achieving Efficient Anonymity in MANETs by Combining HIP, OLSR, and Pseudonyms.

, , , , and . EURASIP J. Wireless Comm. and Networking, (2011)

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.

Javier Aguilar Romero University of Stuttgart

Andres Javier Zeller University of Stuttgart

Javier Andres Carrillo Delcorto University of Stuttgart

 

Other publications of authors with the same name

On Optimal Scheduling in DEDS., , and . ICRA (3), page 821-826. IEEE Computer Society Press, (1993)A pattern-based approach to model software performance., , and . Workshop on Software and Performance, page 137-142. ACM, (2000)Analysing Internet Software Retrieval Systems: Modeling and Performance Comparison., , and . Wireless Networks, 9 (3): 223-238 (2003)Software Performance Modeling Using UML and Petri Nets., and . MASCOTS Tutorials, volume 2965 of Lecture Notes in Computer Science, page 265-289. Springer, (2003)A Min-Max Problem for the Computation of the Cycle Time Lower Bound in Interval-Based Time Petri Nets., and . IEEE Trans. Systems, Man, and Cybernetics: Systems, 43 (5): 1167-1181 (2013)HOP: Achieving Efficient Anonymity in MANETs by Combining HIP, OLSR, and Pseudonyms., , , , and . EURASIP J. Wireless Comm. and Networking, (2011)Structured solution of stochastic DSSP systems., , and . PNPM, page 91-100. IEEE, (1997)Approximate Throughput Computation of Stochastic Weighted T-Systems., , and . IEEE Trans. Systems, Man, and Cybernetics, Part A, 37 (3): 431-444 (2007)A general iterative technique for approximate throughput computation of stochastic marked graphs., , , and . PNPM, page 138-147. IEEE, (1993)Tight Polynomial Bounds for Steady-State Performance of Marked Graphs., , , and . PNPM, page 200-209. IEEE Computer Society, (1989)