جست‌وجوی استاد و پژوهشگر

Paolo Papottiمشاهده پروفایل

دانشیار

• Data Management
• Data Integration
• Data Cleaning
• +۳ مورد دیگر

Paolo Papotti is an Associate Professor of Computer Science at EURECOM (France) since 2017, affiliated with the Data Science department. Previously, he was a senior scientist at QCRI (Qatar) and an assistant professor at Arizona State University (USA). He earned his PhD in Computer Science from the University of Roma Tre (Italy) in 2007, following an MEng in Computer Engineering from the same institution in 2003. His research focuses on scalable data management, data integration, data cleaning, and computational fact-checking. Notable contributions include work on knowledge graph rule discovery (Rudik), fact-checking frameworks (Scrutinizer), and data quality systems. His research has been supported by awards such as the 2020 Google Faculty Research Fellowship. Key publications include advancements in table representation learning, LLM-based data querying, and crowdsourced fact-checking validation. His work spans theoretical foundations and practical tools for improving data quality and information trustworthiness.

• Computational Statistics
• Machine Learning
• Monte Carlo Methods
• +۴ مورد دیگر

Alain Durmus is a Professor at École Polytechnique, affiliated with the applied mathematics department (CMAP). His research focuses on computational statistics, machine learning, and stochastic methods, including Monte Carlo algorithms, Bayesian inference, and optimization. He explores topics such as Markov chain Monte Carlo (MCMC), stochastic approximation, and generative models. His work emphasizes theoretical guarantees for algorithms like Langevin Monte Carlo and Hamiltonian Monte Carlo, with applications to high-dimensional Bayesian inference and inverse problems. Key contributions include hypocoercivity analysis of piecewise deterministic MCMC processes, convergence guarantees for stochastic gradient methods, and the development of efficient sampling techniques. He has also contributed to Bayesian imaging and federated learning through works like the QLSD algorithm. Awarded the Best Student Paper Award at ICASSP 2020 for his work on the Sliced-Wasserstein distance. His teaching spans mathematical statistics, stochastic methods, and probability at École Polytechnique and ENS Paris-Saclay. He has also contributed to conferences and workshops on topics ranging from MCMC convergence to optimization in machine learning.

• Information-Theoretic Security
• Data Privacy
• Network Security
• +۷ مورد دیگر

Salim El Rouayheb is an Associate Professor in the Department of Electrical and Computer Engineering at Rutgers University, within the College of Engineering. He is also a fellow-in-residence at CY Advanced Studies, invited by the ETIS laboratory. Previously, he served as an Assistant Professor at the Illinois Institute of Technology, Chicago (2013–2017), and held postdoctoral positions at the University of California, Berkeley, and Princeton University. His educational background includes a Ph.D. in Electrical Engineering from Texas A&M University, awarded in 2009. Dr. El Rouayheb's research focuses on information-theoretic security and privacy in networks and distributed systems. His work addresses fundamental challenges in secure communication, including the wiretap problem, anonymity, private information retrieval, and differential privacy. He investigates the computational and communication costs of privacy-preserving algorithms and explores mechanisms to dynamically turn privacy ON or OFF based on context, particularly in genomic data applications where data correlation poses unique risks. His research has been recognized with prestigious awards, including the NSF CAREER Award (2016) , the Google Faculty Award (2018) , and the Rutgers University Walter Tyson Junior Faculty Chair (2019) . NSF CAREER Award (2016) Google Faculty Award (2018) Rutgers University Walter Tyson Junior Faculty Chair (2019) He advises graduate students and leads research in secure and private data systems, though specific advisees are not listed in the provided text. His collaborative work includes joint projects with researchers such as Carolina Naim, Fangwei Ye, and Hyunghoon Cho. While no grants are explicitly detailed, his receipt of the NSF CAREER and Google Faculty Award indicates significant external research funding. He is affiliated with research initiatives in information security and privacy, particularly through his lab or research group at Rutgers, though the specific name of the lab is not mentioned. His recent work bridges theoretical foundations with practical applications in genomic privacy and adaptive privacy mechanisms.

