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

Cristiano Bocci is a Full Professor at the Department of Information Engineering and Mathematical Sciences, University of Siena. His research focuses on Algebraic Geometry, Commutative Algebra, and their applications in sensor networks and statistics. He teaches courses like Computational Geometry and Analytical Geometry, and his work extends to interdisciplinary projects involving engineering and data science. Contact him at cristiano.bocci@unisi.it. Research Interests: Geometric constructions in projective spaces Hadamard products of varieties and ideals Applications of algebraic methods in sensor networks and granular material measurement Recent Trends in Publications: Over 2023-2024, Bocci has explored Hadamard products' algebraic properties, Gorenstein points in projective spaces, and sensor network designs. His work bridges pure mathematics with engineering solutions like LoRaWAN-based systems for granular material volume measurement. Grants & Advising: While specific grants aren't listed, his active publication record suggests ongoing research projects. No student advisees are explicitly mentioned. Labs/Teams: Collaborates on interdisciplinary teams applying algebraic geometry to sensor technology and data modeling.

• Algebraic Geometry
• Commutative Algebra
• Computational Geometry
• +۳ مورد دیگر

Shubhangi Saraf is an Associate Professor in the Department of Computer Science and Mathematics at the University of Toronto. Previously, she held faculty positions at Rutgers University and was a postdoctoral researcher at the Institute for Advanced Study in Princeton. She earned her Ph.D. in EECS from MIT under the supervision of Madhu Sudan. Her research focuses on theoretical computer science and discrete mathematics, with an emphasis on complexity theory, algebraic computation, error-correcting codes, and discrete geometry. Her work has been supported by prestigious grants including the Sloan Research Fellowship, NSF CAREER Award, and Simons Collaboration on Algorithms and Geometry. Teaching highlights include courses such as Computational Complexity and Computability , Algebraic Complexity Theory , and Introduction to Combinatorics . She has advised current students like Deepanshu Kush and Devansh Shringi, and past students including Mrinal Kumar and Ben Lund. Awards and honors include recognition for her contributions to coding theory and complexity analysis. Her research frequently bridges algebraic techniques with computational challenges, yielding impactful results in areas like polynomial identity testing and arithmetic circuit lower bounds. She has led multiple academic initiatives, including special topics courses exploring algebraic gems in theoretical computer science and discrete mathematics. Her interdisciplinary work intersects with cryptography, combinatorics, and algorithm design, reflecting her broad scholarly contributions.

• Theoretical Computer Science
• Discrete Mathematics
• Complexity Theory
• +۳ مورد دیگر

Dr. Abhishek Dhawan is a Postdoctoral Research Associate in the Department of Mathematics at the University of Illinois Urbana-Champaign, affiliated with the College of Liberal Arts & Sciences. He works under the supervision of József Balogh in the Combinatorics Research Group. PhD from Georgia Tech's School of Mathematics in Algorithms, Combinatorics, and Optimization Advised by Anton Bernshteyn and Cheng Mao His research focuses on graph theory with emphasis on extremal properties , algorithms , and random graph/hypergraph models . He actively contributes to the UIUC Graph Theory and Combinatorics Seminar. Recent publications analyze edge-coloring algorithms , independent set problems , and coloring constraints in graph theory, with applications in theoretical computer science and probabilistic combinatorics. Contact: adhawan2@illinois.edu | Department: math@illinois.edu

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

Anish Sevekari is a Postdoctoral Associate at the University of Pittsburgh. His research focuses on machine learning, algorithms, optimization, and theoretical computer science. He investigates topics such as neural network training dynamics, generative models, algorithmic analysis beyond worst-case scenarios, and efficient inference techniques. His work bridges theoretical foundations with practical applications in areas like probabilistic modeling and combinatorial optimization. Key research interests include normalizing flows, ensemble methods, score-based learning, stochastic optimization, and combinatorial algorithms. His recent publications explore acceleration of NCE convergence, progressive ensemble distillation, and provable benefits of score matching. He has published extensively in top-tier venues, with a focus on theoretical guarantees and practical efficiency. His research trends emphasize bridging gaps between machine learning and traditional algorithmic analysis, particularly in probabilistic frameworks and high-dimensional data problems. No scientific awards or grants are explicitly mentioned in the provided information.

• Machine Learning
• Algorithms
• Optimization
• +۳ مورد دیگر

