جست‌وجوی استاد و پژوهشگر

Daniel Dominic Kaplan Sleatorمشاهده پروفایل

استاد

• Algorithms
• Data Structures
• Theoretical Computer Science
• +۵ مورد دیگر

Daniel Dominic Kaplan Sleator is a Professor of Computer Science at Carnegie Mellon University's School of Computer Science. He maintains an office in the Gates-Hillman Center (7205 Gates-Hillman) and teaches various courses in algorithms and theoretical computer science. Professor Sleator's research spans several areas of theoretical computer science and algorithms. His primary interests include: Algorithms and Data Structures Amortized Analysis and Competitive Analysis Persistent and Self-Adjusting Data Structures Computational Geometry and Combinatorial Optimization Combinatorial Game Theory and Mathematical Games Music Analysis using Computational Methods His extensive publication record shows a consistent focus on efficient data structures and algorithms. Over the years, his work has evolved from foundational data structures like splay trees and skew heaps to applications in diverse areas such as music analysis and combinatorial games. A notable trend in his work is the development of self-adjusting data structures that achieve excellent amortized performance without maintaining explicit structural constraints. His papers on splay trees, skew heaps, and persistent data structures have become classics in the field. Professor Sleator has made significant contributions across multiple domains of computer science. His work on competitive algorithms for paging and list update problems has been particularly influential, establishing fundamental results in online algorithms. His research extends beyond traditional computer science into interdisciplinary areas like computational music theory, demonstrating the broad applicability of algorithmic thinking. He teaches a variety of courses including Algorithms 15-451/651, Competition Programming 15-295, and specialized topics like mathematical games.

• Database Management Systems
• Self-Driving Database Architectures
• Transaction Processing Systems
• +۴ مورد دیگر

Andy Pavlo is an Associate Professor with Indefinite Tenure in the Computer Science Department at Carnegie Mellon University's School of Computer Science. He is an active member of the CMU Database Group and the Parallel Data Laboratory, where he leads research in database management systems with a focus on self-driving architectures, transaction processing, and large-scale analytics. His work bridges academic research and industry applications through projects like NoisePage, OtterTune (which he co-founded and served as CEO before it ceased operations), and Peloton. Dr. Pavlo's research interests span database management systems with particular emphasis on autonomous database architectures that can self-tune and optimize without human intervention. His work explores transaction processing systems that can handle high-throughput workloads while maintaining consistency, and large-scale data analytics techniques that efficiently process massive datasets. He has made significant contributions to query optimization, database extensibility, and automatic database tuning using machine learning techniques. His recent work on database extensibility revealed critical issues in PostgreSQL's extension ecosystem, showing that approximately 16% of extensions are incompatible with at least one other extension due to API violations and memory errors. His research output demonstrates a consistent focus on practical database systems challenges, with recent publications examining database extensibility, user-defined function optimization, and the cyclical nature of database research. The articles show a strong trend toward making database systems more autonomous, with increasing integration of machine learning techniques for automatic tuning and optimization. His work often combines deep theoretical analysis with practical implementation in open-source systems. Dijkstra Award 2024 for contributions to database systems research Dr. Pavlo actively mentors graduate students, with current advisees including Wan Shen Lim, William Zhang, and Sam Arch (co-advised with Todd Mowry). His former students have gone on to successful careers in both industry and academia. He has secured significant research funding through CMU's affiliate program with major database companies including ClickHouse, DataStax, dbt, Firebolt, MotherDuck, RelationalAI, SingleStore, Spiral, PingCAP/TiDB, Yellowbrick, and Yugabyte. His research is supported by these industry partnerships and likely includes NSF funding given his active participation in the database research community. At CMU, Dr. Pavlo leads the Database Group and organizes several seminar series including "SQL or Death," "Database Building Blocks," and "ML⇄DB Technical Talks." These seminars bring together researchers and practitioners to discuss cutting-edge developments in database systems. He also runs a summer research internship program that has attracted students for multiple consecutive years, indicating a strong research group with ongoing projects and funding.