Tijani CHAHEDمشاهده پروفایل

استاد

• Network Optimization
• Edge Computing
• Machine Learning in Networks
• +۴ مورد دیگر

Prof. Tijani CHAHED is a Professor at Telecom SudParis, part of Université Paris-Saclay, affiliated with the SAMOVAR laboratory and the NeSS research group. His work focuses on network optimization, edge computing, machine learning applications in telecommunications, and game-theoretical frameworks for distributed systems. He holds a position in the Department of Computer Science and Telecommunications. His research spans resource allocation in 5G/6G networks, energy efficiency strategies for mobile infrastructure, reinforcement learning for dynamic systems, and coalitional game theory for multi-agent systems. Key contributions include optimization of cache allocation in edge computing, latency-critical traffic management (URLLC), and strategic investment models for distributed computing infrastructures. Selected articles highlight advances in edge computing resource management, metaverse data transport over 5G, and energy-efficient sleep mode control for base stations. His work often intersects with industrial applications in green networks and smart grid integration for mobile infrastructure. Collaborations involve institutions like École Polytechnique, INRIA, and industry partners in telecommunications. Current projects include 6G network architectures, metaverse-enabled edge services, and decentralized resource allocation frameworks. Labs/Teams: SAMOVAR Lab (Signal and Media Access Networks, Optical and Radio Networks), NeSS Group (Networked Systems and Services).

• Operations Research
• Combinatorial Optimization
• Artificial Intelligence
• +۳ مورد دیگر

Omar Rifki is an Associate Professor (Maître de Conférences) specializing in combinatorial optimization and artificial intelligence applications. His research bridges theoretical computer science with practical logistics challenges, focusing on routing problems, process mining, and machine learning integration for complex decision systems. His core research interests include phase transitions in NP-hard problems, vehicle routing optimization under time constraints, and healthcare process modeling. Rifki's work demonstrates a consistent pattern of integrating reinforcement learning with traditional optimization techniques to solve large-scale real-world problems in transportation and logistics, with particular emphasis on spatio-temporal data effects and collaborative systems. Analysis of his 15 publications (2019-2025) reveals three dominant research thrusts: (1) Fundamental studies of combinatorial problem hardness using phase transition frameworks, (2) Practical applications of deep reinforcement learning in vehicle routing and taxi assignment, and (3) Healthcare process optimization through advanced process mining techniques. His work consistently addresses scalability challenges in real-world implementations while maintaining theoretical rigor. No scientific awards were documented in the provided materials. His collaborative work with researchers like Christine Solnon and Thierry Garaix indicates active participation in European operations research communities, though specific grant details remain unreported. Rifki's research shows increasing integration of graph theory and machine learning in transportation applications, particularly evident in his Lyon City case studies on autonomous ride-sharing systems.

Aurèle Maheoمشاهده پروفایل

پژوهشگر ارشد

• Distributed Systems
• Parallel Computing
• Machine Learning Systems
• +۳ مورد دیگر

Aurèle Maheo is a Research Fellow at the Computer Science Department of Telecom SudParis, affiliated with the Parallel and Distributed Systems (PDS) group. His research focuses on distributed systems, parallel computing, and hardware acceleration, with applications in machine learning and high-performance computing. He has contributed to projects such as SpeedyLoader for optimizing machine learning pipelines and FPGA memory bandwidth improvements. His work bridges theoretical distributed systems principles with practical implementation challenges in large-scale environments. Affiliations: PDS Group, Computer Science Department, Telecom SudParis Research interests include distributed consensus algorithms, system scalability, and hardware-software co-design for accelerating computational workflows. Recent work highlights include presentations on machine learning pipelining techniques and FPGA-based memory optimization strategies.

Petros Eliaمشاهده پروفایل

استاد

• Information Theory
• Coding Theory
• Caching
• +۳ مورد دیگر

