World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
32
Citations
4547
World Ranking
13149
National Ranking
98

Overview

Philippas Tsigas is affiliated with Chalmers University of Technology in Sweden. Their research primarily spans the fields of Computer Science and Engineering, with a focus on several notable subfields including Computer Networks and Communications, Artificial Intelligence, Computer Vision and Pattern Recognition, Hardware and Architecture, and Electrical and Electronic Engineering.

Their main topics of work cover:

  • Distributed systems and fault tolerance
  • Stochastic Gradient Optimization Techniques
  • Advanced Database Systems and Queries
  • Parallel Computing and Optimization Techniques
  • Robotics and Sensor-Based Localization
  • Remote Sensing and LiDAR Applications
  • Cloud Computing and Resource Management

Philippas Tsigas has contributed to various research papers published in respected venues over recent years. Selected papers include:

  • "MAD-C: Multi-stage Approximate Distributed Cluster-combining for obstacle detection and localization," published in 2020 in the Journal of Parallel and Distributed Computing
  • "STRETCH: Virtual Shared-Nothing Parallelism for Scalable and Elastic Stream Processing," published in 2022 in IEEE Transactions on Parallel and Distributed Systems
  • "Concurrent linearizable nearest neighbour search in LockFree-kD-tree," published in 2021 in Theoretical Computer Science
  • "pi-Lisco," published in 2022 in the Proceedings of the 37th ACM/SIGAPP Symposium on Applied Computing
  • "PARMA-CC: A family of parallel multiphase approximate cluster combining algorithms," published in 2023 in the Journal of Parallel and Distributed Computing

Frequently publishing in venues such as arXiv (Cornell University), the Journal of Parallel and Distributed Computing, IEEE Transactions on Parallel and Distributed Systems, Theoretical Computer Science, and the Proceedings of the ACM/SIGAPP Symposium on Applied Computing, the researcher's work is situated within both theoretical and applied areas of computing.

Throughout their career, Philippas Tsigas has collaborated regularly with several coauthors, including:

  • Marina Papatriantafilou
  • Vincenzo Gulisano
  • Amir Keramatian
  • Hannaneh Najdataei
  • Ivan Walulya

Best Publications

  • Fast and lock-free concurrent priority queues for multi-thread systems

    Håkan Sundell;Philippas Tsigas

  • A Taxonomy of 3D Occlusion Management for Visualization

    N. Elmqvist;P. Tsigas

  • A simple, fast and scalable non-blocking concurrent FIFO queue for shared memory multiprocessor systems

    Philippas Tsigas;Yi Zhang

  • GPU-Quicksort: A practical Quicksort algorithm for graphics processors

    Daniel Cederman;Philippas Tsigas

  • A Practical Quicksort Algorithm for Graphics Processors

    Daniel Cederman;Philippas Tsigas

  • ContikiSec: A Secure Network Layer for Wireless Sensor Networks under the Contiki Operating System

    Lander Casado;Philippas Tsigas

  • PEPPHER: Efficient and Productive Usage of Hybrid Computing Systems

    S. Benkner;S. Pllana;J. L. Traff;P. Tsigas

  • On dynamic load balancing on graphics processors

    Daniel Cederman;Philippas Tsigas

  • A simple, fast parallel implementation of Quicksort and its performance evaluation on SUN Enterprise 10000

    P. Tsigas;Yi Zhang

  • Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting

    A. Gidenstam;M. Papatriantafilou;H. Sundell;P. Tsigas

  • Scalable and lock-free concurrent dictionaries

    Håkan Sundell;Philippas Tsigas

  • Lock-free and practical doubly linked list-based deques using single-word compare-and-swap

    Håkan Sundell;Philippas Tsigas

  • CiteWiz: a tool for the visualization of scientific citation networks

    Niklas Elmqvist;Philippas Tsigas

  • Lock-free deques and doubly linked lists

    Håkan Sundell;Philippas Tsigas

  • Mitigating Distributed Denial of Service Attacks in Multiparty Applications in the Presence of Clock Drifts

    Zhang Fu;M. Papatriantafilou;P. Tsigas

  • Employing dynamic transparency for 3D occlusion management: design issues and evaluation

    Niklas Elmqvist;Ulf Assarsson;Philippas Tsigas

  • Causality visualization using animated growing polygons

    N. Elmqvist;P. Tsigas

  • A Taxonomy of 3D Occlusion Management Techniques

    N. Elmqvist;P. Tsigas

  • Evaluating the performance of non-blocking synchronization on shared-memory multiprocessors

    Philippas Tsigas;Yi Zhang

  • Integrating non-blocking synchronisation in parallel applications: performance advantages and methodologies

    Philippas Tsigas;Yi Zhang

  • DataMeadow: A Visual Canvas for Analysis of Large-Scale Multivariate Data

    N. Elmqvist;J. Stasko;P. Tsigas

Frequent Co-Authors

Niklas Elmqvist
Niklas Elmqvist University of Maryland, College Park
Paul G. Spirakis
Paul G. Spirakis University of Liverpool
Shlomi Dolev
Shlomi Dolev Ben-Gurion University of the Negev
Dimitrios Soudris
Dimitrios Soudris National Technical University of Athens
Paul M. B. Vitányi
Paul M. B. Vitányi Centrum Wiskunde & Informatica
Peter Sanders
Peter Sanders Karlsruhe Institute of Technology
Eduardo Tovar
Eduardo Tovar Instituto Superior de Engenharia do Porto
Naveen Garg
Naveen Garg Indian Institute of Technology Delhi
Michalis Polychronakis
Michalis Polychronakis Stony Brook University
Federico Maggi
Federico Maggi University of Sydney

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 study options in Computer Science opens up flexible and valuable pathways for different backgrounds. For those considering higher education, there are many graduate degrees that are worth it, providing advanced skills and better career prospects. These programs can help you specialize and stand out in competitive fields like data science, AI, and software engineering.

If you’re just starting out, online associate degree programs offer a flexible and affordable way to build foundational knowledge in computer science and IT. Many students use these programs as stepping stones toward bachelor’s degrees or immediate entry-level tech roles.

Concerns about cost are common. Fortunately, there are numerous most affordable online colleges offering accredited computer science degrees without a hefty price tag, making quality education accessible from anywhere.

Don’t let academic setbacks hold you back—several college that accepts low gpa provide second chances for motivated learners who may not meet traditional GPA requirements but are eager for a fresh start in tech.

Best Scientists Citing Philippas Tsigas

Trending Scientists

Recently Published Articles