جستجوی استاد راهنمای دانشگاهی

Mika Göösمشاهده پروفایل

استادیار

• Computational Complexity
• Communication Complexity
• Theoretical Computer Science
• +۳ مورد دیگر

Mika Göös is a Tenure Track Assistant Professor at EPFL in the School of Computer and Communication Sciences, Department of Computer Science. Previously, he held postdoctoral positions at Stanford, Princeton IAS, and Harvard. He earned his PhD from the University of Toronto under Toniann Pitassi, an MSc from the University of Oxford, and a BSc from Aalto University. Education PhD: University of Toronto MSc: University of Oxford BSc: Aalto University His research focuses on computational and communication complexity, exploring fundamental limits of algorithms and their applications in cryptography, circuit design, and distributed computing. He co-developed lifting theorems connecting query complexity to communication complexity and investigates lower bounds in randomized algorithms, TFNP problems, and monotone circuits. Recent work emphasizes quantum communication advantages, direct sum theorems, and hardness condensation. His 15 most recent publications span topics like k-Hamming distance, parity decision trees, depth-3 circuits, and separations in TFNP classes. Scientific awards include the Machtey Award (2015), Best Paper at DISC (2012), EATCS Distinguished Dissertation Award (2017), and Best Paper at FOCS (2020). He has advised numerous PhD and MSc students, including Weiqiang Yuan, Ziyi Guan, and Alexandros Hollender. Currently, he leads a team comprising PhD students (Guan, Imbach, Riazanov, Sofronova, Yuan), postdocs (Nathaniel Harms), and scientists (Dmitry Sokolov). His work has appeared in top venues like STOC, FOCS, CCC, and ITCS, often with recorded talks and published in journals such as JACM and SICOMP.

Jieh Hsiangمشاهده پروفایل

استاد

• Automated Reasoning
• Programming Language Logic
• Artificial Intelligence
• +۵ مورد دیگر

Jieh Hsiang is a Distinguished Professor at National Taiwan University , with affiliations in the Department of Computer Science and Information Engineering, the Digital Archives and Automatic Inference Laboratory, and the Digital Humanities Research Center. He holds concurrent roles at the Institute of Information Science, Academia Sinica, and the Higher Education Research & Development Office, National Taiwan University. Education PhD in Computer Science, University of Illinois at Urbana-Champaign (1979–1982) BS in Mathematics, National Taiwan University (1972–1976) Research Interests Hsiang's work spans automated reasoning , digital libraries , digital humanities , and information retrieval . His research focuses on integrating computational methods with cultural heritage preservation , particularly through tools like DocuSky and databases such as the Taiwan Historical Digital Library . He explores AI applications in patent analysis , historical text mining , and semantic relationships in legal documents . Recent Trends in Publications His recent articles highlight advancements in BERT and GPT-2 fine-tuning for patent classification , LARGE language models for legal automation , and GIS-based analysis of historical archives . Themes include digital preservation , AI-driven legal text analysis , and cross-disciplinary computational tools for humanities scholars. Scientific Awards 2019 Ministry of Science and Technology Distinguished Research Fellow 2009 National Taiwan University Outstanding In-House Service Award 2008 Chinese Library Association Special Contribution Award 2006 IEEE Test-of-Time Award 1997 & 1999 National Science Council Outstanding Research Award 1997 Ministry of Education Outstanding Industrial-Academic Collaboration Award 1998–2001 Founder and First Chair of IFIP WG1.6 Labs and Collaborations Hsiang leads the Digital Archive and Automatic Inference Laboratory , developing platforms like DocuSky for digital humanities, Taiwan Historical Digital Library , and QGIS Cloud Maps for spatial analysis. His team collaborates internationally on projects involving historical document digitization , patent automation , and cross-domain knowledge integration .

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

استاد

• Combinatorial Optimization
• Online Algorithms
• Graph Theory
• +۶ مورد دیگر

