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

Pravesh Kothariمشاهده پروفایل

استاد مدعو

• Theoretical Computer Science
• Algorithms
• Average-Case Complexity
• +۳ مورد دیگر

Pravesh Kothari serves as an Adjunct Professor in the Computer Science Department at Carnegie Mellon University, focusing on theoretical computer science and algorithmic foundations of average-case computational problems. His research centers on designing efficient algorithms and establishing rigorous evidence for algorithmic thresholds in problems spanning theoretical computer science, statistics, and allied fields. Key contributions include the development of the sum-of-squares method which bridges proof complexity and semidefinite programming relaxations for optimization challenges, detailed in his monograph Semialgebraic Proofs and Efficient Algorithm Design with Pitassi and Fleming. Recent publications reveal consistent focus on constraint satisfaction problems, small-set expansion, and sparse statistical estimation, demonstrating strong integration of theoretical computer science with statistical learning theory through semidefinite programming frameworks. Major recognitions include: NSF CAREER Award (2021-2026) for The Nature of Average-Case Computation Sloan Fellowship (2022) Current research is primarily supported by the NSF CAREER Award, enabling investigation into computational thresholds and efficient algorithm design for average-case problems through theoretical frameworks. His Fall 2021 CMU lecture notes document practical applications of these methodologies.

• Algorithms
• Data Structures
• Combinatorics
• +۹ مورد دیگر

Conrado Martinez Parra is a Professor in the Department of Computer Science at the Faculty of Computer Science, Universitat Politècnica de Catalunya (UPC). He is a core member of the ALBCOM research group, which focuses on Algorithmics, Bioinformatics, Complexity, and Formal Methods. Affiliation : Department of Computer Science, Faculty of Computer Science (FIB), UPC Research Group : ALBCOM - Algorísmia, Bioinformàtica, Complexitat i Mètodes Formals Email : conrado@cs.upc.edu ORCID : 0000-0003-1302-9067 Researcher ID : G-4629-2015 His research spans theoretical computer science with a strong emphasis on the design and analysis of algorithms and data structures. His work includes average-case analysis of algorithms, combinatorial generation, probabilistic methods in algorithmics, and applications in information retrieval and data stream processing. He has extensively studied multidimensional data structures such as quadtrees, K-d trees, and skip lists, analyzing their performance under various query models including partial match and orthogonal range searches. His recent publications reveal a sustained focus on algorithmic efficiency, sampling techniques, and probabilistic modeling in data structures. Trends indicate a deep engagement with randomized algorithms, unbiased estimation, and cache-efficient selection methods, reflecting both theoretical rigor and practical applicability in modern computing environments. Scientific Contributions Extensive publication record spanning over three decades, from 1989 to 2024. Active in major algorithmic conferences such as ANALCO, AofA, and AAAI. Contributions to foundational algorithm analysis including Hoare’s FIND, Quickselect variants, and deletion in binary search trees. Collaborative research with prominent figures in theoretical computer science across Europe. Professor Martinez Parra has advised or collaborated with several doctoral students, including Gustavo Lau, whose thesis on partial match queries he supervised. He has participated in numerous competitive R&D projects funded by national and regional programs, focusing on large-scale information processing and graph-based computing models. His work is supported by long-standing grants from Spanish and Catalan research councils. He is affiliated with the ALBCOM research group, a leading team in algorithmic research at UPC, contributing to both theoretical advances and practical implementations in combinatorics and data structure optimization.

• Pain Management
• Anesthesiology
• Chronic Pain
• +۳ مورد دیگر

Dr. Blake Stewart Watterworth serves as a Clinical Assistant Professor in the Department of Anesthesiology and Critical Care at the University of Pennsylvania School of Medicine, providing clinical care through the Penn Pain Medicine Center with locations at Perelman Center for Advanced Medicine, Radnor, Valley Forge, and Tuttleman Center in Philadelphia. Education: Medical School: Temple University School of Medicine Residency: University of Maryland Medical Center Fellowship: University of Maryland Rehabilitation & Orthopaedic Institute His clinical and research expertise centers on pain management, specializing in chronic non-cancer pain, neuropathic pain syndromes, and interventional procedures including spinal cord stimulation. Current research examines cannabis therapy efficacy, post-surgical pain management, and peripheral neuropathy treatments, contributing to evidence-based advancements in pain medicine. Patient reviews consistently highlight his thoroughness and compassionate care approach, reflected in a 4.7/5 average rating from 345 reviews. He maintains hospital privileges across Penn Medicine's integrated system including Hospital of the University of Pennsylvania, Pennsylvania Hospital, and Penn Presbyterian Medical Center. The Penn Pain Medicine Center under his practice provides multidisciplinary pain management services integrating clinical care with research initiatives to develop innovative treatment protocols for complex pain conditions.

