K-Selection in Hypercubes. - Pascal Berthomé (ICCI, 1992)

Efficient K-Selection in Hypercube Multiprocessors. - Pascal Berthomé (Parallel Process. Lett., 1992)

Sorting-Based Selection Algorithms for Hypercube Networks. - Pascal Berthomé; Afonso Ferreira; Bruce M. Maggs; Stephane Perennes; C. Greg Plaxton (IPPS, 1993)

On broadcasting schemes in restricted optical passive star systems. - Pascal Berthomé; Afonso Ferreira (Interconnection Networks and Mapping and Scheduling Parallel Computations, 1994)

Time-optimal Geometric Algorithms in Hypercubic Networks. - Pascal Berthomé; Afonso Ferreira (Parallel Algorithms Appl., 1994)

Self-Simulation for the Passive Optical Star Model. - Pascal Berthomé; Th. Duboux; Torben Hagerup; Ilan Newman; Assaf Schuster (ESA, 1995)

Optimal Information Dissemination in Star and Pancake Networks. - Pascal Berthomé; Afonso Ferreira; Stephane Perennes (IEEE Trans. Parallel Distributed Syst., 1996)

Embedding Tori in Partitioned Optical Passive Star Networks. - Pascal Berthomé; Johanne Cohen; Afonso Ferreira (SIROCCO, 1997)

Communication Issues in Parallel Systems with Optical Interconnections. - Pascal Berthomé; Afonso Ferreira (Int. J. Found. Comput. Sci., 1997)

Sorting-Based Selection Algorithms for Hypercubic Networks. - Pascal Berthomé; Afonso Ferreira; Bruce M. Maggs; Stephane Perennes; C. Greg Plaxton (Algorithmica, 2000)

Self-Simulation for the Passive Optical Star. - Pascal Berthomé; Torben Hagerup; Ilan Newman; Assaf Schuster (J. Algorithms, 2000)

A Mixed Deflection and Convergence Routing Algorithm: Design and Performance. - Dominique Barth; Pascal Berthomé; T. Czarchoski; Jean-Michel Fourneau; Christian Laforest; Sandrine Vial (Euro-Par, 2002)

Generalized Parametric Multi-terminal Flows Problem. - Pascal Berthomé; Madiagne Diallo; Afonso Ferreira (WG, 2003)

The Eulerian Stretch Of A Network Topology And The Ending Guarantee Of A Convergence Routing. - Dominique Barth; Pascal Berthomé; Johanne Cohen (J. Interconnect. Networks, 2004)

Periodic Gossiping in Commuted Networks. - Dominique Barth; Pascal Berthomé (Theory Comput. Syst., 2004)

Computation of Chromatic Polynomials Using Triangulations and Clique Trees. - Pascal Berthomé; Sylvain Lebresne; Kim Nguyen 001 (WG, 2005)

Detecting flows congesting a target network link. - Dominique Barth; Pascal Berthomé; Madiagne Diallo (Electron. Notes Discret. Math., 2005)

The Complexity of the Maximal Requests Satisfaction Problem in Multipoint Communication. - Dominique Barth; Pascal Berthomé; Paraskevi Fragopoulou (Parallel Process. Lett., 2005)

Contribution à l'algorithmique des graphes: quelques représentations pertinentes de graphes. (Contribution to graph algorithm: some useful graphs' representations). - Pascal Berthomé (2006)

Revisiting parametric multi-terminal problems: Maximum flows, minimum cuts and cut-tree computations. - Dominique Barth; Pascal Berthomé; Madiagne Diallo; Afonso Ferreira (Discret. Optim., 2006)

An Elementary Chromatic Reduction for Gain Graphs and Special Hyperplane Arrangements. - Pascal Berthomé; Raul Cordovil; David Forge; Véronique Ventos; Thomas Zaslavsky (Electron. J. Comb., 2009)