Dr. Or Brook is an Associate Professor of Competition Law and Policy at the School of Law, University of Leeds, and Deputy Director of the Centre for Business Law and Practice. They hold interdisciplinary qualifications, including a PhD from the Amsterdam Centre for European Law and Governance, an LLM in European Competition Law from the University of Amsterdam, and degrees in Law and Economics from the Hebrew University of Jerusalem. Research focuses on international EU competition law, antitrust, and empirical legal methods. Notable projects include the Priority Setting Project (funded by ESRC) and a comprehensive study of judicial review in EU competition law. They co-edit the Research Handbook on Abuse of Dominance and lead the UK branch of ASCOLA, contributing to policy discussions through international collaborations. Education: PhD in Law, University of Amsterdam LLM in European Competition Law, University of Amsterdam LLB and BSc in Economics, Hebrew University of Jerusalem Research interests emphasize empirical analyses of legal texts, institutional enforcement practices, and competition law’s intersections with other regulatory frameworks. Recent monograph Non-Competition Interests in EU Antitrust Law (Cambridge UP, 2022) presents novel empirical data on public policy influences in EU competition enforcement. Key awards include the Michael Beverley Innovation Fellowship (associated member), supporting entrepreneurial academic initiatives. Their work bridges law and economics through interdisciplinary methods, advocating for empirical rigor in European legal scholarship.

• Competition Law and Policy
• Antitrust
• Regulation
• +۳ مورد دیگر

Terry Soo is an Associate Professor in the Department of Statistical Science at University College London (UCL), a position he has held since 2020. His academic background includes postdoctoral roles at the University of Warwick and the University of Victoria, followed by an Associate Professorship at the University of Kansas. He holds degrees from Simon Fraser University (undergraduate) and the University of British Columbia (PhD). His research focuses on probability theory and ergodic theory , with a particular emphasis on topics such as nonsingular systems, Bernoulli shifts, and stochastic processes. His work often explores structural properties of dynamical systems and their isomorphisms, with applications to measure-preserving transformations and entropy theory. Soo teaches advanced courses such as Stat 0009 (Probability and Statistics) and LTCC Stochastic Processes . His research has been published in prestigious journals like Annals of Probability and Ergodic Theory and Dynamical Systems , and he maintains an active presence in the academic community through external profiles on arXiv, ZbMATH, and AMS.

• Probability Theory
• Ergodic Theory
• Statistical Science

Andrew C. Lee is an Assistant Teaching Professor in the Department of Computer Science at Syracuse University. He holds a Ph.D. from the University of Maryland, College Park (1998) and multiple advanced degrees from the University of Michigan and the University of Hong Kong. His expertise spans the Theory of Computing, Graphs and Combinatorics, Computer Science Education, and the History of Computing. His research focuses on mathematical analysis of computational resources and strategies, integrating methods from logic, discrete mathematics, and automata theory. He has contributed to formal learning theory, graph algorithms, and educational curriculum development. Education: Ph.D. in Computer Science, University of Maryland, College Park (1998) M.A. in Computer Science, University of Maryland, College Park (1996) M.A. in Mathematics, University of Michigan, Ann Arbor (1988) B.A. in Mathematics, University of Hong Kong (1987) Research Interests: Dr. Lee investigates computational problem-solving strategies, particularly in machine learning and algorithm design. He applies graph theory and combinatorial methods to formal learning models and explores the interplay between computing history and education to enhance teaching practices for future professionals. Recent work includes applications in game theory, questionnaire design, and data analytics. Publications: His work spans topics like recursive chromatic numbers, query-based learning models, and graph homeomorphisms. Key themes include algorithmic efficiency, computational logic, and discrete mathematics applications. Teaching & Advising: Courses taught include Artificial Intelligence, Algorithms, and Automata Theory. No explicit grants or student advisees are listed, but his research engages undergraduates in concrete problem-solving scenarios. Labs/Teams: Not explicitly mentioned, but his educational focus suggests involvement in curriculum design and undergraduate research initiatives.

• Theory of Computing
• Graphs and Combinatorics
• Computer Science Education
• +۳ مورد دیگر

Donald Vestal is an Associate Professor and Coordinator in the Department of Mathematics and Statistics at the University of South Dakota. He specializes in Ramsey Theory and Operations Research, with teaching responsibilities in courses like Operations Research (MATH 475/575/675) and Abstract Algebra (MATH 413). His research focuses on Ramsey Theory on the Integers and Operations Research applications. Education: Ph.D. in Mathematics, University of Colorado, Boulder (1998) M.S. in Mathematics, Colorado State University (1992) B.S. in Mathematics, Colorado State University (1990) Research Interests: Dr. Vestal's work explores Ramsey numbers, additive number theory, and combinatorial problems. His studies often bridge pure mathematics with applied operations research methodologies. Publications Trends: His articles span nonlinear Ramsey theory, Diophantine equations, and eta functions, reflecting a focus on both theoretical foundations and applied mathematical problem-solving. Awards: 2013 Engineering Academic Advisor of the Year 2003 Jesse Lee Myers Excellence in Teaching Award Grants & Advising: Secured a $294,200 NSF grant (2003) for Computer Science and Mathematics scholarships. Actively coordinates graduate programs and advises students in mathematics and operations research.

