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

Richard Kiehlمشاهده پروفایل

استاد

• Nanoelectronics
• Spintronics
• Topological Insulators
• +۵ مورد دیگر

Richard Kiehl is a retired professor in the School of Electrical, Computer and Energy Engineering at Arizona State University (ASU), previously holding faculty positions at Stanford University, University of Minnesota, and University of California, Davis. He holds a Ph.D. from Purdue University (1974) and has extensive industry experience at Sandia National Laboratories, AT&T Bell Labs, IBM Research, and Fujitsu Laboratories. His research focuses on nanoscale electronics, molecular nanotechnology, spintronics, and topological insulators. He pioneered DNA-based self-assembly for nanoelectronics and led interdisciplinary initiatives like the Molecular Nanoscience Alliance (MONALISA) and the Functional Engineered Nano Architectonics (FENA) center. Education: Ph.D. (1974), M.S. (1970), and B.S. (1970) in Electrical Engineering from Purdue University. Research Interests: Nanofabrication, quantum devices, non-Boolean computing, and interdisciplinary applications of nanotechnology. Awards: Life Fellow of IEEE (2001), Louis John Schnell Professorship (Minnesota). His work spans corporate R&D, university leadership (e.g., Department Chair at UC Davis), and over 100 publications in journals like Nano Letters, Physical Review Applied, and Applied Physics Letters. He also served on technical committees for IEEE conferences and edited volumes on heterostructure devices.

Sarah M. Assmannمشاهده پروفایل

استاد

• Plant Physiology
• Cell Signaling
• Abiotic Stress Response
• +۴ مورد دیگر

Sarah M. Assmann is the Waller Professor of Biology at the Department of Biology, Pennsylvania State University. She is affiliated with the Huck Institutes of the Life Sciences. Her research focuses on plant electrophysiology, cell signaling, and abiotic stress responses, particularly in guard cell function and G-protein signaling pathways. She leads projects aimed at improving crop resilience through genetic and environmental studies in rice and Arabidopsis. Research Interests: Dr. Assmann investigates how plants perceive and respond to environmental stresses like drought and heat. Key areas include guard cell signaling, heterotrimeric G-protein regulation, and RNA structure-function relationships. Her work integrates molecular, physiological, and systems biology approaches. Grants & Projects: NIFA-USDA 2019-67013-29234: Rice G-protein signaling for drought tolerance NIH-R01GM126079: G-protein phosphorylation mechanisms NSF-MCB 1715826: G-protein networks in stomatal closure Labs & Teams: The Assmann Lab focuses on plant stress biology, employing advanced techniques like Structure-seq for RNA structural analysis. Collaborations include interdisciplinary teams addressing crop improvement and environmental adaptation.

Demetres Christofidesمشاهده پروفایل

دانشیار

• Combinatorics
• Random Graphs
• Extremal Graph Theory
• +۱۰ مورد دیگر

Dr. Demetres Christofides is an Associate Professor in Mathematics and Course Leader of BSc (Hons) Mathematics & Statistics at the University of Central Lancashire Cyprus (UCLan Cyprus). He holds a PhD in Mathematics from the University of Cambridge (2008), alongside advanced qualifications from Cambridge including a BA (2003), MA (2007), and Certificate of Advanced Study in Mathematics (2004). Affiliations: School of Sciences, Department of Mathematics. Administrative Roles: Former Senate Member (2015–2020), Deputy Head of School (2017–2018), and Academic Standards Lead (2017–2020). Research Interests: Focuses on combinatorics, including random graphs, extremal graph theory, positional games, and algorithmic graph theory. His work spans Hamilton cycles, Cayley graphs, information theory, and structural graph properties. He has contributed to over 10 peer-reviewed publications in journals like Journal of Combinatorial Theory and SIAM Journal on Discrete Mathematics . Funding & Grants: Secured research grants from the Cyprus Research Promotion Foundation and the EPSRC, including projects on extremal combinatorics and graph algorithms. Awards: Smith Prize (University of Cambridge). Outreach: Trains Cypriot Mathematical Olympiad teams, creates problems for international competitions (e.g., IMO Shortlist 2020), and co-authored a training book for high-school mathematics competitions. Teaching: Leads and teaches modules across all undergraduate years, including Real Analysis, Algebra, and Complex Analysis. Previously taught at Charles University, Warwick, and Birmingham.

