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

Tom Verhoeffمشاهده پروفایل

استادیار

• Software Engineering
• Model-Driven Engineering
• Domain-Specific Languages
• +۷ مورد دیگر

Tom Verhoeff is an Assistant Professor at the Faculty of Mathematics and Computing Science of Eindhoven University of Technology (TU/e) , working within the Software Engineering & Technology group. His research focuses on Model-Driven Engineering (MDE) , Domain-Specific Languages (DSLs) , and the intersection of mathematics, computing, and the arts . He teaches courses in data analytics, programming, algorithms, theoretical computer science , and logic . Verhoeff earned both his MSc and PhD in Technical Science (Mathematics and Computer Science) from TU/e. He is actively involved in promoting mathematics and informatics through initiatives like the annual Bridges conference , and serves as board member and treasurer of the Dutch Mathematics Olympiad , as well as chair of the Koos Verhoeff MathArt foundation . He has also held roles as guest lecturer in Lithuania and Finals Director for the ACM International Collegiate Programming Contest . Research Interests: Verhoeff’s work spans Model-Driven Engineering , domain-specific language development , and 3D geometric modeling . His scholarship often explores symmetry, recursion, and mathematical visualization , particularly through computational art and algorithmic puzzles . Recent publications highlight 3D rotation methods , knot theory , and mathematical art using lattice paths and geometric transformations . Scientific Awards: ACM ICPC European Founders Award (2004) IOI Distinguished Service Award (2007) Second Place in the 2022 Wolfram Computational Art Contest Notable Collaborations and Affiliations: He is affiliated with the Esprit Working Group on Asynchronous Circuit Design (ACiD-WG) , WIRE (TUE Mathematics Alumni) , ACM (Senior Member) , CSTA , IEEE Computer Society , and Royal Dutch Mathematical Society (KWG) .

• Operations Research
• Optimization
• Combinatorial Optimization
• +۶ مورد دیگر

Michael Trick is the Senior Associate Dean for Faculty and Research and Higgins Professor of Operations Research at the Tepper School of Business, Carnegie Mellon University. His research focuses on combinatorial optimization, sports scheduling, constraint programming, and operations research applications. He has contributed to seminal work on sports timetabling (e.g., scheduling college basketball conferences) and the traveling tournament problem. Trick's work bridges theoretical advancements with practical applications, including integer programming, branch-and-price methods, and stochastic dynamic programming. He has led initiatives in operations research education and served as President of INFORMS, emphasizing the field's societal impact. His research also spans voting systems, optimization for newspaper zoning, and algorithmic design for complex scheduling problems. Trick's expertise spans academic leadership, research methodology, and cross-disciplinary applications. His articles address topics like auction design for spectrum allocation, bike-sharing logistics, and robust scheduling strategies. He collaborates across academia and industry, contributing to both theoretical advancements and real-world operational challenges. His work often highlights the practical utility of mathematical programming techniques in diverse domains.

Giorgia Ramponiمشاهده پروفایل

استادیار

• Machine Learning
• Mathematical Modelling
• Reinforcement Learning
• +۳ مورد دیگر

Giorgia Ramponi is an Assistant Professor with Tenure Track at the Faculty of Business, Economics and Informatics at the University of Zurich. She is also an affiliated professor at the ETH AI Center and the Data Science and AI, Computer Science and Engineering department at Chalmers University of Technology. Her educational background includes a Ph.D. in Information Technology from Politecnico di Milano (completed June 2021 with honors), advised by Marcello Restelli, and a Master of Science in Computer Science with Honours Programme (110/110 cum laude) from la Sapienza (July 2017), advised by Flavio Chierichetti and Alessandro Panconesi. Dr. Ramponi's research focuses on machine learning and mathematical modeling, with particular emphasis on reinforcement learning and multiagent learning. Her work bridges theoretical foundations with practical applications, exploring how learning algorithms can make optimal decisions in complex environments. She has made significant contributions to areas including inverse reinforcement learning, multi-agent systems, constrained Markov decision processes, and human-AI interaction through preference learning. Her recent publications demonstrate a strong trend toward addressing fundamental challenges in reinforcement learning, particularly in multi-agent settings, constrained optimization, and learning from human feedback. Her work combines theoretical rigor with practical applications across robotics, economics, and decision-making systems. Hassler Research Grant for "Unified Feedback Integration Framework for Reinforcement Learning" Dr. Ramponi actively contributes to the academic community through conference participation, invited lectures (including at the Mediterranean Machine Learning Summer School), and teaching. She designed and taught the "Data Science and Machine Learning" course for the ETH-Ashesi Master program. She is also a member of the ELLIS community, which connects excellence in AI research across Europe. Her research group focuses on developing frameworks for reinforcement learning with various feedback types, including preferences, rewards, and demonstrations. The group aims to advance the theoretical understanding of learning algorithms while addressing practical challenges in real-world applications.

