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

• Data Management and Analysis
• Machine Learning
• Knowledge Representation
• +۵ مورد دیگر

Assoc Prof John Wang is an Associate Professor at the School of Information and Communication Technology , Griffith University. His work spans Data Management and Analysis (graph, text, spatial-temporal data), Machine Learning , Knowledge Representation , and Algorithm Design . He has published extensively in top venues like ACM Transactions on Database Systems , IEEE Transactions on Knowledge and Data Engineering , and conferences including SIGMOD , VLDB , and ICDE . Appointments : Member of the Institute for Integrated and Intelligent Systems (2003–2024). Education : PhD in Computer Science (Griffith University, 2003). His research has led to real-world implementations in Graph Data Processing , including techniques for shortest distance queries and temporal reachability. He actively contributes to program committees of conferences like VLDB and ICDE , and his funded projects include "Developing Soil Knowledge..." (ACIAR, 2024–2029) and "Harnessing Social Media..." (QLD Inspector-General, 2020). Recent publications focus on Graph Indexing , Causality Detection , and Spatial-temporal Querying . Examples include optimizing road network queries (2023), 2-hop labeling for shortest paths (2021), and geospatial skyline algorithms (2020). Co-authored works appear in venues such as IEEE Transactions on Knowledge and Data Engineering and Neurocomputing . Consultancy : Delivered commercial research on pandemic-related data analytics (2020). Supervision : Mentored 15+ PhD/Master’s students, including projects on deep learning, data leakage prevention, and XML querying. Teaching : Directed programs like Graduate Certificate in Information Technology and Diploma of Information Technology .

• Database Systems
• Data Management
• Information Systems
• +۳ مورد دیگر

Tobias Bleifuß is a researcher affiliated with the Hasso Plattner Institute at the University of Potsdam, Germany. His work focuses on database systems, data management, and schema evolution. He has collaborated extensively with researchers like Felix Naumann and Divesh Srivastava on projects exploring functional dependencies, temporal data analysis, and data quality. Notable contributions include methodologies for discovering functional dependencies via hitting set enumeration and analyzing schema changes in Wikipedia tables. His research interests span theoretical computer science aspects of databases, practical data management challenges, and leveraging temporal data for semantic insights. Recent work emphasizes efficient algorithms for data exploration and maintaining data integrity in evolving schemas.

Nicole Schweikardtمشاهده پروفایل

استاد

• Logic
• Database Theory
• Complexity Theory
• +۳ مورد دیگر

Nicole Schweikardt is a full Professor at the Department of Computer Science, Humboldt-Universität zu Berlin, since 2014. She previously held positions at Goethe-Universität Frankfurt (W2/W3 Professor for Theory of Complex Systems, 2007-2014) and served as Junior-Professor for Logic and Database Theory at HU Berlin (2005-2007). Her research focuses on logic in computer science, particularly database theory and complexity theory. Key contributions include algorithmic meta-theorems for bounded degree structures, efficient query evaluation techniques, and analysis of first-order logic extensions with counting quantifiers. She explores query languages' expressivity, document spanners, and locality properties in logic. Recent work (2025) covers event stream query discovery, color refinement for relational structures, and learning aggregate queries via first-order logic. Earlier studies (2018-2022) address FO+MOD queries under updates, Hanf normal forms, and enumeration algorithms over sparse graphs. GI-Dissertationspreis (2002) Emmy-Noether Fellowship (2005) Heinz Maier-Leibnitz-Prize (2007) Teaching Award (2015) She has supervised 6 PhD theses and contributed to database conferences (PODS, ICDT, LICS) as PC member and workshop organizer. Her affiliations include DFG Fachkollegium Informatik (since 2024) and editorial boards of Acta Informatica and ACM SIGLOG Education Committee.

Arnaud Durandمشاهده پروفایل

استاد

• Structural Complexity
• Descriptive Complexity
• Finite Model Theory
• +۴ مورد دیگر