Chethan Kamathمشاهده پروفایل

استادیار

• Cryptography
• Theoretical Computer Science
• Foundations of Cryptography
• +۵ مورد دیگر

Chethan Kamath is an Assistant Professor in the Department of Computer Science and Engineering at IIT Bombay, where he is a member of the Theory Group and Trust Lab. His primary research focus is on cryptography, particularly its foundations, with broader interests extending to theoretical computer science. His educational journey includes: PhD from IST Austria (2014-2020) under Krzysztof Pietrzak, with thesis titled "On the Average-Case Hardness of Total Search Problems" Master's in CS from IISc Bangalore (2010-2013) under Sanjit Chatterjee, with thesis titled "Constructing Provably Secure Identity-Based Signature Schemes" Bachelor's in CS from University of Kerala (2005-2009) at TKM College of Engineering, Kollam Dr. Kamath's research interests span the theoretical foundations of cryptography, with particular focus on secure computation, complexity theory, and cryptographic hardness assumptions. His work often bridges theoretical computer science with practical cryptographic applications, exploring the boundaries of what can be efficiently computed while maintaining security guarantees. His research frequently addresses fundamental questions about the relationship between cryptographic primitives and complexity classes, especially the PPAD and TFNP complexity classes. His recent publications demonstrate a consistent focus on foundational aspects of cryptography, with particular emphasis on secure computation (garbled circuits, Yao's protocol), proofs systems (proofs of work, proofs of exponentiation), and complexity-theoretic aspects of cryptographic primitives. A notable trend is his exploration of the connections between complexity classes like PPAD and cryptographic assumptions, as well as his work on verifiable delay functions and their underlying number-theoretic assumptions. His research often employs tools from algorithmic graph theory (treewidth, separators) to analyze cryptographic protocols. His notable scientific achievement includes: Azrieli Fellowship during his post-doc at Tel Aviv University Dr. Kamath actively mentors students and researchers, currently advising several PhD and MS students at IIT Bombay, often in collaboration with Sruthi Sekar. His service to the academic community includes extensive program committee memberships for major conferences including Crypto, Eurocrypt, and TCC, demonstrating his standing in the cryptographic research community. He has co-organized educational events like the "Introduction to Cryptography" school as part of the ACM India Summer School 2025 and the "Theoretical Foundations of Cryptography" school as part of the ACM India Summer School 2024. He leads research activities within the Trust Lab at IIT Bombay, which focuses on theoretical and applied aspects of cryptography and security. The lab actively recruits MS/PhD students and post-docs, with ongoing research in foundational cryptography and its applications to secure computation, verifiable delay functions, and complexity-theoretic aspects of cryptographic security.

Shane M. Parkerمشاهده پروفایل

دانشیار

• Computational Chemistry
• Photochemistry
• Spectroscopy
• +۴ مورد دیگر

Shane M. Parker is an Associate Professor at Case Western Reserve University , specializing in computational and quantum chemistry. His research focuses on developing electronic structure theories to predict photochemical reaction mechanisms and advancing technologies for light-driven chemical synthesis and power generation. Education: B.S. in Chemistry & Mathematics (2008) from the University of Florida; Ph.D. in Chemistry (2014) from Northwestern University; Postdoctoral Fellow (2014–2019) at the University of California, Irvine. His work combines Time-Dependent Density Functional Theory (TDDFT) , surface hopping , and non-adiabatic dynamics to model photochemical processes in molecular materials. Key applications include RNA metabolic labeling , γ-graphyne synthesis , and light-controlled reactions . Recent publications highlight advancements in electronic structure algorithms , ultrafast photodynamics , and carbon nanomaterial characterization . His group actively develops open-source simulation tools for exploratory photochemical research. Professor Parker welcomes postdoctoral, graduate, and undergraduate students to join his research team. Contact him via shane.parker@case.edu . His laboratory collaborates with experimentalists to validate theoretical predictions through spectroscopic measurements and numerical experiments , bridging computational and empirical approaches to solve complex photochemical challenges.

• Forensic Statistics
• Medical Statistics
• Machine Learning
• +۲ مورد دیگر