• Data Quality
• Database Systems
• Data Profiling
• +۷ مورد دیگر

Felix Naumann is a Professor at the Hasso Plattner Institute in Potsdam, Germany, specializing in data management and database systems. His research focuses on data quality, data profiling, entity resolution, functional dependencies, and database optimization. He has authored over 300 publications in top-tier conferences and journals, including VLDB, SIGMOD, and ICDE. His work bridges theoretical foundations with practical systems, such as TASHEEH for data cleaning and PRISMA for privacy-preserving schema matching. He serves as an editor for the ACM Journal of Data and Information Quality and has led initiatives on hybrid conference formats and inclusive computing. Key contributions include: Data Quality: Pioneered studies on data quality's impact on machine learning and developed tools like AutoTSAD for anomaly detection. Data Dependency Discovery: Advanced functional and inclusion dependency mining algorithms, including Hitting Set Enumeration methods. Schema Matching & Integration: Created systems like BrewER and Frost for entity resolution and schema alignment. Educational Impact: Led massive open courses in data engineering with over 10,000 participants. His work emphasizes practical applications in cultural heritage data (ReCLAIM), Wikipedia table analysis, and cross-platform data systems (RHEEMix). He collaborates extensively with industry and academia, addressing challenges in dynamic datasets and data governance.

• Neurosymbolic AI
• Answer Set Programming
• Visual Question Answering
• +۳ مورد دیگر

Nelson Nicolas Higuera Ruiz is a PreDoc Researcher at the Vienna University of Technology, affiliated with the Faculty of Informatics' Knowledge-Based Systems research group. His work bridges logic programming and deep learning for explainable AI. Research Focus: Neurosymbolic AI, Visual Question Answering (VQA), Answer Set Programming (ASP), and hybrid reasoning systems Projects: Leads optimization research in the LCS (2017–2025) project, developing neurosymbolic approaches for intelligent systems Key Contributions: Pioneering adaptive large-neighbourhood search algorithms for ASP optimization, modular neurosymbolic architectures, and contrastive explainability frameworks for VQA Collaborations: Active in international workshops and conferences including IJCAI, AAAI, and CLeaR, frequently collaborating with researchers like Thomas Eiter and Johannes Oetsch Publications: Focus on neurosymbolic integration, optimization algorithms, and explainability across AI, logic programming, and computer vision domains

Fabrizio Riguzziمشاهده پروفایل

استاد

• Logic Programming
• Statistical Relational Artificial Intelligence
• Probabilistic Logic Programming
• +۳ مورد دیگر

Fabrizio Riguzzi is a Full Professor at the Department of Mathematics and Computer Science of the University of Ferrara, Italy. His academic career spans over two decades at the same institution, having served as Associate Professor (2014-2020) and Assistant Professor/Ricercatore (1999-2014). He is an active researcher in the fields of Logic Programming and Statistical Relational Artificial Intelligence with numerous publications and leadership roles in international conferences. His educational background includes: PhD in Electronic and Computer Engineering from the University of Bologna (1999) Laurea in Computer Engineering from the University of Bologna (1995) Riguzzi's research focuses on probabilistic approaches to artificial intelligence, particularly probabilistic logic programming and statistical relational AI. His work bridges symbolic reasoning with probabilistic methods, developing frameworks for uncertain knowledge representation and reasoning. He has made significant contributions to probabilistic answer set programming, neuro-symbolic integration, and applications in areas like network intrusion detection and knowledge graph completion. His research demonstrates how logical formalisms can be enhanced with probabilistic reasoning to tackle real-world problems with uncertainty. An analysis of his recent publications reveals a strong trend toward integrating neural and symbolic approaches in AI, with significant work on probabilistic answer set programming frameworks. His research spans theoretical foundations of probabilistic logic programming, practical implementations, and applications in cybersecurity, knowledge graphs, and decision-making under uncertainty. The interdisciplinary nature of his work connects computer science theory with practical AI applications. His notable awards include: Alain Colmerauer 10-Year Test-of-Time Award at ICLP 2021 Best Paper Award for "BUNDLE: A Reasoner for Probabilistic Ontologies" at RR-2013 Highly Commended Paper Award for "Probabilistic declarative process mining" at KSEM 2010 Riguzzi has supervised several PhD students to completion, including Elena Bellodi, Riccardo Zese, and Giuseppe Cota, who have gone on to win prestigious awards for their theses. He has served in numerous editorial roles, including Associate Editor of the Journal of Artificial Intelligence Research and Editor in Chief of Intelligenza Artificiale. His leadership extends to organizing major conferences like ILP 2018 and serving on program committees for top AI venues including IJCAI, AAAI, and ECAI. He is a member of the ML@unife research group and has developed several online systems including cplint, TRILL, and an Online AUC calculator. His work has fostered collaborations across the AI research community, particularly in the areas of probabilistic logic programming and neuro-symbolic AI.

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

