default search action
Pascal Berthomé
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j19]Benjamin Vignau
, Patrice Clemente, Pascal Berthomé:
Systematic literature review: References extraction helper and automatic analysis. Softw. Impacts 21: 100669 (2024) - [c20]Benjamin Vignau, Patrice Clémente, Pascal Berthomé, Joseph Kawalec:
Continuous learning: a feasible solution for continuous authentication using PPG? IJCB 2024: 1-9 - 2021
- [c19]Fergal Martin-Tricot, Cédric Eichler, Pascal Berthomé:
Secure key distribution in heterogeneous interoperable industrial Internet of Things. WiMob 2021: 74-79 - 2020
- [j18]João Paulo de Freitas Araujo, Madiagne Diallo, Fernanda M. P. Raupp, Pascal Berthomé, José Eugênio Leal:
Parametric analysis on cut-trees and its application on a protein clustering problem. Central Eur. J. Oper. Res. 28(1): 229-249 (2020) - [c18]Fergal Martin-Tricot, Cédric Eichler, Pascal Berthomé:
An Enrolment Gateway for Data Security in Heterogeneous Industrial Internet of Things. WETICE 2020: 199-202
2010 – 2019
- 2019
- [j17]Karine Heydemann, Jean-François Lalande
Formally verified software countermeasures for control-flow integrity of smart card C code. Comput. Secur. 85: 202-224 (2019) - [c17]Jean-François Lalande, Valérie Viet Triem Tong, Pierre Graux
Teaching Android Mobile Security. SIGCSE 2019: 232-238 - 2018
- [c16]Salwa Souaf, Pascal Berthomé, Frédéric Loulergue
A Cloud Brokerage Solution: Formal Methods Meet Security in Cloud Federations. HPCS 2018: 691-699 - 2015
- [j16]Ghada Arfaoui
A Practical Set-Membership Proof for Privacy-Preserving NFC Mobile Ticketing. Proc. Priv. Enhancing Technol. 2015(2): 25-45 (2015) - [c15]Asma Guesmi, Patrice Clemente, Frédéric Loulergue, Pascal Berthomé:
Cloud Resources Placement based on Functional and Non-functional Requirements. SECRYPT 2015: 335-342 - [i2]Ghada Arfaoui, Jean-François Lalande, Jacques Traoré, Nicolas Desmoulins, Pascal Berthomé, Saïd Gharout:
A Practical Set-Membership Proof for Privacy-Preserving NFC Mobile Ticketing. CoRR abs/1505.03048 (2015) - 2014
- [c14]Jean-François Lalande
Software Countermeasures for Control Flow Integrity of Smart Card C Codes. ESORICS (2) 2014: 200-218 - [c13]Michael François, David Defour, Pascal Berthomé:
A Pseudo-Random Bit Generator Based on Three Chaotic Logistic Maps and IEEE 754-2008 Floating-Point Arithmetic. TAMC 2014: 229-247 - 2012
- [c12]Pascal Berthomé, Karine Heydemann, Xavier Kauffmann-Tourkestansky, Jean-François Lalande
High Level Model of Control Flow Attacks for Smart Card Functional Security. ARES 2012: 224-229 - [c11]Pascal Berthomé, Thomas Fécherolle, Nicolas Guilloteau, Jean-François Lalande
Repackaging Android Applications for Auditing Access to Private Data. ARES 2012: 388-396 - [i1]Pascal Berthomé, Jean-François Lalande, Vincent Levorato:
Implementation of exponential and parametrized algorithms in the AGAPE project. CoRR abs/1201.5985 (2012) - 2010
- [j15]Madiagne Diallo, Serigne Gueye, Pascal Berthomé:
Sensitivity analysis on the all pairs q-route flows in a network. Int. Trans. Oper. Res. 17(1): 103-117 (2010) - [c10]Pascal Berthomé, Karine Heydemann, Xavier Kauffmann-Tourkestansky, Jean-François Lalande
Attack model for verification of interval security properties for smart card C codes. PLAS 2010: 2
2000 – 2009
- 2009
- [j14]Pascal Berthomé, Raul Cordovil, David Forge, Véronique Ventos, Thomas Zaslavsky:
An Elementary Chromatic Reduction for Gain Graphs and Special Hyperplane Arrangements. Electron. J. Comb. 16(1) (2009) - [j13]Madiagne Diallo, Serigne Gueye, Pascal Berthomé:
Impact of a varying capacity on the all pairs 2-route network flows. Electron. Notes Discret. Math. 35: 59-64 (2009) - [j12]Dominique Barth, Pascal Berthomé, Dominique Chiaroni, Jean-Michel Fourneau, Christian Laforest, Sandrine Vial:
Mixing Convergence and Deflection Strategies for Packet Routing in All-Optical Networks. JOCN 1(3): 222-234 (2009) - 2006
- [b1]Pascal Berthomé:
Contribution à l'algorithmique des graphes: quelques représentations pertinentes de graphes. (Contribution to graph algorithm: some useful graphs' representations). University of Paris-Sud, Orsay, France, 2006 - [j11]Dominique Barth, Pascal Berthomé, Madiagne Diallo, Afonso Ferreira:
Revisiting parametric multi-terminal problems: Maximum flows, minimum cuts and cut-tree computations. Discret. Optim. 3(3): 195-205 (2006) - 2005
- [j10]Dominique Barth, Pascal Berthomé, Madiagne Diallo:
Detecting flows congesting a target network link. Electron. Notes Discret. Math. 19: 233-239 (2005) - [j9]Dominique Barth, Pascal Berthomé, Paraskevi Fragopoulou:
The Complexity of the Maximal Requests Satisfaction Problem in Multipoint Communication. Parallel Process. Lett. 15(1-2): 209-222 (2005) - [c9]Pascal Berthomé, Sylvain Lebresne, Kim Nguyen:
Computation of Chromatic Polynomials Using Triangulations and Clique Trees. WG 2005: 362-373 - 2004
- [j8]Dominique Barth, Pascal Berthomé, Johanne Cohen:
The Eulerian Stretch Of A Network Topology And The Ending Guarantee Of A Convergence Routing. J. Interconnect. Networks 5(2): 93-109 (2004) - [j7]Dominique Barth, Pascal Berthomé:
Periodic Gossiping in Commuted Networks. Theory Comput. Syst. 37(5): 559-584 (2004) - 2003
- [c8]Pascal Berthomé, Madiagne Diallo, Afonso Ferreira:
Generalized Parametric Multi-terminal Flows Problem. WG 2003: 71-80 - 2002
- [c7]Dominique Barth, Pascal Berthomé, T. Czarchoski, Jean-Michel Fourneau, Christian Laforest, Sandrine Vial:
A Mixed Deflection and Convergence Routing Algorithm: Design and Performance. Euro-Par 2002: 767-774 - 2000
- [j6]Pascal Berthomé, Afonso Ferreira, Bruce M. Maggs, Stephane Perennes, C. Greg Plaxton:
Sorting-Based Selection Algorithms for Hypercubic Networks. Algorithmica 26(2): 237-254 (2000) - [j5]Pascal Berthomé, Torben Hagerup, Ilan Newman, Assaf Schuster:
Self-Simulation for the Passive Optical Star. J. Algorithms 34(1): 128-147 (2000)
1990 – 1999
- 1997
- [j4]Pascal Berthomé, Afonso Ferreira:
Communication Issues in Parallel Systems with Optical Interconnections. Int. J. Found. Comput. Sci. 8(2): 143-162 (1997) - [c6]Pascal Berthomé, Johanne Cohen, Afonso Ferreira:
Embedding Tori in Partitioned Optical Passive Star Networks. SIROCCO 1997: 40-52 - 1996
- [j3]Pascal Berthomé, Afonso Ferreira, Stephane Perennes:
Optimal Information Dissemination in Star and Pancake Networks. IEEE Trans. Parallel Distributed Syst. 7(12): 1292-1300 (1996) - 1995
- [c5]Pascal Berthomé, Th. Duboux, Torben Hagerup, Ilan Newman, Assaf Schuster:
Self-Simulation for the Passive Optical Star Model. ESA 1995: 369-380 - 1994
- [j2]Pascal Berthomé, Afonso Ferreira:
Time-optimal Geometric Algorithms in Hypercubic Networks. Parallel Algorithms Appl. 4(3-4): 169-181 (1994) - [c4]Pascal Berthomé, Afonso Ferreira:
On broadcasting schemes in restricted optical passive star systems. Interconnection Networks and Mapping and Scheduling Parallel Computations 1994: 19-29 - 1993
- [c3]Pascal Berthomé, Afonso Ferreira, Bruce M. Maggs, Stephane Perennes, C. Greg Plaxton:
Sorting-Based Selection Algorithms for Hypercube Networks. IPPS 1993: 89-95 - [c2]Afonso Ferreira, Pascal Berthomé, Stephane Perennes:
Optimal Information Dissemination in Star and Pancake Networks. SPDP 1993: 720-725 - 1992
- [j1]Pascal Berthomé:
Efficient K-Selection in Hypercube Multiprocessors. Parallel Process. Lett. 2: 221-230 (1992) - [c1]Pascal Berthomé:
K-Selection in Hypercubes. ICCI 1992: 164-167
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-27 20:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: