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

Jeeseop Kimمشاهده پروفایل

استادیار

• Robotics
• Autonomy
• Control Theory
• +۳ مورد دیگر

Jeeseop Kim is an Assistant Professor in the Department of Aerospace and Mechanical Engineering at The University of Texas at El Paso (UTEP), College of Engineering, specializing in robotics, autonomy, and control theory. His research focuses on safety-critical planning and control, with emphasis on bipedal/quadrupedal locomotion, hybrid dynamical system control, and whole-body planning and control. Education: B.S. in Mechanical and Aerospace Engineering, Seoul National University (2014) M.S. in Intelligence and Information (Robotics), Seoul National University (2017) Ph.D. in Mechanical Engineering, Virginia Tech (2022) Postdoctoral Scholar, Mechanical and Civil Engineering, Caltech (2022–2025) His research spans safety-critical control systems for legged robots, including obstacle-aware nonlinear model predictive control (MPC), control barrier functions, and distributed coordination algorithms. Recent work explores adaptive delay estimation, tactile sensing for robotic grasping, and hardware-software co-design for humanoid robots. Key article trends highlight advancements in autonomous inspection robotics, hybrid control architectures, and real-time planning for quadrupedal systems. His work integrates control theory with practical applications in industrial and healthcare domains. Awards: ASME DSCD Rudolf Kalman Best Paper Award (2022) IEEE ICRA Outstanding Paper Award (2023) Jeeseop teaches MECH 4332: Mechanical Computational Applications in Vision and Robotics (Fall 2025). He actively recruits Ph.D. students for Spring/Fall 2026 and seeks motivated undergraduates/MS students with skills in robotics kinematics, programming (C/C++, Python, MATLAB), and CAD design. The AIGIS Lab welcomes applicants with interests in robotics, controls, and autonomous systems.

Lieven Vandenbergheمشاهده پروفایل

استاد

• Convex Optimization
• Semidefinite Programming
• System Identification
• +۶ مورد دیگر

Lieven Vandenberghe is a Professor in the Electrical and Computer Engineering Department and Department of Mathematics at the University of California, Los Angeles (UCLA). His research focuses on convex optimization, semidefinite programming, and applications in signal processing, system identification, and control theory. Books: Co-author of Convex Optimization (2004) and Introduction to Applied Linear Algebra (2018) Courses: Teaches graduate-level courses in linear programming, convex optimization, and numerical computing (ECE236A/B/C, ECE133A/B) Software: Developer of CVXOPT, CHOMPACK, and SMCP for optimization algorithms His research group has produced significant work in sparse matrix computations, operator splitting methods, and applications to machine learning and control systems. Publications span topics like Bregman splitting, proximal gradient methods, and semidefinite programming for signal processing. His advisees include PhD students in optimization and postdoctoral researchers in applied mathematics.

• Controllability and time optimal control
• Viability and invariance for differential inclusions
• Hamilton-Jacobi-Bellman equations
• +۳ مورد دیگر

Prof. Ovidiu Cârjă is a Professor of Mathematical Analysis at the Faculty of Mathematics, University of Iasi, Romania. He holds a PhD from the same university (1984) and has held academic positions since 1981, progressing from Assistant Professor (1984) to his current role. His research focuses on controllability, viability theory, and Hamilton-Jacobi-Bellman equations, with significant contributions to differential inclusions and nonlinear analysis. Education: B.Sc. Mathematics, University of Iasi (1976) M.Phil. Mathematics, University of Iasi (1977) Ph.D. Mathematics, University of Iasi (1984) Research Interests: Optimal control and time-optimal control problems Viability and invariance for differential inclusions Hamilton-Jacobi-Bellman equations Nonlinear functional analysis and semilinear systems Awards and Fellowships: Romanian Academy 'Simion Stoilow' Award (1991) Fulbright Award (UCLA, 1993–1994) NATO Fellowship (CMAF Lisbon, 1998–2002) Invited Professorships at University of Perpignan and Tor Vergata Rome Professional Activities: Editor of the Applied Analysis and Differential Equations (World Scientific, 2007) Co-author of influential books on nonlinear analysis and viability theory