Professor Petros Elia is a faculty member at EURECOM, holding the position of Professor within the Department of Communications systems. He specializes in Information Theory , Coding Theory , Caching , Distributed Computing , and Wireless Networks , with additional research in Biometrics . His work focuses on advancing theoretical foundations and practical applications in distributed systems and wireless communication efficiency. He received a prestigious ERC Consolidator Grant for his DUALITY project (2016) and a four-year Fulbright Scholarship (1993-1997). He is also a recipient of the Newcom++ Network of Excellence Distinguished Achievement Award (2008-2011) and the Best Student Paper Award at SPAWC 2011, awarded to his advisee Arun Singh. His research explores cutting-edge topics such as tessellated distributed computing , hypergraph decomposition , and topology-aware caching , with recent contributions presented at venues like the IEEE International Symposium on Information Theory (ISIT 2025). His work bridges theoretical advancements with real-world applications in wireless networks and distributed systems. Education: Supported by his Fulbright Scholarship, he pursued studies in the U.S. during 1993-1997. Grants: ERC Consolidator Grant (2016), and others. Advising: Mentor to Arun Singh , whose work earned a student paper award. He actively contributes to teaching Mobile Communications at EURECOM and remains a key figure in advancing the field through interdisciplinary collaborations and leadership in the Communication Systems department.

Jonathan Andrew Crowcroftمشاهده پروفایل

استاد

• Computer Networks
• Distributed Systems
• Opportunistic Communications
• +۷ مورد دیگر

Jon Crowcroft is the Marconi Professor of Communications Systems in the Department of Computer Science and Technology at the University of Cambridge, and serves as the Chair of the Programme Committee at the Alan Turing Institute. He is also a Fellow of Wolfson College, Cambridge, and a visiting professor at the Department of Computing at Imperial College London. With a career spanning over three decades in computer networking research, Professor Crowcroft has made seminal contributions to the development of the Internet and continues to be highly active in cutting-edge research areas. His educational background includes: BA in Physics from Trinity College, University of Cambridge (1979) MSc in Computing from University College London (1981) PhD from University College London (1993) Professor Crowcroft's research spans multiple domains in computer networking and distributed systems. He has worked in Internet support for multimedia communications for over 30 years, with three main focus areas: scalable multicast routing, practical approaches to traffic management, and the design of deployable end-to-end protocols. His current research focuses on opportunistic communications, social networks, and techniques to scale infrastructure-free mobile systems. He is particularly known for his 'build and learn' paradigm for research and has recently been exploring decentralized digital identification systems, smart cities, and edge computing. His work often bridges theoretical foundations with practical implementations, emphasizing privacy-preserving approaches and sustainable network architectures. Professor Crowcroft has received numerous prestigious awards recognizing his contributions to the field, including: Election as Fellow of the Royal Society (2013) ACM SIGCOMM Award (2009) ACM Fellow (2002) Fellow of the Royal Academy of Engineering IEEE Fellow (2004) Chartered Fellow of the British Computer Society Throughout his career, Professor Crowcroft has advised numerous PhD students, including Mark Handley and Pan Hui, who have themselves become influential researchers in the networking community. He has authored several influential books that have been adopted internationally in academic courses, such as 'TCP/IP & Linux Protocol Implementation,' 'Internetworking Multimedia,' and 'Open Distributed Systems.' His research has been supported by various grants and collaborations with both academic institutions and industry partners, contributing to successful startup projects and influencing Internet standards. Professor Crowcroft is actively involved in several research initiatives, including serving on the Scientific Council of IMDEA Networks Institute since 2007 and the advisory board of the Max Planck Institute for Software Systems. He is also a director of the Matrix Foundation, which develops open network protocols. His current research group focuses on privacy-preserving analytics, decentralized systems, and the future of Internet architecture.

• Virtualization
• Operating Systems
• Concurrency
• +۴ مورد دیگر