• Ramsey Theory
• Operations Research
• Mathematics Education
• +۳ مورد دیگر

Garth Isaak is a Professor in the Department of Mathematics and Statistics at Lehigh University , part of the College of Arts and Sciences. He has held roles such as Department Chair (2012–2022) and Associate Dean for Graduate Studies (2012–2016). Isaak earned his Ph.D. in 1990 from Rutgers University’s RUTCOR interdisciplinary program. His research focuses on discrete mathematics, particularly graph theory, with contributions to interval orders, pebbling games, Ramsey numbers, and tolerance graphs. He has also explored combinatorial duality and alternative calculus pedagogy. Isaak teaches courses like Graph Theory and Introduction to Mathematical Reasoning . His work emphasizes algorithmic solutions for graph problems and structural characterizations. Over 150 publications and a strong academic mentorship record highlight his scholarly impact. Education: Ph.D. (Rutgers University, 1990); Postdoctoral research at Dartmouth College (1990–1992). Research Interests: Discrete Mathematics, Graph Theory, Interval Orders, Combinatorial Optimization, Ramsey Theory, and Algorithmic Graph Analysis. His work bridges theoretical foundations and practical applications, such as efficient graph recognition algorithms and game-theoretic graph dynamics.

• Discrete Mathematics
• Graph Theory
• Combinatorics
• +۵ مورد دیگر

Kevin Iga is a Professor of Mathematics at Pepperdine University's Seaver College, part of the Natural Science Division. He has been teaching since 1998 and holds a PhD from Stanford University (1998) and dual BS degrees in Mathematics and Physics from MIT (1992). His research focuses on supersymmetry, particularly using Adinkra diagrams, differential topology, general relativity, and cryptography. He has contributed to geometric interpretations of supersymmetry algebras and combinatorial analysis of Adinkras. Iga serves as Public Information Officer for the MAA's Philosophy of Mathematics SIG and is active in professional organizations like the AMS, ASA, and MAA. His work spans over 25 years, with significant contributions to mathematical physics, including structural theory of Adinkras, cohomological applications, and cryptographic hardness problems. He teaches courses such as Algebraic Structures, Automata Theory, and Real Analysis. Iga is also involved in community activities, singing in the Pepperdine Concert Choir and participating in Malibu Presbyterian Church.

• Mathematical Physics
• Supersymmetry
• Differential Topology
• +۴ مورد دیگر

Orli Herscovici is an Assistant Professor in the Department of Mathematics and Computer Science at St. John’s College of Liberal Arts and Sciences, St. John’s University. Her research focuses on advanced mathematical analysis, combinatorics, and special functions, with notable contributions to fractional calculus, polynomial theory, and combinatorial identities. She has published extensively on topics including Gaussian principal frequencies, deformed fractional transforms, and degenerate polynomials. Her work bridges pure mathematics and applications in probability theory and nonlinear systems. Dr. Herscovici’s academic affiliations include the Mathematics and Computer Science department, where she contributes to teaching and research initiatives. Her publications reflect a deep engagement with interdisciplinary areas such as spectral geometry and umbral calculus. While no specific scientific awards or grants are highlighted in the provided text, her scholarly output demonstrates sustained academic engagement in theoretical and applied mathematics.

• Mathematics
• Combinatorics
• Number Theory
• +۳ مورد دیگر

Hsin-Hao Su is an Assistant Professor in the Department of Computer Science at Boston College. His research focuses on distributed computing through the lens of theoretical computer science, emphasizing parallelism, locality, communication, combinatorial optimization, symmetry breaking problems, and gossip-based algorithms. He completed his Ph.D. at the University of Michigan (2010–2015), advised by Seth Pettie, followed by a postdoctoral fellowship in Nancy Lynch's group at MIT (2015–2017). **Education:** Ph.D. in Computer Science, University of Michigan (2010–2015) Postdoctoral Associate, MIT (2015–2017) His work addresses foundational challenges in distributed systems, including efficient algorithms for shortest paths, graph decomposition, and task allocation. Notable contributions include advancing parallel and distributed approaches to clustering, matching, and quantile computations. Su has served on program committees for major conferences like ISAAC, ESA, and DISC, and held roles such as Workshop Chair (PODC 2021) and Student Travel Awards Organizer (PODC 2018). **Research Trends:** His articles emphasize algorithm design under distributed and parallel constraints, with recent focus on optimizing communication, reducing computational rounds, and bridging theoretical guarantees with practical efficiency. Topics span graph algorithms, approximation techniques, and bio-inspired methods.

