PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Berthomé, Pascal"

Author of the publication

copydeleteadd this publication to your clipboard
Self-Simulation for the Passive Optical Star.

, , , and . J. Algorithms, 34 (1): 128-147 (2000)

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.

Pascal Goldschmid University of Stuttgart

Reinforcement learning based autonomous multi-rotor landing on moving platforms, and . Autonomous Robots, 48 (4): 13 (Jun 6, 2024)

Pascal Gröger University of Stuttgart

Pascal Heinzelmann University of Stuttgart

Pascal Strobel University of Stuttgart

Pascal Mossier University of Stuttgart

 

Other publications of authors with the same name

Periodic Gossiping in Commuted Networks., and . Theory Comput. Syst., 37 (5): 559-584 (2004)Time-optimal Geometric Algorithms in Hypercubic Networks., and . Parallel Algorithms Appl., 4 (3-4): 169-181 (1994)Repackaging Android Applications for Auditing Access to Private Data., , , and . ARES, page 388-396. IEEE Computer Society, (2012)Implementation of exponential and parametrized algorithms in the AGAPE project, , and . CoRR, (2012)Formally verified software countermeasures for control-flow integrity of smart card C code., , and . Computers & Security, (2019)Sensitivity analysis on the all pairs q-route flows in a network., , and . ITOR, 17 (1): 103-117 (2010)Impact of a varying capacity on the all pairs 2-route network flows., , and . Electron. Notes Discret. Math., (2009)Attack model for verification of interval security properties for smart card C codes., , , and . PLAS, page 2. ACM, (2010)On broadcasting schemes in restricted optical passive star systems., and . Interconnection Networks and Mapping and Scheduling Parallel Computations, volume 21 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 19-29. DIMACS/AMS, (1994)The Eulerian Stretch Of A Network Topology And The Ending Guarantee Of A Convergence Routing., , and . Journal of Interconnection Networks, 5 (2): 93-109 (2004)