Standa Živnýمشاهده پروفایل

استاد

• Theoretical Computer Science
• Discrete Mathematics
• Algorithms
• +۱۰ مورد دیگر

Standa Živný is a Professor of Computer Science at the University of Oxford and a Fellow and Tutor at Merton College. He has been a faculty member at Oxford since 2013 and was promoted to full professor in 2021. His research spans theoretical computer science and discrete mathematics, with a focus on algorithms, computational complexity, and constraint satisfaction problems (CSPs) in various forms, including optimisation, counting, and approximation. His research interests include the power and limitations of convex relaxations, sparsification, submodularity, and the algebraic and logical foundations of tractability in combinatorial problems. He has made significant contributions to understanding when and why certain problems can or cannot be efficiently solved using linear programming and other algorithmic paradigms. The recent trends in his publications show a deep engagement with approximation algorithms, hardness results, sparsification techniques, and the complexity of counting and promise problems. His work often lies at the intersection of algebra, logic, and optimisation, demonstrating the power of interdisciplinary approaches in theoretical computer science. ERC Consolidator Grant (NAASP, 2022–2027) ERC Starting Grant (PowAlgDO, 2017–2022) Royal Society University Research Fellowship (2013–2021) He actively supervises a large cohort of postdoctoral researchers and students, including PhD candidates, master’s, and undergraduate students. His leadership extends to academic service, where he serves as Editor-in-Chief of the SIAM Journal on Discrete Mathematics and holds editorial and committee positions in major journals and funding bodies. He has organised numerous workshops and research programmes at institutions such as Dagstuhl, the Isaac Newton Institute, and AIM. He is involved in major research initiatives, including a Simons Programme on symmetry in computation and an American Institute of Mathematics SQuARE on relaxations for promise CSPs.

• Machine Learning
• Optimization
• Federated Learning
• +۸ مورد دیگر

Peter Richtarik is a Professor at the King Abdullah University of Science and Technology (KAUST), specializing in Machine Learning, Optimization, and Federated Learning. He actively teaches courses such as Stochastic Gradient Descent Methods and mentors PhD and MS students like Konstantin Burlachenko, Kai Yi, and Lukang Sun. His research spans distributed optimization, parameter-efficient fine-tuning, and theoretical frameworks for non-convex and non-smooth problems. Recent work includes 2025 contributions to Bernoulli-LoRA (theoretical PEFT) and Gluon (LMO-based optimizers). He co-developed Thanos (block-wise pruning) and BurTorch (CPU-optimized training framework). His publications focus on communication efficiency ( ATA , LoCoDL ), differential privacy ( DP-RBCD ), and stochastic proximal methods. Richtarik received the Charles Broyden Prize for his work on quasi-Newton methods. He frequently presents at workshops like MLSS in Senegal and FLOW seminars.

László Kozmaمشاهده پروفایل

استادیار

• Data Structures
• Algorithms
• Algorithmic Adaptivity
• +۷ مورد دیگر

László Kozma is an Assistant Professor at the Theoretical Computer Science group of the Institute of Computer Science (Freie Universität Berlin). He obtained his PhD from Saarland University under Raimund Seidel, followed by postdoctoral positions at Tel Aviv University and TU Eindhoven. His research focuses on self-adjusting data structures , adaptive algorithms , and combinatorial optimization with applications to problems like the Traveling Salesman Problem, binary search trees, and geometric data structures. Academic Affiliation: Freie Universität Berlin (since 2018) Education: PhD in Computer Science (Saarland University, 2016); postdoc at Tel Aviv University and TU Eindhoven. His work explores the intersection of data structures, combinatorial algorithms, and geometric methods. He has made significant contributions to problems involving pattern-avoidance in inputs, saddlepoint detection , and self-adjusting heaps . Key areas include: Adaptive algorithms for pattern-avoiding inputs Optimal tree and heap structures Geometric and stochastic approaches to optimization Complexity analysis of classical algorithms Recent publications highlight efficient solutions for exponential cut problems (ESA 2025), balanced TSP partitioning (EuroCG 2025), and randomized saddlepoint algorithms (ESA 2024). His research often bridges theory and practice, exemplified by the smooth heap implementation and fun projects like Recursi and Cuckoo Hashing visualization.

