World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
32
Citations
4740
World Ranking
13122
National Ranking
337

Overview

Jan Ramon is a researcher affiliated with the French Institute for Research in Computer Science and Automation (INRIA) in France. Their work spans multiple domains within computer science, with a strong focus on privacy-preserving technologies and cryptography.

Ramon's research portfolio includes contributions to several subfields, notably:

  • Artificial Intelligence
  • Computational Theory and Mathematics
  • Molecular Biology
  • Oncology
  • Statistics and Probability

Their main research topics consist of:

  • Privacy-Preserving Technologies in Data
  • Cryptography and Data Security
  • Internet Traffic Analysis and Secure E-voting
  • Complexity and Algorithms in Graphs
  • Algorithms and Data Compression
  • Semigroups and Automata Theory
  • DNA and Biological Computing

Jan Ramon has published extensively in leading scientific venues. Frequent publication outlets include:

  • arXiv (Cornell University)
  • Zenodo (CERN European Organization for Nuclear Research)
  • Machine Learning
  • Journal of Controlled Release
  • HAL (Le Centre pour la Communication Scientifique Directe)

Some recent papers authored or co-authored by Ramon are:

  • "An accurate, scalable and verifiable protocol for federated differentially private averaging," 2022, Machine Learning
  • "Naive Infinite Enumeration of Context-free Languages in Incremental Polynomial Time," 2020, Lirias (KU Leuven)
  • "Private Sampling with Identifiable Cheaters," 2023, Proceedings on Privacy Enhancing Technologies
  • "An Accurate, Scalable and Verifiable Protocol for Federated Differentially Private Averaging," 2020, arXiv (Cornell University)
  • "Immunogenic cell death as interplay between physical anticancer modalities and immunotherapy," 2025, Journal of Controlled Release

Ramon collaborates frequently with several other researchers, including:

  • César Sabater
  • Florian Hahn
  • Peter Andreas
  • Aurélien Bellet
  • Stefaan C. De Smedt

Their research encompasses both theoretical and applied aspects, engaging with complex algorithms and privacy protocols as well as interdisciplinary areas like molecular biology and oncology.

Best Publications

  • Top-Down Induction of Clustering Trees

    Hendrik Blockeel;Luc De Raedt;Jan Ramon

  • Expressivity versus efficiency of graph kernels

    Jan Ramon;Thomas Gaertner

  • Multi instance neural networks

    Jan Ramon;Luc De Raedt

  • Improving the efficiency of inductive logic programming through the use of query packs

    Hendrik Blockeel;Luc Dehaspe;Bart Demoen;Gerda Janssens

  • Cheaper faster drug development validated by the repositioning of drugs against neglected tropical diseases

    Kevin Stewart Williams;Elizabeth Bilsland;Andrew Charles Sparkes;Wayne Aubrey

  • Machine learning techniques to examine large patient databases.

    Geert Meyfroidt;Fabian Güiza;Jan Ramon;Maurice Bruynooghe

  • A new ensemble coevolution system for detecting HIV-1 protein coevolution

    Guangdi Li;Kristof Theys;Jens Verheyen;Andrea Clemencia Pineda-Peña;Andrea Clemencia Pineda-Peña

  • Frequent subgraph mining in outerplanar graphs

    Tamás Horváth;Jan Ramon;Stefan Wrobel

  • Hierarchical multi-classification

    Hendrik Blockeel;Maurice Bruynooghe;Sašo Džeroski;Jan Ramon

  • A polynomial time computable metric between point sets

    Jan Ramon;Maurice Bruynooghe

  • Speeding Up Relational Reinforcement Learning through the Use of an Incremental First Order Decision Tree Learner

    Kurt Driessens;Jan Ramon;Hendrik Blockeel

  • Mining data from intensive care patients

    Jan Ramon;Daan Fierens;Fabián Güiza;Geert Meyfroidt

  • Transfer Learning in Reinforcement Learning Problems Through Partial Policy Recycling

    Jan Ramon;Kurt Driessens;Tom Croonenborghs

  • Relational instance based regression for relational reinforcement learning

    Kurt Driessens;Jan Ramon

  • Monte-Carlo Tree Search in Poker Using Expected Reward Distributions

    Guy Broeck;Kurt Driessens;Jan Ramon

  • Relational instance based regression for relational reinforcement learning

    Kurt Driessens;Jan Ramon

  • Graph kernels and Gaussian processes for relational reinforcement learning

    Kurt Driessens;Jan Ramon;Thomas Gärtner

  • Logical Bayesian Networks and Their Relation to Other Probabilistic Logical Models.

    Daan Fierens;Hendrik Blockeel;Maurice Bruynooghe;Jan Ramon

  • Logical bayesian networks and their relation to other probabilistic logical models

    Daan Fierens;Hendrik Blockeel;Maurice Bruynooghe;Jan Ramon

  • A Framework for Defining Distances Between First-Order Logic Objects

    Jan Ramon;Maurice Bruynooghe

  • Machine learning applications in proteomics research: How the past can boost the future

    Pieter Kelchtermans;Pieter Kelchtermans;Wout Bittremieux;Kurt De Grave;Sven Degroeve

  • Executing Query Packs in ILP

    Hendrik Blockeel;Luc Dehaspe;Bart Demoen;Gerda Janssens

  • Frequent subgraph mining in outerplanar graphs

    Tamás Horváth;Jan Ramon;Stefan Wrobel

Frequent Co-Authors

Luc De Raedt
Luc De Raedt KU Leuven
Karl Tuyls
Karl Tuyls DeepMind (United Kingdom)
Lennart Martens
Lennart Martens Ghent University
Anne-Mieke Vandamme
Anne-Mieke Vandamme Rega Institute for Medical Research
Toon Calders
Toon Calders University of Antwerp
Stefan Wrobel
Stefan Wrobel University of Bonn
Ross D. King
Ross D. King University of Manchester

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 computer science in the USA opens the door to many flexible education options and dynamic career paths. For those eager to advance quickly, consider enrolling in one of the fastest masters degree online programs. These accelerated courses allow you to earn your credential in less time, making it easier to pivot into higher-level roles.

If you’re focused on long-term career prospects, look for one of the most valuable masters degrees in computer science or a related field. These in-demand qualifications often lead to high salaries and better job stability in tech-driven industries.

For those just starting out or seeking a budget-friendly entry into the field, online associates programs offer foundational IT and coding knowledge, often completed in just two years.

Affordability is also a key concern for many students. To keep costs low while pursuing your tech education, research the cheapest online college options that provide recognized computer science degrees.

Best Scientists Citing Jan Ramon

Trending Scientists