Find Academic Supervisors

• Distributed/Parallel Computing
• Information Visualization
• Fault-Tolerant Communication Mechanisms
• +4 more

Philippas Tsigas is a Professor at the Department of Computer Science and Engineering at Chalmers University of Technology. He leads the Distributed Computing and Systems Research Group and has held roles as co-leader of research initiatives such as the PEPPHER project. His research spans distributed/parallel computing, information visualization, and fault-tolerant communication mechanisms. He has supervised numerous PhD students, including Yi Zhang, Håkan Sundell, and Farnaz Moradi. Research interests include lock-free data structures, multicore algorithms, secure network services, and visualization tools like Lydian and DataMeadow. Notable awards include Best Paper Awards at IPDPS 2003 and SNS 2012. His work has been published in top venues like IEEE Transactions on Parallel and Distributed Systems and ACM Journal of Experimental Algorithmics. Awards highlight contributions to lock-free algorithms and network modeling. Students have contributed to projects like NBmalloc (memory reclamation) and GPU Quicksort. Collaborations with institutions like SSF and VR have supported his research. Tsigas is also involved in teaching distributed systems and mentoring early-career researchers.

Reynald AffeldtView profile

Visiting Professor

• Formal Verification
• Coq Proof Assistant
• Monadic Equational Reasoning
• +7 more

Reynald Affeldt is a Chief Senior Research Scientist at AIST (National Institute of Advanced Industrial Science and Technology, Japan) and a Visiting Professor at NAIST (Nara Institute of Science and Technology). His work focuses on formal verification of software using logic and the Coq proof-assistant, with notable contributions to monadic equational reasoning, probabilistic programming, and robotics applications. His research spans multiple domains, including Monadic effects and equational reasoning Probabilistic and nondeterministic programming Information theory and error-correcting codes 3D geometry for robotics Recent publications highlight his efforts in extending monadic reasoning with transformers and formalizing probabilistic semantics in Coq. He has contributed to various conferences, notably as a committee member for CPP and TyDe tracks, and as a program chair for APLAS-related events. His work includes applications to OCaml, imperative language semantics, and algorithm verification (e.g., n-queens, quicksort).

KOŠŤÁL, IgorView profile

Assistant Professor

• Distributed Technologies
• Parallelization of Desktop and Distributed Applications
• .NET Remoting
• +3 more

Igor Košťál is an Assistant Professor at the Department of Applied Informatics within the Faculty of Economic Informatics at the University of Economics in Bratislava . His research focuses on Distributed Technologies , Parallelization of Applications , and Data Structure Optimization , particularly in the context of .NET frameworks and industrial robotics. University: University of Economics in Bratislava School: Faculty of Economic Informatics Department: Department of Applied Informatics Academic Rank: Assistant Professor Košťál's work emphasizes software performance testing , with publications analyzing execution efficiency in .NET applications using parallel programming , Dijkstra's algorithm , and symbol table implementations . His recent research explores modern UI development in mobile applications and algorithm optimization for industrial robotics. Key trends in his 15 most recent articles (2014-2022) include: Performance analysis of parallel and sequential algorithms in .NET environments Optimization of data structures (arrays, linked lists, skip lists) for search efficiency Integration of asynchronous methods in WCF services and clients Testing precision in KUKA welding robots through structured data extraction

David M W PowersView profile

Professor

• Artificial Intelligence
• Cognitive Science
• Robotics
• +4 more

Professor David M W Powers is a leading academic at Flinders University of South Australia, holding the Professor of Computer and Cognitive Science position. He serves as Visiting Professor at Beijing University of Technology and contributes extensively to editorial and program committees, including as Editor-in-Chief of Springer's Cognitive Science and Technology series. PhD in Computational Psycholinguistics (UNSW) Founding President of ACL SIGNLL and CoNLL conference series Recipient of 15+ major research grants including multiple ARC and NSF awards His research spans Artificial Intelligence, Cognitive Science, Robotics, and Biomedical Engineering with a focus on: Embodied Conversational Agents Brain-Computer Interfaces Parallel Logic Programming Evaluation Metrics in Machine Learning Assistive Technologies for disability support AI in Health and Education Recent publications emphasize optimization algorithms for autonomous systems (AUV routing models) and evaluation methodology advancements . Scientific awards include the Loebner Prize Bronze Medal and multiple ARC grants totaling over $30M in funding. Teaching roles include coordination of courses in Artificial Intelligence, Computational Intelligence, and Human-Computer Interaction . Professional engagements span leadership roles in ACL, ACM, and IEEE, with significant industry collaboration through startups like YourAmigo Pty Ltd.

David PenmanView profile

Senior Lecturer

