Mario Baldi is a researcher affiliated with the Polytechnic University of Turin, Italy , with significant contributions to computer networking , distributed systems , and software-defined networking . Key research themes: network function virtualization , programmable dataplanes , time-driven scheduling , and traffic analysis . Recent work focuses on RDMA-enabled compute offloading (2023) and DNN inference in network data planes (2023). Longstanding expertise in multicast routing , voice/data packet efficiency , and XML-based protocol parsing (2000–2006). Collaboration network includes Yoram Ofek , Fulvio Risso , and Han Hee Song , with 99+ publications spanning 1994–2023.
Vinayak R. Borkar is a researcher and software engineer affiliated with the University of California, Irvine, where he completed his PhD in 2016. His work focuses on big data platforms, database systems, and scalable query processing frameworks. PhD in Big Data Processing (UC Irvine, 2016) Contributions to Apache AsterixDB, Hyracks, and Pregelix Industry experience at BEA Systems (2000s) Research interests include database systems , big data management , XQuery optimization , and dataflow engines . His publications analyze scalable similarity queries, memory management, and declarative approaches to machine learning. Recent articles explore Apache AsterixDB , dataflow compilation , and graph analytics . Collaborators include Michael J. Carey and Alexander Behm.
YongChul Kwon is a researcher affiliated with the University of Washington , focusing on distributed computing, database systems, and big data optimization. His work addresses critical challenges in MapReduce frameworks, including skew management, fault tolerance, and performance efficiency. Key research contributions include SkewTune for dynamic skew mitigation in MapReduce, SnipSuggest for SQL autocompletion, and comparative analyses of Hadoop's scalability. He has published in venues like VLDB , SIGMOD , and IEEE Data Engineering Bulletin , often collaborating with Magdalena Balazinska and Bill Howe. Recent work (2013–2016) explores iterative MapReduce frameworks, Hadoop's workload evolution, and parallel processing of scientific user-defined functions. Earlier contributions (2008–2010) include fault-tolerant stream processing, clustering algorithms for astrophysics, and collaborative query management systems. His research bridges distributed systems, database engineering, and scientific computing, with implications for cloud infrastructure and large-scale data analytics.
Krzysztof Onak is the Shibulal Family Career Development Assistant Professor in the Faculty of Computing & Data Sciences at Boston University. He is actively engaged in research and teaching, with a focus on theoretical foundations of algorithms for big data and their applications in AI and machine learning. PhD, Massachusetts Institute of Technology (2010) Researcher, IBM T.J. Watson Research Center Simons Postdoctoral Fellow, Carnegie Mellon University His research interests include theoretical computer science , streaming algorithms , sublinear-time algorithms , and parallel and distributed computing models . He works on algorithmic techniques for taming big data, such as sampling, sketching, and dimensionality reduction, with applications in machine learning and artificial intelligence. His work bridges theory and practice, addressing challenges in modern data processing frameworks like MapReduce. The most recent publications highlight a strong focus on efficient graph algorithms in distributed and streaming settings, dynamic data structures , and fairness in machine learning . His work frequently appears in top-tier venues such as STOC, FOCS, SODA, and ICML, demonstrating both theoretical depth and practical relevance. Scientific awards and recognitions include: ACM ICPC World Champion Gold Medalist, International Olympiad in Informatics Krzysztof Onak advises several PhD students and postdoctoral researchers, including Esty Kelman, Dragos Ristache, Themistoklis Haris, and Zi Song Yeoh. He has secured research funding through academic appointments and fellowships, and he is actively involved in the theoretical computer science community as a program committee member and workshop organizer. He has taught courses such as Algorithmic Techniques for Taming Big Data and Algorithms for Data Science . He is involved in organizing key academic events, including the Workshop on Emerging Models of Colossal Computation (E=mc²), the Workshop on Local Algorithms (WOLA 2022), and the Simons Semesters on Algorithms for the Massive Parallel Computation Model. He also contributes to the community through SUBLINEAR.INFO, a curated list of open problems in sublinear algorithms.
Christine Morin is a Professor at INRIA - Institut National de Recherche en Informatique et en Automatique, focusing on advanced research topics in cloud computing, distributed systems, and high-performance computing. Fields of Research: Cloud Computing, Distributed Systems, Grid Computing, Virtualization, Parallel Computing, High Performance Computing, Fault Tolerance, Resource Management, Operating Systems, Autonomic Computing, Energy Efficiency Long-term Research Contributions: SLA management in cloud environments, self-adaptable systems, energy-efficient computing, distributed application deployment Her work has been particularly influential in the areas of cloud security, SLA verification, fault tolerance mechanisms, and energy-efficient computing. She has pioneered approaches to self-adaptable security monitoring in IaaS clouds and developed innovative frameworks for cloud bursting PaaS environments. Christine Morin has published extensively on topics related to: Autonomic cloud management systems like Snooze and Merkat Energy-aware resource allocation and consumption models Message logging and fault tolerance protocols Distributed application deployment under SLA constraints Virtual organization support in grid operating systems Her research has contributed significantly to the evolution of cloud computing infrastructure, particularly in the areas of security monitoring, resource management, and energy efficiency.
Mohamed F. Mokbel is a Professor at the University of Minnesota with a distinguished career in spatial databases and big spatial data management. His research spans over two decades with more than 260 publications in top-tier venues including ICDE, SIGMOD, VLDB, and GIS conferences. He has established himself as a leading researcher in trajectory data management, mobility data science, and scalable spatial processing systems. Dr. Mokbel's research interests focus on the intersection of spatial databases, big data, and machine learning. He has pioneered work in trajectory data management systems, developing frameworks like ST-Hadoop for processing spatio-temporal data at scale. His recent research explores the application of large language models to trajectory analysis, spatial data cleaning systems with spatial awareness, and innovative approaches to mobility data science. His work addresses fundamental challenges in handling massive spatial datasets while maintaining efficiency and accuracy. His publication record reveals significant trends toward integrating machine learning with spatial data management, particularly in trajectory imputation using BERT models (KAMEL system) and applying NLP techniques to trajectory analysis. Recent work shows increasing focus on urban mobility applications, privacy considerations in location data, and the development of specialized frameworks for processing different types of spatial data at scale. Dr. Mokbel has mentored numerous students who have become productive researchers in their own right, with many publications featuring students as first authors. His collaborative network is extensive, with frequent co-authorship with researchers like Walid G. Aref, Ahmed Eldawy, and Amr Magdy, indicating strong research group leadership. He has contributed significantly to the spatial database community through systems like RASED for monitoring OpenStreetMap updates, KAMEL for trajectory imputation, and Sparcle for spatial data cleaning. His work bridges theoretical database concepts with practical applications in transportation, urban planning, and location-based services.
Mohsen Lesani is an Associate Professor at the Computer Science and Engineering Department of University of California, Santa Cruz . He obtained his PhD from UCLA , MS in Artificial Intelligence from Sharif University of Technology , and BS in Software Engineering from University of Tehran . His research focuses on reliability and security of software systems , particularly concurrent and distributed systems , with recent work on secure replicated systems and distributed machine learning . NSF CAREER Award (2020) DARPA Young Faculty Award (2022) SIGPLAN Research Highlight (2019) Distinguished Paper Award at OOPSLA 2018 Best Paper Award at ISSRE 2015 His recent publications tackle challenges in automated synthesis of distributed protocols , heterogeneous replication , secure blockchain transactions , and verified RDMA-based data types . He advises PhD students Xiao Li , Eric Chan , Javad Saber-Latibari , and Tejas Mane in the Safe and Secure Software (S3) lab . He has taught courses on Distributed Systems , Parallel Programming , and Compiler Design .
Mehrdad Almasi is affiliated with the University of Luxembourg and Tarbiat Modares University, Tehran, Iran. His research focuses on Machine Learning , Data Mining , and Big Data applications. Key Research Areas : Associative classification, sentiment analysis, and scalable data processing. Technical Domains : Pattern recognition, distributed computing, and Android malware detection. Published Work : Collaborated on graphical models for database joins, large-scale classification systems, and multi-objective evolutionary algorithms.
Markus Hegland is a Professor and Head of the Centre for Mathematics and its Applications (CMA) at the Australian National University (ANU). He holds a PhD from ETH Zurich (1988) and has been affiliated with ANU since 1992, focusing on High-Performance Computing (HPC) and numerical analysis. As a Hans Fischer Senior Fellow at TUM-IAS, his research emphasizes high-dimensional problems, ill-posed systems, and data mining applications. His work bridges computational mathematics with practical domains like systems biology and spectral enhancement. Research interests include sparse grid techniques, regularization methods, and algorithm development for HPC. Notable contributions include the OPTICOM method for stable sparse grid solutions and convergence theory for variable Hilbert scales regularization. He has led projects on fault-tolerant HPC algorithms and collaborated with Fujitsu on HPC applications. Publications span numerical analysis, bioinformatics, and computational physics. His work on the chemical master equation and gyrokinetics showcases interdisciplinary impact. Currently, he explores resilient grid-based solvers and machine learning integration with HPC frameworks. No awards are explicitly listed, but his senior fellowship underscores recognition in his field. Grants and collaborations include ARC-funded research in bioinformatics and HPC resilience. His work on digital twins and algorithm optimization reflects broader interests in advanced computational modeling. He is actively involved in teaching and supervising in computational mathematics and data science at ANU.
Dr. Long Cheng was a former Researcher at the International Center for Computational Logic (ICCL) within the Faculty of Computer Science at TU Dresden. His research focused on cloud computing, big data analytics, and distributed systems, particularly in optimizing large-scale data processing, outer join operations, and semantic web technologies. He contributed to projects involving parallel programming models like X10, MapReduce frameworks, and efficient data compression techniques for RDF datasets. Cheng collaborated with the Knowledge-Based Systems research group, addressing challenges in scalable systems, high-throughput indexing, and parallel reasoning under non-monotonic logics. His work emphasized performance optimization in distributed environments, including skew handling, data redistribution strategies, and algorithm scalability for large datasets. Publications span topics such as outer join evaluation in cloud environments, efficient compression of semantic web data, and high-performance query execution over distributed systems. His research bridges theoretical computational logic with practical applications in big data and cloud infrastructure.
Anish Das Sarma is a researcher affiliated with Google, USA , specializing in uncertain data management, MapReduce algorithms, and knowledge graph systems. He earned a PhD from Stanford University in 2010 under the supervision of Jennifer Widom and Alon Halevy, with a dissertation on "Managing Uncertain Data." His career spans collaborations with leading institutions, focusing on scalable data integration, social choice theory, and machine learning applications in scholarly knowledge organization. PhD in Computer Science, Stanford University (2010) Key collaborations: Stanford, Google Research, NFDI4DataScience His research interests intersect uncertain data modeling , MapReduce optimization , and large language model applications for scientific synthesis. Recent work includes FAIR data frameworks, ontology learning, and clinical entity linking. Article trends highlight his evolution from foundational database systems (2004-2015) to modern applications of LLMs in scholarly communication (2023-2024). Key areas: scalable algorithms, research data management, and ethical AI.