استادیار

• Probability Theory
• High-Dimensional Statistics
• Theoretical Machine Learning
• +۵ مورد دیگر

Shuangping Li is an Assistant Professor in the Department of Statistics and Data Science at Yale University. She was previously a Stein Fellow in the Department of Statistics at Stanford University (2022–2025). Her research lies at the intersection of probability theory, high-dimensional statistics, theoretical machine learning, and the theory of algorithms. Ph.D. in Applied and Computational Mathematics, Princeton University (2022) B.Sc. in Mathematics, University of Hong Kong Her research interests include probability theory , high-dimensional statistics , theoretical machine learning , and theory of algorithms . She investigates foundational aspects of random constraint satisfaction problems, neural networks, spectral methods, and phase transitions in high-dimensional models. Her work often draws from statistical physics and combinatorics to explain algorithmic behavior. The recent articles highlight a strong focus on binary perceptrons , clustering in network models , and algorithmic phase transitions . Keywords across publications include probability, theoretical computer science, machine learning, and statistical inference. Subfields reveal deep engagement with spin glass theory, discrepancy minimization, spectral embedding, and information-computation gaps. Scientific awards include: Stein Fellow, Department of Statistics, Stanford University (2022–2025) She has advised and taught at both Stanford and Yale, including courses such as Advanced Probability , Theory of Probability , and Stochastic Processes . She has organized seminars at Stanford and has delivered invited talks at institutions including Cornell, Duke, UC Berkeley, and Princeton. Her collaborative research involves prominent scholars such as Allan Sly, Emmanuel Abbe, and Tselil Schramm. There is no mention of external grants, but her postdoctoral fellowship suggests research funding support. She is involved in academic service through organizing the Stanford Statistics and Probability Seminars. She maintains an active research presence with publications in top venues like STOC, FOCS, COLT, ICLR, and journals such as Annals of Probability and Annals of Statistics .

Alina Eneمشاهده پروفایل

دانشیار

• Algorithms
• Combinatorial Optimization
• Submodularity
• +۳ مورد دیگر

Alina Ene is an Associate Professor in the Department of Computer Science at Boston University, within the Faculty of Arts & Sciences. She holds a BSE in Computer Science (High Honors) from Princeton University (2008) and a PhD from the University of Illinois at Urbana-Champaign (2013), advised by Chandra Chekuri. Her research focuses on algorithms, combinatorial optimization (submodularity, graph theory), and their applications to machine learning. She previously served as Assistant Professor at the University of Warwick, Faculty Fellow at the Alan Turing Institute, and postdoctoral researcher at Princeton's Center for Computational Intractability. Key research themes include distributed submodular maximization, streaming algorithms, optimization theory, and machine learning. Her work bridges theoretical guarantees with practical applications in data science and distributed systems. Notable contributions include frameworks for submodular maximization under constraints, randomized coordinate descent methods, and routing algorithms with balance considerations. Publications emphasize algorithm design for submodular functions, stochastic optimization, and graph problems. Recent work explores high-probability convergence in stochastic gradient methods, clipped gradient techniques, and online ad allocation strategies. Her 2016 FOCS paper on distributed submodular maximization remains influential in large-scale optimization. Professional service includes editorial work for conferences like FOCS/STOC/SODA and grants from NSF's CAREER program. No explicit scientific awards are listed, though her fellowships and postdoctoral appointments reflect scholarly recognition.

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