Giulia Cereda serves as Associate Professor in the Department of Statistics, Computer Science, and Applications 'G. Parenti' (DiSIA) at the University of Florence since 2025. Her academic journey includes prior roles as Fixed-term Researcher (RTD-b, 2022-2024), Research Fellow (2021-2022), and Swiss National Science Foundation Postdoc Mobility Fellow (2019-2021) at Leiden University and University of Florence. She holds a Joint PhD in Statistics from Leiden University and University of Lausanne (2011-2016), complemented by Master's and Bachelor's degrees in Mathematics from the University of Milan. Her research spans forensic statistics with focus on rare type match problems in DNA evidence evaluation, medical statistics applied to SARS-CoV-2 pandemic modeling, and machine learning implementations for biogeographical ancestry prediction. Recent publications demonstrate methodological innovations in Bayesian approaches for forensic evidence, compartmental modeling of epidemic dynamics, and supervised learning applications in population genetics. Analysis of her 14 most recent publications (2020-2025) reveals dual research thrusts: (1) forensic statistics addressing DNA mixture interpretation and rare haplotype matching through Bayesian frameworks, and (2) epidemiological modeling of smoking dynamics and SARS-CoV-2 transmission using compartmental models with uncertainty quantification. Her work bridges theoretical statistics with practical public health and forensic applications, frequently employing machine learning for complex prediction tasks. Supported by the Swiss National Science Foundation for postdoctoral research (2019-2021), she has contributed to pandemic response through Tuscan regional modeling and school-based screening strategies. Current office hours are Thursdays 3:00-4:00 PM by appointment, with ongoing research in forensic identification systems and epidemic forecasting methodologies.

• Quantum Information
• Quantum Computing
• Many-body Physics
• +۵ مورد دیگر

Dr. Rahul Trivedi is a tenured Research Group Leader in the Theory Division at the Max Planck Institute of Quantum Optics in Garching, Germany. His research focuses on theoretical quantum information and quantum science, particularly addressing challenges in noisy quantum systems and simulators. Dr. Trivedi received his undergraduate degree in Electrical Engineering from the Indian Institute of Technology Delhi, followed by MS and PhD in Electrical Engineering from Stanford University (2021). After a postdoctoral fellowship at the Max Planck Harvard Research Center for Quantum Optics, he served as an Assistant Professor of Electrical and Computer Engineering at the University of Washington before returning to MPQ as a tenured researcher in 2024. His research program spans multiple areas at the intersection of quantum information theory, many-body physics, and quantum device engineering. Key research directions include: Theory of open quantum systems and non-Markovian dynamics Quantum simulation with noisy intermediate-scale quantum (NISQ) devices Quantum error correction and fault tolerance Quantum optics theory with applications to quantum simulation and metrology Dr. Trivedi has secured significant research funding including an ERC Starting Grant for his ToNQS project (Theory of Noisy Quantum Simulation of Many-body Physics), as well as previous awards from the National Science Foundation and Department of Energy in the United States. His scientific awards and recognitions include: ERC Starting Grant: ToNQS - Theory of Noisy Quantum Simulation of Many-body Physics National Science Foundation (NSF) research funding Department of Energy (DOE) research funding Dr. Trivedi currently leads a research group consisting of three PhD students, one Master's student, and several co-advised students. His group maintains extensive collaborations with partners both within Europe and the US. With the ERC grant, additional positions for PhD students and postdoctoral researchers are becoming available. The Theory of Open Systems research group is housed in the Theory Division at the Max Planck Institute of Quantum Optics. The group actively collaborates with experimental teams to bridge theoretical frameworks with practical quantum device implementations, particularly focusing on how noise affects quantum simulation capabilities.

Daniel Olejárمشاهده پروفایل

دانشیار

• Information Security
• Cybersecurity
• Combinatorial Analysis
• +۴ مورد دیگر