Mahdi Imaniمشاهده پروفایل

استادیار

• Machine Learning
• Control Theory
• Learning Theory
• +۳ مورد دیگر

Mahdi Imani is an Assistant Professor in the Department of Electrical and Computer Engineering at Northeastern University, with a courtesy appointment in the Khoury College of Computer Sciences. He holds a PhD in Electrical Engineering from Texas A&M University (2019), and MSc and BSc degrees in Electrical and Mechanical Engineering from the University of Tehran (2014 and 2012, respectively). His research focuses on machine learning, control theory, Bayesian statistics, and signal processing, with applications in gene regulatory networks, network security, and human-AI collaboration. Dr. Imani has received prestigious awards, including the NIH NIBIB Trailblazer Award (2022), the NSF CISE Career Award (2020), and the Outstanding Associate Editor Award from IEEE Transactions on Neural Networks and Learning Systems (2023 and 2024). He serves as an Associate Editor for IEEE Transactions on Neural Networks and Learning Systems and IEEE Transactions on Vehicular Technology, and is a Senior Member of IEEE. His research projects include DARPA-funded work on verified probabilistic reasoning in mixed reality systems, NSF-funded statistical inference methods, and ONR-funded studies on human-AI team synergy. He leads a lab focused on developing scalable Bayesian methods and reinforcement learning techniques for complex systems.

• Application of Mathematics to Programming Languages
• Programming
• Software Engineering
• +۳ مورد دیگر

Dr. Jeremy L Jacob is a Senior Lecturer in the Department of Computer Science at the University of York. He holds a BSc in Mathematics from the University of Hull, an MSc in Computation from the University of Oxford (Oxon), and a DPhil (PhD) from Oxon. With over 10 years of postgraduate research experience, he has been a Lecturer since 1992 and joined the University of York in 1993. His research focuses on applying mathematical principles to programming language design, software engineering, and security protocols. His work spans formal methods, threat modeling in cloud and IoT systems, and security protocol analysis. He is affiliated with the Automated Software Engineering research group led by Professor Dimitris Kolovos. Contact details include office CSE/043 and phone +44 (0)1904 325667, though direct email access requires using the department's web form to protect against spam. Key contributions include pioneering work on translating CSP into timed automata, adapting threat modeling frameworks for modern systems, and exploring confidentiality properties in formal specifications (e.g., Circus and Z formalisms). His research bridges theoretical foundations with practical applications in cybersecurity and software engineering.

• Theoretical Computer Science
• Complexity Theory
• Operator Scaling
• +۲ مورد دیگر

Leonid Gurvits is a Professor in the Computer Science department at City College of New York. His research spans theoretical computer science, complexity theory, operator scaling, and quantum computing. Gurvits develops mathematical frameworks and algorithms addressing fundamental problems in combinatorics, optimization, and quantum information. Recent publications demonstrate Gurvits' focus on: Advanced operator scaling techniques and applications Quantum particle statistics and entanglement complexity Combinatorial optimization through matrix analysis Efficient algorithms for permanents and partition functions

• Cryptography
• Constraint Programming
• Formal Methods
• +۳ مورد دیگر