Nikhil Bansal holds the prestigious Patrick C. Fischer Professorship of Theoretical Computer Science in the Department of Computer Science & Engineering at the University of Michigan's College of Engineering. His research program has established him as a leading figure in theoretical computer science, with significant contributions to algorithm design and analysis, particularly in discrete optimization problems. Bansal's research focuses on theoretical computer science with emphasis on design and analysis of algorithms for discrete optimization problems. His work spans multiple areas including discrepancy theory, approximation algorithms, randomized algorithms, combinatorial optimization, complexity theory, machine learning theory, and probability. He has made significant contributions to understanding the limits of approximation algorithms and developing novel techniques for combinatorial optimization problems. Analysis of Bansal's recent publications reveals a strong focus on discrepancy theory, online algorithms, and combinatorial optimization. His work often bridges theoretical computer science with discrete mathematics and probability theory. A recurring theme across his publications is the development of novel algorithmic techniques for solving NP-hard problems with provable guarantees. His research has evolved from foundational work in approximation algorithms to more recent contributions in quantum computing complexity and stochastic optimization. Patrick C. Fischer Professor of Theoretical Computer Science Bansal has advised numerous PhD students including Marek Elias, Shashwat Garg, and Greg Koumoutsous, as well as mentoring several postdoctoral researchers. He has served on editorial boards for top journals including Journal of the ACM, Theory of Computing, and Stochastic Models, and has been active on program committees for major conferences such as STOC, FOCS, SODA, and ICALP, including serving as chair for ICALP 2021. Bansal has organized multiple academic workshops including the STOC 2020 Workshop on Recent Advances in Discrepancy and Applications, several SDP Days at CWI Amsterdam, and the Semester on Bridging Continuous and Discrete Optimization at UC Berkeley in Fall 2017.

Nikhil Bansalمشاهده پروفایل

استاد

• Theoretical Computer Science
• Design and Analysis of Algorithms
• Discrete Mathematics
• +۳ مورد دیگر

Nikhil Bansal is a Professor in Theoretical Computer Science at the University of Michigan, Ann Arbor. He earned his PhD from Carnegie Mellon University and previously worked at IBM Research, TU Eindhoven, and CWI Amsterdam. His research focuses on algorithm design, discrepancy theory, and combinatorial optimization. Education: PhD, Carnegie Mellon University Bansal's work bridges classical and quantum computing, with recent publications exploring k -Forrelation, vector balancing, and stochastic scheduling. His algorithmic approaches often combine geometric insights and probabilistic methods. Scientific Awards: Patrick C. Fischer Professor of Theoretical Computer Science NSF Career Award (2023) He has advised numerous PhD and postdoctoral researchers, including Marek Elias, Shashwat Garg, and Makrand Sinha. Bansal actively contributes to program committees (ICALP 2021, STOC 2020, FOCS 2018) and organizes workshops on discrepancy theory and optimization.

Noah Gansمشاهده پروفایل

استاد

• Service Operations
• Stochastic Processes
• Queueing Systems
• +۳ مورد دیگر

Noah Gans is the Anheuser-Busch Professor of Management Science at the Wharton School of the University of Pennsylvania, where he serves as Professor in the Operations, Information and Decisions department. His research focuses on service operations with particular emphasis on call center management, stochastic processes, and queueing system control. Department Editor, Stochastic Models and Simulation at Management Science President of Manufacturing and Service Operations Management Society (MSOM) PhD Program Coordinator for the OID Department His academic work spans diverse domains including healthcare technology pricing, container inspection security, workforce optimization, and revenue management. He has pioneered adaptive clinical trial designs and developed novel models for customer demand sensitivity in overbooking scenarios. Key research areas include: Bayesian sequential learning for multi-arm clinical trials Value-based pricing under uncertainty Stochastic control in service systems Security policy analysis for global supply chains Risk-sharing mechanisms in healthcare Scientific honors include NSF CAREER Award (1998), INFORMS George E. Nicholson Prize (1995), and multiple teaching awards from the Wharton MBA program (2004, 2010-2011, 1997-2001). His publications bridge theoretical operations research with practical implementation across healthcare, transportation, and service industries.

Steven O. Kimbroughمشاهده پروفایل

استاد

• Artificial Intelligence
• Computational Rationality
• Decision Support Systems
• +۶ مورد دیگر

Steven O. Kimbrough is a Professor of Operations, Information and Decisions at the Wharton School, University of Pennsylvania. His research spans artificial intelligence, computational rationality, and strategic optimization with applications to political science, economics, and service innovation. He teaches courses like Agents, Games, and Evolution and Thinking With Models , focusing on experimental approaches to bounded rationality and uncertainty in decision-making. Primary Email: kimbrough@wharton.upenn.edu Office: 3730 Walnut Street, 565 Jon M. Huntsman Hall, Philadelphia, PA 19104 His research interests include: Artificial intelligence and metaheuristics for constrained optimization Evolutionary computation in electoral redistricting Agent-based modeling of market dynamics Logic modeling for normative reasoning Text mining applications in event analysis Publications demonstrate expertise in computational economics, political modeling, and service analytics. Recent work focuses on: Empirical validation of electoral compactness Strategic learning in oligopolies Multi-objective matching algorithms Feasible-infeasible solution spaces Service network optimization Teaching emphasizes: Game-theoretic approaches to strategic behavior Modeling life-cycle for energy sustainability Computational experiments in social science