Professor Yann Disser is a faculty member in the Department of Mathematics at TU Darmstadt since 2021. He previously held an Assistant Professor (tenure-track) position at TU Darmstadt (2016-2021), a PostDoc position at TU Berlin (2012-2016), and a Visiting Professor role at Augsburg University (2015). His research spans Combinatorial Optimization , Online Algorithms , Graph Exploration , Computational Complexity , and Robust Optimization . Current position: Professor (W2), TU Darmstadt Previous: Assistant Professor (2016-2021), TU Darmstadt PostDoc & Habilitation: TU Berlin (2012-2016) His research focuses on algorithmic approaches to optimization problems, including: Combinatorial Optimization for problems like Steiner trees and knapsack variants Online Algorithms with applications to scheduling and transportation Graph Exploration by mobile agents and complexity bounds Computational Complexity of linear programming pivot rules Network Flows and geometric reconstruction Recent publications analyze incremental maximization with greedy methods, lower bounds for active-set methods , and universal circuit designs . His work appears in top venues like IPCO , ESA , and SODA . He advises a team of researchers including David Weckbecker, Farehe Soheil, and Alexander Birx. Current and past advisees often focus on algorithmic theory, with placements at institutions like HPI Potsdam and Merck.

• FPGA Design
• VLSI Systems
• Logic Synthesis
• +۷ مورد دیگر

Pierre-Emmanuel Gaillardon is a Professor in the Department of Electrical & Computer Engineering and Adjunct Professor in the School of Computing at the University of Utah. He holds a joint appointment since July 2024, having previously served as Assistant Professor (2016–2019) and Adjunct Assistant Professor in Computing (2016–2019). His research focuses on FPGA design, VLSI systems, nanoelectronics, and hardware security. He leads projects in emerging devices like TIGFETs, compute-in-memory architectures, and radiation-hardened FPGA fabrics. Teaching includes courses on Digital VLSI Design, Embedded Systems Design, and thesis supervision. He has secured grants from NSF, DARPA, and industry partners totaling over $10M, addressing topics like FPGA redaction, neuromorphic systems, and environmental sensors. Notable awards include the NSF CAREER Award (2018) and IEEE Senior Member elevation (2016). He actively serves on IEEE committees for nanoelectronics and EDA tools, contributing to standards like OpenFPGA.

Noga Alonمشاهده پروفایل

استاد

• Combinatorics
• Graph Theory
• Theoretical Computer Science
• +۵ مورد دیگر

Noga Alon is a Professor of Mathematics at Princeton University, affiliated with the Mathematics Department. He is renowned for his contributions to Combinatorics, Graph Theory, and Theoretical Computer Science. His research emphasizes algebraic and probabilistic methods, with applications in circuit complexity and combinatorial geometry. Education & Affiliations Current position: Professor at Princeton University. Active in the Princeton Discrete Mathematics Seminar and has led conferences like the Noga60 Birthday Conference. Research Interests Focus areas include Combinatorics (e.g., Ramsey Theory, Graph Coloring), Theoretical Computer Science (e.g., Algorithms, Complexity), and probabilistic and algebraic methods in discrete mathematics. His work bridges combinatorial structures and algorithmic applications, with contributions to expander graphs, randomized algorithms, and extremal graph theory. Publications Over 300 papers, including foundational work on the probabilistic method, expander graphs, and combinatorial algorithms. Notable recent topics include graph coloring, path-finding algorithms (e.g., Color-coding), and spectral techniques for graph problems. Grants & Awards No specific grants or awards listed in available texts, though his academic stature implies prestigious recognition in combinatorics and computer science. Labs & Collaborations Involved in collaborative research through Princeton’s Mathematics Department and international conferences. Leads seminars and co-authors work with prominent researchers like M. Naor, J. Spencer, and others.

Ran Razمشاهده پروفایل

استاد

• Complexity Theory
• Quantum Computation
• Circuit Complexity
• +۲ مورد دیگر

Professor Ran Raz specializes in complexity theory at Princeton University's Department of Computer Science. His research targets lower bounds in computational models, quantum communication, and derandomization. Current investigations include quantum logspace verifiability and memory-sample tradeoffs in learning algorithms. Research pillars: Boolean/arithmetic circuit complexity Quantum computation and communication Probabilistically checkable proofs Publications reflect a focus on quantum-classical hybrid systems and foundational limits of computation. Lab affiliations: Quantum research group at Princeton CS.