Arnaud Durand is a Professor at Paris-Diderot University's Faculty of Mathematics since 2005. He currently serves as Director of the Mathematics Department (UFR de mathématiques) and has held several leadership roles including Pole Manager (2006-2010), Deputy Director (2010-2014), and Co-Director (2014-2017) of the GDR IM - Mathematical Computer Science research group. He previously headed the Master's program in Mathematical Logic and Foundations of Computer Science (2007-2013) and the Logic research team (2014-2017), and was instrumental in establishing the university's Mathematics and Computer Science double degree program (2009-2016). Education includes: Ph.D. from University of Caen (1994-1996) Postdoctoral research at University of Pisa (1997-1998) His research bridges mathematics and computer science, focusing on: Structural complexity : Counting and enumeration problems Descriptive complexity : Logical characterization of complexity classes Database theory : Query evaluation and tractability Finite model theory : Logical aspects of finite structures Graph/hypergraph theory : Algorithmic and structural properties Recent publications demonstrate a strong emphasis on computational complexity, logical methods in computer science, and database theory, with frequent exploration of counting problems, team semantics, and conjunctive query evaluation. Research consistently intersects theoretical computer science, mathematical logic, and discrete mathematics. Student Advising : Has supervised doctoral candidates including: David Duris (2006-2009) Yann Strozecki (2007-2010) Nicolas de Rugy-Altherre (2011-2015, co-supervised) Florent Capelli (2013-2016) Alexandre Vigny (current, co-supervised)

Yann Strozeckiمشاهده پروفایل

دانشیار

• Enumeration Complexity
• Algorithmic Game Theory
• Simple Stochastic Games
• +۷ مورد دیگر

Yann Strozecki is an Associate Professor (Maître de Conférences HDR) at the University of Versailles Saint-Quentin, where he is based in the DAVID Laboratory and leads the ALMOST research team focused on algorithms and stochastic models. He is currently on a part-time assignment at LIGM, Gustave Eiffel University, and has previously held positions at LIP6 (RO team), Paris-Sud University (ALGO team), and completed a postdoctoral fellowship at the University of Toronto's Theory Group. He earned his PhD from Paris Diderot (Paris 7) under Arnaud Durand. His research lies at the intersection of theoretical computer science and discrete mathematics, with core interests in: Enumeration complexity, especially delay and space constraints Algorithmic game theory, particularly simple stochastic games (SSGs) Graph and matroid algorithms Cheminformatics and molecular structure generation Sparse polynomials and algebraic complexity Analysis of his recent publications reveals a strong trend in developing efficient enumeration algorithms with provable delay and space bounds, advancing the theoretical foundations of output-sensitive computation. He also contributes to practical algorithms for Cloud RAN scheduling and cheminformatics, often combining theoretical rigor with real-world applications. His work on geometric amortization and strategy improvement in SSGs demonstrates innovation in algorithm design. Notable scientific contributions include: Generic strategy improvement methods for SSGs Polynomial-delay enumeration via closure operations Efficient deterministic scheduling for low-latency networks Tools for molecular cage generation in chemistry Yann Strozecki actively supervises PhD and master’s students, including Noé Demange, Maël Guiraud, and Xavier Badin de Montjoye. He co-organizes the ALMOST team seminar and has advised numerous interns in algorithmics and game theory. His research has been supported through collaborations with Nokia Bell Labs (CIFRE thesis) and interdisciplinary projects in cheminformatics and networking.

• Combinatorics
• Graph Theory
• Asymptotic Enumeration
• +۷ مورد دیگر

Brendan McKay is a Professor in the School of Computing at the Australian National University (ANU), where he conducts research at the intersection of mathematics and computing. His work is deeply rooted in combinatorics, graph theory, and probabilistic methods in discrete structures. His research interests span a wide range of topics in discrete mathematics, including random graphs , asymptotic enumeration , Hamiltonian cycles , planar and bipartite graphs , matrix theory , and computational combinatorics . His work often combines theoretical depth with algorithmic applications, particularly in the analysis of complex networks and discrete systems. The recent publications (2015–2025) reflect a sustained focus on asymptotic enumeration techniques, structural properties of graphs, and algorithmic challenges in graph isomorphism and distance queries. Key themes include the use of probabilistic tools (e.g., cumulant expansions, martingales), enumeration under degree constraints, and symmetry-preserving operations on maps. His collaborations frequently involve researchers such as Mikhail Isaev, Catherine Greenhill, and Qing Wang. Scientific Awards and Recognitions: Fellow, Australian Mathematical Society (2000 → …) Fellow, Australian Academy of Science (1997 → …) McKay has led and co-led several major research projects, including Deep Learning for Graph Isomorphism and Hypergraph models for complex discrete systems , demonstrating leadership in both theoretical and applied directions. He has not explicitly listed advisees, but his role as Principal Investigator (PI) on multiple projects indicates active mentorship and grant leadership. His work often involves interdisciplinary applications in bioinformatics and network science. He is associated with research groups and projects focused on graph algorithms , random discrete structures , and computational combinatorics , often in collaboration with the mathematical sciences community at ANU and beyond.