• Soft Matter Physics
• Materials Science
• Surface Mechanics
• +۴ مورد دیگر

Etienne BARTHEL serves as a CNRS Research Director at the Laboratory of Soft Matter Science and Engineering (SIMM), a joint research unit of PSL University (ESPCI Paris), CNRS, and Sorbonne University. His primary affiliations span multiple prestigious French institutions focused on advanced materials research. His research centers on the mechanical behavior of soft and brittle materials, with emphasis on surface mechanics, adhesion phenomena, fracture dynamics, and thin film behavior . Key contributions include fundamental studies on wetting/dewetting processes, plastic deformation mechanisms in glasses, and instability phenomena at interfaces. His experimental and modeling work bridges nanoscale material behavior with macroscopic mechanical responses. Analysis of his recent publications reveals strong focus on silicate glasses, soft matter fracture, microfluidics, and surface characterization techniques . His work frequently employs advanced methods like Brillouin spectroscopy, nanoindentation, and micro-photoelasticity to probe material responses under stress. As a CNRS Research Director, he leads experimental investigations in the SIMM laboratory, supervising PhD candidates and postdoctoral researchers in projects spanning materials physics, surface science, and mechanical engineering. His research program integrates experimental mechanics with theoretical modeling to address fundamental questions in material failure and interfacial phenomena. The SIMM laboratory maintains advanced facilities for soft matter characterization, including micro-mechanical testing setups, surface analysis instruments, and microfluidics platforms where his team conducts cutting-edge research on material interfaces and deformation mechanisms.

Vijayaraghavan Aravindanمشاهده پروفایل

دانشیار

• Theoretical Computer Science
• Machine Learning
• Quantum Information
• +۳ مورد دیگر

Dr. Vijayaraghavan Aravindan is an Associate Professor in the Department of Computer Science at Northwestern University, with a courtesy appointment in Industrial Engineering & Management Sciences. He is a core member of the Theory CS Group and serves as the Site Director for the NSF-funded Institute for Data, Economics, Algorithms, and Learning (IDEAL). His research focuses on theoretical computer science, particularly algorithmic foundations of machine learning, quantum information, and beyond worst-case analysis. Education: Ph.D. and M.A. in Computer Science, Princeton University B.Tech. in Computer Science and Engineering, Indian Institute of Technology Madras Research Interests: His work bridges theoretical computer science and machine learning, emphasizing efficient algorithms for high-dimensional data, quantum entanglement certification, and adversarial robustness. He explores paradigms such as smoothed analysis and stability-based approaches to provide practical algorithmic guarantees. Awards & Grants: NSF CAREER Award Google Research Scholar NSF AITF Grants (CCF-1637585, CCF-2154100) Advising & Teaching: He advises PhD students on topics like quantum computing, robust machine learning, and optimization. Courses taught include graduate algorithms, theoretical foundations of data science, and quantum computation. His lab collaborates on projects at IDEAL and with institutions like Carnegie Mellon University and TTI Chicago. Professional Leadership: Served as FOCS 2024 General Chair and organizes the McCormick Theory Workshops. Active on program committees for ICML, COLT, and NeurIPS.

Jianqiang Chengمشاهده پروفایل

دانشیار

• Stochastic Programming
• Robust Optimization
• Distributionally Robust Optimization
• +۷ مورد دیگر