• Computational Complexity
• Boolean Functions
• Communication Complexity
• +۵ مورد دیگر

Shachar Lovett is a researcher at the University of California, San Diego (UCSD), specializing in computational complexity, combinatorics, and theoretical computer science. His work spans advanced topics in communication complexity, pseudorandomness, and coding theory, often intersecting with problems in additive combinatorics and Boolean function analysis. Education : Not explicitly detailed in the provided text. Research Interests : Lovett's research focuses on computational complexity, particularly in communication and circuit complexity, combinatorial structures like sunflowers and high-dimensional expanders, and the analysis of Boolean functions through Fourier and Gowers norms. His work explores the limits of deterministic vs. randomized computation, the structure of codes over finite fields, and the interplay between additive combinatorics and theoretical computer science. Article Trends : His recent publications address exact vs. approximate representations of Boolean functions, quasipolynomial bounds in combinatorics, hypercontractivity in high-dimensional expanders, and advancements in the log-rank conjecture. These works emphasize connections between computational complexity, discrete mathematics, and pseudorandomness, often yielding improved bounds or novel frameworks for understanding Boolean function behavior. Scientific Awards : No specific awards or honors were mentioned in the provided text. Advising and Collaborations : Lovett collaborates extensively with researchers like Hamed Hatami, Kaave Hosseini, and Jiapeng Zhang, contributing to fields such as non-malleable codes, matrix multiplication algorithms, and communication complexity. No formal student advising details were provided.

• Mathematical Logic
• Philosophical Logic
• Philosophy of Mathematics
• +۳ مورد دیگر

Prof. Dr. Reinhard Kahle is a faculty member at the University of Tübingen in the Faculty of Philosophy . He holds the academic rank of Professor and his research focuses on Mathematical Logic , Philosophical Logic , Philosophy of Mathematics , and History of Logic . He also investigates the Societal Relevance of Science and Philosophy of Language . Education : Studium der Mathematik, Philosophie und Informatik in Göttingen, Zürich und München (1987-1993) Diplom in Mathematik, LMU München (1993) Promotion in Informatik, Universität Bern (1997) Habilitation in Informatik, Universität Tübingen (2007) Habilitation in Mathematik, Universidade de Coimbra (2008) Awards : Carl Friedrich von Weizsäcker-Stiftungsprofessor für Theorie und Geschichte der Wissenschaften, University of Tübingen (2019) Publications : Advances in Proof Theory (2016, co-editor) Gentzen's Centenary: The quest for consistency (2015, co-editor) Over 40 peer-reviewed journal articles and book chapters focusing on proof theory, mathematical logic, and philosophical implications of formal systems

• Parallel Computing
• Distributed Computing
• Algorithms
• +۴ مورد دیگر

Ramachandran Vaidyanathan (Vaidy Vaidyanathan) is the Elaine T. and Donald C. Delaune Distinguished Professor in the School of Electrical Engineering and Computer Science at Louisiana State University (LSU). His research focuses on parallel and distributed computing, reconfigurable architectures, interconnection networks, and autonomous robot coordination. Developed the Reconfigurable Multiple Bus Machine (RMBM) model Authored the book Dynamic Reconfiguration: Architectures and Algorithms Holds multiple patents for optical networking and reconfigurable hardware Research Interests : Parallel and distributed algorithms Reconfigurable computing models Autonomous robot coordination Optical interconnection networks Scientific Awards : US Patent 6,332,050 US Patent 6,792,175 US Patent 8,862,854 US Patent 9,257,988 US Patent 10,282,347 Advising and Grants : Supervises students in reconfigurable computing and distributed systems. Collaborates with institutions on NSF-funded projects. Labs : Leads the Reconfigurable Computing Group at LSU.

• Distributed Systems
• Cryptography
• Electronic Voting
• +۳ مورد دیگر

