World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
38
Citations
6199
World Ranking
10227
National Ranking
179

Overview

Kurt Stockinger is affiliated with the Zurich University of Applied Sciences in Switzerland and has contributed extensively to the field of computer science, with a focus on artificial intelligence and related subfields.

Their research spans several areas, including:

  • Artificial Intelligence
  • Molecular Biology
  • Computer Networks and Communications
  • Information Systems and Management
  • Management Science and Operations Research

Main topics of their scientific work include:

  • Topic Modeling
  • Semantic Web and Ontologies
  • Natural Language Processing Techniques
  • Biomedical Text Mining and Ontologies
  • Scientific Computing and Data Management
  • Data Quality and Management
  • Quantum Computing Algorithms and Architecture

They have published a number of papers in various venues, highlighting recent works such as:

  • Entity matching with transformer architectures - a step forward in data integration (2020, ZHAW Digital Collection)
  • Querying knowledge graphs in natural language (2021, Journal Of Big Data)
  • Experimental Evaluation of Quantum Machine Learning Algorithms (2023, IEEE Access)
  • ScienceBenchmark: A Complex Real-World Benchmark for Evaluating Natural Language to SQL Systems (2023, Proceedings of the VLDB Endowment)
  • Bio-SODA: Enabling Natural Language Question Answering over Knowledge Graphs without Training Data (2021, arXiv (Cornell University))

Their publication record includes frequent appearances in the following venues:

  • arXiv (Cornell University)
  • ZHAW Digital Collection
  • IEEE Access
  • Proceedings of the VLDB Endowment
  • Journal Of Big Data

Kurt Stockinger collaborates recurrently with several coauthors, including:

  • Tarcisio Mendes de Farias
  • Martín Braschler
  • Catherine Kosten
  • Ellery Smith
  • Claude Lehmann

Best Publications

  • Data Management in an International Data Grid Project

    Wolfgang Hoschek;Francisco Javier Jaén-Martínez;Asad Samar;Asad Samar;Heinz Stockinger;Heinz Stockinger

  • Giggle: A Framework for Constructing Scalable Replica Location Services

    Ann Chervenak;Ewa Deelman;Ian Foster;Leanne Guy

  • Optorsim: A Grid Simulator for Studying Dynamic Data Replication Strategies

    William H. Bell;David G. Cameron;A. Paul Millar;Luigi Capozza

  • Evaluation of an economy-based file replication strategy for a data grid

    W.H. Bell;D.G. Cameron;R. Carvajal-Schiaffino;A.P. Millar

  • Simulation of Dynamic Grid Replication Strategies in OptorSim

    William H. Bell;David G. Cameron;Luigi Capozza;A. Paul Millar

  • FastBit: interactively searching massive data

    K. Wu;S. Ahern;E. W. Bethel;E. W. Bethel;J. Chen

  • Evaluating scheduling and replica optimisation strategies in OptorSim

    D.G. Cameron;R. Carvajal-Schiaffino;A.P. Millar;C. Nicholson

  • A comparative survey of recent natural language interfaces for databases

    Katrin Affolter;Kurt Stockinger;Abraham Bernstein

  • Replica Management in Data Grids

    Leanne Guy;Peter Kunszt;Erwin Laure;Heinz Stockinger

  • Models for replica synchronisation and consistency in a data grid

    D. Dullmann;W. Hoschek;J. Jaen-Martinez;B. Segal

  • Query-driven visualization of large data sets

    K. Stockinger;J. Shalf;K. Wu;E.W. Bethel

  • Towards an Economy-Based Optimisation of File Access and Replication on a Data Grid

    M. Carman;F. Zini;L. Serafini;K. Stockinger

  • Analysis of Scheduling and Replica Optimisation Strategies for Data Grids Using OptorSim

    D. G. Cameron;A. P. Millar;C. Nicholson;R. Carvajal-Schiaffino

  • SODA: generating SQL for business users

    Lukas Blunschi;Claudio Jossen;Donald Kossmann;Magdalini Mori

  • HDF5-FastQuery: Accelerating Complex Queries on HDF Datasets using Fast Bitmap Indices

    L. Gosink;J. Shalf;K. Stockinger;K. Wu

  • Analyses of multi-level and multi-component compressed bitmap indexes

    Kesheng Wu;Arie Shoshani;Kurt Stockinger

  • Breaking the Curse of Cardinality on Bitmap Indexes

    Kesheng Wu;Kurt Stockinger;Arie Shoshani

  • Bitmap Indices for Data Warehouses

    Kurt Stockinger;Kesheng Wu

  • Optimizing candidate check costs for bitmap indices

    Doron Rotem;Kurt Stockinger;Kesheng Wu

  • Enabling Real-Time Querying of Live and Historical Stream Data

    F. Reiss;K. Stockinger;Kesheng Wu;A. Shoshani

  • SODA: Generating SQL for Business Users

    Lukas Blunschi;Claudio Jossen;Donald Kossman;Magdalini Mori

Frequent Co-Authors

Kesheng Wu
Kesheng Wu Lawrence Berkeley National Laboratory
Arie Shoshani
Arie Shoshani Lawrence Berkeley National Laboratory
John Shalf
John Shalf Lawrence Berkeley National Laboratory
Christophe Dessimoz
Christophe Dessimoz University College London
Scott W. Campbell
Scott W. Campbell University of Michigan–Ann Arbor
Marc Robinson-Rechavi
Marc Robinson-Rechavi University of Lausanne
Luciano Serafini
Luciano Serafini Fondazione Bruno Kessler
Sihem Amer-Yahia
Sihem Amer-Yahia Grenoble Alpes University
Joseph M. Hellerstein
Joseph M. Hellerstein University of California, Berkeley
Donald Kossmann
Donald Kossmann Microsoft (United States)

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 online education options can help you quickly advance your computer science career. Many professionals begin by earning 1 year associate degree programs online, which offer foundational knowledge and fast entry into tech roles.

Looking for credentials with an immediate impact? Many certifications that pay well can be earned online, focusing on high-demand skills like coding, networking, and cloud computing. These are ideal for those wanting to boost their salary or change fields quickly.

For rapid career progression, consider the shortest masters degree programs available online, which can be completed in as little as one year, allowing you to move ahead without a long time commitment.

Finally, the best masters degree to get will combine technical expertise with current industry needs, improving your job prospects in fields like data science, AI, or cybersecurity.

Best Scientists Citing Kurt Stockinger

Trending Scientists