Gaël Thomas is a Senior Researcher at Inria Saclay and a part-time Professor at École Polytechnique. He leads the Benagil team, a joint initiative between Inria and Telecom SudParis/IP Paris. His research focuses on virtualization, operating systems, concurrency, and runtime systems, with an emphasis on improving system performance and safety. He holds a PhD and Habilitation from Sorbonne Université and has extensive academic experience, including roles as a Professor at Telecom SudParis (2014–2023) and an Associate Professor at UPMC (2006–2014). Education: PhD in Computer Science, 2005, UPMC Sorbonne Université Habilitation à Diriger les Recherches (HDR), 2012, UPMC Sorbonne Université MSc in Computer Science, 2001, MIAIF Program Research Interests: Gaël’s work spans virtualization techniques, NUMA architecture optimization, garbage collection scalability, lock-free algorithms, and persistent memory systems. He has pioneered solutions like J-NVM for Java NVMM and NumaGiC for big data systems. Grants & Awards: Principal Investigator of DiVA (PEPR Cloud, 868k€) and Maplurinum (ANR PRC, 184k€) Contributions to VMKit and infra-web-cours development Labs/Teams: Benagil Team (Inria/Telecom SudParis) focuses on systems and runtime optimization.

• Extreme Value Theory
• Applied Mathematics
• Gaussian Processes
• +۵ مورد دیگر

Marie Kratz is a Full Professor at ESSEC Business School (Cergy, France), affiliated with the CREAR - Center of Research in Econo-finance and Actuarial Sciences on Risk . Her work bridges theoretical and applied domains in extreme value theory , heavy-tailed distributions , and risk management , with applications in finance, cybersecurity, and neuroscience. Research Focus : Extreme value theory, risk concentration, cyber risk modeling, Gaussian random fields, and pro-cyclicality in financial risk measures. Collaborations : Active collaborations with Michel Dacorogna, Marcel Bräutigam, and Sibsankar Singha on cyber risk and financial applications. Methodologies : Development of the Normex method for aggregated heavy-tailed risks, hybrid Gaussian-Pareto models, and near-explosive random coefficient autoregressive models. Awards and Recognition : No specific awards mentioned in the text.

Evripidis BAMPISمشاهده پروفایل

استاد

• Approximation Algorithms
• Energy-Aware Algorithms
• Algorithmic Game Theory
• +۵ مورد دیگر

Evripidis Bampis is a Professor of Computer Science at Sorbonne Université, affiliated with the LIP6 laboratory and the Operations Research (RO) group. He currently serves as the Head of the Master of Computer Science program and leads the AGAPE research group within the GDR Recherche Opérationnelle. His research focuses on approximation algorithms, energy-aware computing, algorithmic game theory, scheduling, and graph problems. He has been actively involved in organizing international conferences and workshops, including co-chairing the International Symposium on Fundamentals of Computation Theory (FCT) in 2021 and 2023, and chairing the Symposium on Experimental Algorithms (SEA) in 2015. His collaborative projects include ANR-funded initiatives such as ALGORIDAM (2020–2024) and ENERGUMEN (2018–2023), which address algorithmic theory and energy efficiency in distributed systems. Bampis has advised numerous PhD students and co-authored influential publications in scheduling and algorithm design. His international collaborations span institutions like the Technical University of Munich, the Chinese Academy of Sciences, and Imperial College London. He maintains a strong presence in academic committees and has contributed to EU-funded thematic networks like APPOL and APPOL II.

Xujia ZHUمشاهده پروفایل

دانشیار

• Uncertainty Quantification
• Surrogate Modeling
• Stochastic Simulators
• +۴ مورد دیگر

Xujia ZHU is an Associate Professor at CentraleSupélec, Paris-Saclay University, affiliated with the Laboratory of Signals and Systems (L2S). His research focuses on uncertainty quantification, surrogate modeling, stochastic simulators, and reliability analysis. He holds an engineer’s degree in Mechanics from École Polytechnique (2015), a Master’s in Computational Mechanics from TU Munich (2017), and a Ph.D. from ETH Zurich (2022). He was a postdoctoral researcher at ETH Zurich until 2023. Education: Ph.D., Chair of Risk, Safety, and Uncertainty Quantification, ETH Zurich, 2022 Master’s (high distinction), Computational Mechanics, Technical University of Munich, 2017 Engineer’s Degree, Mechanics, École Polytechnique, 2015 Research Interests: Xujia’s work bridges numerical simulations and statistics, addressing topics like uncertainty propagation, sensitivity analysis, and surrogate modeling for stochastic systems. Key areas include polynomial chaos expansions, Bayesian active learning, and applications in seismic fragility analysis. Publications: His recent work emphasizes emulation techniques for stochastic simulators, multi-fidelity methodologies, and Bayesian active learning strategies in reliability analysis. Key themes include sparse polynomial chaos expansions and latent variable modeling. Labs/Teams: Affiliated with L2S, he collaborates on transversal projects in energy, industry, and health, leveraging interdisciplinary approaches in uncertainty quantification and computational modeling.

