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

Pierre-Evariste Dagandمشاهده پروفایل

پژوهشگر

• Formal Verification
• Programming Languages
• Theorem Proving
• +۵ مورد دیگر

Pierre-Evariste Dagand is a CNRS Researcher at IRIF, Université de Paris, where he is a member of the Proofs, Programs, and Systems group. His research focuses on enhancing the safety of systems software through the application of domain-specific languages and formal verification techniques, particularly leveraging interactive theorem provers. His research interests span several areas of computer science, including: Formal Methods : Using rigorous mathematical techniques to verify software and hardware systems Programming Languages : Designing and implementing languages with a focus on safety and correctness Compilers : Developing verified compilers for domain-specific languages and synchronous languages Type Theory : Exploring dependent types and their applications in verification Operating Systems : Contributing to the design of systems for multicore architectures Cryptography : Creating high-throughput cryptographic implementations via formal methods Dagand's publications demonstrate a consistent focus on formal verification and theorem proving applied to practical systems. His work frequently involves the Coq proof assistant and addresses challenges in compilers, cryptography, and systems programming. Recent trends include the development of tools for secure cryptographic implementations (e.g., Usuba and Tornado) and formal models for intermittent computing. He has advised numerous students in internships, working on projects related to formal methods, compilers, and cryptography. These internships have contributed to various research outputs and tools. Dagand is part of the Proofs, Programs, and Systems group at IRIF, which focuses on foundational aspects of computer science and their application to software verification and language design.

Evgenia Dimitrova Velikovaمشاهده پروفایل

دانشیار

• Coding Theory
• Algebra
• Information Theory
• +۳ مورد دیگر

Dr. Evgenia Dimitrova Velikova is an Associate Professor in the Algebra Department at the Faculty of Mathematics and Informatics, Sofia University "St. Kliment Ohridski". Her academic career spans several decades with significant contributions to both theoretical mathematics and educational research. Her research interests focus primarily on coding theory, particularly covering radius of linear codes, cyclic codes, and weight distributions. She has also made notable contributions to the field of educational assessment within mathematics education, analyzing student admissions processes and examination systems at her institution. Her work bridges theoretical mathematics with practical applications in both information theory and educational systems. Analysis of Dr. Velikova's publication history reveals a strong trajectory in coding theory research from the 1980s through the 2000s, with a notable shift toward educational research and interdisciplinary applications in digital humanities during the 2010s. Her later work demonstrates expertise in applying mathematical concepts to art image analysis and metadata extraction, showing versatility across multiple domains while maintaining her core mathematical foundation. Dr. Velikova has collaborated extensively with researchers including Ts. Baicheva, A. Bojilov, K. Ivanova, and P. Stanchev. Her work on covering radii of linear codes has been cited in numerous publications, including significant references in "Covering codes" by Cohen, Honkala, Litsyn, and Lobstein (1997), indicating substantial impact in her field. Her research has appeared in prestigious journals such as IEEE Transactions on Information Theory and SERDICA Journal of Computing. As an educator at Sofia University's Faculty of Mathematics and Informatics, Dr. Velikova has contributed significantly to curriculum development and educational assessment. Her office is located in room FMI-518, with office hours on Mondays from 13 to 15 at room 208 and Tuesdays from 13 to 14 at room 518, demonstrating her active engagement with students and academic community.

• Algebra
• Geometry
• Coding Theory
• +۲ مورد دیگر

Ilaria Cardinali serves as Associate Professor in the Department of Information Engineering and Mathematical Sciences at the University of Siena, teaching Linear Algebra for undergraduate programs in Management Engineering and Computer and Information Engineering through the 2025/2026 academic year. Her office hours are held Tuesdays from 14:30-16:00 at S. Niccolo' Building, Room 108. Her research spans Algebra, Geometry, Coding Theory, and Combinatorics with emphasis on structural properties of Grassmannians, polar spaces, and Lie-type geometries. Key investigations include interrelationships between finite fields, linear codes, and geometric frameworks, revealing novel algebraic characterizations in combinatorial structures. Recent publications demonstrate consistent focus on geometric aspects of coding theory, particularly through Grassmann graph analyses and orthogonal/symplectic polar space characterizations. This work bridges abstract algebraic concepts with practical coding applications, showing increasing collaboration intensity in recent years.