Dr. Jianqiang Cheng is an Associate Professor in the Department of Systems and Industrial Engineering at the University of Arizona, College of Engineering. He is also a member of the Graduate Faculty and affiliated with the Applied Mathematics and Statistics Graduate Interdisciplinary Programs. His research is centered on optimization under uncertainty with applications in energy systems and logistics. Research Interests: His primary research areas include stochastic programming, robust optimization, distributionally robust optimization, semidefinite programming, and chance-constrained optimization. He applies these methodologies to challenges in power systems, renewable energy integration, microgrid design, and resilient supply chains. The recent publications (2020–2022) reflect a strong trend toward data-driven and computationally efficient methods in optimization. Key themes include distributionally robust optimization under moment and Wasserstein ambiguity, chance-constrained AC optimal power flow, and resilient supply chain modeling under disruptions such as the COVID-19 pandemic. His work frequently appears in top journals like INFORMS Journal on Computing , IEEE Transactions on Power Systems , and European Journal of Operational Research . Scientific Awards: Best Short Paper Award, INFORMS Workshop on Data Science (Fall 2022) NSF CAREER Award, National Science Foundation (Spring 2022) Science Foundation Arizona's 2017 Bisgrove Scholar (Spring 2017) Dr. Cheng has secured significant research funding, including the NSF CAREER Award, supporting his work in data-driven optimization. He collaborates extensively with researchers in energy systems and operations research, including K. Pan, M. Cheramin, A. M. Fathabad, and A. Lisser. While specific advisees are not listed, his role as a member of the Graduate Faculty indicates active supervision of graduate students in systems engineering, applied mathematics, and statistics. His research contributes to the development of advanced optimization models for real-world systems affected by uncertainty, particularly in energy and logistics. Though no specific lab is mentioned, his work implies involvement in computational optimization and energy systems modeling research groups within the College of Engineering.

Laurent Condatمشاهده پروفایل

پژوهشگر

• Optimization
• Convex Relaxation
• Stochastic Algorithms
• +۵ مورد دیگر

Laurent Condat is a Senior Research Scientist at King Abdullah University of Science and Technology (KAUST) in Saudi Arabia, where he conducts research in optimization algorithms and their applications. He is affiliated with the College of Engineering, Department of Computer Science, and has previously held research positions at CNRS in France, working at GREYC in Caen and GIPSA-Lab in Grenoble. Dr. Condat received his PhD in 2006 from Grenoble Institute of Technology, followed by a 2-year postdoc in Munich, Germany. He was recruited as a permanent researcher by CNRS in 2008 and has been on leave from CNRS since November 2019 to work at KAUST. In February 2025, he was promoted to 'chargé de recherche hors classe' (senior research scientist) by CNRS. His research focuses on deterministic and stochastic optimization algorithms, convex relaxations, and applications to machine learning, signal and image processing. His work spans theoretical foundations of optimization methods to practical implementations for distributed and federated learning systems. He has developed several influential algorithms including RandProx, TAMUNA, and LoCoDL that address communication efficiency in distributed optimization. His recent publications demonstrate strong trends in communication-efficient distributed optimization, with particular emphasis on federated learning, compression techniques, and local training methods. His work bridges theoretical optimization with practical machine learning applications, showing consistent innovation in algorithmic design for large-scale problems. Best reviewer award at AISTATS 2025 Meritorious Service Award from Mathematical Programming Stanford's list of world's top 2% most influential scientists Dr. Condat has co-supervised PhD students including Daniele Picone and Julien Baderot. He serves as an Associate Editor for IEEE Transactions on Signal Processing and has presented his work at numerous international conferences including plenary talks at major optimization workshops. His research is supported through KAUST funding and collaborative projects with researchers worldwide.

Zeyu Dingمشاهده پروفایل

استادیار

• Privacy
• Algorithmic Fairness
• Machine Learning
• +۵ مورد دیگر

Zeyu Ding is an Assistant Professor in the School of Computing at Binghamton University, with a courtesy appointment in the Department of Mathematics and Statistics. He holds two PhDs: one in Computer Science from Penn State University and another in Mathematics from Binghamton University, along with a BS in Mathematics from Zhejiang University. Research Interests His work focuses on the intersection of privacy, security, machine learning, and algorithmic fairness. He investigates how to protect sensitive personal information through differential privacy mechanisms, formal verification, numerical optimization, and privacy-preserving statistical inference. Article Trends Ding's publications highlight advancements in differential privacy, including the Report Noisy Max with Gap Mechanism and the Permute-and-Flip approach. His research also addresses security challenges like reconstruction attacks and automated verification tools (e.g., Checkdp and DPGen), alongside mathematical explorations of automorphism group schemes and Barsotti-Tate groups. Scientific Awards CCS Outstanding Paper Award, 2018 Caper Bowden PET Award Runner-up, 2019 CCS Best Paper Award Runner-up, 2020 CCS Best Paper Award Runner-up, 2021 Research Award from Penn State University, 2019 Teaching Award from Penn State University, 2021 His research is supported by the NSF grant 2317233, underscoring his contributions to privacy-preserving computational methods.