Eric TOTELمشاهده پروفایل

استاد

• Network Security
• Intrusion Detection Systems
• Data Confidentiality
• +۳ مورد دیگر

Eric TOTEL is a Professor at Telecom SudParis, specializing in cybersecurity and network security. His research focuses on intrusion detection systems, graph-based anomaly detection, machine learning applications in security, and data confidentiality in distributed systems. He has contributed to projects such as DAMS (DDoS mitigation using deep reinforcement learning), Sec2Graph (novelty detection on graph-structured data), and DAEMON (dynamic autoencoder-based anomaly detection). His work emphasizes scalable solutions for multi-step attack detection and privacy-preserving infrastructure for encrypted DNS logs. Key contributions include developing correlation engines for distributed systems, formalizing invariant-based attack detection in web applications, and exploring static analysis for information flow control. He has authored over 50 peer-reviewed publications and served on program committees for conferences like RAID, CRiSIS, and EuroS&P. His HDR (2012) formalized error-detection techniques applied to intrusion detection. Advising and grants: He collaborates on projects funded by French national research agencies and has mentored students in cybersecurity, AI for defense (CAID conferences), and cloud infrastructure security. His research often bridges theoretical models and practical implementations, with tools like STARLORD for 3D graph visualization of security data.

• Cybersecurity
• Network Security
• IoT Security
• +۵ مورد دیگر

Prof. Joaquin GARCIA ALFARO is a Professor at Telecom SudParis, affiliated with the SCN department. His research focuses on cybersecurity, network security, quantum computing applications, and resilience engineering in cyber-physical systems. He has contributed to advancements in intrusion detection systems, blockchain integration in cellular networks, and privacy-preserving frameworks for IoT and healthcare. University: Telecom SudParis Key Research Areas: Cybersecurity, Quantum Computing, IoT Security, Resilience Engineering Labs: SAMOVAR laboratory His work emphasizes practical solutions for real-world challenges, including secure data provenance, digital twin implementations, and energy-efficient edge computing. Recent research explores quantum-resistant protocols and collaborative drone systems.

Hugo Paquetمشاهده پروفایل

پژوهشگر

• Probabilistic Programming
• Categorical Semantics
• Game Semantics
• +۴ مورد دیگر

Hugo Paquet is a Researcher at INRIA Paris and a member of the ANTIQUE team at École Normale Supérieure , PSL University. He completed a PhD in Computer Science (2015–2019) at the University of Cambridge under Glynn Winskel , focusing on concurrent game semantics for probabilistic programming. His postdoctoral work includes positions at LIPN, Paris (2022–2024, funded by a Marie Skłodowska-Curie Award) and University of Oxford (2020–2022). He has contributed to conferences including LICS , ESOP , FSCD , and POPL . Education : PhD in Computer Science (University of Cambridge, 2019) Research Interests : Probabilistic programming (semantics, inference algorithms, nonparametric models), categorical semantics (game semantics, concurrency models, adjunctions), combinatorial species, and 2-dimensional categories. Teaching : Category Theory (2023–2024), Bayesian Statistical Probabilistic Programming (2021–2022), Lambda-calculus and Types (2020–2021), and small-group teaching at Cambridge (Logic, Discrete Mathematics, Semantics). Awards : Marie Skłodowska-Curie Award under the Paris Region Fellowship Programme Labs : INRIA Paris, ANTIQUE team (2024–present)