default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJean-Marc Robert 0001
Person information
- affiliation: École de Technologie Supérieure (ÉTS), Montréal, QC, Canada
- affiliation (former): Alcatel, Research and Innovation Centre - Security Group, Ottawa, ON, Canada
- affiliation (former): Université du Québec à Chicoutimi, QC, Canada
- affiliation (former): McGill University, Montréal, QC, Canada
Other persons with the same name
- Jean-Marc Robert 0002 — École Polytechnique de Montréal, Department of Mathematics and Industrial Engineering, QC, Canada
- Jean-Marc Robert 0003
![[0000-0002-9634-5729]](/https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0002-9634-5729")
— University of Toulon, France (and 2 more)
2020 – today
- 2024
[j25]Ehsan Mortazavi, Philippe Doyon-Poulin, Daniel Imbeau, Jean-Marc Robert:
Development and Validation of Four Social Scales for the UX Evaluation of Interactive Products. Int. J. Hum. Comput. Interact. 40(20): 6608-6621 (2024)- [j24]Ehsan Mortazavi, Philippe Doyon-Poulin, Daniel Imbeau, Mitra Taraghi, Jean-Marc Robert:
Exploring the Landscape of UX Subjective Evaluation Tools and UX Dimensions: A Systematic Literature Review (2010-2021). Interact. Comput. 36(4): 255-278 (2024) - 2023
- [j23]Ehsan Mortazavi, Philippe Doyon-Poulin, Daniel Imbeau, Jean-Marc Robert:
Identifying the Importance of UX Dimensions for Different Software Product Categories. Interact. Comput. 35(6): 801-814 (2023) - 2022
- [j22]Firouzeh Golaghazadeh, Stéphane Coulombe, Jean-Marc Robert:
Residual packet loss rate analysis of 2-D parity forward error correction. Signal Process. Image Commun. 102: 116597 (2022)
2010 – 2019
- 2018
- [c31]Sébastien Gambs, Julien Lolive, Jean-Marc Robert:
Entwining Sanitization and Personalization on Databases. AsiaCCS 2018: 207-219 - [c30]Aurélien Dupin, Jean-Marc Robert, Christophe Bidan:
Location-Proof System Based on Secure Multi-party Computations. ProvSec 2018: 22-39 - [i4]Aurélien Dupin, Jean-Marc Robert, Christophe Bidan:
Location-Proof System based on Secure Multi-Party Computations. IACR Cryptol. ePrint Arch. 2018: 525 (2018) - 2017
- [c29]Gildas Avoine, Xavier Bultel, Sébastien Gambs, David Gérault, Pascal Lafourcade, Cristina Onete, Jean-Marc Robert:
A Terrorist-fraud Resistant and Extractor-free Anonymous Distance-bounding Protocol. AsiaCCS 2017: 800-814 - [i3]Gildas Avoine, Xavier Bultel, Sébastien Gambs, David Gérault, Pascal Lafourcade, Cristina Onete, Jean-Marc Robert:
A Terrorist-fraud Resistant and Extractor-free Anonymous Distance-bounding Protocol. IACR Cryptol. ePrint Arch. 2017: 297 (2017) - 2016
- [j21]Abdelfattah Amamra, Jean-Marc Robert, Andrien Abraham, Chamseddine Talhi:
Generative versus discriminative classifiers for android anomaly-based detection system using system calls filtering and abstraction process. Secur. Commun. Networks 9(16): 3483-3495 (2016) - [c28]Faustin Mbol, Jean-Marc Robert, Alireza Sadighian:
An Efficient Approach to Detect TorrentLocker Ransomware in Computer Systems. CANS 2016: 532-541 - [c27]Xavier Bultel, Sébastien Gambs, David Gérault, Pascal Lafourcade, Cristina Onete, Jean-Marc Robert:
A Prover-Anonymous and Terrorist-Fraud Resistant Distance-Bounding Protocol. WISEC 2016: 121-133 - 2015
- [j20]Abdelfattah Amamra, Jean-Marc Robert, Chamseddine Talhi:
Enhancing malware detection for Android systems using a system call filtering and abstraction process. Secur. Commun. Networks 8(7): 1179-1192 (2015) - 2014
- [j19]Éric Barthélémy, Jean-Marc Robert:
Mechanisms to locate noncooperative transmitters in wireless networks based on residual signal strengths. Secur. Commun. Networks 7(11): 1788-1804 (2014) - [j18]Nadia Moati, Hadi Otrok, Azzam Mourad, Jean-Marc Robert:
Reputation-Based Cooperative Detection Model of Selfish Nodes in Cluster-Based QoS-OLSR Protocol. Wirel. Pers. Commun. 75(3): 1747-1768 (2014) - [c26]Sébastien Gambs, Cristina Onete, Jean-Marc Robert:
Prover anonymous and deniable distance-bounding authentication. AsiaCCS 2014: 501-506 - [i2]Sébastien Gambs, Cristina Onete, Jean-Marc Robert:
Prover Anonymous and Deniable Distance-Bounding Authentication. IACR Cryptol. ePrint Arch. 2014: 114 (2014) - 2013
- [c25]Abdelfattah Amamra, Chamseddine Talhi, Jean-Marc Robert:
Impact of Dataset Representation on Smartphone Malware Detection Performance. IFIPTM 2013: 166-176 - [c24]Hiba Sanadiki, Hadi Otrok, Azzam Mourad, Jean-Marc Robert:
Detecting attacks in QoS-OLSR protocol. IWCMC 2013: 1126-1131 - 2012
- [j17]Jean-Marc Robert, Hadi Otrok, Ahmad Nahar Quttoum, Rihab Boukhris:
A distributed resource management model for Virtual Private Networks: Tit-for-Tat strategies. Comput. Networks 56(2): 927-939 (2012) - [j16]Jean-Marc Robert, Hadi Otrok, Abdelkarim Chriqi:
RBC-OLSR: Reputation-based clustering OLSR protocol for wireless ad hoc networks. Comput. Commun. 35(4): 487-499 (2012) - [j15]Stephane Boyer, Jean-Marc Robert, Hadi Otrok, Clement Rousseau:
An adaptive tit-for-tat strategy for IEEE 802.11 CSMA/CA protocol. Int. J. Secur. Networks 7(2): 95-106 (2012) - [j14]Maxime Dumas, Jean-Marc Robert, Michael J. McGuffin:
Alertwheel: radial bipartite graph visualization applied to intrusion detection system alerts. IEEE Netw. 26(6): 12-18 (2012) - [c23]Abdelfattah Amamra, Chamseddine Talhi, Jean-Marc Robert:
Performance Evaluation of Multi-pattern Matching Algorithms on Smartphone. BWCCA 2012: 329-334 - [c22]Stephane Boyer, Jean-Marc Robert, Clement Rousseau, Hadi Otrok:
A novel reputation-based Tit-for-Tat strategy for IEEE 802.11 CSMA/CA protocol. CCNC 2012: 143-148 - [c21]Éric Barthélémy, Jean-Marc Robert:
Mechanisms to Locate Non-cooperative Transmitters in Wireless Networks. ICAIT 2012: 199-212 - [c20]Abdelfattah Amamra, Chamseddine Talhi, Jean-Marc Robert:
Smartphone malware detection: From a survey towards taxonomy. MALWARE 2012: 79-86 - [c19]Hajer Al Housani, Hadi Otrok, Rabeb Mizouni, Jean-Marc Robert, Azzam Mourad:
Towards Smart Anti-Malwares for Battery-Powered Devices. NTMS 2012: 1-4 - 2011
- [c18]Maxime Dumas, Michael J. McGuffin, Jean-Marc Robert, Marie-Claire Willig:
Optimizing a Radial Layout of Bipartite Graphs for a Tool Visualizing Security Alerts. GD 2011: 203-214 - [c17]Hadi Otrok, Azzam Mourad, Jean-Marc Robert, Nadia Moati, Hiba Sanadiki:
A cluster-based model for QoS-OLSR protocol. IWCMC 2011: 1099-1104 - [c16]Yassine Snoussi, Jean-Marc Robert, Hadi Otrok:
Novel detection mechanisms for malicious attacks targeting the cluster-based OLSR protocol. WiMob 2011: 135-140 - 2010
- [j13]Michael J. McGuffin, Jean-Marc Robert:
Quantifying the space-efficiency of 2D graphical representations of trees. Inf. Vis. 9(2): 115-140 (2010)
2000 – 2009
- 2009
- [c15]Abdelkarim Chriqi, Hadi Otrok, Jean-Marc Robert:
SC-OLSR: Secure Clustering-Based OLSR Model for Ad Hoc Networks. WiMob 2009: 239-245 - 2008
- [c14]Carlton R. Davis, Stephen Neville, José M. Fernandez, Jean-Marc Robert, John McHugh:
Structured Peer-to-Peer Overlay Networks: Ideal Botnets Command and Control Infrastructures?. ESORICS 2008: 461-480 - 2006
- [j12]Michel Barbeau, Jean-Marc Robert:
Rogue-base station detection in WiMax/802.16 wireless access networks. Ann. des Télécommunications 61(11-12): 1300-1313 (2006) - [j11]Paul C. van Oorschot, Jean-Marc Robert, Miguel Vargas Martin:
A monitoring system for detecting repeated packets with applications to computer worms. Int. J. Inf. Sec. 5(3): 186-199 (2006) - 2005
- [c13]Michel Barbeau, Jean-Marc Robert:
Perfect identity concealment in UMTS over radio access links. WiMob (2) 2005: 72-77 - 2004
- [j10]Thomas M. Chen, Jean-Marc Robert:
Worm Epidemics in High-Speed Networks. Computer 37(6): 48-53 (2004) - [c12]Emanuele Jones, Olivier Le Moigne, Jean-Marc Robert:
IP traceback solutions based on time to live covert channel. ICON 2004: 451-457 - 2001
- [c11]Geneviève Arboit, Jean-Marc Robert:
From Fixed-Length Messages to Arbitrary-Length Messages Practical RSA Signature Padding Schemes. CT-RSA 2001: 44-51
1990 – 1999
- 1999
- [j9]Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jean-Marc Robert, Mariette Yvinec:
Convex tours of bounded curvature. Comput. Geom. 13(3): 149-159 (1999) - [i1]Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jean-Marc Robert, Mariette Yvinec:
Convex Tours of Bounded Curvature. CoRR cs.CG/9909004 (1999) - 1997
- [j8]Jean-Marc Robert:
Geometric Orderings of Intersecting Translates and Their Applications. Comput. Geom. 7: 59-72 (1997) - [j7]Jurek Czyzowicz, Hazel Everett, Jean-Marc Robert:
Separating Translates in the Plane: Combinatorial Bounds and an Algorithm. Int. J. Comput. Geom. Appl. 7(6): 551-562 (1997) - 1996
- [j6]Leonidas J. Guibas, Mark H. Overmars, Jean-Marc Robert:
The Exact Fitting Problem in Higher Dimensions. Comput. Geom. 6: 215-230 (1996) - [j5]Hazel Everett, Jean-Marc Robert, Marc J. van Kreveld:
An optimal algorithm for the (<= k)-levels, with applications to separation and transversal problems. Int. J. Comput. Geom. Appl. 6(3): 247-261 (1996) - 1994
- [j4]Jean-Marc Robert, Godfried T. Toussaint:
Linear Approximation of Simple Objects. Comput. Geom. 4: 27-52 (1994) - [c10]Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jean-Marc Robert, Mariette Yvinec:
Convex Tours on Bounded Curvature. ESA 1994: 254-265 - [c9]Jurek Czyzowicz, Hazel Everett, Jean-Marc Robert:
Separating Translates in the Plane: Combinatorial Bounds and an Algorithm. SWAT 1994: 107-118 - 1993
- [j3]Michael E. Houle, Hiroshi Imai, Keiko Imai, Jean-Marc Robert, Peter Yamamoto:
Orthogonal Weighted Linear L1 and L∞ Approximation and Applications. Discret. Appl. Math. 43(3): 217-232 (1993) - [j2]Jean-Marc Robert:
Maximum distance between two sets of points in Ed. Pattern Recognit. Lett. 14(9): 733-735 (1993) - [c8]Jean-Marc Robert:
Geometric Orderings and Helly-type Theorem for Intersecting Translates in the Plane. CCCG 1993: 61-66 - [c7]Hazel Everett, Jean-Marc Robert, Marc J. van Kreveld:
An Optimal Algorithm for the (<= k)-Levels, with Applications to Separation and Transversal Problems. SCG 1993: 38-46 - 1992
- [c6]Jean-Marc Robert, Godfried T. Toussaint:
Linear Approximation of Simple Objects. STACS 1992: 233-244 - 1991
- [c5]Binay K. Bhattacharya, Shreesh Jadhav, Asish Mukhopadhyay, Jean-Marc Robert:
Optimal Algorithms for Some Smallest Intersection Radius Problems (Extended Abstract). SCG 1991: 81-88
1980 – 1989
- 1989
- [c4]Michael E. Houle, Hiroshi Imai, Keiko Imai, Jean-Marc Robert:
Weighted Orthogonal Linear L∞-Approximation and Applications. WADS 1989: 183-193 - 1988
- [j1]Charles H. Bennett, Gilles Brassard, Jean-Marc Robert:
Privacy Amplification by Public Discussion. SIAM J. Comput. 17(2): 210-229 (1988) - 1986
- [c3]Gilles Brassard, Claude Crépeau, Jean-Marc Robert:
All-or-Nothing Disclosure of Secrets. CRYPTO 1986: 234-238 - [c2]Gilles Brassard, Claude Crépeau, Jean-Marc Robert:
Information Theoretic Reductions among Disclosure Problems. FOCS 1986: 168-173 - 1985
- [c1]Charles H. Bennett, Gilles Brassard, Jean-Marc Robert:
How to Reduce Your Enemy's Information (Extended Abstract). CRYPTO 1985: 468-476
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.
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.
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.
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 2025-01-20 22:59 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:
