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

Wojciech Rytterمشاهده پروفایل

استاد

• Design and analysis of computer algorithms
• Automata and formal languages
• Parallel algorithms
• +۵ مورد دیگر

Wojciech Rytter is a full professor at the Institute of Informatics, Department of Mathematics and Informatics at the University of Warsaw, Poland, holding this position continuously since October 1971. His academic career includes significant international appointments as full professor at New Jersey Institute of Technology (2002-2004), Liverpool University (1997-2002), and Bonn University (1994-1995), and as visiting professor at University of California, Riverside (1992-1993) and University of Warwick (1985-1986). He earned his MSc in 1971, PhD in 1975, habilitation in 1985, and was awarded the scientific degree of professor in 1997, all from Warsaw University. Professor Rytter's research focuses on the design and analysis of computer algorithms, with particular expertise in automata and formal languages, parallel algorithms, and text algorithms. His work spans efficient sequential and parallel algorithms, automata theory, complexity of recognition and parsing of context-free languages, pattern matching, algorithmics of WWW, parallel combinatorial computing, graph-theoretic algorithms, and algorithmics of highly compressible objects. His theoretical contributions have practical applications in computational biology, bioinformatics, and text processing systems. His recent publications (2022-2025) demonstrate continued activity in string algorithms, particularly in pattern matching, string covers, and combinatorics on words, with a strong focus on theoretical computer science with applications in bioinformatics. 200 problems on automata, languages, computations (Cambridge University Press 2023) 125 Problems in Text Algorithms (Cambridge University Press, 2021) Jewels of Stringology (World Scientific, 2002) Fast parallel algorithms for matching problems in graphs (Oxford University Press 1998) Text algorithms (Oxford University Press 1994) Professor Rytter has collaborated extensively with researchers including Jakub Radoszewski, Tomasz Walen, Tomasz Kociumaka, and Maxime Crochemore. He is a member of the Academy of Europe (elected 2011, Informatics section) and has authored or co-authored more than 130 publications. He maintains an active research laboratory focused on string algorithms and combinatorics on words at the University of Warsaw.

Daniel M. Kaneمشاهده پروفایل

استاد

• Number Theory
• Combinatorics
• Complexity Theory
• +۳ مورد دیگر

Daniel M. Kane is a Professor at the University of California, San Diego (UCSD), holding a joint appointment in the Department of Mathematics and the Department of Computer Science and Engineering (CSE). His research spans mathematics and theoretical computer science, with a focus on number theory, combinatorics, complexity theory, and computational statistics. He earned a Ph.D. in Mathematics from Harvard University (2011) and dual BS degrees in Mathematics with Computer Science and Physics from MIT (2007). Prior to UCSD, he was a postdoctoral researcher at Stanford University (2011–2014) on an NSF fellowship. His research interests include robust statistics, machine learning, polynomial threshold functions, and algorithmic methods for high-dimensional data. Notable achievements include co-authoring the book Algorithmic High-Dimensional Robust Statistics (Cambridge University Press, 2023) and receiving the Best Paper Award at the Conference on Computational Complexity (2013), as well as gold medals at the International Mathematical Olympiad (2002 and 2003). Current teaching includes courses such as Math 96 (Putnam Seminar), Math 154 (Graph Theory), CSE 101 (Algorithms), and CSE 203A (Randomized Algorithms). He has consulted for companies like CASPER Labs and AIble, and his work extends to cryptographic protocols, including quantum money schemes based on quaternion algebras. Key contributions include breakthroughs in robust mean estimation, list-decodable learning, and the development of efficient algorithms for statistical problems. His research often bridges foundational theory with practical applications in machine learning and data analysis.

• Time Series Analysis
• Data Mining
• Machine Learning
• +۳ مورد دیگر

Eamonn Keogh is a Professor in the Computer Science and Engineering Department at the University of California, Riverside. His pioneering work centers on the Matrix Profile, a transformative approach to time series data mining enabling efficient solutions for motif discovery, anomaly detection, and similarity search. His algorithms (STAMP, STOMP, SCRIMP, DAMP, SCAMP) offer exact, parameter-free, and scalable solutions across domains like seismology, bioinformatics, and industrial IoT. Research areas include: Development of ultra-fast algorithms for time series joins and motif discovery at unprecedented scales (breaking the 100 million barrier) GPU acceleration for time series mining Domain-agnostic methods for semantic segmentation and anomaly detection Novel primitives like Time Series Chains, Snippets, and Consensus Motifs His work is highly cited and recognized by industry and academia, with applications ranging from NASA's Cassini mission to detecting BGP anomalies in computer networks.

• Databases
• Big Data Management
• Spatial Data Processing
• +۳ مورد دیگر

Ahmed Eldawy is an Associate Professor in the Department of Computer Science at the University of California, Riverside. He leads groundbreaking research in databases, big data management, and spatial data processing, with a focus on scalable exploratory analytics through systems like Beast , UCR-Star , Raptor , and Spider . His work spans geospatial data infrastructure, distributed computing, and computational geometry. Research Interests : Databases, big data management, spatial data processing, geospatial analytics, distributed systems, computational geometry. Awards : NSF CAREER award (2021), 10-year Influential Paper Award (ICDE 2025), Best Demo award (SIGSPATIAL 2020). Grants : NSF (IIS-2046236, IIS-1954644, CNS-1924694), USDA (USDA NIFA 2020-69012-31914), UC Office of the President (M21PL3368). Labs & Centers : RAISE@UCR, Data Science Center, Center for Robotics and Intelligent Systems (CRIS), Affiliate of Center for Geospatial Sciences and Winston Chung Global Energy Center. His recent publications focus on LLM-driven geospatial visualization (LASEK), distributed raster analytics (RDPro), learned spatial query optimization, and scalable spatiotemporal systems. He advises numerous PhD and Master’s students, many of whom now work at top tech companies like Amazon, Microsoft, and Meta.

• Computer Architecture
• Machine Learning
• FPGA Acceleration
• +۴ مورد دیگر

Hadi Esmaeilzadeh is an Associate Professor at the University of California, San Diego in the Department of Computer Science and Engineering . He previously served as an Assistant Professor at Georgia Tech (2013-2017) and holds the Halicioğlu Chair in Computer Architecture . As founder/director of the Alternative Computing Technologies (ACT) Laboratory and associate director of UCSD's Center for Machine Integrated Computing and Security (MICS) , his research drives cross-stack solutions for next-generation computer systems. Early tenure recipient at UCSD Coined the term "dark silicon" in computer architecture Developed Tabla/DnnWeaver open-source frameworks Research Interests span: Approximate Computing Neural Acceleration FPGA/ASIC Hardware Design Machine Learning Systems Dark Silicon Challenges Security/Privacy in Accelerated Systems Scientific Recognition : 4 CACM Research Highlights 4 IEEE Micro Top Picks Distinguished Paper Award (HPCA 2016) Inducted to ISCA Hall of Fame (2018) Teaching : Developed courses on accelerator design (CSE 240D) and alternative computing (CS 8803 ACT) Advocates for hands-on FPGA-based learning in Processor Design with FPGAs courses

Leslie Ann Goldbergمشاهده پروفایل

استاد

• Algorithms
• Complexity Theory
• Randomised Algorithms
• +۵ مورد دیگر

Leslie Ann Goldberg is a Senior Research Fellow at St Edmund Hall and Professor of Computer Science at the University of Oxford. She currently serves as Head of the Department of Computer Science (on sabbatical 2025-26) and focuses on foundational problems in Algorithms and Complexity Theory , particularly randomised algorithms for network communication, machine learning, and statistical physics models. Her research includes solving Aldous' 1987 conjecture on backoff protocol instability (with John Lapinskas), developing rigorous mathematical analysis frameworks for algorithmic efficiency, and advancing approximate counting techniques via Markov Chain Monte Carlo methods (with Andreas Galanis and collaborators). Key projects involve graph homomorphisms , Moran process dynamics , and #BIS complexity class analysis. Recent publications (2023-2024) span topics like Sybil defense mechanisms, low-temperature sampling on random graphs, and parameterised subgraph counting modulo 2. Her work demonstrates cross-disciplinary impact in computational biology, statistical physics, and database theory. Scientific Awards include Best Paper Prizes at ICALP 2016, ICALP 2010, and IPEC 2017. She supervises PhD student Paulina Smolarova and collaborates extensively with researchers in Oxford and beyond.

Stefania Dumbravaمشاهده پروفایل

دانشیار

• Formal methods for databases
• Graph databases
• Property graphs
• +۷ مورد دیگر