Sebastian Manethمشاهده پروفایل

استاد

• Databases
• Automata Theory and Applications
• Data Compression
• +۳ مورد دیگر

Sebastian Maneth is a Heisenberg Professor at the Universität Bremen , affiliated with the Faculty of Mathematics and Computer Science and the Department of Computer Science . His research focuses on Databases , Automata Theory and Applications , and Data Compression , with significant contributions to tree transducers and XML processing. Editor of Theory of Computing Systems (TOCS) Associate Editor for Frontiers in Computer Science Editor of Algorithms His recent work explores the boundaries of tree transducers , regular expressions , and grammar-based compression , with decidable properties in formal language theory. He organizes major conferences like the Dagstuhl Seminar on Regular Expressions and serves on numerous program committees (CIAA, ICALP, FoIKS, etc.). Current projects include FO-Query Enumeration over compressed data, shape-preserving tree transducers , and user identification via eye-tracking data . His editorial and organizational roles highlight leadership in theoretical computer science communities.

Bruce Kapronمشاهده پروفایل

استاد

• Logic in Computer Science
• Cryptography
• Foundations of Security
• +۳ مورد دیگر

Bruce Kapron is a Professor of Computer Science at the University of Victoria, affiliated with the Faculty of Engineering and Computer Science. He holds a PhD from the University of Toronto (1991) and an M.Sc. in Mathematics from Simon Fraser University (1986). His research focuses on theoretical computer science, including computability, cryptography, computational complexity, and verification. He has held visiting positions at institutions such as Stanford University and the Institute for Advanced Study. Notable contributions include foundational work in higher-order computability, cryptographic protocols, and formal verification. Education: PhD in Computer Science from the University of Toronto (1991), supervised by Stephen Cook; M.Sc. in Mathematics from Simon Fraser University (1986), supervised by S. K. Thomason. Research interests emphasize logic in computer science, computational complexity, cryptographic foundations, and verification techniques. His work bridges theoretical insights with practical applications in security and algorithm design. Recent publications explore equilibrium complexity in games, separation logic, and pseudorandomness. He has advised numerous graduate students and holds major grants, including NSERC Discovery Grants focused on complexity theory and security foundations. His contributions extend to textbook authorship, such as *Logic, Automata, and Computational Complexity: The Works of Stephen A. Cook* (2023). Key professional milestones include roles as Distinguished Professor at Fondation Sciences Mathématiques de Paris (2022) and Visiting Fellow at the University of Bologna (2022). He actively participates in research networks and has delivered invited talks on topics such as NP-completeness and higher-order complexity theory.

Sajin Korothمشاهده پروفایل

استادیار

• Theoretical computer science
• Complexity theory
• Communication complexity
• +۳ مورد دیگر

Sajin Koroth is an Assistant Professor in the Department of Computer Science at the University of Victoria, Canada. He holds a PhD from the Indian Institute of Technology Madras and has held postdoctoral positions at Simon Fraser University and the University of Haifa. His research focuses on theoretical computer science, particularly complexity theory, communication complexity, and circuit complexity. He has received the IBM India Outstanding Ph.D. Thesis Award for his doctoral work. Education: PhD and Master's from IIT Madras, postdoctoral research at SFU and Haifa University. Research interests include circuit lower bounds, communication complexity, and probabilistically checkable proofs (PCPs). Key contributions involve lifting theorems, query-to-communication complexity, and lower bounds for De Morgan formulas. Awards: IBM India Outstanding Ph.D. Thesis Award (2017). Teaching: Courses on communication complexity and computational complexity theory at UVic. Active in academic conferences and workshops, including presentations at STOC, CCC, and ICALP.

• Constraint Satisfaction Problems
• Computational Complexity
• Theoretical Computer Science
• +۴ مورد دیگر

Victor Dalmau is an Associate Professor at the Department of Information and Communication Technologies, Universitat Pompeu Fabra (UPF). He holds a Ph.D. and a degree in Computer Science from Universitat Politècnica de Catalunya. His career includes post-doctoral roles at institutions such as the University of Zaragoza and University of California, Santa Cruz, before joining UPF in 2000. He has held visiting positions at prestigious universities including Oxford, Cambridge, and Simon Fraser University. His research focuses on theoretical computer science, particularly constraint satisfaction problems (CSPs), exploring their complexity, combinatorial structures, and applications in areas like artificial intelligence and database theory. His work integrates concepts from universal algebra, logic, and computational learning theory. Notably, he investigates algorithmic techniques like Sherali-Adams hierarchies and Weisfeiler-Leman invariance for solving CSPs efficiently. Recent publications emphasize advancements in constraint satisfaction frameworks, homomorphism dualities, and the interplay between logic and database query optimization. His research bridges foundational theory with practical challenges in distributed computing and algorithm design. Victor Dalmau’s contributions span over 50 peer-reviewed articles, with a focus on computational complexity classifications, constraint programming, and the theoretical underpinnings of database systems. His work often addresses the boundaries between tractability and intractability in combinatorial problems.