Anand V Natarajanمشاهده پروفایل

استادیار

• Quantum Information Theory
• Quantum Complexity Theory
• Nonlocality and Bell Inequalities
• +۳ مورد دیگر

Anand V Natarajan is the ITT Career Development Professor in Computer Technology and Assistant Professor in the Department of Electrical Engineering and Computer Science (EECS) at MIT, with affiliation to the Computer Science and Artificial Intelligence Laboratory (CSAIL). He holds a PhD in Physics from MIT (2018), advised by Aram Harrow, and previously served as a postdoc at Caltech's Institute for Quantum Information and Matter. His research focuses on theoretical quantum information, emphasizing quantum complexity theory (e.g., MIP* and QMA(2) classes), nonlocality (Bell inequalities, nonlocal games), and semidefinite programming hierarchies. He teaches courses such as Quantum Cryptography, Quantum Systems Engineering, and Introduction to Algorithms at MIT. Notable contributions include resolving the MIP* = RE problem and the FOCS 2019 Best Paper Award for NEEXP ⊆ MIP*. He advises PhD students in quantum computing topics and collaborates extensively on quantum verification protocols and entanglement testing.

Nikolaos Tziavelisمشاهده پروفایل

استادیار

• Database Systems
• Database Theory
• Query Processing and Optimization
• +۳ مورد دیگر

Nikolaos Tziavelis is an Assistant Professor in the Department of Computer Science and Engineering at Basking Engineering, University of California, Santa Cruz. His research bridges theoretical and practical aspects of database systems, focusing on improving real-world data processing through novel algorithmic solutions. Education: Ph.D. from Northeastern University (advised by Mirek Riedewald and Wolfgang Gatterbauer) Diploma from National Technical University of Athens, Greece Research Interests: Data Management Database Theory Query Processing and Optimization Algorithms for Big Data Integration of Machine Learning with Database Systems Publication Trends: His work emphasizes ranked enumeration, join algorithms, and query optimization, with applications in responsive database systems and machine learning integration. Key themes include theoretical foundations, practical system improvements, and algorithmic efficiency for complex data processing tasks. Scientific Awards: 2022 Google PhD Fellowship PODS 2021 Best of Recognition 2023 VLDB PhD Workshop Best Paper Award 2024 Khoury Research Award from Northeastern University Service: He has served on program committees for major conferences including SIGMOD, VLDB, PODS, EDBT, ICDE, and Northeast Database Day.

• Graph Analytics
• Graph Mining
• Graph Algorithms
• +۳ مورد دیگر

Dr. Lijun Chang is an Associate Professor in the School of Computer Science at the University of Sydney. He holds an ARC Future Fellowship (2019–2022) and an ARC DECRA Fellowship (2015–2017). Previously, he was at the University of New South Wales. His research focuses on graph analytics, mining, algorithms, and network science. He teaches courses like INFO5011 (Competitive Programming), COMP5313 (Large Scale Networks), and COMP9120 (Database Management Systems), and coaches the USYD Programming Competition Teams. Education: B.Eng. in Computer Science & Technology from Renmin University of China; PhD from the Chinese University of Hong Kong. Research highlights include scalable graph processing systems (e.g., ScaleG), densest subgraph detection, and graph similarity search. He leads projects funded by ARC grants such as 'Advanced Search of Cohesive Subgraphs in Big Graphs' (2018) and 'Directionality-Aware Cohesive Subgraph Search' (2022). His work emphasizes efficient algorithms for large-scale networks and graph databases. Awards : ARC Future Fellow, ARC DECRA Fellow Students : Yu KONG, Rashmika MATHTHAKA GAMAGE, Mouyi XU Labs/Teams : Focuses on graph algorithms and systems research, contributing to open-source tools and large-scale network analysis.

Chenhao Maمشاهده پروفایل

استادیار

• Graph Computing
• Data Mining
• Database Systems
• +۳ مورد دیگر