Michael J. Fischer is a Professor of Computer Science at Yale University, renowned for foundational contributions to distributed systems theory, cryptography, and parallel algorithms. His work includes the seminal impossibility result for distributed consensus with faulty processes and the development of the parallel prefix algorithm fundamental to modern parallel computing. His educational background: B.S. in Mathematics, University of Michigan (1963) M.A. in Applied Mathematics, Harvard University (1965) Ph.D. in Applied Mathematics, Harvard University (1968) Fischer's research spans theoretical and applied computer science with emphasis on distributed systems (consensus protocols, fault tolerance), cryptography (information-theoretic security, card-based protocols), and electronic voting systems . His work bridges abstract theory with practical security applications, particularly in trust modeling for e-commerce. Current investigations focus on algorithmic approaches to establishing trust relationships in distributed environments. His publication trajectory reveals evolving expertise from early parallel algorithms (1970-80s) to distributed consensus breakthroughs (mid-1980s), then cryptographic protocols and secure e-voting systems (1985-2000s), with recent work synthesizing these domains through trust frameworks. Key thematic threads include fault tolerance in unreliable networks and verifiable security mechanisms. Scientific recognition: ACM Fellow Fischer has held significant leadership roles including Editor-in-Chief of the Journal of the ACM , chair of the Max-Planck-Institute for Computer Science International Scientific Advisory Board, and founding member of the Computing Research Association's subcommittee on Women in Computer Science. His advisory work extends to the National Science Foundation and Wuhan University's State Key Laboratory on Software Engineering. Outside academia, he actively participates in the Yale Figure Skating Club, having served multiple terms as president. He maintains international collaborations as Guest Professor at Wuhan University and through editorial roles including Acta Informatica , while continuing to teach core computer science courses from data structures to cryptography at Yale.

Christian Ikenmeyerمشاهده پروفایل

استاد

• Computational Complexity
• Algebraic Combinatorics
• Geometric Complexity Theory
• +۲ مورد دیگر

Christian Ikenmeyer is Professor in Computer Science and Mathematics at the University of Warwick. His research focuses on algebraic complexity theory, geometric complexity theory (GCT), and representation theory, with emphasis on tensor rank, Kronecker coefficients, and polynomial identity testing. Research Focus: Dr. Ikenmeyer develops mathematical frameworks to solve fundamental problems in computational complexity, including P vs NP. His work connects representation theory with algebraic geometry to establish complexity lower bounds and classify computational hardness. Leadership: He organizes workshops on algebraic complexity and GCT, including the 2023 Algebraic Complexity Theory Workshop at ICALP. His research is funded by EPSRC and DFG grants, supporting investigations into homogeneous complexity and branching programs. Teaching: Courses include 'Groups and Representations' and programming contest coaching. He has previously taught at MIT, Texas A&M, and Saarland University, developing lecture notes on GCT.

Ran Razمشاهده پروفایل

استاد

• Computational Complexity Theory
• Boolean Circuit Complexity
• Communication Complexity
• +۲ مورد دیگر

Ran Raz is a Professor of Theoretical Computer Science at Princeton University. He earned his B.Sc. in Mathematics and Physics (1987) and Ph.D. in Mathematics (1992) from the Hebrew University of Jerusalem. After postdoctoral work at Princeton (1994), he joined the Weizmann Institute of Science in Israel and held visiting positions at Microsoft Research (2006, 2009) and the Institute for Advanced Study (2012–2016). Education: B.Sc. in Mathematics and Physics, Hebrew University of Jerusalem (1987) Ph.D. in Mathematics, Hebrew University of Jerusalem (1992) Research Interests: Computational Complexity Theory Boolean and Arithmetic Circuit Complexity Probabilistically Checkable Proofs Quantum Computation and Communication Randomness and Derandomization

Mauricio Antunesمشاهده پروفایل

استادیار

• Synthetic Biology
• Plant Synthetic Biology
• Genetic Circuits
• +۳ مورد دیگر