Impact of a varying capacity on the all pairs 2-route network flows. - Madiagne Diallo; Serigne Gueye; Pascal Berthomé (Electron. Notes Discret. Math., 2009)

Mixing Convergence and Deflection Strategies for Packet Routing in All-Optical Networks. - Dominique Barth; Pascal Berthomé; Dominique Chiaroni; Jean-Michel Fourneau; Christian Laforest; Sandrine Vial (JOCN, 2009)

Attack model for verification of interval security properties for smart card C codes. - Pascal Berthomé; Karine Heydemann; Xavier Kauffmann-Tourkestansky; Jean-François Lalande (PLAS, 2010)

Sensitivity analysis on the all pairs q-route flows in a network. - Madiagne Diallo; Serigne Gueye; Pascal Berthomé (Int. Trans. Oper. Res., 2010)

Repackaging Android Applications for Auditing Access to Private Data. - Pascal Berthomé; Thomas Fécherolle; Nicolas Guilloteau; Jean-François Lalande (ARES, 2012)

High Level Model of Control Flow Attacks for Smart Card Functional Security. - Pascal Berthomé; Karine Heydemann; Xavier Kauffmann-Tourkestansky; Jean-François Lalande (ARES, 2012)

Implementation of exponential and parametrized algorithms in the AGAPE project - Pascal Berthomé; Jean-François Lalande; Vincent Levorato (CoRR, 2012)

Software Countermeasures for Control Flow Integrity of Smart Card C Codes. - Jean-François Lalande; Karine Heydemann; Pascal Berthomé (ESORICS (2), 2014)

A Pseudo-Random Bit Generator Based on Three Chaotic Logistic Maps and IEEE 754-2008 Floating-Point Arithmetic. - Michael François; David Defour; Pascal Berthomé (TAMC, 2014)

Cloud Resources Placement based on Functional and Non-functional Requirements. - Asma Guesmi; Patrice Clemente; Frédéric Loulergue; Pascal Berthomé (SECRYPT, 2015)

A Practical Set-Membership Proof for Privacy-Preserving NFC Mobile Ticketing. - Ghada Arfaoui; Jean-François Lalande; Jacques Traoré; Nicolas Desmoulins; Pascal Berthomé; Saïd Gharout (Proc. Priv. Enhancing Technol., 2015)

A Cloud Brokerage Solution: Formal Methods Meet Security in Cloud Federations. - Salwa Souaf; Pascal Berthomé; Frédéric Loulergue (HPCS, 2018)

Teaching Android Mobile Security. - Jean-François Lalande; Valérie Viet Triem Tong; Pierre Graux; Guillaume Hiet; Wojciech Mazurczyk; Habiba Chaoui; Pascal Berthomé (SIGCSE, 2019)

Formally verified software countermeasures for control-flow integrity of smart card C code. - Karine Heydemann; Jean-François Lalande; Pascal Berthomé (Comput. Secur., 2019)

An Enrolment Gateway for Data Security in Heterogeneous Industrial Internet of Things. - Fergal Martin-Tricot; Cédric Eichler; Pascal Berthomé (WETICE, 2020)

Parametric analysis on cut-trees and its application on a protein clustering problem. - João Paulo de Freitas Araujo; Madiagne Diallo; Fernanda M. P. Raupp; Pascal Berthomé; José Eugênio Leal (Central Eur. J. Oper. Res., 2020)

Secure key distribution in heterogeneous interoperable industrial Internet of Things. - Fergal Martin-Tricot; Cédric Eichler; Pascal Berthomé (WiMob, 2021)

Continuous learning: a feasible solution for continuous authentication using PPG? - Benjamin Vignau; Patrice Clémente; Pascal Berthomé; Joseph Kawalec (IJCB, 2024)

Systematic literature review: References extraction helper and automatic analysis. - Benjamin Vignau; Patrice Clemente; Pascal Berthomé (Softw. Impacts, 2024)