Dr. Chenhao Ma is an Assistant Professor at the School of Data Science , The Chinese University of Hong Kong, Shenzhen , where he works on large-scale data management and data mining. Previously, he was a Postdoctoral Fellow at the University of Hong Kong (2021–2022) and earned his PhD in Computer Science from the University of Hong Kong (2021) and B.Eng. from Shandong University (2017). Current research focuses on graph computing (dense subgraph discovery, motif analysis, graph learning), AI+DB (Text-to-SQL, vector search), and traffic data mining (trajectory analysis, outlier detection). He has published over 40 papers in top venues including SIGMOD, PVLDB, KDD and received the ACM SIGMOD Research Highlight Award 2021 and Best of SIGMOD 2020 (4/458). Scientific Awards : ACM SIGMOD Research Highlight Award 2021 Best of SIGMOD 2020 (4/458) Presidential Young Fellow at CUHK-Shenzhen (2023) Hong Kong and China Gas Scholarship (2019-2020) Reaching Out Award (2019) HKU Postgraduate Scholarship (2017-2021) ACM-ICPC Gold Medal (2015) National Scholarship (2014, 2015) Advising and Research Team : He leads a team including Postdoc Dr. Yuanyuan Zeng, PhD students Lujie Ban, Yuwei Xu, and MPhil students Yi Yang, Yuyang Liang. Former mentees like Yichen Xu (PhD at Berkeley) and Jiayang Pang (Master at UC San Diego) have achieved academic placements. Professional Service : He has served as PC member/reviewer for VLDB, KDD, ICDE, WWW, NeurIPS, TKDE , and guest editor for Applied Sciences and Frontiers in Big Data . He chairs sessions at ICDE and VLDB.

Matthias Rareyمشاهده پروفایل

استاد

• Bioinformatics
• Cheminformatics
• Algorithmic Molecular Design
• +۵ مورد دیگر

Prof. Dr. Matthias Rarey is a computer scientist and Professor at the University of Hamburg's Center for Bioinformatics. He holds a Ph.D. in Computer Science from the University of Bonn (1996) and has been leading the Algorithmic Molecular Design working group since 2002. His research focuses on molecular design algorithms, cheminformatics tools, and 3D bioinformatics. Co-founder of BioSolveIT GmbH Former cheminformatics group leader at Fraunhofer SCAI Former researcher at SmithKline Beecham and Roche Bioscience Head of Helmholtz Data Science Graduate School DASHH Director of Center for Data and Computing in Natural Science (CDCS) Research interests span algorithmic molecular design, cheminformatics, structure-based drug discovery, and machine learning applications in bioactivity prediction. His group developed widely used tools like FlexX, PoseView, and SpaceLight for molecular modeling and fragment space analysis. Recent publications focus on geometric pattern matching in protein-ligand interfaces, combinatorial fragment space encoding, adverse drug reaction network analysis, and efficient shape-based virtual screening. The work emphasizes scalable algorithms for billion-sized compound libraries and integration of machine learning with traditional cheminformatics approaches. Scientific awards include: GMD Award 1996 (Best Dissertation) GMD Award 2000 (Best Project) NRW Wissenschaftspreis 2002 Corwin Hansch Award 2005 Emerging Technologies Award 2011 Norddeutscher Wissenschaftspreis 2020 Academic leadership roles: Founding director of Center for Bioinformatics Co-founder of M.Sc. Bioinformatics and B.Sc. Computing in Science programs Chair of doctoral committee at Faculty of Computer Science Member of EMBL-EBI's Molecular and Cellular Structure advisory board Former Associate Editor of Journal of Chemical Information and Modeling

Julian Shunمشاهده پروفایل

دانشیار

• Parallel Computing
• High-Performance Computing
• Graph Analytics
• +۷ مورد دیگر