Thomas M. Langleyمشاهده پروفایل

استاد

• Combinatorics
• Algebra
• Algebraic combinatorics
• +۳ مورد دیگر

Thomas M. Langley serves as Professor of Mathematics in the Department of Mathematics at Rose-Hulman Institute of Technology, specializing in combinatorics and algebra with expertise in symmetric functions and cwatsets. His academic credentials include: PhD in Mathematics from University of California-San Diego (2001) MA in Mathematics from San Diego State University (1996) MS in Electrical Engineering from University of Southern California (1989) BS in Electrical Engineering from Rice University (1989) Dr. Langley's research integrates algebraic combinatorics with discrete structures, focusing on cwatsets (binary space subsets discovered at Rose-Hulman in the 1980s), symmetric functions, and graph theory. His work bridges theoretical mathematics with applications in coding theory and computability. His 2011-2012 publications reveal a concentrated exploration of combinatorial structures, particularly Wilf equivalence frameworks and group-theoretic commutativity bounds, demonstrating consistent contributions to enumerative combinatorics and finite group theory within mathematical research. As editor of the Rose-Hulman Undergraduate Mathematics Journal—the longest-running U.S. publication dedicated to undergraduate math research—Dr. Langley actively mentors student scholarship. His pre-academic career included electrical engineering at NASA's Jet Propulsion Laboratory (1989-1993) and mathematical consulting for Algebraix Data Corporation (2012).

Ruzica Piskacمشاهده پروفایل

استاد

• Software Verification
• Security
• Applied Cryptography
• +۳ مورد دیگر

Ruzica Piskac is a Professor of Computer Science at Yale University, where she joined the Department of Computer Science in 2013 and leads the Rigorous Software Engineering (ROSE) research group. Her work focuses on formal techniques to improve software reliability and trustworthiness through verification, security, and synthesis approaches. Education: PhD in Computer Science from the Swiss Federal Institute of Technology (EPFL) in 2011 Thesis title: Decision Procedures for Program Synthesis and Verification Previously led an independent research group at the Max Planck Institute for Software Systems in Germany (2012-2013) Research Interests: Piskac's research spans software verification, security and applied cryptography, automated reasoning, and code synthesis. Her work combines formal methods with practical applications in programming languages, particularly focusing on making software systems more reliable and trustworthy. She has developed tools for symbolic execution in Haskell, privacy-preserving formal methods, and verification techniques for configuration files and software updates. Publication Trends: Her recent work shows a strong focus on applying formal verification techniques to emerging challenges including large language models, zero-knowledge proofs, quantum computing security, and legal accountability for AI systems. There's a clear trajectory toward bridging formal methods with practical security and verification challenges across diverse domains. Awards: Multiple Amazon Research Awards Yale University's Ackerman Award for Teaching and Mentoring Facebook Communications and Networking Award Microsoft Research Award for the Software Engineering Innovation Foundation Patrick Denantes Prize for her doctoral dissertation Advising and Service: Piskac has graduated five PhD students, four of whom are now assistant professors of computer science. She has served as Program Chair of the 37th International Conference on Computer Aided Verification and is on the Steering Committee of the Formal Methods in Computer-Aided Design conference. Her service includes numerous program committee roles across major programming languages and verification conferences. Research Group: She leads the Rigorous Software Engineering (ROSE) group at Yale, which focuses on developing formal techniques for software reliability and trustworthiness, with projects spanning symbolic execution, privacy-preserving verification, reactive synthesis, and configuration file verification.

Volker Stolzمشاهده پروفایل

دانشیار

• Formal Methods
• Model Transformation
• UML
• +۷ مورد دیگر

