Find Academic Supervisors

Divesh AggarwalView profile

Associate Professor

• Lattices
• Pseudorandomness
• Computational Complexity
• +3 more

Divesh Aggarwal is an Associate Professor at the Department of Computer Science , National University of Singapore , and a Principal Investigator at the Centre for Quantum Technologies . He received his PhD from ETH Zurich under Prof. Ueli Maurer , focusing on theoretical cryptography. His research spans lattices, pseudorandomness, computational complexity, cryptography, and coding theory , with a focus on quantum-safe cryptographic systems. Research Themes: Lattice-based cryptography, quantum algorithms, computational complexity, non-malleable codes, and randomness extraction. Advising: Actively mentors graduate students in theoretical computer science and quantum computing. Professional Service: Serves on program committees for top conferences (CRYPTO, STOC, TCC, etc.) and editorial boards. Group Activities: Organizes a weekly research seminar covering diverse topics in theoretical computer science, including lattice algorithms, quantum computing, and cryptographic protocols.

• Income Inequality
• Social Welfare
• Operations Research
• +4 more

Ronny Aboudi is an Associate Professor in the Management Science department at the Miami Herbert Business School, University of Miami. His research spans economics, operations research, and public policy, focusing on income inequality, social welfare functions, and optimization algorithms. He has contributed to theoretical frameworks for income redistribution and practical applications in industrial logistics and financial market analysis. Key Research Themes Economic inequality and social welfare optimization Stochastic dominance in financial decision-making Operations research for logistics and industrial applications Notable Contributions Mathematical programming models for basic income systems Extensions of Muirhead's Lemma for inequality analysis Tactical fleet planning for car rental businesses

• Quantum Computing
• Cryptography
• Theoretical Computer Science
• +3 more

Sean Hallgren is a Professor in Computer Science and Engineering, specializing in quantum algorithms and computational complexity. His research spans both theoretical and applied aspects of quantum computing, cryptography, and mathematical optimization. Research Interests Hallgren's work focuses on: Quantum algorithm design and complexity Cryptographic reductions under quantum models Number-theoretic problems in cryptography Quantum linear algebra techniques Computational complexity of combinatorial problems Recent Publications Hallgren's 15 most recent articles (5 shown) demonstrate expertise in quantum algorithm limitations, cryptographic hardness reductions, and isogeny-based cryptography. His 2023 study in Quantum analyzed the Macaulay matrix approach for solving polynomial systems using quantum linear solvers. Grants & Projects Current and past projects include: Exponential Speedups and Limitations of Quantum Computation (U.S. Navy, 2018–) NSF Convergence Accelerator: Scalable Quantum Artificial Intelligence for Discovery (2020–2023) SaTC: CORE: Small: Classical and quantum algorithms for number-theoretic cryptography (2020–2025) AF: Small: Quantum Algorithms and Complexity (2016–2020, PI)