Julian Shun is an Associate Professor at the Massachusetts Institute of Technology (MIT) in the Department of Electrical Engineering and Computer Science (EECS) and a principal investigator in the Computer Science and Artificial Intelligence Laboratory (CSAIL). Previously, he was a Miller Research Fellow at UC Berkeley and earned his Ph.D. from Carnegie Mellon University under Guy Blelloch. His research focuses on parallel and high-performance computing, with emphasis on graph analytics, spatial/graph clustering, and dynamic algorithms. He designs algorithms with theoretical guarantees and empirical efficiency, along with high-level programming frameworks to simplify parallel code development. His work spans cache-oblivious, external-memory, and streaming graph algorithms, addressing scalability and performance across diverse computational architectures. Julien's recent publications highlight advancements in parallel graph traversal, dynamic connectivity, and approximation algorithms for centrality metrics. His research also explores domain-specific languages like GraphIt for graph analytics and frameworks such as Julienne for work-efficient bucketing. Scientific Awards: Miller Research Fellow at UC Berkeley He has taught graduate-level courses at MIT, including 6.506 (Algorithm Engineering) and 6.886 (Graph Analytics), emphasizing theoretical foundations, experimental analysis, and open-ended research projects.

Nofar Carmeliمشاهده پروفایل

پژوهشگر

• Database Query Optimization
• Fine-Grained Complexity
• Enumeration Complexity
• +۲ مورد دیگر

Nofar Carmeli is a researcher at Inria , affiliated with the Boreal joint project-team (LIRMM, Inria, University of Montpellier, CNRS) in Montpellier, France. Her work focuses on theoretical aspects of database query optimization, particularly through the lenses of fine-grained complexity and enumeration complexity. PhD from Technion (2015-2020), advised by Prof. Benny Kimelfeld Postdoctoral Researcher at ENS Paris (2021-2022) and Inria's Valda project-team Holds the Schmidt Postdoctoral Award (2021-2022) Her research explores optimal algorithms for database query answering, including direct access to ranked answers, quantile computation, and handling of conjunctive queries with self-joins or negation. She investigates how structural properties of queries and data constraints like functional dependencies affect computational complexity. Key contributions include: Establishing tractability boundaries for direct access to conjunctive queries Developing efficient algorithms for minimal triangulation enumeration Advancing probabilistic database representations for infinite domains Creating explainable opinion graph frameworks for review summarization Scientific awards: Google PhD Fellowship (2019) Schmidt Postdoctoral Award (2021-2022) PODS Best Student Paper (2019) She has served on program committees for STACS (2025), PODS (2023-2025), and ICDT (2022-2024), and contributed to open-access research dissemination through Arxiv and dblp.

Ruben Martinsمشاهده پروفایل

استادیار

• Constraint Programming
• Program Synthesis
• Formal Verification
• +۳ مورد دیگر

Ruben Martins is an Assistant Professor at Carnegie Mellon University's School of Computer Science and serves as the program director of the Master of Science in Computer Science (MSCS) . His research focuses on the intersection of constraint programming, program synthesis, analysis, and verification, with recent work aiming to make formal methods tools more accessible through automated reasoning. Ruben earned his Ph.D. with honors from the Technical University of Lisbon, Portugal (2013) , followed by postdoctoral research at the University of Oxford (2014-2015) and UT Austin (2015-2017) . Research Interests : Ruben's work bridges constraint programming and program synthesis , with applications in software verification , optimization , and automated reasoning . He has developed award-winning tools like Open-WBO , a modular MaxSAT solver that has won gold medals in international competitions. His publications span top-tier venues such as POPL , PLDI , FSE , SAT , and CP , often addressing real-world challenges from program analysis to network security. Scientific Awards include: Distinguished Paper Award at PLDI 2018 Distinguished Paper Award at FSE 2021 Distinguished Paper Award at SAT 2022 Gold medals for Open-WBO in MaxSAT competitions Teaching & Advising : Ruben mentors Ph.D., Master’s, and undergraduate students in research projects related to program synthesis, formal methods, and constraint solving. He teaches courses such as Bug Catching: Automated Program Verification and Advanced Topics in Logic: Automated Reasoning and Satisfiability , emphasizing hands-on experience with tools like Why3. His advising spans topics from AI-driven program repair to network protocol verification , fostering collaboration across disciplines.

