معرفی
Jeff Edmonds is a Professor in the Department of Electrical Engineering & Computer Science at York University. He received his PhD from the University of Toronto in 1992, with a thesis on time-space tradeoffs. His postdoctoral work at ICSI in Berkeley focused on secure data transmission for multimedia applications. He joined York University in 1995.
His research interests include complexity theory, scheduling, proof systems, probability theory, combinatorics, and machine learning. He is affiliated with the Theory Group at York University and teaches advanced courses such as COSC6111 (Advanced Algorithm Design and Analysis), CSE3101 (Algorithms), and CSE2101 (Fundamentals of Data Structures).
Edmonds has developed notable algorithms, including collaborative work with Kirk Pruhs on randomized cake-cutting protocols, which address fair division problems with applications beyond dessert, such as asset distribution and international negotiations. His teaching emphasizes foundational algorithmic techniques, including loop invariants, recursion, dynamic programming, and randomized algorithms.
His research extends to network flow, linear programming, entropy, and computational complexity topics like NP-completeness and computability. He is also active in machine learning fundamentals, covering topics such as gradient descent and neural networks.