Roberto Grossiمشاهده پروفایل

استاد

• Algorithms and Data Structures
• Dynamic and External Memory Algorithms
• Algorithm Engineering
• +۴ مورد دیگر

Roberto Grossi is a Professor of Algorithms and Data Structures at the University of Pisa's Dipartimento di Informatica. He is actively involved in editorial roles for journals like Theory of Computing Systems and RAIRO-Theoretical Informatics, and has served on program committees for conferences such as SWAT, IWOCA, ESA, FOCS, and SPIRE. His research focuses on algorithms, data structures, graph theory, and bioinformatics, with contributions to string processing, compressed data structures, and algorithm engineering. He advises Ph.D. students and collaborates on projects involving large-scale networks and community detection. Grossi has authored numerous publications, including works on clique enumeration, graphlet algorithms, and phylogenetic reconstruction. His teaching includes courses on Algorithm Design and Data Structures, and he maintains an active presence in academic networks through his research and editorial activities. Education: Not explicitly stated, but inferred from his role as a professor at a top Italian university. Research Interests: Dynamic algorithms, external memory methods, experimental algorithmics, pattern matching in strings and graphs. Grants/Awards: While no specific prizes are listed, his extensive publication record and editorial roles reflect sustained recognition in the field. Lab/Teams: Leads research groups focused on algorithmic foundations and applications, collaborating with international teams on projects like Zuckerli (compressed graph representations) and motif trie indexing. His work bridges theoretical computer science with practical applications in bioinformatics and network analysis.

Luc Devroyeمشاهده پروفایل

استاد

• Computer Science
• Probability Theory
• Algorithms
• +۴ مورد دیگر

Luc Devroye is a Professor in the School of Computer Science at McGill University, Montreal. He joined McGill in 1977 after completing his PhD at the University of Texas in 1976. His research spans probabilistic analysis of algorithms, random structures, and typography. Notable contributions include work on random trees, data structures, and simulation methods. Affiliations : McGill University since 1977, School of Computer Science. Education : PhD in Computer Science from the University of Texas (1976), studies at the University of Leuven and Osaka University. Research Interests : Algorithms, probability theory, random graphs, data structures, and typography. Focus on average-case analysis, random tree structures, and simulation techniques. His work emphasizes theoretical foundations with practical applications, including contributions to random number generation and algorithmic efficiency. He advises students in theoretical computer science and maintains an active research agenda with over 500 publications. Teaching : Courses like COMP 252 (Algorithms), COMP 690 (Probabilistic Analysis of Algorithms). Students : Mentored numerous PhD and MSc students, many now in academia and industry.

Sebastian Siebertzمشاهده پروفایل

استاد

• Algorithmic Graph Structure Theory
• Sparse Graphs
• Logic in Computer Science
• +۴ مورد دیگر

Professor Sebastian Siebertz is a faculty member in the Department of Computer Science at the Faculty of Mathematics and Computer Science, University of Bremen. His research focuses on the intersection of graph theory and logic in computer science, particularly in the areas of sparse graph classes and algorithmic meta-theorems. His primary research interests include Algorithmic Graph Structure Theory (especially sparse and structurally sparse graphs), Logic in Computer Science (particularly first-order model-checking, query evaluation, enumeration, and counting), and Applications of stability theory in the finite. He has made significant contributions to the theory of bounded expansion and nowhere dense graph classes, which provide robust notions of uniform sparsity. Notably, in collaboration with Martin Grohe and Stephan Kreutzer, he proved that the first-order model-checking problem is fixed-parameter tractable on nowhere dense graph classes. His recent publications (2022-2024) demonstrate a strong focus on extending model-checking results to more general graph classes, exploring connections with stability theory, and developing efficient algorithms for graph problems, particularly in reconfiguration, connectivity, and structural graph theory. Professor Siebertz actively serves the academic community through program committee memberships for major conferences including LICS, IPEC, and Highlights of Logics, Games and Automata, and has organized Dagstuhl seminars on sparsity in algorithms, combinatorics and logic. He currently supervises several doctoral students and postdocs, including Dr. Alexandre Vigny, Mario Grobler, and Nikolas Mählmann, indicating an active research group focused on theoretical computer science problems at the University of Bremen.