• Data Quality
• Database Systems
• Data Profiling
• +۷ مورد دیگر

Felix Naumann is a Professor at the Hasso Plattner Institute in Potsdam, Germany, specializing in data management and database systems. His research focuses on data quality, data profiling, entity resolution, functional dependencies, and database optimization. He has authored over 300 publications in top-tier conferences and journals, including VLDB, SIGMOD, and ICDE. His work bridges theoretical foundations with practical systems, such as TASHEEH for data cleaning and PRISMA for privacy-preserving schema matching. He serves as an editor for the ACM Journal of Data and Information Quality and has led initiatives on hybrid conference formats and inclusive computing. Key contributions include: Data Quality: Pioneered studies on data quality's impact on machine learning and developed tools like AutoTSAD for anomaly detection. Data Dependency Discovery: Advanced functional and inclusion dependency mining algorithms, including Hitting Set Enumeration methods. Schema Matching & Integration: Created systems like BrewER and Frost for entity resolution and schema alignment. Educational Impact: Led massive open courses in data engineering with over 10,000 participants. His work emphasizes practical applications in cultural heritage data (ReCLAIM), Wikipedia table analysis, and cross-platform data systems (RHEEMix). He collaborates extensively with industry and academia, addressing challenges in dynamic datasets and data governance.

J. Ian Munroمشاهده پروفایل

استاد

• Data Structures
• Space Efficient Data Structures
• Algorithm Design and Analysis
• +۷ مورد دیگر

J. Ian Munro is a University Professor and Canada Research Chair in Algorithm Design at the Cheriton School of Computer Science, University of Waterloo. He has been a faculty member at Waterloo since completing his PhD at the University of Toronto in 1971 and was appointed University Professor in 2006, one of the highest honors the university bestows on its faculty. Dr. Munro's research focuses on the design, analysis, and implementation of efficient algorithms and data structures, with particular emphasis on space-efficient solutions. His work spans several key areas including succinct data structures, tree algorithms, text search methods, priority queues, and memory management for data structures. His research has had significant impact on how we understand the theoretical limits of data representation while maintaining efficient query performance. The trajectory of his recent publications (2020-2024) reveals a continued focus on pushing the boundaries of space efficiency in data structures, particularly for graphs and trees. His work increasingly addresses dynamic scenarios where data structures must be updated efficiently while maintaining query performance. The research shows strong connections between information theory, combinatorics, and practical algorithm design, with applications spanning database systems, computational geometry, and text processing. Fellow of the Association for Computing Machinery (FACM) Elected Fellow of the Royal Society of Canada (FRSC) in 2003 Canada Research Chair in Algorithm Design Dr. Munro has supervised over 24 PhD students throughout his career and has been actively involved in teaching advanced courses on data structures and algorithms. His research has been consistently funded through competitive grants, including his Canada Research Chair position. He maintains active collaborations with researchers worldwide, as evidenced by his extensive co-authorship network across numerous publications. As a member of both the Algorithms and Complexity Group and the Data Systems Group at Waterloo, Dr. Munro contributes to interdisciplinary research that bridges theoretical computer science with practical systems challenges. His work continues to influence both theoretical understanding and practical implementations of efficient data management solutions.

Shaun Fallatمشاهده پروفایل

استاد

• Combinatorial Matrix Theory
• Algebraic Graph Theory
• Matrix Positivity
• +۳ مورد دیگر