• Theoretical Computer Science
• Sublinear Algorithms
• Complexity Theory
• +۴ مورد دیگر

Elena Grigorescu is an Adjunct Associate Professor in the Department of Computer Science at Purdue University, where she has been a faculty member since Fall 2012. Her research program spans theoretical computer science with a focus on foundational algorithmic challenges in large-scale data processing and computational limits, maintaining strong connections to cryptography, communications, and optimization applications. Her educational background includes a PhD from the Massachusetts Institute of Technology (MIT), establishing her expertise in rigorous theoretical frameworks. Professor Grigorescu's research emphasizes designing algorithms that operate in sublinear time or space for massive datasets, analyzing complexity of error-correcting codes and lattices, and exploring information-theoretical computation limits. Current investigations integrate differential privacy with learning-augmented techniques to solve online optimization problems, network design challenges, and data stream processing bottlenecks. Her work bridges abstract theory with practical implementations in cryptographic systems and quantum computing paradigms, demonstrating consistent innovation in algorithmic foundations. Analysis of her recent publications (2022-2025) reveals a dominant focus on sublinear-time algorithms, particularly at the intersection with differential privacy and machine learning augmentation. Key contributions include novel spanner constructions for network design, privacy-preserving clustering frameworks, and breakthroughs in trace reconstruction and coding theory. A pronounced trend shows increasing integration of learning-based predictions to enhance classical online algorithms for packing/covering problems while maintaining theoretical guarantees, alongside sustained contributions to error-correcting code analysis and graph-theoretic foundations. No specific scientific awards or major fellowships were documented in the provided materials, though her publication record in premier venues like STOC, FOCS, and APPROX/RANDOM indicates significant peer recognition. Professor Grigorescu actively mentors graduate students in theoretical computer science research, guiding investigations in sublinear algorithms, complexity theory, and coding theory. Her collaborative projects involve interdisciplinary teams across institutions, focusing on cryptographic applications and quantum information theory, though specific grant details were not included in the source texts. Ongoing work suggests expansion into quantum algorithm design and privacy-preserving machine learning frameworks. While dedicated laboratory facilities were not specified, her research operates within Purdue's theoretical computer science group, leveraging university-wide computational resources and fostering collaborations through conference participation and workshop organization.

Shi Liمشاهده پروفایل

استاد

• Theoretical Computer Science
• Design and Analysis of Algorithms
• Combinatorial Optimization
• +۱۱ مورد دیگر

Shi Li is a Professor in the Theory Group at the Department of Computer Science and Technology, School of Computer Science, Nanjing University. He previously held faculty positions at the University at Buffalo (2015–2023) as Assistant and Associate Professor, and was a Research Assistant Professor at Toyota Technological Institute at Chicago (2013–2015). He earned his Ph.D. from Princeton University in 2014 under Moses Charikar and completed his B.S. in Computer Science and Technology at Tsinghua University, where he was part of Andrew Chi-Chih Yao’s Special Pilot Class. His research lies at the intersection of theoretical computer science and combinatorial optimization, with a focus on the design and analysis of algorithms for problems in clustering, scheduling, network design, facility location, and online algorithms. He also explores learning-augmented algorithms and differential privacy in algorithmic contexts. His work combines deep theoretical insights with practical algorithmic frameworks, often leveraging linear programming relaxations, iterative rounding, and randomized techniques. The recent publications highlight a consistent trend in approximation algorithms, particularly in clustering (e.g., correlation clustering, fair k-set selection), scheduling (e.g., unrelated machine scheduling, load balancing), and robust optimization. His work frequently appears in top-tier theoretical venues such as STOC, FOCS, SODA, and ICALP, with increasing emphasis on fairness, privacy, and efficiency in algorithm design. Best Paper Award of Track A, ICALP 2011 Co-winner of Best Paper Award, FOCS 2012 Invited to Special Issue of SICOMP (FOCS 2017 paper) Best Paper Award, COCOON 2018 Invited to Special Issue of SICOMP (STOC 2019 paper) Best Paper Award of Track A, ICALP 2024 Outstanding Paper Award, SPAA 2024 Shi Li has advised several PhD and master’s students, including Yuda Feng, Han Dai, Zihao Liang, and Jia Ye, and has mentored postdoctoral researcher Ruilong Zhang. He has served on numerous program committees (e.g., STOC, SODA, ICALP) and is an Editorial Board Member of ACM Transactions on Algorithms . He teaches core algorithm courses such as Design and Analysis of Algorithms and Advanced Algorithms , and actively collaborates with researchers worldwide. His lab focuses on theoretical foundations of efficient and fair algorithm design, with applications in large-scale data analysis and distributed systems.