Stefania Dumbrava is an Associate Professor of Computer Science at ENSIIE (École Nationale Supérieure d'Informatique pour l'Industrie et l'Entreprise) and a permanent member of the ACMES team in the SAMOVAR laboratory at Télécom SudParis, Institut Polytechnique de Paris. She is also actively involved in the Property Graph Schema Working Group and the European Research Network on Formal Proofs (EuroProofNet). Education PhD in Computer Science, Université Paris-Sud (2016) MSc in Computer Science, Jacobs University Bremen (2012) BSc in Mathematics, Jacobs University Bremen (2010) Research Interests Dumbrava's research lies at the intersection of formal methods and data management . She designs and verifies algorithms and systems for graph databases , with emphasis on property graphs , schema discovery , query optimization , and distributed graph processing . Recently, her work focuses on certifying large-scale distributed graph systems under the ANR JCJC VERDI project (2025–2029). Awards & Honors SIGMOD Best Paper Award 2023 – “PG-Schema: Schemas for Property Graphs” SIGMOD Research Highlight Award 2023 – “Threshold Queries” VLDB 2022 Best Regular Research Paper Runner-Up – “Threshold Queries in Theory and in the Wild” SIGMOD 2025 Distinguished Reviewer Award ICDE 2025 Best Program Committee Member Award EASST Best Software Science Paper Award, ICGT 2025 Students & Grants Dumbrava has supervised numerous research interns and is actively recruiting PhD students for her ANR VERDI project on verified foundations of large-scale distributed graph systems. She has also served on six PhD thesis committees as examiner since 2021. Labs & Teams She leads the ACMES research group within the SAMOVAR laboratory (Télécom SudParis, Institut Polytechnique de Paris), where her team develops formally verified graph-database engines and tools such as GRASP, VerDILog, and DatalogCert.

Paata Ivanisviliمشاهده پروفایل

دانشیار

• Analysis
• Partial Differential Equations
• Probability
• +۵ مورد دیگر

Paata Ivanisvili is an Associate Professor at the University of California, Irvine (UCI), Department of Mathematics, School of Physical Sciences. His research focuses on Analysis, Probability, Harmonic Analysis, and Functional Analysis, with a particular emphasis on isoperimetric inequalities, functional inequalities, and discrete structures such as the Hamming cube. He has held visiting positions at institutions including the Hausdorff Research Institute for Mathematics and Princeton University. Ivanisvili has organized conferences such as the Dual Trimester Program at the Hausdorff Institute on Boolean Analysis in Computer Science (2024) and annual Summer/Fall Schools since 2021. He earned his PhD in Mathematics from Michigan State University (2015) and a BS from Saint Petersburg State University (2011). His research interests include sharp inequalities in analysis (e.g., Poincaré, Beckner, Ehrhard), hypercontractivity, and applications to discrete mathematics and probability. He has collaborated with prominent mathematicians such as Fedor Nazarov, Alexander Volberg, and Roman Vershynin. Notable awards include the NSF CAREER Award (2021–2025) and Simons Fellowship in Mathematics (2025–2026). Ivanisvili’s recent work explores the interface between harmonic analysis and discrete mathematics, including studies on additive energies, convex hulls of space curves, and learning theory. His articles frequently address foundational questions in geometric functional analysis, often using tools like Bellman functions and optimal control theory. He actively advises PhD students and has mentored visiting researchers at UCI.

Erik Waingartenمشاهده پروفایل

استادیار

• Algorithms for Massive Datasets
• High-dimensional Geometry
• Property Testing
• +۵ مورد دیگر

Erik Waingarten is an assistant professor at the University of Pennsylvania in the Computer and Information Science department. His research focuses on algorithms for massive datasets, including similarity search, streaming/sketching, property testing, and distribution testing. Former postdoctoral researcher at Stanford's CS Department under Moses Charikar PhD from Columbia University advised by Xi Chen and Rocco Servedio Key research areas: High-dimensional geometry Streaming algorithms Property testing Sketching techniques Clustering and metric optimization Recent article trends show expertise in: 2025 publications on monotonicity testing and metric property analysis 2024 work on Earth Mover's Distance and kernel evaluations 2023 papers on clustering, optimal transport, and MST algorithms 2022-2020 foundations in sublinear algorithms and entropy estimation Scientific recognition: NSF CAREER Award (2023) CCC Best Paper Award (2017) Invited to Journal of the ACM (2017) Academic advising includes PhD students: Ashwin Padaki Tian Zhang Nicolas Menand Krish Singal Junkai Song

• Database Systems
• Data Management
• GPU Acceleration
• +۶ مورد دیگر

Anastasia Ailamaki is a Professor at the Swiss Federal Institute of Technology in Lausanne (EPFL), renowned for her work in database systems and data management . Her research focuses on optimizing query processing for modern hardware, particularly GPUs and heterogeneous systems, and advancing cloud data analytics with serverless architectures like PixelDB . She has co-authored influential frameworks for adaptive query optimization , hardware-conscious database engines , and model-relational data management . Key research areas: GPU acceleration , HTAP , query approximation , spatial data processing , and cloud-native databases . Recent work emphasizes cross-task optimizations in distributed environments, efficient sampling , and context-aware joins integrating vector embeddings. In 2023, she contributed to adaptive recursive query optimization and speculative K-means clustering, while 2024 publications addressed proportional caching (HPCache) and model-relational systems . Her collaborations span institutions such as MIT, Microsoft, and ETH Zurich, with publications in top venues like SIGMOD , VLDB , and ICDE .

• Quantum Computation
• Quantum Algorithms
• Computational Complexity
• +۳ مورد دیگر

Ashley M R Montanaro is a Professor of Quantum Computation at the School of Mathematics, University of Bristol . Active in quantum computing research since at least 2014, they lead projects at the intersection of quantum algorithms , computational complexity , and quantum information theory , affiliated with the Bristol Quantum Information Institute. Research interests focus on quantum algorithm design , computational complexity analysis , and quantum simulation . Key work includes developing variational quantum algorithms for phase transition detection, Hamiltonian simulation techniques, and quantum-classical hybrid methods for solving complex problems in physics and optimization. Recent publications demonstrate expertise in: Quantum phase diagram simulation with low-depth circuits Quantum speedups for constraint satisfaction problems Quantum communication complexity of machine learning tasks Quantum-enhanced optimization heuristics Hamiltonian simulation with time-dependent product formulas Quantum algorithm complexity analysis Scientific awards include: EPSRC Fellowship (2014-2019) - "New insights in quantum algorithms and complexity" Active in quantum software development through projects like: "Quantum Algorithms from Foundations to Applications" (ERC-2018-COG) "Quantum Computing and Simulation Hub" (2019-2024) "Prosperity Partnership in Quantum Software" (2019-2023)

Xiaohui Yuمشاهده پروفایل

استاد

• Big Data Management and Analytics
• Database Systems
• Machine Learning
• +۳ مورد دیگر

Xiaohui Yu is a Professor and Graduate Program Director in the School of Information Technology at York University. He holds a BSc from Nanjing University, an MPhil from the Chinese University of Hong Kong, and a PhD from the University of Toronto. His research focuses on the intersection of data management and machine learning, including ML-based database systems, large-scale machine learning, and spatio-temporal data analysis in contexts like intelligent transportation systems and social networks. Supported by grants from NSERC and industry partners, his work has been published in top venues such as SIGMOD, VLDB, and TKDE. He serves as an Associate Editor for journals like IEEE TKDE and ACM TKDD, and actively participates in conference program committees. Education: BSc (Nanjing University), MPhil (Chinese University of Hong Kong), PhD (University of Toronto). Research Interests: Big data management, database systems, machine learning, spatio-temporal data analytics, and video query processing. Recent articles emphasize ML-driven database components, efficient video query optimization, and scalable algorithms for large-scale data. His work addresses challenges in query processing, indexing, and real-time systems. Service: Serves on editorial boards (e.g., Information Systems), and chairs/workshops (e.g., Symposium on Data Markets). Active in program committees for SIGMOD, ICDE, and other leading conferences. Advising & Grants: Directs graduate programs and leads research groups. Collaborates with industry on data marketplaces and AI model integration. No specific student names listed, but actively recruits PhD/Master’s candidates.

• Databases
• Data Mining
• Information Retrieval
• +۲ مورد دیگر

Dr. Arnab Bhattacharya is a Professor in the Department of Computer Science and Engineering at the Indian Institute of Technology (IIT) Kanpur since December 2020. He previously served as Associate Professor (2014–2020) and Assistant Professor (2007–2014) at IIT Kanpur. Education: PhD in Computer Science (2007), University of California, Santa Barbara MS in Computer Science (2007), University of California, Santa Barbara Bachelor of Computer Science and Engineering (2001), Jadavpur University Research Focus spans Databases , Data Mining , Information Retrieval , and Artificial Intelligence . His work emphasizes graph analytics , skyline queries , probabilistic data , and knowledge graph management . Article Trends reveal expertise in graph neural networks , trajectory-aware systems , statistical significance in databases , and legal/medical data mining . His methodologies often integrate chi-square statistics , approximate indexing , and provenance tracking . Scientific Awards: IBM Faculty Research Award Yahoo! Faculty Research and Engagement Program Award Best Paper at COMAD 2011 Best Student Paper at COMAD 2010 Top-Five Student Paper at ICDM 2005 ICDM Student Travel Award sponsored by IBM Contact: Office RM 409, Department of Computer Science and Engineering, IIT Kanpur Email: arnabb@iitk.ac.in | Phone: +91-512-259-7650

Pekka Marttinenمشاهده پروفایل

دانشیار

• Machine Learning
• Large Language Models
• Reinforcement Learning
• +۸ مورد دیگر

Pekka Marttinen is a tenured Associate Professor of Machine Learning at Aalto University, Department of Computer Science, and leads the Machine Learning for Health (Aalto-ML4H) group within the Helsinki Institute for Information Technology HIIT. Education: M.Sc. in Applied Mathematics, University of Helsinki (2004) Ph.D. in Statistics, University of Helsinki (2008) Title of Docent in Information and Computer Science, Aalto University (2015) Research Focus: His methodological work spans large language models, reinforcement learning, deep learning, probabilistic machine learning, and causal inference . These techniques are applied to critical domains of healthcare, bioinformatics, statistical genetics, epidemiology, and personalized medicine . The group develops novel algorithms, theoretical guarantees, and open-source software that enable data-driven discovery and decision-making in medicine and biology. Publication Trends: Across 2022-2024 the lab has concentrated on (i) rigorous causal reasoning over temporal clinical data, (ii) principled uncertainty quantification in LLMs, (iii) representation learning for neural network comparison, and (iv) translational projects that turn raw EHRs into actionable clinical insights. Earlier work integrated high-dimensional genomics with metabolomics and mapped evolutionary forces in bacterial pathogens. Scientific Awards & Recognition: While no specific awards are listed, his sustained publication record in top-tier venues (NeurIPS, ICML, AISTATS, Nature Genetics, PLOS CB) and his role as responsible professor of the Machine-Learning, Data-Science and AI major signify significant peer recognition. Advising & Grants: Prof. Marttinen currently mentors 8 PhD students as primary supervisor and an additional 7 PhD students as co-supervisor. He has already graduated 8 PhDs since 2014. The group is supported through competitive funding including the Finnish Center for Artificial Intelligence (FCAI) doctoral program. Labs & Teams: He directs the Machine Learning for Health (Aalto-ML4H) research group, comprising postdocs Hans Moen, Ti John, Alexander Nikitin, Negar Safinianaini, Linli Zhang, Zhiyuan Li, and the above-mentioned PhD cohort.

• Data Systems for AI
• Retrieval-Augmented Generation (RAG)
• Database Systems
• +۴ مورد دیگر

Yongjoo Park is an Assistant Professor in the Department of Computer Science at the University of Illinois at Urbana-Champaign (UIUC), affiliated with the Grainger College of Engineering. He leads research in data-intensive AI systems as a member of the Data and Information Systems (DAIS) lab, focusing on novel data systems that bridge database theory and practical AI applications. His work emphasizes open-source contributions through GitHub and direct societal impact. Research interests center on systems for data-intensive AI , particularly efficient Retrieval-Augmented Generation (RAG) systems for exploratory AI, data science versioning, and in-storage computing. Key projects include Kishu (the world's first undoable Jupyter notebook with time-travel capabilities), CARE (a causal-relational system for structured/unstructured data), and AirDB/AirIndex (serverless transactions and automatic index optimization). His group develops tools enabling scalable, optimized AI workflows from storage layers to LLM inference. Recent publications reveal a strong focus on interactive data systems (85% of recent work), with significant contributions to notebook environments (Kishu), vector databases (ISCA'25), and RAG optimization. Awards highlight technical innovation, including SIGMOD 2025 Best Demo Award and NSF CAREER funding. His open-source philosophy drives GitHub releases of all major systems. SIGMOD 2025 Best Demo Award (Kishu) NSF CAREER Award (Novel data science systems) SIGMOD'23 Best Artifact Award Honorable Mention (DeepOLA) IBM-Illinois Project Selection (VectorDB/RAG) Mentorship spans 12 current PhD/MS students and 6 graduated advisees, including Supawit Chockchowwat (now Postdoc at Google, future Assistant Professor at CMKL University). He teaches advanced courses like CS511 (Advanced Data Management) and recruits 1-2 new PhD students annually, prioritizing data systems research. His lab emphasizes diversity, individual respect, and concrete outcomes in a collaborative workspace.