| Optimal information dissemination in star and pancake networks P Berthome, A Ferreira, S Perennes IEEE Transactions on Parallel and Distributed Systems 7 (12), 1292-1300, 1996 | 102 | 1996 |
| Software countermeasures for control flow integrity of smart card C codes JF Lalande, K Heydemann, P Berthomé Computer Security-ESORICS 2014: 19th European Symposium on Research in …, 2014 | 62 | 2014 |
| Repackaging android applications for auditing access to private data P Berthome, T Fecherolle, N Guilloteau, JF Lalande 2012 Seventh International Conference on Availability, Reliability and …, 2012 | 55 | 2012 |
| A practical set-membership proof for privacy-preserving NFC mobile ticketing G Arfaoui, JF Lalande, J Traoré, N Desmoulins, P Berthomé, S Gharout arXiv preprint arXiv:1505.03048, 2015 | 42 | 2015 |
| Improved embeddings in POPS networks through stack-graph models P Berthomé, A Ferreira Proceedings of Massively Parallel Processing Using Optical Interconnections …, 1996 | 32 | 1996 |
| High level model of control flow attacks for smart card functional security P Berthomé, K Heydemann, X Kauffmann-Tourkestansky, JF Lalande 2012 Seventh International Conference on Availability, Reliability and …, 2012 | 30 | 2012 |
| Performance comparisons of Eulerian routing and deflection routing in a 2d-mesh all optical network D Barth, P Berthomé, A Borrero, JM Fourneau, C Laforest, F Quessette, ... ESM’2001, 2001 | 25 | 2001 |
| Formally verified software countermeasures for control-flow integrity of smart card C code K Heydemann, JF Lalande, P Berthomé Computers & Security 85, 202-224, 2019 | 21 | 2019 |
| Teaching android mobile security JF Lalande, V Viet Triem Tong, P Graux, G Hiet, W Mazurczyk, H Chaoui, ... Proceedings of the 50th ACM Technical Symposium on Computer Science …, 2019 | 21 | 2019 |
| Sorting-based selection algorithms for hypercubic networks P Berthome, A Ferreira, BM Maggs, S Perennes, CG Plaxton [1993] Proceedings Seventh International Parallel Processing Symposium, 89-95, 1993 | 20 | 1993 |
| Revisiting parametric multi-terminal problems: Maximum flows, minimum cuts and cut-tree computations D Barth, P Berthomé, M Diallo, A Ferreira Discrete Optimization 3 (3), 195-205, 2006 | 17 | 2006 |
| Attack model for verification of interval security properties for smart card C codes P Berthomé, K Heydemann, X Kauffmann-Tourkestansky, JF Lalande Proceedings of the 5th ACM SIGPLAN Workshop on Programming Languages and …, 2010 | 16 | 2010 |
| Optical Interconnections and Parallel Processing P Berthomé, A Ferreira Springer Science & Business Media, 1998 | 14 | 1998 |
| Generalized parametric multi-terminal flows problem P Berthomé, M Diallo, A Ferreira Graph-Theoretic Concepts in Computer Science: 29th International Workshop …, 2003 | 13 | 2003 |
| A pseudo-random bit generator based on three chaotic logistic maps and IEEE 754-2008 floating-point arithmetic M François, D Defour, P Berthomé Theory and Applications of Models of Computation: 11th Annual Conference …, 2014 | 10 | 2014 |
| Embedding tori in partitioned optical passive star networks P Berthomé, J Cohen, A Ferreira Université Paris-Sud, Centre d'Orsay, Laboratoire de recherche en Informatique, 1997 | 10 | 1997 |
| Decomposing hierarchical cayley graphs, with applications to information dissemination and algorithm design P Berthomé, A Ferreira, S Perennes Ecole Normale Supérieure de Lyon. Laboratoire de l'Informatique du …, 1992 | 10 | 1992 |
| An unified FPT algorithm for width of partition functions P Berthomé, T Bouvier, F Mazoit, N Nisse, RP Soares INRIA, 2013 | 9 | 2013 |
| The Eulerian stretch of a network topology and the ending guarantee of a convergence routing D Barth, P Berthomé, J Cohen Journal of Interconnection Networks 5 (02), 93-109, 2004 | 8 | 2004 |
| The Eulerian stretch of a digraph and the ending guarantee of a convergence routing D Barth, P Berthomé, J Cohen | 8 | 2000 |