Volker Stolz is an Associate Professor in the Department of Informatics at the University of Oslo, Faculty of Mathematics and Natural Sciences. He is affiliated with the Reliable Systems research group, where his work centers on improving software reliability through formal methods, model transformation, and UML-based modeling. Institution: University of Oslo School: Faculty of Mathematics and Natural Sciences Department: Department of Informatics Research Group: Reliable Systems Contact: stolz@ifi.uio.no | +47 22852438 | Room GA06 9461 His research spans formal verification, concurrency, model-based testing, and programming language semantics. He has made significant contributions to deadlock detection, refactoring equivalence, runtime verification in distributed systems, and data race analysis, often using formal models such as Petri nets and active object languages. The recent publications highlight a consistent focus on software correctness , modular analysis , and automated verification techniques. Trends include the use of behavioral effects, abstract execution, and field calculus for distributed monitoring. His work frequently appears in top-tier venues like Theoretical Computer Science , Lecture Notes in Computer Science , and Journal of Logical and Algebraic Methods in Programming , indicating strong theoretical and practical impact. He collaborates extensively with researchers such as Violet Ka I Pun, Rui Wang, Lars Michael Kristensen, and Martin Steffen, reflecting an active and collaborative research profile. No scientific awards are mentioned in the provided text. There is no information available about student advising or research grants. Volker Stolz is involved in research projects related to model-based testing, formal methods, and reliable software systems, particularly through the Reliable Systems group. His work often involves building theoretical foundations and practical tools for verifying and improving software behavior in distributed and concurrent environments.

Are Raklevمشاهده پروفایل

استاد

• Theoretical Physics
• Particle Physics
• Dark Matter
• +۴ مورد دیگر

Are Raklev is a Professor at the University of Oslo's Department of Physics. His research focuses on theoretical and computational physics, particularly dark matter, particle physics at CERN's LHC, and applications of machine learning. He holds leadership roles in the GAMBIT Collaboration and its Collider Working Group. Education: PhD (University of Bergen, 2007), Postdoc (University of Cambridge, 2009), and Associate Professor at the University of Oslo (2010-2013) before becoming a full Professor in 2013. His teaching includes classical mechanics and electrodynamics (FYS3120) and supersymmetry (FYS5190/9190). Research Interests: Dark matter detection, Higgs boson studies, software for computational physics, and machine learning techniques like Gaussian processes. He leads projects like GAMBIT (a global inference tool) and PLUMBIN' (to address computational bottlenecks in high-energy physics). Recent publications span superconducting magnet design for colliders, quantum computing error correction, and nuclear isotope production. His work bridges theoretical insights with experimental applications at CERN and other facilities.

Hua Sunمشاهده پروفایل

استادیار

• Information Theory
• Secure Communication
• Coding Theory
• +۱ مورد دیگر

Hua Sun is an Assistant Professor in Electrical Engineering at the University of North Texas. His research focuses on information theory, secure communication, coding theory, and private information retrieval. Recent publications demonstrate strong emphasis on secure aggregation methods, information-theoretic privacy guarantees, and coded systems optimization. Key trends in his work include: 1) Fundamental limits of secure computation under collusion and dropout constraints, 2) Quantum and classical code optimizations, 3) Private information retrieval architectures. His research consistently addresses information-theoretic security in distributed systems.

• Cryptography
• Theoretical Computer Science
• Lattice Algorithms
• +۵ مورد دیگر

Divesh Aggarwal is an Associate Professor in the Department of Computer Science at the National University of Singapore (NUS) and a Principal Investigator at the Centre for Quantum Technologies (CQT). He holds a PhD from ETH Zurich (2012) and was a postdoc at EPFL and New York University. His research focuses on discrete structures in theoretical computer science, with emphasis on cryptography, lattices, computational number theory, and coding theory. Aggarwal has advised numerous PhD students and postdocs, and his work bridges cryptography, quantum computing, and algorithm design. He is involved in editorial roles for journals like Information Processing Letters and serves on program committees for top conferences such as CRYPTO, EUROCRYPT, and STOC. Education: PhD in Computer Science from ETH Zurich (2012), under Prof. Ueli Maurer. Postdoctoral research at EPFL (School of Computer and Communication Sciences) and NYU (Department of Computer Science). Research Interests: Information-theoretic Cryptography Randomness Extractors Lattice Algorithms and Applications Coding Theory Quantum Cryptography and Algorithms Computational Number Theory Recent Work Trends: His publications emphasize lattice-based cryptography, quantum-resistant algorithms, and complexity-theoretic hardness. Recent topics include SVP/ CVP algorithms, non-malleable codes, and quantum-proof cryptographic protocols. Over 70 papers in venues like FOCS, STOC, CRYPTO, and ITCS. Advising & Grants: Supervised students now in academia (e.g., IIT Delhi) and industry. Hosts visiting researchers and postdocs. Open to highly motivated PhD candidates and postdocs in theoretical computer science. Labs & Collaborations: Leads research at CQT and NUS School of Computing. Collaborates internationally on projects like quantum-resistant cryptosystems and lattice algorithm optimizations.