Dr. Arthur Gontier serves as a Research Associate within the School of Computing Science at the University of Glasgow, where he conducts specialized research at the intersection of cryptography and constraint programming. His academic profile centers on advancing formal methods for security-critical systems through rigorous algorithmic development. Research interests span Cryptography (symmetric ciphers, cryptanalysis), Constraint Programming (explanation generation, decomposition methods), and Formal Verification techniques. Recent work demonstrates deep engagement with Feistel network optimization, Trivium stream cipher analysis, and conflict-driven search methodologies, reflecting a consistent focus on mathematical foundations of secure computation. Publication trends from 2020-2022 reveal concentrated contributions to top-tier cryptography venues (INDOCRYPT, SAC) and constraint programming workshops. His research exhibits growing sophistication in post-quantum cryptographic techniques and trustworthy AI verification, with increasing emphasis on practical implementation challenges alongside theoretical advances. Collaborative patterns indicate active engagement with European research networks, particularly in cryptographic analysis. While specific grant details aren't public, the publication frequency suggests sustained research activity within Glasgow's security research ecosystem. Prospective collaborators would find opportunities in formal methods for security protocol verification and constraint-based AI validation systems.

Vladimir Shpilrainمشاهده پروفایل

استاد

• Post-Quantum Cryptography
• Computational Complexity
• Group Theory
• +۴ مورد دیگر

Vladimir Shpilrain is a Professor in the Department of Mathematics at The City College of New York (CUNY). His primary research focuses on post-quantum cryptography, computational complexity, and algorithmic problems in group theory. He is a leading figure in applying algebraic methods to cryptographic protocols and has contributed to foundational work in non-commutative cryptography. His academic affiliations include the Algebraic Cryptography Center and collaborative projects at the intersection of mathematics and computer science. Shpilrain has authored over 100 publications, including two influential books on combinatorial and computational group theory. His work bridges pure mathematics (e.g., combinatorial group theory, affine algebraic geometry) with applied areas like secure communication and blockchain technology. He holds patents for cryptographic systems and has advised numerous students in interdisciplinary research areas. Shpilrain teaches advanced courses in linear algebra, probability theory, and cryptography. His research is supported by grants exploring post-quantum security, Cayley hash functions, and delegation protocols. Collaborations span global institutions, emphasizing both theoretical rigor and practical applications in information security.

Otmar Spinasمشاهده پروفایل

استاد

• Set Theory
• Forcing
• Cardinal Invariants
• +۷ مورد دیگر

Prof. Dr. Otmar Spinas is affiliated with the Christian-Albrechts-University of Kiel , where he works in the Department of Mathematics . His research focuses on set theory, forcing, cardinal invariants, descriptive set theory, and infinite combinatorics , particularly in the context of Polish spaces and tree ideals. Research Interests : Spinas investigates the interplay between tree ideals, Ramsey theory, and regularity properties, with a focus on cardinal invariants, Tukey reductions, and the structure of Borel functions. His work often bridges mathematical logic, topology, and combinatorial set theory. Publications : His recent papers explore topics such as Mycielski ideals, compact tree ideals, and their covering numbers, alongside foundational contributions to Silver forcing and Sacks amoeba forcing. Projects : He is involved in DFG-funded research on cardinal invariants of tree ideals, antichain numbers, and continuous Ramsey theory.

• Set Theory
• Topology
• Topological Dynamics
• +۳ مورد دیگر

Will Brian is an Associate Professor of Mathematics at the University of North Carolina Charlotte. His primary research interests lie in set theory, topology, and topological dynamics. He holds affiliations with the Department of Mathematics within the College of Liberal Arts and Sciences. His research explores advanced topics such as cardinal invariants, ultrafilters, and the interplay between set theory and topological spaces. Notable works include studies on Borel partitions, Mahavier products, and dynamics of Cantor spaces. Brian frequently collaborates with scholars like Alan Dow, Saharon Shelah, and Jörg Brendle, producing impactful papers in journals like Proceedings of the American Mathematical Society and Topology and its Applications . Recent research trends focus on partition calculus, topological games, and combinatorial principles in forcing. He has presented at international conferences including the Summer Topology Conference and TOPOSYM, showcasing work on Efimov spaces, Banach-Mazur games, and automorphisms of ultrafilter spaces. Brian’s contributions span over 40 peer-reviewed articles. Notable awards or grants are not explicitly stated in the provided materials. His advising record is currently unspecified, though his collaborations suggest active participation in graduate mentorship. He maintains an active seminar presence and frequently shares preprint versions of his work.

