Button to scroll to the top of the page.

Updates

Campus health and safety are our top priorities. Get the latest from UT on COVID-19.

Get help with Zoom and more.

PLAXTON, C GREG

C Greg Plaxton

Professor
Department of Computer Science


Theoretical Computer Science

plaxton@cs.utexas.edu

Phone: 512-471-9751

Office Location
GDC 4.512

Postal Address
2317 SPEEDWAY
AUSTIN, TX 78712

Ph.D., Stanford University (1989)
B.A.Sc., University of Toronto (1985)

Research Interests

Dr. Plaxton's research is concerned with the design and analysis of fast algorithms for basic computational problems. His past work includes contributions related to caching, clustering, scheduling, and sorting. He is currently studying variants of the matching problem motivated by applications to scheduling and to combinatorial auctions.

Selected Publications 

X. Li, J. Misra, C. G. Plaxton. Maintaining the Ranch topology. Journal of Parallel and Distributed Computing, 70:1142--1158, 2010.

N. B. Dimitrov and C. G. Plaxton. Competitive weighted matching in transversal matroids. In Proceedings of the 35th International Colloquium on Automata, Languages, and Programming, Part I, Reykjavik, Iceland, pages 397-408, July 2008. To appear in Algorithmica.

C. G. Plaxton. Fast scheduling of weighted tasks with release times and deadlines. In Proceedings of the 35th International Colloquium on Automata, Languages, and Programming, Part I, Reykjavik, Iceland, pages 222-233, July 2008.

C. G. Plaxton. Approximation algorithms for hierarchical location problems. Journal of Computer and System Sciences, 72:425-443, 2006.

R. R. Mettu and C. G. Plaxton. The online median problem. SIAM Journal on Computing, 32:816-832, 2003.