Ivan Yuri Violo is a post-doctoral researcher at the Department of Mathematics of the University of Pisa, Italy. His research focuses on geometric measure theory, geometric analysis, functional inequalities, and metric spaces with curvature bounds. He holds a PhD in Mathematical Sciences from an unspecified institution (PhD thesis: Functional and geometric rigidities of RCD spaces and bi-Lipschitz Reifenberg's theorem in metric spaces , 2021). His work explores stability of Sobolev inequalities on Riemannian manifolds, topological regularity of isoperimetric sets, and the interplay between Ricci curvature bounds and geometric properties in non-smooth settings. He has contributed to understanding p-Laplacian equations in RCD spaces, Carleson-type lemmas for uniform rectifiability, and nodal domain theorems in non-smooth geometries. Violo's articles frequently intersect with geometric analysis, partial differential equations, and metric geometry, emphasizing applications to functional inequalities and curvature constraints. He maintains a homepage with further details and is reachable at ivan.violo@sns.it .
جستوجوی استاد و پژوهشگر
استاد راهنما، استاد دانشگاه یا پژوهشگر مناسب برای مسیر پژوهشیتان را پیدا کنید و با او ارتباط بگیرید.
نمایش ۳۱-۴۵ از ۵۸ استاد راهنما
اطلاعات این پروفایلها از صفحات عمومی دانشگاهها جمعآوری شده و ممکن است بهروز نباشد.
Tao Wangمشاهده پروفایل
استادیار
- Pathology
- Molecular Medicine
- Oncology
- +۴ مورد دیگر
Tao Wang is an Assistant Professor in the Department of Pathology and Molecular Medicine at Queen's University, affiliated with the School of Medicine and the Faculty of Health Sciences. His research focuses on gastrointestinal and liver pathology, oncology, and molecular mechanisms underlying cancer progression. He specializes in tumor grading systems, molecular diagnostics, and histopathological evaluation of cancers such as pancreatic, colorectal, and cholangiocarcinoma. Dr. Wang's work emphasizes translational applications of immunohistochemistry and genomic profiling in clinical oncology. He is reachable via tw75@queensu.ca or tao.wang@kingstonhsc.ca at Douglas Wing 203. His recent publications (2020–2024) highlight advancements in pancreatic cancer grading systems, endoscopic management of gastrointestinal lesions, and molecular pathways in lung and liver cancers. Key areas include YAP/TEAD signaling in pan-cancer vulnerabilities, fibrosis dynamics in hepatocellular carcinoma, and pathophysiological overlaps between autoimmune conditions and neoplasms.
Parosh Aziz Abdulla is a Chaired Professor at the Department of Information Technology, Uppsala University, Sweden. He is a prominent researcher in the field of theoretical computer science with a focus on formal methods, concurrency, and program verification. His work bridges theoretical foundations with practical applications in software and hardware verification. Professor Abdulla's primary research interests include Concurrency, Distributed Systems, Program Verification, Model Checking, Automata, and Logic. His work spans both theoretical aspects of computer science and practical verification techniques for concurrent and distributed systems. He has made significant contributions to the understanding of memory models, particularly in the context of modern architectures like x86 with persistent memory. His research has evolved from foundational work on infinite-state systems to practical verification techniques for concurrent programs and string constraints. Professor Abdulla has served on numerous program committees for top-tier conferences including PLDI, POPL, CAV, CONCUR, and TACAS, demonstrating his standing in the research community. He has been PC co-Chair for TACAS'11 and has contributed to many other conferences over the years. As an advisor, Professor Abdulla has supervised numerous PhD students to completion, with graduates working on topics ranging from verification of networks of communicating processes to caches, transactions, and memory models. His students have gone on to successful careers in academia and industry. Professor Abdulla maintains an active research agenda, with recent work focusing on verification of quantum circuits, efficient linearizability monitoring, and verification under Intel-x86 with persistency. His research continues to address fundamental challenges in program verification while adapting to new computing paradigms and hardware architectures.
Zachary Kincaid is an Associate Professor in the Department of Computer Science within the School of Engineering and Applied Science at Princeton University. His research spans programming languages, formal methods, and program analysis, with a focus on making analysis techniques more compositional and robust. He maintains an active research program with numerous publications in top-tier conferences including PLDI, POPL, OOPSLA, and CAV. His research interests include program analysis, logic, and programming languages, with particular emphasis on static analysis, verification, and automated reasoning. His work develops theoretical foundations for program analysis while creating practical tools that can be applied to real-world software systems. He has made significant contributions to termination analysis, invariant generation, and the application of algebraic methods to program verification. Analysis of his recent publications shows a consistent focus on improving the precision and scalability of program analysis techniques. His work frequently bridges theoretical computer science with practical implementation, developing novel algorithms for static analysis while also implementing them in tools like the Duet program analyzer. His research spans multiple subfields including termination analysis, invariant generation, recurrence relations, and algebraic methods for program analysis. Professor Kincaid has advised several PhD students to completion, including Shaowei Zhu (PhD 2024, now a researcher at Amazon) and Charlie Murphy (PhD 2023, now a postdoc at University of Wisconsin–Madison). He currently advises Jake Silverman, Nicolas Koh, and Nikhil Pimpalkhare. He teaches courses at Princeton including COS 320 (Compiling Techniques), COS 516/ELE 516 (Automated Reasoning about Software), and COS 217 (Introduction to Programming Systems). His teaching reflects his research interests, focusing on the theoretical foundations and practical implementation of programming language tools and techniques.
Quentin Royمشاهده پروفایل
استادیار
Quentin Roy is an Assistant Professor at Université Grenoble Alpes (UFR SHS) with extensive academic experience across multiple institutions including University of Waterloo, National University of Singapore, and Télécom ParisTech. His research focuses on Human-Computer Interaction (HCI) with specialties in conversational agents, wearable computing, mobile interfaces, and gesture-based interaction. He has authored over 20 peer-reviewed publications in top venues like CHI, AVI, and TVCG, receiving two Best Paper Honorable Mentions. His work explores topics ranging from tactile feedback systems to AR medical guidance. Quentin has taught courses such as Interaction Humain-Machine, Programming, and Mobile Technologies across various universities. His research interests include: Design of conversational agents considering user personality and task context Optimization of touch-based and gesture interaction techniques Development of wearable computing interfaces for physical activity scenarios Error reduction strategies in word suggestion systems Multi-touch interaction modalities for medical visualization Key contributions include studies on: Spacial anchoring in AR surgery guidance (CHI '25) Cognitive load effects on vibrotactile pattern recognition (AVI '18) Path creation using interactive videos on smartglasses (CHI '17) He has collaborated widely with institutions like Singapore Management University, University of Waterloo, and Télécom ParisTech. Current research explores adaptive interfaces for emerging device form factors and multimodal interaction systems.
Nikos Tzevelekosمشاهده پروفایل
مدرس ارشد
Nikos Tzevelekos is a Senior Lecturer in the School of Electronic Engineering and Computer Science at Queen Mary University of London (QMUL), and a member of the Theory Group and Centre for Fundamental Computer Science. His research focuses on theoretical computer science, particularly the mathematical foundations of computation. He develops formal models of programming languages using game semantics and category theory, with applications to program analysis and verification. Tzevelekos holds a PhD from the University of Oxford and previously served as a postdoctoral researcher there within the Quantum Group. His research interests include program equivalence, automata theory over infinite alphabets, and formal verification techniques. He has organized workshops such as the Workshop on Program Equivalence (2016) and contributed to conferences like LICS, POPL, and FOSSACS. Tzevelekos has received funding, including a £44,502 grant from Innovate UK for the Mokapot/Millr project on cloud computing infrastructure. He teaches computer science courses at QMUL and maintains an active presence in the academic community, participating in events like LICS 2025 and POPL 2024. His work bridges foundational theory with practical tools for software analysis, emphasizing the mathematical rigor of computational systems.
René Thiemannمشاهده پروفایل
دانشیار
René Thiemann is an Associate Professor in the Department of Computer Science at the University of Innsbruck, Austria, where he is a member of the Computational Logic group. His research is centered on formal methods, with a focus on program verification, termination analysis, and interactive theorem proving using Isabelle/HOL. He has led and contributed to several FWF-funded research projects, including Automation of Rewriting Infrastructure and Certifying Termination and Complexity Proofs of Programs . His research interests include: Program Verification via Interactive Theorem Proving (Isabelle, CeTA) Termination and Complexity Analysis of Programs and Rewriting Systems Term Rewriting and Dependency Pairs SAT and SMT Solving Formalization of Algebraic Structures (e.g., algebraic numbers, Smith normal form) Automated Reasoning and Certified Software The most recent articles highlight his continued work in formal verification, particularly in certifying termination, confluence, and complexity proofs. His publications show a strong trend toward mechanizing mathematical and logical foundations in Isabelle/HOL, with applications in rewriting, arithmetic, and program analysis. He frequently publishes in top venues such as CPP, ITP, LICS, and FSCD. He has served on program committees for conferences including CPP and RTA, and he regularly advises and collaborates on formalization projects. While no explicit grants or advising roles are listed, his leadership in multiple FWF projects indicates significant grant involvement. He teaches courses such as Program Verification, Functional Programming, Constraint Solving, and Interactive Theorem Proving in Isabelle/HOL, reflecting his expertise in formal methods and programming languages.
Gabor Sarkozy is a Professor in the Computer Science Department at Worcester Polytechnic Institute (WPI). His research focuses on graph theory, discrete mathematics, and theoretical computer science, with notable contributions to Ramsey theory, extremal graph theory, and algorithmic graph problems. He co-developed the Blow-up Lemma, a foundational tool in combinatorics. He teaches advanced courses such as Analysis of Algorithms and Foundations of Computer Science, and leads the Budapest MQP Project Center, fostering international academic collaborations. His work spans over 100 publications, emphasizing monochromatic cycle partitions, hypergraphs, and time-series data analytics. He collaborates extensively with researchers like Endre Szemerédi and András Gyárfás. His research integrates theoretical insights with practical applications in data mining and algorithm design. Research Interests: Graph Theory Ramsey Numbers Combinatorial Optimization Algorithm Design Time Series Analysis Key Projects: Budapest MQP Project Center Algorithmic Graph Theory Research Time Series Clustering and Matching Professional Activities: PhD advisor and mentor International conference speaker Co-author of influential papers in Combinatorica and Journal of Combinatorial Theory
René Thiemannمشاهده پروفایل
دانشیار
René Thiemann is an Associate Professor in the Department of Computer Science at the University of Innsbruck, Austria, where he is a key member of the Computational Logic Group. His work bridges theoretical computer science and practical formal verification, with a strong emphasis on automated reasoning and program correctness. Research Interests: Program Verification using interactive theorem proving (Isabelle/HOL) Termination and complexity analysis of programs Term rewriting systems and dependency pairs SAT/SMT solving and decision procedures Formalization of algebraic algorithms (LLL, Smith normal form, algebraic numbers) Development of the Certification Problem Format (CPF) and the CeTA tool His recent publications (2017–2025) reflect a consistent focus on formalizing advanced algorithms in Isabelle/HOL, especially those related to termination, complexity, and algebraic computation. These works are published in top venues like CPP, FSCD, LICS, and ITP, demonstrating rigorous, machine-checked proofs. His research often centers on verifying tools like AProVE and developing foundational libraries for number theory and rewriting. Scientific Projects: ARI : Automation of Rewriting Infrastructure (Task Leader, since 2022) Certifying Termination and Complexity Proofs : Project Leader (2014–2021) Constrained Rewriting and SMT : Task Leader (2012–2015) Improving Certifiers for Termination Proofs : Project Leader (2010–2014) Teaching Activities: Lecture and Proseminar: Program Verification (SS 2023–2025) Lecture: Constraint Solving (SS 2024–2025) Lecture and Proseminar: Functional Programming (WS 2021–2025) Lecture: Advanced Functional Programming (WS 2024/25) Lecture: Interactive Theorem Proving in Isabelle/HOL (SS 2022–2024) Lecture: Decision Procedures (SS 2021) He has supervised no listed students in the provided data but actively contributes to collaborative research. His email is rene.thiemann@uibk.ac.at.
Tiark Rompfمشاهده پروفایل
دانشیار
- Programming Languages
- Compilers
- Software Engineering
- +۱۳ مورد دیگر
Tiark Rompf is an Associate Professor in the Department of Computer Science at Purdue University, where he has been a faculty member since Fall 2014. He is the founder and director of the Purdue Center for Programming Principles and Software Systems (PurPL), a research group focused on next-generation software systems that integrate data-driven algorithms, also known as "Software 2.0". His academic background includes a PhD from École Polytechnique Fédérale de Lausanne (EPFL), an MS from Universität zu Lübeck, and a BS from Universität Bremen, all in computer science. His research spans programming languages, compilers, systems, databases, machine learning, and AI. He is a leading figure in meta-programming, domain-specific languages (DSLs), and compiler design, particularly through his work on Lightweight Modular Staging (LMS). His interdisciplinary work bridges theory and practice, aiming to make high-level programming languages performant and scalable. The most recent publications highlight his focus on advanced type systems (e.g., reachability types), query languages (e.g., Flan, Rhyme), compiler IRs, and the integration of machine learning and data management systems. These works appear in top venues like POPL, OOPSLA, ICFP, SIGMOD, and ECOOP, indicating sustained influence and innovation in programming language research. Among his scientific contributions, he has no explicitly listed awards in the provided text, but his leadership in founding PurPL and his extensive publication record in premier conferences are significant recognitions of his impact. He advises a group of active researchers and students, many of whom are co-authors on his recent papers. His lab, PurPL, fosters collaborative research in programming principles and software systems, often involving meta-programming, differentiable programming, and system-level optimizations. He has led or co-led multiple collaborative projects, including work on Flare (a native compiler for Apache Spark), HACCLE (secure multi-party computation), and AutoGraph (imperative-style differentiable programming).
Tiark Rompfمشاهده پروفایل
دانشیار
Tiark Rompf is the Kevin C. and Susanne L. Kahn New Frontiers Associate Professor at Purdue University, with a scientific focus on programming languages, compilers, and systems research. He co-directs the Purdue Center for Programming Principles and Software Systems (PurPL) and serves as a Scientific Advisor at SambaNova Systems. His research spans Reachability Types (integrating Rust-style lifetime tracking with higher-order abstractions), Rhyme (query languages for nested data), and formal verification using Coq and logical relations. Key techniques include Graph IRs , Mechanized Proofs , and E-Graphs . Scientific Awards : GPCE Test of Time Award (2020) ACM SIGPLAN PL Software Award (2019) NSF CAREER Award (2016) Google Faculty Research Award (2017, 2018) DOE Early Career Research Award (2017) He teaches graduate courses on compilers (CS 502, CS 590) and software foundations. His lab actively recruits PhD students for projects involving type systems, compiler design, and metaprogramming.
Oliver Bračevac is a researcher affiliated with Purdue University in the United States and EPFL (École Polytechnique Fédérale de Lausanne) in Switzerland, where he is part of the LAMP (Programming Methods Laboratory) group. His work focuses on advanced type systems and functional language compilation, particularly in the context of Scala 3 . His research interests include functional language compilers , dependent types , effect systems , capture types , co-effects , separation logic , and ownership . He has made significant contributions to the development of reachability types and their integration into practical programming languages. He has published extensively in top-tier conferences such as ECOOP , POPL , OOPSLA , ICFP , and SPLASH , focusing on type safety, compiler optimizations, and formal verification. His recent work includes modeling reachability types with logical relations and developing ergonomic capture tracking systems for generic data structures in Scala 3. Oliver serves on numerous program committees and artifact evaluation committees, including roles at OOPSLA 2025 , POPL 2025 , SPLASH 2024 , and ECOOP 2022 . He is actively involved in organizing workshops such as The Scala Workshop 2025 . He maintains a personal website at https://bracevac.org and is active on GitHub under the username bracevac .
Kousha Etessami is a Professor in the Laboratory for Foundations of Computer Science within the School of Informatics at the University of Edinburgh . His research spans theoretical computer science with a focus on automated verification, logic, algorithms and computational complexity, algorithmic game theory, stochastic systems, automata theory and model checking. Research Interests: Automated verification and model checking Logic and computational complexity Algorithmic game theory and equilibrium computation Analysis of probabilistic systems, Markov decision processes and stochastic games Automata theory and infinite-state systems Finite model theory and descriptive complexity His publications reveal a strong profile in algorithmic game theory, stochastic modelling, and verification of complex systems. Recent work focuses on equilibrium computation complexity, reachability in stochastic games, and fixed-point methods for probabilistic models. He has contributed extensively to both foundational theory and practical algorithms, with journal publications in top venues including SIAM Journal on Computing , Journal of the ACM , Information and Computation , and Games and Economic Behavior . Students & Collaborators: PhD graduates: Thomas Webster (2024), Emanuel Martinov (2021), Alistair Stewart (2014), Dominik Wojtczak (2009) Postdoc: Václav Brožek (Newton Fellow, now at Google-Munich) Teaching Contributions: Professor Etessami teaches and has taught courses on Algorithmic Game Theory, Randomized Algorithms, Discrete Mathematics, Stochastic Modelling and Simulation, and Compiling Techniques at the University of Edinburgh. Contact: Email: kousha@inf.ed.ac.uk Office: Informatics Forum, Room 5.20, 10 Crichton Street, Edinburgh EH8 9AB, Scotland, UK Telephone: +44 (0)131 650 5197
Cassandra Bates is an academic researcher affiliated with the Department of Plant Pathology at Washington State University (WSU) within the College of Agricultural, Human, and Natural Resource Sciences . She leads the Plant Pest Diagnostic Clinic in Pullman, focusing on identifying plant pests (pathogens, nematodes, insects, and disorders) using microscopy, molecular techniques, and expert consultations. Her work supports crop management strategies for small grains, oilseeds, and other agricultural systems. Her research interests span plant pathology, nematology, and agricultural diagnostics, with expertise in molecular diagnostics and pest resistance mechanisms. She collaborates with WSU experts to develop practical solutions for crop health issues. Her recent publications explore topics ranging from plant pest biology to public health databases, though some work appears outside her primary agricultural focus. No scientific awards are explicitly mentioned in the provided materials. She oversees the Plant Pest Diagnostic Clinic, providing diagnostic services and management recommendations to farmers and researchers. Her roles include clinic leadership and research, with no listed current grants or advising relationships. She is based in Clark Hall and reachable via 509-335-0616 .
- Verification of cyber-physical systems
- Logics and semantics of programming languages
- Programming with coinductive types
- +۳ مورد دیگر
Jean-Baptiste Jeannin is an Assistant Professor in the Department of Aerospace Engineering at the University of Michigan — Ann Arbor, leading the MARVL group. He is also affiliated with the departments of Computer Science and Engineering and Robotics. His research focuses on formal verification of cyber-physical systems, logics and semantics of programming languages, and coinductive programming types. He holds a Ph.D. in Computer Science from Cornell University (2013) and a Diplôme d'Ingénieur from École polytechnique (2007), with prior roles at Samsung Research America and Carnegie Mellon University. His research interests include verification of aerospace applications, program logics, and formal methods applied to robotics and distributed systems. Notable work includes formally verified algorithms for collision avoidance, network consensus protocols, and numerical methods. He teaches courses such as AERO 552 (Aerospace Information Systems) and EECS 590 (Advanced Programming Languages). Jeannin's recent publications emphasize formal verification in hybrid systems, rounding error analysis, and hardware-software co-design. His work bridges theoretical foundations with practical applications in autonomous systems, cybersecurity, and computational physics. Collaborations include projects on certified approximations of mathematical functions and verified distributed system protocols.