Mauricio Antunes is an Assistant Professor in the Department of Biological Sciences and a member of the BioDiscovery Institute at the University of North Texas (UNT), where he joined in 2018 after serving as a Research Assistant Professor at Colorado State University. His work pioneers plant synthetic biology to engineer plants with novel traits for environmental sensing and improved bioproduction. Education: B.S. in Agronomy from Universidade Federal de Viçosa, Brazil M.S. in Crop Sciences from Universidade Federal de Viçosa, Brazil Ph.D. in Plant Molecular Biology from Purdue University under Nick Carpita and Tom Hodges Dr. Antunes' research focuses on developing synthetic biology tools for plant engineering. Key areas include: Synthetic transcriptional/post-transcriptional control systems modulated by specific inputs Small RNAs as mobile signaling molecules in plants Complex genetic circuits for enhanced plant production Re-wiring metabolic pathways like phenylpropanoid biosynthesis His publication analysis (2016-2024) shows consistent innovation in plant synthetic biology, with recent emphasis on Boolean logic gates for environmental sensing, RNA signaling mechanisms, and metabolic pathway engineering. Key trends include the development of tunable promoters, microRNA mobility studies, and biosensors for plant metabolites. Scientific Awards: No scientific awards listed for Dr. Antunes Dr. Antunes actively mentors graduate students and secures research funding: Current Students: Jordan LaChance (PhD), Md Shoyeb (PhD), Jesseca Hemminger (PhD) Former Students: Stephanie Amack (MS), Charles Anderson (MS), Armin Tutnjic (MA) Current Grant: The Welch Foundation ($240,000, 2021-2024) for 'Establishing biochemical determinants of microRNA long-distance mobility in plants' The Antunes Lab, part of UNT's BioDiscovery Institute, comprises postdocs, graduate students, and undergraduates collaborating on plant synthetic biology projects. The team maintains strong interdisciplinary connections within UNT and with external partners like Colorado State University, focusing on translating synthetic biology tools into agricultural and biotechnological applications.

Wilson W. Wongمشاهده پروفایل

استاد

• Synthetic Biology
• Immunotherapy
• Gene Circuit Engineering
• +۵ مورد دیگر

Wilson W. Wong is a Professor in the Department of Biomedical Engineering at Boston University's College of Engineering. His research focuses on synthetic biology and engineering cellular therapies, particularly CAR T and CAR-NK cells for cancer, diabetes, and vaccine applications. He leads the Wilson Wong Lab, developing genetic circuits for precise control of cell functions through molecular, chemical, and optogenetic tools. Key achievements include FDA-approved drug-gated circuits, light-inducible recombinases, and saRNA platforms for reduced immunogenicity. Education: PhD in Chemical Engineering (UCLA), B.S. in Chemical Engineering (UC Berkeley). Awards include the Allen Distinguished Investigator Award (2022), NAE German-American Frontiers Invitee (2021), and NIH Director’s New Innovator Award (2013). He collaborates with institutions like MIT and Harvard on lung regeneration projects through the Allen Distinguished Investigators program. Research Highlights: Logic-gated CAR therapies, optogenetic cell patterning, and saRNA-based vaccines Lab Members: Supervises students including Cristina, Huishan, Josh, and Justin Letendre Grants: Allen Foundation, NSF CAREER Award, NIH funding His work bridges synthetic biology with clinical translation, emphasizing spatiotemporal control of cell functions for regenerative medicine and oncology. Recent breakthroughs include multiplex light-inducible circuits and saRNA modifications enhancing therapeutic efficacy.

• Mathematical Logic
• Computer Science
• Proof Theory
• +۵ مورد دیگر

Kazushige Terui is an Associate Professor at the Research Institute for Mathematical Sciences (RIMS), Kyoto University. His research focuses on mathematical logic and its applications to computer science, particularly proof theory, computational complexity, and nonclassical logics. He investigates proof normalization complexity, algebraic reformulations of proof-theoretic techniques, and logical foundations of computation. Terui maintains an active research group at RIMS and teaches courses including Mathematical Logic and Computer Science Fundamentals. Research Interests: Terui's work spans: Proof-theoretic aspects of nonclassical logics (linear logic, substructural logics) Computational complexity of proof normalization in lambda calculus Algebraic reformulation of logical techniques (cut-elimination, interpolation) Denotational semantics approaches to complexity characterization Effective proof discovery methods based on programming language theory Publications: His recent articles primarily explore proof theory, computational complexity, and logical foundations, with frequent focus on lambda calculus, linear logic, and type systems. Works frequently bridge theoretical computer science and mathematical logic. Education & Outreach: Authored the book Can Computers Become Mathematicians? (2015) for general audiences and maintains extensive lecture materials on mathematical logic and computer science foundations.