Daniel McKenzieمشاهده پروفایل

استادیار

• Derivative-free optimization
• Implicit neural networks
• Geometric methods in data science
• +۳ مورد دیگر

Daniel McKenzie is an Assistant Professor in the Department of Applied Mathematics and Statistics at the Colorado School of Mines. His research focuses on derivative-free optimization, implicit neural networks, and geometric methods in data science. He holds a B.Sc.(hons) and M.Sc. in Mathematics from the University of Cape Town (2010, 2014) and a PhD in Mathematics from the University of Georgia (2019). B.Sc.(hons): Mathematics and Applied Mathematics, University of Cape Town, 2010 M.Sc.: Mathematics, University of Cape Town, 2014 PhD: Mathematics, University of Georgia, 2019 His research explores the intersection of optimization theory and machine learning, with applications in spatial data modeling, geometric data analysis, and high-dimensional clustering. Recent work emphasizes curvature-aware algorithms, comparison-based optimization, and implicit network architectures like LatticeVision. His methods address challenges in non-stationary spatial data and convex game equilibria prediction. Key contributions include Fermat distance metrics for clustering, Jacobian-Free Backpropagation (JFB) for implicit networks, and zeroth-order algorithms for black-box optimization. While no scientific awards are listed, his publications reflect a strong focus on advancing optimization techniques for modern data science problems. No specific grants or advising roles are detailed in the provided text. His work bridges computational mathematics and applied AI, with potential applications in robotics, spatial statistics, and algorithmic game theory.

• Sparse signal processing
• Signal processing for machine learning
• Wireless communications
• +۴ مورد دیگر

Dr. Wei Dai is a Senior Lecturer (Associate Professor) in the Department of Electrical and Electronic Engineering at Imperial College London, part of the Faculty of Engineering. He holds affiliations with the EPSRC Centre for Maths of Precision Healthcare and the Communications and Signal Processing group. His research focuses on sparse signal processing, machine learning applications in signal processing, linear and bilinear inverse problems, wireless communications, and random matrix theory. Notably, he contributed to the first compressive sensing DNA microarray prototype and has a highly cited 2009 paper on compressive sensing reconstruction. Dr. Dai's educational background includes a Ph.D. in Electrical and Computer Engineering from the University of Colorado at Boulder (2007) and postdoctoral research at the University of Illinois at Urbana-Champaign (2007-2010). His work bridges theoretical signal processing with practical applications in sensing, communication systems, and biomedical signal analysis. He leads research initiatives in gridless DOA estimation, robust beamforming, and cortico-muscular coupling analysis using advanced optimization techniques. His research outputs span topics like spectral compressed sensing, Bayesian methods for integrated sensing-communication systems, and dictionary learning for causal discovery. Ongoing work emphasizes low-rank matrix recovery, distributed compressed sensing, and mathematical frameworks for super-resolution localization. Dr. Dai collaborates across disciplines, leveraging signal processing innovations for healthcare technology and next-generation wireless systems.