World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
32
Citations
5301
World Ranking
13043
National Ranking
333

Overview

Philippe Nain is affiliated with the French Institute for Research in Computer Science and Automation (INRIA) in France. Their research primarily falls within the domain of Computer Science, with a focus on several key subfields including Artificial Intelligence, Computer Networks and Communications, Atomic and Molecular Physics, and Optics, as well as Management Information Systems and Signal Processing.

Their work extensively covers topics related to Quantum Information and Cryptography, Quantum Mechanics and Applications, and Quantum Computing Algorithms and Architecture. Additional areas of interest include Optimization and Search Problems, Advanced Queuing Theory Analysis, Network Security and Intrusion Detection, and Advanced Malware Detection Techniques.

Frequent publication venues for Philippe Nain include:

  • ACM SIGMETRICS Performance Evaluation Review
  • arXiv (Cornell University)
  • Performance Evaluation
  • ACM Transactions on Modeling and Performance Evaluation of Computing Systems
  • Queueing Systems

Notable recent papers authored or co-authored by Philippe Nain are:

  • On the exact analysis of an idealized quantum switch, 2020, Performance Evaluation
  • On the Analysis of a Multipartite Entanglement Distribution Switch, 2020, Proceedings of the ACM on Measurement and Analysis of Computing Systems
  • On the Capacity Region of Bipartite and Tripartite Entanglement Switching, 2021, ACM SIGMETRICS Performance Evaluation Review
  • Fundamental scaling laws of covert DDoS attacks, 2021, Performance Evaluation
  • On the Exact Analysis of an Idealized Quantum Switch, 2021, ACM SIGMETRICS Performance Evaluation Review

Philippe Nain frequently collaborates with several researchers including Don Towsley, Gayane Vardoyan, Saikat Guha, Nitish K. Panigrahy, and Amir Reza Ramtin.

Best Publications

  • The message delay in mobile ad hoc networks

    Robin Groenevelt;Philippe Nain;Ger Koole

  • Mobility improves coverage of sensor networks

    Benyuan Liu;Peter Brass;Olivier Dousse;Philippe Nain

  • Properties of random direction models

    P. Nain;D. Towsley;Benyuan Liu;Zhen Liu

  • A survey of TCP over ad hoc networks

    A. Al Hanbali;E. Altman;P. Nain

  • Dynamic Coverage of Mobile Sensor Networks

    Benyuan Liu;Olivier Dousse;P. Nain;D. Towsley

  • On achievable service differentiation with token bucket marking for TCP

    Sambit Sahu;Philippe Nain;Christophe Diot;Victor Firoiu

  • On optimal polling policies

    Zhen Liu;Philippe Nain

  • Analysis of TTL-based cache networks

    N. Choungmo Fofack;Philippe Nain;Giovanni Neglia;Don Towsley

  • Message delay in MANET

    Robin Groenevelt;Philippe Nain;Ger Koole

  • Performance evaluation of hierarchical TTL-based cache networks

    Nicaise Choungmo Fofack;Nicaise Choungmo Fofack;Philippe Nain;Giovanni Neglia;Don Towsley

  • Asymptotic behavior of a multiplexer fed by a long-range dependent process

    Zhen Liu;Philippe Nain;Don Towsley;Zhi Li Zhang

  • Relaying in mobile ad hoc networks: the Brownian motion mobility model

    R. Groenevelt;E. Altman;P. Nain

  • Optimal priority assignment with hard constraint

    P. Nain;K. Ross

  • Inferring network characteristics via moment-based estimators

    S. Alouf;P. Nain;D. Towsley

  • Performance of ad hoc networks with two-hop relay routing and limited packet lifetime

    Ahmad Al Hanbali;Philippe Nain;Eitan Altman

  • A simple fluid model for the analysis of the squirrel peer-to-peer caching system

    F. Clevenot;P. Nain

  • On a reduced load equivalence for fluid queues under subexponentiality

    Rajeev Agrawal;Armand M. Makowski;Philippe Nain

  • Multiclass P2P networks: Static resource allocation for service differentiation and bandwidth diversity

    Florence Clévenot-Perronnin;Philippe Nain;Keith W. Ross

  • Simple models for the performance evaluation of a class of two-hop relay protocols

    Ahmad Al Hanbali;Arzad A. Kherani;Philippe Nain

  • A retrial system with two input streams and two orbit queues

    Konstantin Avrachenkov;Philippe Nain;Uri Yechiali

  • Performance of ad hoc networks with two-hop relay routing and limited packet lifetime (extended version)

    Ahmad Al Hanbali;Philippe Nain;Eitan Altman

  • Closed-loop control with delayed information

    Eitan Altman;Philippe Nain

  • Delay and resource analysis in MANETs in presence of throwboxes

    Mouhamad Ibrahim;Ahmad Al Hanbali;Philippe Nain

  • Interchange arguments in stochastic scheduling

    Philippe Nain;Pantelis Tsoucas;Jean Walrand

Frequent Co-Authors

Don Towsley
Don Towsley University of Massachusetts Amherst
Konstantin Avrachenkov
Konstantin Avrachenkov French Institute for Research in Computer Science and Automation - INRIA
Eitan Altman
Eitan Altman French Institute for Research in Computer Science and Automation - INRIA
Saikat Guha
Saikat Guha University of Arizona
Ger Koole
Ger Koole Vrije Universiteit Amsterdam
Keith W. Ross
Keith W. Ross New York University
Kin K. Leung
Kin K. Leung Imperial College London
Benyuan Liu
Benyuan Liu University of Massachusetts Lowell
Vishal Misra
Vishal Misra Columbia University
Zhen Liu
Zhen Liu Nokia (Finland)

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring a Computer Science education in the USA opens up a variety of flexible online learning options. Many students start their journey with online associates programs in computer science, which offer foundational skills and can often be completed quickly and affordably.

For those aiming to advance their careers, pursuing one of the most valuable masters degrees can boost qualifications and open doors to in-demand tech roles. Choosing the right program is important, especially when considering cost and value.

Budget-conscious students may be interested in the list of cheap online colleges. Many reputable U.S. institutions offer accredited computer science programs at lower tuition rates, making higher education more accessible.

Finally, if your academic record isn’t perfect, don’t worry—there are will grad schools accept low gpa resources to guide you to online colleges that accept applicants with lower GPAs. This flexibility ensures that motivated students still have paths to success in the tech industry.

Best Scientists Citing Philippe Nain

Trending Scientists

Recently Published Articles