• Distributed Computing
• Theoretical Computer Science
• Parallel Algorithms
• +۴ مورد دیگر

Andrew Granville serves as Chair of Mathematics at University College London (2015-present) and holds a Canada Research Chair at the University of Montreal (2002-present). His distinguished career spans institutions including University of Georgia, Institute for Advanced Study, and University of Paris. A Fellow of both the Royal Society of Canada and American Mathematical Society, he maintains active research and leadership roles in mathematical academia. Education: 1984: Master degree, Trinity College Cambridge 1987: PhD, Queens University (Advisor: Paulo Ribenboim) Professor Granville's research centers on analytic number theory , combinatorics , and arithmetic geometry . His work bridges theoretical foundations with innovative applications, evidenced by his supervision of 27 PhD students and 32 postdoctoral researchers. His scholarly impact extends through over 100 plenary lectures delivered at premier institutions worldwide including Berkeley, Cambridge, IAS, and Princeton. Notable Awards: CRM-Fields-PIMS Prize (2021) Multiple Lester R. Ford Awards (2007, 2009) Chauvenet Prize (2008) Royal Society Wolfson Research Merit Award (2015) Presidential Faculty Fellowship (1994-1999) His academic leadership includes delivering the plenary address at the American Mathematical Society Annual Meeting and serving as invited speaker at the International Congress of Mathematicians. Current research activities continue through his Montreal-based chair position and ongoing supervision of doctoral candidates across international institutions.

• Analytic number theory
• Combinatorics
• Arithmetic geometry

Dr. David Pike is a Research Professor at Memorial University of Newfoundland, cross-appointed to the Department of Computer Science. His primary research focuses on combinatorial mathematics, including block-intersection graphs of combinatorial designs, cycle systems, graph decompositions, and computational problems in combinatorics. He has held grants from NSERC and CFI for research in combinatorial design theory and high-performance computing. Dr. Pike has taught courses such as Graph Theory, Combinatorial Design Theory, and Cryptography across multiple academic years. He earned a B.Math from the University of Waterloo and a PhD from Auburn University. His awards include the Motivational Teaching Award (2004) and the ICA Hall Medal (2007). Dr. Pike serves as Vice-President of the Institute of Combinatorics and its Applications and previously held roles in the Canadian Mathematical Society. His research spans structural properties of graphs, existential closure, and algorithmic problems in combinatorics. Recent work includes studies on hypergraph burning, firefighting strategies, and colorings of combinatorial systems.

• Combinatorics
• Graph Theory
• Design Theory
• +۱ مورد دیگر

Louis DeBiasio is a Professor of Mathematics at Miami University, part of the College of Arts and Science. He earned his Ph.D. in Mathematics from Arizona State University. His research focuses on Extremal and Probabilistic Graph Theory, with a strong emphasis on Ramsey Theory, hypergraphs, and structural graph properties. He has held significant grants, including an NSF DMS Grant (2020–2023) and a Simons Collaboration Grant (2013–2018). Notably, he was a Project NExT Fellow in 2012. His work often involves collaborations on topics like Hamiltonian cycles, monochromatic components, and Ramsey numbers. Education: Ph.D., Mathematics, Arizona State University Research Interests: Extremal Graph Theory, Probabilistic Methods, Ramsey Theory, Hypergraph Coloring, Directed Graphs, and Structural Combinatorics. His recent work explores monochromatic subgraphs in edge-colored structures and properties of Hamiltonian cycles in diverse graph classes. Grants and Awards: NSF DMS Grant (2020–2023) Simons Collaboration Grant (2013–2018) Project NExT Fellow (2012) His publications span over 40 articles in top journals such as SIAM Journal on Discrete Mathematics, Combinatorics, Probability, and Computing, and European Journal of Combinatorics. He also organized the MIGHTY LIV conference at Miami University in 2013, fostering academic collaboration in graph theory.

• Extremal Graph Theory
• Probabilistic Graph Theory
• Combinatorics
• +۳ مورد دیگر