Shaun Fallat is a Professor in the Mathematics and Statistics Department at the University of Regina, within the Faculty of Science. He holds a Ph.D. in Applied Mathematics from the College of William and Mary (1999) and degrees from the University of Victoria (BSc and MSc). His research focuses on combinatorial matrix theory, algebraic graph theory, matrix positivity, and total positivity, with over 90 publications and a co-authored book on totally nonnegative matrices. He has supervised numerous graduate and undergraduate students, postdoctoral fellows, and visiting scholars, fostering a collaborative research environment. Fallat has delivered lectures globally and organized conferences, including the Western Canada Linear Algebra Meeting. His awards include the U. Regina Alumni Association Teaching Award, Olga Taussky-Todd Lecturer (2014), and Inaugural Hans Schneider Lecturer (2015). He serves as an Associate Editor for Linear Algebra and its Applications and the Canadian Journal of Mathematics . His research spans topics such as zero forcing parameters, spectral graph theory, and matrix inequalities. Recent work includes studies on hypertrees, graph complements, and applications of combinatorial matrix analysis. Fallat is actively involved in mentoring and promoting mathematics education at all levels, including outreach to K-12 students.

Pedro Orvalhoمشاهده پروفایل

پژوهشگر

• Artificial Intelligence
• Automated Reasoning
• Formal Methods
• +۴ مورد دیگر

Pedro Orvalho is a Research Associate in the Department of Computer Science at the University of Oxford, working with Professor Marta Kwiatkowska on the FUN2MODEL ERC project. His research bridges theoretical computer science with practical applications in software engineering and programming education. His educational background includes: PhD in Computer Science and Engineering (2025) from Instituto Superior Técnico, Universidade de Lisboa MSc in Information Systems and Computer Engineering (2019) from Instituto Superior Técnico BSc in Information Systems and Computer Engineering (2017) from Instituto Superior Técnico Orvalho's research spans Artificial Intelligence, Automated Reasoning, Formal Methods, and Program Repair, with significant contributions to programming education tools. His work integrates formal methods with machine learning techniques to develop novel approaches for program verification and repair, particularly focused on introductory programming assignments. His scientific achievements have been recognized with prestigious awards: Vencer o Adamastor (VoA) - 3rd Edition (2025) ELISE Mobility Grant (2024) COST Travel Grant (2022) Excellence in Teaching IST Awards (2021 and 2024) ACM SIGSOFT Distinguished Paper Award (ESEC/FSE 2021) FCT PhD Scholarship (2020-2024) With five years of teaching experience at Instituto Superior Técnico, Orvalho has developed educational tools like GitSEED and MENTOR that bridge his research with practical classroom applications. His research has been supported by multiple grants including the ERC FUN2MODEL project and FCT PhD Scholarship, demonstrating both academic and practical impact. He maintains active collaborations with researchers from Czech Technical University in Prague, Carnegie Mellon University, and industry partners like OutSystems, contributing to an international research network focused on software reliability and educational technology.

Laks V.S. Lakshmananمشاهده پروفایل

استاد

• Data Management
• Graph Computing
• Machine Learning
• +۵ مورد دیگر

Laks V.S. Lakshmanan is a Professor in the Department of Computer Science at the University of British Columbia (UBC), within the Faculty of Science. His research focuses on data management, graph computing, machine learning, and algorithms, with notable contributions to dense subgraph discovery, influence maximization, and healthcare informatics. He teaches advanced courses on databases and data management, including CPSC 404 (Advanced Relational Databases) and CPSC 534L (Topics in Data Management). His awards include the ACM SIGMOD Research Highlight Award, the IEEE Data Science Best Paper Award, and recognition as an ACM Distinguished Scientist (2016). His work bridges theoretical algorithm design with practical applications in social networks, bioinformatics, and healthcare. Key research themes include optimizing graph algorithms for large-scale data, combating misinformation through network analysis, and developing efficient methods for subgraph enumeration and influence propagation. His recent publications explore topics like clinical event prediction (TRACE), cost-effective LLM selection (ThriftLLM), and cross-modal consistency in AI systems. Education: Details not explicitly provided in sources. Grants & Funding: Recipient of NSERC Discovery Accelerator Supplements. Labs/Teams: Engaged in UBC's data management research groups and collaborative initiatives with industry partners.