Jinwook Leeمشاهده پروفایل

استادیار

• Optimization
• Risk Modeling
• Stochastic Optimization
• +۱۷ مورد دیگر

Jinwook Lee is an Assistant Professor in the Decision Sciences and MIS department at LeBow College of Business, Drexel University. His research focuses on optimization, risk modeling, and artificial intelligence systems, particularly applied to blockchain, supply chain, and financial decision-making. He is actively involved in funded research, including an NSF SBIR grant on blockchain-based supply chain systems. Research Interests: His expertise spans Stochastic Optimization , Mathematical Programming , Blockchain , Operations Research , and Data Privacy . He develops models for uncertainty quantification, risk assessment, and fairness in AI systems using advanced mathematical tools such as pseudo-Boolean functions and multivariate risk measures (e.g., MVaR, MCVaR). His work bridges theoretical rigor with practical applications in finance, supply chains, and forecasting. The recent articles reflect a strong trend toward integrating blockchain and AI with privacy-preserving forecasting , equity metrics , and secure supply chains . His publications span top journals in operations research and management science, indicating a consistent and impactful research trajectory in quantitative decision sciences. Scientific Awards: NSF SBIR Grant (Award #2112078), Co-PI, Mar 2022 Advising and Grants: While direct student names are not listed, his collaborative work with Matthew J. Schneider and András Prékopa suggests active mentorship and research collaboration. He leads a funded project on blockchain-based tracking and distribution with $255,786 from the National Science Foundation, indicating strong grant-writing capability and research leadership. Labs and Research Teams: Though no formal lab name is provided, his research activities suggest leadership in a group focused on blockchain, AI, and risk modeling, likely involving interdisciplinary collaboration across business analytics, computer science, and operations research.

Clemens Dubslaffمشاهده پروفایل

استادیار

• Formal Methods
• Probabilistic Model Checking
• Symbolic Methods
• +۴ مورد دیگر

Clemens Dubslaff is an Assistant Professor in the Formal System Analysis group at TU Eindhoven (The Netherlands). His research focuses on improving the reliability and explainability of computing systems through formal methods, particularly probabilistic model checking and symbolic techniques. He holds a Ph.D. from TU Dresden (Germany) and has affiliations with TU Dresden's Cluster of Excellence CeTI and Collaborative Research Center CPEC. His work addresses challenges in analyzing complex configurable systems and enhancing system transparency through explainable AI approaches. Education: B.Sc. in Mathematics and Computer Science (TU Dresden) M.Sc. in Computational Logic (NOVA University Lisbon) Ph.D. in Formal Methods (TU Dresden) Research Interests: Formal methods and model checking Symbolic analysis techniques Configurable and reconfigurable systems Explainability in AI and verification Probabilistic systems analysis Recent Achievements: NWO VENI Grant (2023) Launched OxiDD decision diagram framework (2024) Key contributions to feature-based software analysis Labs/Teams: Formal System Analysis group at TU/e, collaborating with Dresden's CeTI and CPEC initiatives.

• Numerical Analysis
• Computer Science
• Partial Differential Equations
• +۵ مورد دیگر

Kosmas Iordanidis is a Professor of Mathematics actively involved in teaching courses related to computer science and numerical analysis. His academic contributions include instruction in: Introduction to Computer Science Numerical Analysis II Numerical Solution of Partial Differential Equations (Postgraduate Course) Research interests are evident from his teaching focus, spanning computational mathematics, algorithm design, and numerical methods for differential equations. He has developed extensive educational materials, including lecture notes, slides, and exercises in FORTRAN programming , Boolean Algebra , and Arithmetic Logic Units (ALU). Key technical themes include computer arithmetic, logic function simplification with Karnaugh maps, and numerical solutions for scientific computing. Course materials from 2005–2006 highlight structured teaching across 13 educational weeks, covering topics such as: Computer components and information processing systems Combinational circuits and symbolic languages Microprogramming, memory systems, and high-level language comparisons Applications in BCD arithmetic , Newton-Raphson method , and Gaussian integration

Sourav Chakrabortyمشاهده پروفایل

استاد

• Theoretical Computer Science
• Boolean Functions
• Quantum Complexity
• +۴ مورد دیگر

Sourav Chakraborty is a Professor in the Advanced Computing and Microelectronics Unit (ACMU) of the Computer and Communication Sciences Division at the Indian Statistical Institute (ISI), Kolkata, India. He joined ISI in July 2018 after serving as faculty at Chennai Mathematical Institute from 2010-2018. Previously, he held postdoctoral positions at Centrum Wiskunde & Informatica (CWI) in Amsterdam and Technion in Israel. Education: Ph.D. in Computer Science, University of Chicago (2008) M.S. in Computer Science, University of Chicago (2005) B.Sc. in Mathematics, Chennai Mathematical Institute (2003) Research Focus: Professor Chakraborty specializes in Theoretical Computer Science with emphasis on classical and quantum complexity of Boolean functions, including sensitivity analysis, property testing, and quantum database search. His work extends to graph algorithms, electronic commerce mechanisms, and coding theory. His research explores fundamental questions in computational complexity through innovative mathematical frameworks. Publication Trends: Recent work demonstrates a strong focus on property testing, sampling algorithms, and complexity theory, with significant contributions to streaming algorithms, Boolean function analysis, and quantum query complexity. His publications frequently appear in top theoretical computer science venues and exhibit consistent innovation in algorithm design and complexity boundaries. Awards & Honors: Praise from Donald E. Knuth for streaming algorithms research Inclusion in Oded Goldreich's 'my choices' list for Conditional Sampling and Huge-Object Model work Chakraborty's function named in his honor for Sensitivity Conjecture contributions Academic Service: Teaches courses in discrete mathematics and theoretical computer science, with detailed course materials available through institutional pages. Organized workshops including the 2020 Workshop on Sensitivity and Query Complexity at ISI.

Oscar Defrainمشاهده پروفایل

دانشیار

• Algorithms
• Combinatorics
• Graph Theory
• +۴ مورد دیگر

Oscar Defrain is an Associate Professor at Aix-Marseille University, affiliated with the Laboratoire d’Informatique et Systèmes (LIS UMR CNRS 7020) and the ACRO team. He holds a Ph.D. from Université Clermont Auvergne (2020) and completed a postdoc at the University of Warsaw. His research focuses on algorithms and combinatorics in graphs, hypergraphs, and lattice structures, with expertise in minimal dominating sets, maximal independent sets, and Boolean function dualization. Education : Ph.D. in Computer Science, Université Clermont Auvergne (2020) Research Interests : Defrain specializes in structural graph theory, hypergraph dualization, and algorithmic enumeration. His work spans combinatorial optimization, parameterized complexity, and lattice theory, with recent contributions to geometric graph certification, metric graph problems, and XOR-CNF signature enumeration. He coordinates the ANR JCJC PARADUAL project and participates in ERC Cutacombs and ANR DISTANCIA. Recent Publications (2024-2025) examine quasi-optimal bounds for induced paths, polynomial-delay isomorphism generation, hypergraph dualization with FPT-delay, and geometric graph certification. These works intersect graph algorithms, combinatorics, and theoretical computer science. Teaching : Defrain teaches graph theory, algorithmic enumeration, and programming (Java/Python) at Aix-Marseille University (M1, L1, L2) and Université Clermont Auvergne (M1, L3). He uses platforms like Moodle and AMeTICE for course materials.