Assoc. Prof. Daniel Olejár, PhD, serves in the Department of Cryptology and Information Security at Comenius University's Faculty of Mathematics, Physics and Informatics in Bratislava. His academic responsibilities include teaching Principles of Computers, Combinatorial Analysis, Information Security, and Information Theory/Coding Theory courses. Contactable at olejar@dcs.fmph.uniba.sk from office M-214, he maintains active scholarly engagement through recent high-impact publications. Professor Olejár's research bridges cybersecurity policy implementation and theoretical computer science . His expertise spans information security governance , combinatorial structures , and random graph theory . The 2018 commentary on Slovakia's Cybersecurity Act demonstrates practical policy contributions, while earlier works on dominating cliques phase transitions reveal deep theoretical foundations. This dual focus creates unique value in translating mathematical rigor into security frameworks. His publication trajectory shows strategic evolution from pure theory (2008-2012) to policy application (2018), reflecting responsive scholarship aligned with national security priorities. The consistent output across disparate domains indicates rigorous methodological discipline applicable to both legislative analysis and abstract computational problems. Though specific grant details aren't public, his role in major policy documents suggests institutional research support. Student supervision occurs through structured coursework and departmental seminars, with theoretical specializations offering potential thesis directions in combinatorial security analysis. As a core faculty member in Cryptology and Information Security, he contributes to the department's mission of advancing both theoretical knowledge and practical security solutions. No dedicated laboratory is referenced, but his departmental affiliation places him within Bratislava's primary hub for cryptographic research and cybersecurity education, facilitating collaboration on national security initiatives through institutional channels.

Alain Hertzمشاهده پروفایل

استاد

• Operations Research
• Management Science
• Combinatorial Optimization
• +۶ مورد دیگر

Alain Hertz is a Full Professor in the Department of Mathematics and Industrial Engineering at Polytechnique Montréal. He is affiliated with two major research centers: Institut de valorisation des données (IVADO) and Groupe d'études et de recherche en analyse des décisions (GERAD). His expertise spans operations research, management science, and algorithm development with applications across multiple industries. Professor Hertz specializes in combinatorial optimization, graph theory, algorithms, heuristics and metaheuristics. His research bridges theoretical mathematics with practical applications in scheduling, vehicle routing, and decision support systems. Recent work explores graph-based approaches for recommender systems and chemical graph theory, demonstrating the versatility of his mathematical frameworks. His publication record shows consistent output across top journals in operations research and graph theory. Recent articles (2021-2025) focus on extremal graph theory, chemical graphs, graph coloring variants, and applications of graph theory to recommender systems. This demonstrates both theoretical depth and practical relevance in his research trajectory. Prix de la ministre de l'Éducation, du Loisir et du Sport - Gouvernement du Québec (2011) Professor Hertz has supervised 13 doctoral students and 18 master's students, with thesis topics ranging from optimization methods for semi-supervised clustering to wind farm network design. His supervision approach emphasizes both theoretical foundations and practical applications, preparing students for careers in both academia and industry. His research has been supported by various grants enabling collaborative work with international partners. Through his affiliations with IVADO and GERAD, Professor Hertz contributes to interdisciplinary research initiatives that connect mathematical theory with real-world problems in data science, artificial intelligence, and industrial engineering.

Matteo Camilliمشاهده پروفایل

دانشیار

• Software Engineering
• Software verification
• Automated testing
• +۴ مورد دیگر

Matteo Camilli is an Associate Professor in the Department of Electronics, Information and Bioengineering (DEIB) at Politecnico di Milano, Italy, where he leads research in software engineering and verification. His academic journey includes positions as Assistant Professor at Free University of Bozen-Bolzano and postdoctoral research at the University of Milan and University of Bergamo. His educational background includes a PhD in Computer Science (2015), MSc in Computer Science (2012), and BSc in Computer Science (2009), all from the University of Milan. His doctoral research focused on combining advanced abstraction techniques and big data approaches to address state explosion problems in formal verification. Camilli's research primarily centers on software verification, testing, and methods to improve dependability of autonomous, cyber-physical, service-based, and ML-enabled critical systems. His work spans formal methods, model-based testing, uncertainty quantification, and design-time/runtime verification with applications to complex distributed systems. His recent publications reflect a growing focus on explainable self-adaptation, quality assurance for LLM-based systems, and managing uncertainty in adaptive systems. His publication record includes papers in top journals (TOSEM, TAAS, JSS, EMSE) and conferences (ICSE, ISSRE, ICST, ICSA). He serves on program committees for prestigious conferences including ICSE, ICSA, ICST, and ECSA, and is on the steering committee for the International Workshop on Formal Approaches for Advanced Computing Systems (FAACS). Camilli actively contributes to the academic community through conference organization, including serving as Program Committee Member for numerous conferences and as Program Co-Chair for the Software Architecture track at ACM SAC. He also serves as guest editor for special issues on automated testing and dependable AI systems. His teaching portfolio at Politecnico di Milano includes Software Engineering 2, Software Engineering for Automation, and Distributed Software Development. Previously at Free University of Bozen-Bolzano, he taught Systems Engineering and Verification and Reliability for Dependable Systems.