Pascal Berthomé - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 38 from 38

2021

Secure key distribution in heterogeneous interoperable industrial Internet of ThingsFergal Martin-Tricot, Cédric Eichler, Pascal Berthomé. wimob 2021: 74-79 [doi]

2020

Parametric analysis on cut-trees and its application on a protein clustering problemJoão Paulo de Freitas Araujo, Madiagne Diallo, Fernanda M. P. Raupp, Pascal Berthomé, José Eugênio Leal. cejor, 28(1):229-249, 2020. [doi]

An Enrolment Gateway for Data Security in Heterogeneous Industrial Internet of ThingsFergal Martin-Tricot, Cédric Eichler, Pascal Berthomé. wetice 2020: 199-202 [doi]

2019

Formally verified software countermeasures for control-flow integrity of smart card C codeKarine Heydemann, Jean-François Lalande, Pascal Berthomé. compsec, 85:202-224, 2019. [doi]

Teaching Android Mobile SecurityJean-François Lalande, Valérie Viet Triem Tong, Pierre Graux, Guillaume Hiet, Wojciech Mazurczyk, Habiba Chaoui, Pascal Berthomé. sigcse 2019: 232-238 [doi]

2018

A Cloud Brokerage Solution: Formal Methods Meet Security in Cloud FederationsSalwa Souaf, Pascal Berthomé, Frédéric Loulergue. ieeehpcs 2018: 691-699 [doi]

2015

A Practical Set-Membership Proof for Privacy-Preserving NFC Mobile TicketingGhada Arfaoui, Jean-François Lalande, Jacques Traoré, Nicolas Desmoulins, Pascal Berthomé, Saïd Gharout. popets, 2015(2):25-45, 2015. [doi]

Cloud Resources Placement based on Functional and Non-functional RequirementsAsma Guesmi, Patrice Clemente, Frédéric Loulergue, Pascal Berthomé. secrypt 2015: 335-342 [doi]

2014

A Pseudo-Random Bit Generator Based on Three Chaotic Logistic Maps and IEEE 754-2008 Floating-Point ArithmeticMichael François, David Defour, Pascal Berthomé. tamc 2014: 229-247 [doi]

Software Countermeasures for Control Flow Integrity of Smart Card C CodesJean-François Lalande, Karine Heydemann, Pascal Berthomé. esorics 2014: 200-218 [doi]

2012

Repackaging Android Applications for Auditing Access to Private DataPascal Berthomé, Thomas Fécherolle, Nicolas Guilloteau, Jean-François Lalande. IEEEares 2012: 388-396 [doi]

High Level Model of Control Flow Attacks for Smart Card Functional SecurityPascal Berthomé, Karine Heydemann, X. Kauffmann-Tourkestansky, Jean-François Lalande. IEEEares 2012: 224-229 [doi]

2010

Attack model for verification of interval security properties for smart card C codesPascal Berthomé, Karine Heydemann, X. Kauffmann-Tourkestansky, Jean-François Lalande. PLDI 2010: 2 [doi]

q-route flows in a networkMadiagne Diallo, Serigne Gueye, Pascal Berthomé. itor, 17(1):103-117, 2010. [doi]

2009

2006

Revisiting parametric multi-terminal problems: Maximum flows, minimum cuts and cut-tree computationsDominique Barth, Pascal Berthomé, Madiagne Diallo, Afonso Ferreira. disopt, 3(3):195-205, 2006. [doi]

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

2005

Detecting flows congesting a target network linkDominique Barth, Pascal Berthomé, Madiagne Diallo. endm, 19:233-239, 2005. [doi]

The Complexity of the Maximal Requests Satisfaction Problem in Multipoint CommunicationDominique Barth, Pascal Berthomé, Paraskevi Fragopoulou. ppl, 15(1-2):209-222, 2005. [doi]

Computation of Chromatic Polynomials Using Triangulations and Clique TreesPascal Berthomé, Sylvain Lebresne, Kim Nguyen. criwg 2005: 362-373 [doi]

2004

Periodic Gossiping in Commuted NetworksDominique Barth, Pascal Berthomé. mst, 37(5):559-584, 2004. [doi]

The Eulerian Stretch Of A Network Topology And The Ending Guarantee Of A Convergence RoutingDominique Barth, Pascal Berthomé, Johanne Cohen. join, 5(2):93-109, 2004. [doi]

2003

Generalized Parametric Multi-terminal Flows ProblemPascal Berthomé, Madiagne Diallo, Afonso Ferreira. criwg 2003: 71-80 [doi]

2002

A Mixed Deflection and Convergence Routing Algorithm: Design and PerformanceDominique Barth, Pascal Berthomé, T. Czarchoski, Jean-Michel Fourneau, Christian Laforest, Sandrine Vial. europar 2002: 767-774 [doi]

2000

Sorting-Based Selection Algorithms for Hypercubic NetworksPascal Berthomé, Afonso Ferreira, Bruce M. Maggs, Stephane Perennes, C. Greg Plaxton. algorithmica, 26(2):237-254, 2000. [doi]

Self-Simulation for the Passive Optical StarPascal Berthomé, Torben Hagerup, Ilan Newman, Assaf Schuster. jal, 34(1):128-147, 2000.

1997

Embedding Tori in Partitioned Optical Passive Star NetworksPascal Berthomé, Johanne Cohen, Afonso Ferreira. sirocco 1997: 40-52

Communication Issues in Parallel Systems with Optical InterconnectionsPascal Berthomé, Afonso Ferreira. ijfcs, 8(2):143, 1997.

1996

Optimal Information Dissemination in Star and Pancake NetworksPascal Berthomé, Afonso Ferreira, Stephane Perennes. tpds, 7(12):1292-1300, 1996. [doi]

1995

Self-Simulation for the Passive Optical Star ModelPascal Berthomé, Th. Duboux, Torben Hagerup, Ilan Newman, Assaf Schuster. esa 1995: 369-380

1994

On broadcasting schemes in restricted optical passive star systemsPascal Berthomé, Afonso Ferreira. dimacs 1995: 19-30

Time-optimal Geometric Algorithms in Hypercubic NetworksPascal Berthomé, Afonso Ferreira. paapp, 4(3-4):169-181, 1994. [doi]

1993

Sorting-Based Selection Algorithms for Hypercube NetworksPascal Berthomé, Afonso Ferreira, Bruce M. Maggs, Stephane Perennes, C. Greg Plaxton. ipps 1993: 89-95

Optimal Information Dissemination in Star and Pancake NetworksAfonso Ferreira, Pascal Berthomé, Stephane Perennes. spdp 1993: 720-725

1992

K-Selection in HypercubesPascal Berthomé. icci 1992: 164-167

Efficient K-Selection in Hypercube MultiprocessorsPascal Berthomé. ppl, 2:221-230, 1992.

Sign in or sign up to see more results.

runs on WebDSL