George Fikiorisمشاهده پروفایل

استاد

• Antennas
• Electromagnetic Theory
• Numerical Methods
• +۵ مورد دیگر

George Fikioris is a Professor at the School of Electrical and Computer Engineering, National Technical University of Athens (NTUA). He holds degrees from NTUA and Harvard University, and has held academic positions since 2002, progressing to full Professor in 2017. His research focuses on electromagnetism, antennas, numerical methods, and applied mathematics. He authored/co-authored over 60 peer-reviewed papers and multiple books including 'Cylindrical Antennas and Arrays' and 'Selected Asymptotic Methods with Applications to Electromagnetics.' Education: BEng in Electrical Engineering, NTUA (1986) MS and PhD in Applied Sciences from Harvard University (1987, 1993) Research Interests: Electromagnetic theory and numerical methods Antenna design and analysis Asymptotic and spectral methods Superoscillations and wave phenomena Graphene-based shielding materials Publications trends reflect expertise in computational electromagnetics, antenna theory, and mathematical physics. He contributes to IEEE journals and collaborates internationally. A member of IEEE Antennas & Propagation Society and TEE (Technical Chamber of Greece). Labs/Teams: Active in computational electromagnetics research groups at NTUA, focusing on antenna modeling and numerical methods validation.

Steven Flammiaمشاهده پروفایل

استاد

• Quantum Information Theory
• Quantum Error Correction
• Quantum Computing
• +۳ مورد دیگر

Steven Flammia is a Professor of Computer Science at Virginia Tech’s College of Engineering and Director of the Center for Quantum Architecture and Software Development at the Virginia Tech Innovation Campus. His research focuses on quantum error correction, quantum fault tolerance, and learning quantum noise dynamics. He has held prior roles at Amazon Web Services, University of Sydney, and University of Washington, with over 80 peer-reviewed publications and 9,000+ citations. Education & Experience: Postdoctoral Researcher, California Institute of Technology & Perimeter Institute (2000s) Professor at University of Sydney (2010s) Principal Research Scientist at Amazon Web Services (2020s) Research Interests: His work bridges theoretical foundations (e.g., quantum coding theory, representation theory) with practical implementations (e.g., noise modeling, quantum tomography). Key areas include developing fault-tolerant architectures, optimizing quantum error correction codes, and applying statistical learning to quantum systems. Recent Contributions: Recent papers explore Hamiltonian learning with Heisenberg limits, Zauner’s conjecture via number theory, and fiber bundle fault tolerance of GKP codes. His work emphasizes scalable quantum computing solutions under realistic noise conditions. Grants & Leadership: Leads the Center for Quantum Architecture, overseeing faculty hiring and strategic direction for quantum software/hardware integration. Collaborates on projects funded by industry and academic partnerships.

• Coded computation
• Erasure codes for distributed storage
• Information-theoretic privacy
• +۳ مورد دیگر

Dr. Vinayak Ramkumar is a Postdoctoral Researcher at the Institute for Communications Engineering, Technical University of Munich (TUM), under Prof. Antonia Wachter-Zeh’s COD group. Previously, he was a Postdoctoral Fellow at Tel Aviv University (2023–2024) and a Visiting Researcher at Washington University in St. Louis. He earned his Ph.D. from the Indian Institute of Science (2023) under Prof. P. Vijay Kumar. His research focuses on Coded computation , Erasure codes for distributed storage , Information-theoretic privacy , Codes for low-latency streaming , and Quantum codes . Key contributions include explicit constructions of streaming codes and quantum locally recoverable codes. He has received prestigious awards, including the Qualcomm Innovation Fellowship India (2021) and the Prof. F. M. Mowdawalla Medal (2017–18) for his M.Sc. thesis. His work bridges theoretical foundations with practical applications in distributed systems and quantum computing.

Samuel Jaquesمشاهده پروفایل

استادیار

• Cryptography
• Quantum Computing
• Quantum Cryptanalysis
• +۴ مورد دیگر

