معرفی
Greg Plaxton is a Professor of Computer Science at the University of Texas at Austin. He holds a Ph.D. from Stanford University (1989) and a B.A.Sc. from the University of Toronto (1985). His research focuses on the design and analysis of efficient algorithms for computational problems related to matching, scheduling, sorting, and clustering, with applications in distributed systems and algorithmic game theory.
Key research areas include
- Theoretical Computer Science
- Matching and Scheduling Algorithms
- Sorting Networks and Distributed Computing
- Algorithmic Game Theory and Resource Allocation
Recent publications analyze three-dimensional stable matchings, egalitarian resource sharing over multiple rounds, and obnoxious facility location games. His work frequently appears in top conferences like ACM-SIAM Symposium on Discrete Algorithms and International Conference on Game Theory.
He is affiliated with the Algorithms and Computational Theory Group at UT Austin. Contact: plaxton@cs.utexas.edu, (512) 471-9751, GDC 4.512.