• Probabilistic Combinatorics
• Random Graphs
• Paley Graphs
• +5 more

David Penman is a Senior Lecturer at the University of Essex's School of Mathematics, Statistics and Actuarial Science (SMSAS). He holds a first degree and Part III Mathematics from Cambridge, followed by an M.Sc. and Ph.D. in probability from Sheffield University. His research focuses on probabilistic combinatorics, random graphs, additive combinatorics, and graph theory, with notable work on Paley graphs and fixed point polynomials of permutation groups. He has supervised eight research students, including six Ph.D. candidates, and currently serves as Editor of the British Combinatorial Bulletin. Education : Bachelor's and Part III (Master's equivalent) in Mathematics, University of Cambridge M.Sc. and Ph.D. in Probability (random graphs), University of Sheffield Research Interests : Probabilistic combinatorics with correlation structures Paley graphs and pseudo-random graphs Extremal Ramsey graphs and poset analysis Quicksort algorithms and sandpile group dynamics Professional Roles : Deputy Dean (Education), Faculty of Science and Health (2013–2019) Editor of the British Combinatorial Bulletin Teaching : Current module: Graph Theory (MA314). Publications : Over 10 peer-reviewed articles in journals like Discrete Mathematics , Acta Arithmetica , and Electronic Journal of Combinatorics . His work bridges theoretical mathematics and applied combinatorics, with contributions to additive number theory and algorithmic analysis. Collaborations include projects on large deviations in random graphs and fixed point polynomials in permutation groups.

Pamela E. HarrisView profile

Professor

• Algebraic Combinatorics
• Representation Theory
• Graph Theory
• +4 more

Pamela E. Harris is a Professor of Mathematics in the Department of Mathematical Sciences at the University of Wisconsin-Milwaukee. She is also a cohost of the podcast Mathematically Uncensored and President and co-founder of Lathisms: Latinxs and Hispanics in the Mathematical Sciences. Education: PhD in Mathematics (2012), University of Wisconsin-Milwaukee; M.S. in Mathematics (2008), University of Wisconsin-Milwaukee; B.S. in Mathematics (2005), Marquette University; Associate Degrees in Sciences and Liberal Arts (2003), Milwaukee Area Technical College. Her research focuses on algebraic combinatorics, particularly representation theory of Lie algebras, with applications to parking functions, graph theory, and discrete mathematics. She is a leading advocate for diversity, equity, and inclusion in mathematics, mentoring underrepresented students and co-organizing symposia for SACNAS and the American Mathematical Society. Dr. Harris has authored over 65 peer-reviewed articles and coauthored books such as Asked And Answered: Dialogues On Advocating For Students of Color in Mathematics and Practices and Policies: Advocating for Students of Color in Mathematics . Her work includes developing community agreements and DEI frameworks for academic settings. Scientific Awards: MAA Deborah and Franklin Tepper Haimo Award (2023), MAA Northeast Section Award (2020), MAA Henry L. Alder Award (2019), Council on Undergraduate Research Mentor Award (2019), Karen Uhlenbeck EDGE Fellow (2020). She actively engages in promoting community-building initiatives and has contributed to national dialogues on mentorship, equity, and the intersection of mathematics with social justice.

Michel SchellekensView profile

Professor

• Artificial Intelligence
• Data Analytics
• Algorithmics
• +2 more

Michel Schellekens is Professor at University College Cork's School of Computer Science and Information Technology, specializing in Artificial Intelligence, Data Analytics, and Algorithmics. His research develops mathematical frameworks for complexity analysis, including quasi-metric spaces and entropy-based approaches for algorithm evaluation. Recent work focuses on low-power computing designs, reversible computing principles, and static analysis methods for energy-efficient software and hardware systems. He maintains collaborations through the Complex and Adaptive Systems Laboratory (CASL).

Ralph NeiningerView profile

Professor

• Probability Theory
• Algorithms
• Stochastic Analysis
• +3 more

Ralph Neininger is a Professor at the Department of Computer Science and Mathematics, Goethe University Frankfurt. His research focuses on Probability Theory, Algorithms, Stochastic Analysis, and Data Structures, with a particular emphasis on the analysis of randomized algorithms and combinatorial structures. Key research areas: Randomized algorithms, stochastic processes, data structures, and distributional analysis. Recent publications address complexity fluctuations in algorithms, analysis of satisfiability problems, and probabilistic models for trees and urns. His methodological work leverages advanced probabilistic techniques to derive limit theorems and convergence rates for algorithms. Though no scientific awards are explicitly mentioned, his extensive publication record underscores significant contributions to theoretical computer science and applied probability. He has not been listed with advisees or students in the provided materials.