Vijay K Gargمشاهده پروفایل

استاد

• Distributed Algorithms
• Fault Tolerance
• Multicore Computing
• +۷ مورد دیگر

Vijay K Garg is a Professor at the University of Texas at Austin , holding positions in both the Department of Electrical and Computer Engineering and the Department of Computer Sciences . He serves as the Director of the Parallel and Distributed Systems Laboratory and has made significant contributions to distributed computing. Ph.D. in Electrical Engineering and Computer Science from University of California at Berkeley (1988) M.S. in Electrical Engineering and Computer Science from University of California at Berkeley (1985) B.Tech. in Computer Science & Engineering from Indian Institute of Technology, Kanpur (1984) His research focuses on Distributed Algorithms , Fault Tolerance , Multicore Computing , and Lattice Theory applied to computing problems. He has also contributed to areas like Distributed Debugging , Simulation , and Supervisory Control of Discrete Event Systems . His publications show a consistent focus on applying Lattice Theory to Distributed Systems , with recent work on Predicate Detection algorithms, Lattice Agreement , and applications to problems like Stable Marriage and Matching . His work bridges theoretical computer science with practical implementations in distributed systems. Among his scientific awards are: IEEE Fellow (2004) UT Outstanding Inventor (2011) Best Paper Award at 17th International Conference on Runtime Verification (RV'2017) Best Paper Award at 12th International Symposium on Stabilization, Safety, and Security of Distributed Systems (2010) Dean’s Fellowship at UT Austin (2002) Faculty Research Award at UT Austin (2000) Vijay has served on numerous program committees including ICDCS 2022 , SRDS 2021 , ICDCN 2020 , and DISC 2019 . He has also delivered keynote and invited talks at major conferences.

Rolf Wankaمشاهده پروفایل

استاد

• Algorithms
• Combinatorial Optimization
• Swarm Intelligence
• +۳ مورد دیگر

Prof. Dr. Rolf Wanka is a Professor at the Department of Computer Science, Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU), specializing in efficient algorithms and combinatorial optimization. His research focuses on swarm intelligence, discrete optimization algorithms, and scheduling problems, particularly in timetabling and robotics applications. Education : Sc.D. (Dr. rer. nat.) in Computer Science His work includes theoretical and experimental analyses of particle swarm optimization (PSO) algorithms, addressing runtime complexity, stagnation behavior, and convergence properties. He has developed novel heuristics for timetabling and sorting problems, with applications in multi-robot systems and medical imaging. Notable collaborations include studies on Markov chain-based PSO and fairness in academic scheduling. Key trends in his recent publications span swarm intelligence , discrete optimization , and scheduling heuristics , with a focus on robust timetabling , runtime analysis , and stochastic algorithm behavior . While no explicit scientific awards are listed, his mentorship in the Max Weber-Programm highlights his advisory role in academia. His publications demonstrate interdisciplinary applications of algorithms in robotics , medical imaging , and parallel computing , leveraging both theoretical rigor and practical experimentation. The full description below provides exhaustive details on his academic contributions and affiliations.

• Optimization
• Operational Research
• Electric Mobility
• +۳ مورد دیگر

Imene ZAIDI is a Teacher-researcher at CESI engineering school in France, affiliated with the Engineering and Digital Tools research team. Her work bridges computer science and operational research with practical applications in sustainable transportation systems. Her academic background includes: Doctorate in Optimized management of electric vehicle fleet charging from University of Haute-Alsace (2022) Engineering Diploma in Computer Systems from ex.INI Algiers (2018) ZAIDI's research centers on optimization challenges in electric mobility, particularly electric vehicle charging scheduling. She develops computational approaches including heuristics, metaheuristics, and exact algorithms to address grid capacity constraints, demand satisfaction, and energy maximization in unbalanced power systems. Her work integrates operational research with real-world transportation and energy infrastructure challenges. Analysis of her 2020-2024 publications reveals consistent focus on preemptive scheduling, computational complexity, and multi-objective optimization in electric vehicle ecosystems. The research demonstrates increasing sophistication from foundational scheduling models to grid-integrated solutions addressing three-phase power imbalances and capacity limitations. She teaches computer science courses including Object-oriented programming, Algorithms, Databases, Embedded systems, Web development, and Information systems to engineering and bachelor's students across multiple academic levels. The Engineering and Digital Tools research team at CESI provides the collaborative framework for her investigations into decision support systems for sustainable mobility and energy-efficient transportation solutions.