Samuel Jaques is an Assistant Professor in the Department of Combinatorics and Optimization at the University of Waterloo (since 2023). His research focuses on cryptography (particularly privacy/anonymity) and quantum computing, with notable work on quantum algorithms for cryptanalysis and the Landscapes of Quantum Computing blog. He completed a PhD at the University of Oxford and holds degrees from the University of Waterloo and University of Regina. Education: PhD, University of Oxford (supervised by Simon C. Benjamin and Christophe Petit) MMath, University of Waterloo (co-supervised by Alfred Menezes and Michele Mosca) B.Sc. in Math and Biology, University of Regina Research Interests: Jaques explores quantum computing's impact on cryptography, including post-quantum security, lattice-based algorithms, and quantum error correction. His work critiques quantum RAM assumptions and analyzes resource costs for breaking cryptographic systems like RSA and ECC. Recent projects include accumulator schemes for digital credentials and dynamic group signatures. Awards and Recognition: Best Young Researcher Paper (2019) for quantum claw-finding attacks on SIKE Advising & Grants: Jaques supervises graduate students and postdocs in cryptography/quantum computing. His lab focuses on real-world privacy solutions with a post-quantum lens. Recent advisees include Mojtaba Fadavi (postdoc) and Jérôme Guyot (visiting student). Labs/Teams: Active in the Institute for Quantum Computing (IQC) at Waterloo, collaborating on quantum algorithms and cryptographic security. Maintains open-source projects like the Q# quantum crypto library and surface code cost calculators.

Cesar Federico Caiafaمشاهده پروفایل

استاد مدعو

• Tensor Factorizations
• Parsimonious Representations
• Machine Learning
• +۵ مورد دیگر

Cesar Federico Caiafa holds an Adjunct Professor position in the Engineering Department at the University of Buenos Aires (FIUBA) and serves as an independent researcher at IAR (Instituto Argentino de Radioastronomía) and CONICET (National Council for Scientific and Technical Research). He completed his Electronics Engineering degree in 1996 and earned a PhD in Engineering from the University of Buenos Aires in 2007. His research focuses on tensor factorizations and parsimonious representations applied to astronomy, biomedicine, neuroscience, and computational imaging. As a visiting professor at Laboratoire de Physique (LPENSL) from January to February 2025, he collaborates on developing novel machine learning methods for microwave tomography, including unrolled neural networks and self-supervised learning. His visit strengthens Franco-Argentine ties in computational imaging and aims to establish an international research network (IRN-CNRS). Key collaborations include work with Nelly Pustelnik (unrolled networks), Pierre Borgnat (neuroscience signal processing), and Julien Tachella (SiSyPh team). He will also deliver specialized courses on tensorial methods in machine learning and signal processing at ENS Lyon and Inria. His research spans interdisciplinary fields such as brain connectomics, medical imaging analysis, and optimization algorithms for high-dimensional data. His contributions bridge theoretical advancements with practical applications in healthcare and astronomy.

Ralf Gerkmannمشاهده پروفایل

مدرس

• Algebra
• Number Theory
• Galois Theory
• +۵ مورد دیگر

Dr. Ralf Gerkmann serves as a Lecturer at the Mathematical Institute of the Ludwig Maximilian University of Munich (LMU), within the Faculty of Mathematics, Computer Science and Statistics. He is actively involved in the Teacher Training Programmes Working Group and teaches multiple courses for secondary school teacher training programs (LA Gymnasium). His primary research and teaching interests include: Algebra and Number Theory with emphasis on Galois theory Linear Algebra and vector space theory Analysis of multiple variables Function Theory and complex analysis Lebesgue integration theory Ordinary Differential Equations Dr. Gerkmann has developed extensive teaching materials, including 288-page lecture notes for Algebra and Number Theory II (as of July 2025), 183-page Linear Algebra notes, and 80-page Analysis notes. His approach combines theoretical foundations with computational methods using SageMath, as evidenced by detailed code examples analyzing Galois groups and algebraic equation solutions. He coordinates examination retakes for students following older study regulations, with upcoming opportunities scheduled through 2025-2026. His teaching encompasses both regular courses and specialized preparation for state examinations in mathematics, with lecture recordings available through LMUCast.