Viktor Kunčakمشاهده پروفایل

دانشیار

• Program Synthesis
• Program Verification
• Automated Reasoning
• +۳ مورد دیگر

Viktor Kunčak is an Associate Professor with tenure at the École Polytechnique Fédérale de Lausanne (EPFL) in the School of Computer and Communication Sciences. He leads the Laboratory for Automated Reasoning and Analysis (LARA) and has been at EPFL since 2007 after completing his PhD at the Massachusetts Institute of Technology (MIT). His educational background includes: PhD from Massachusetts Institute of Technology (MIT), 2007 Professor Kunčak's research focuses on bridging the gap between human goals and computational realizations through program synthesis , verification , and automated reasoning . His work has significant applications in software development, formal methods, and programming languages. He is particularly known for developing practical tools like Leon and Stainless that implement theoretical advances in automated reasoning. His recent publications demonstrate a consistent focus on advancing program synthesis techniques, verification frameworks, and formal methods. The research trajectory shows progression from foundational theoretical work to practical applications and tools that can be used by developers. Many papers focus on making verification and synthesis more accessible and efficient for real-world programming tasks. His notable scientific achievements include: ACM SIGSOFT Distinguished Paper Award for work on automated testing European Research Council (ERC) Grant of 1.5M EUR (2012) Communications of the ACM Research Highlight for a PLDI paper Professor Kunčak has supervised 13 completed PhD theses and teaches courses on functional and parallel programming, compilers, and verification at EPFL. He has also co-taught a popular MOOC on Parallel Programming that reached over 100,000 learners worldwide. His research has been supported by significant funding including a 5-year ERC grant. He has served in leadership roles for major conferences including as program co-chair for FMCAD 2014 and VMCAI 2012. He leads the Laboratory for Automated Reasoning and Analysis (LARA) at EPFL, which develops tools like Stainless for program verification. The lab has established an international presence through collaborations including a European COST Action to establish standardized formats for verification and synthesis (Rich Model Toolkit).

Arne Meierمشاهده پروفایل

استاد

• Complexity Theory
• Parameterised Complexity Theory
• Logic in Computer Science
• +۳ مورد دیگر

Arne Meier is a Professor at Leibniz Universität Hannover, affiliated with the Faculty of Electrical Engineering and Computer Science and the Institute of Theoretical Computer Science. He heads the Algorithms research group, focusing on theoretical aspects of computer science with applications to artificial intelligence and database systems. Meier obtained all his academic degrees—Bachelor's, Master's, PhD, and Habilitation—at Leibniz Universität Hannover, establishing a strong foundation in theoretical computer science. His academic journey at the same institution reflects his deep commitment to advancing research in computational theory. Meier's research spans several interconnected areas in theoretical computer science. His primary focus is on complexity theory, particularly the parameterized complexity of problems in non-classical logics with applications to AI. He also investigates enumeration algorithms and the logical foundations of artificial intelligence. His work bridges theoretical computer science with practical applications in knowledge representation and reasoning systems. He has a notable interest in LaTeX and typography, having developed the 'timeline' package for creating timelines in LaTeX documents. His recent publications (2023-2025) demonstrate a consistent focus on the intersection of logic, complexity, and artificial intelligence. Meier's work shows progression from foundational research in dependence and team logics toward more applied areas in argumentation theory and database systems. His research increasingly addresses computational challenges in AI systems, particularly in reasoning under uncertainty and handling inconsistent information. Meier actively contributes to the academic community through extensive program committee service for major conferences including AAAI (2021, 2023, 2024, 2025), IJCAI (2021-2025), and FoIKS (2024 as Co-Chair, 2026). He has also served as a reviewer for numerous conferences and journals in theoretical computer science and artificial intelligence. His current research projects include the DAAD-funded 'Applications and Complexity of Logics in Semiring-Team-Semantics' (2024-2025) and the DFG project 'Team Logics: New Bridges to Database Repairs' (2023-2026). Previously, he led the DFG project 'Nonclassical logics: parametrised and enumeration complexity' (2013-2022) and the MWK project 'Innovation Plus: Komplexität von Algorithmen' (2020-2022). Meier leads the Algorithms research group at Leibniz Universität Hannover, which focuses on theoretical aspects of algorithms with applications to logic and artificial intelligence. The group's work spans complexity theory, logical formalisms, and their applications to computational problems in knowledge representation and database systems.