C.-K. Lam and C. G. Plaxton. Maximum stable matching with one-sided ties of bounded length. Theory of Computing Systems, 32 pages, March 2021, accepted subject to minor revisions. Revised, May 2021.
C.-K. Lam and C. G. Plaxton. On the existence of three-dimensional stable matchings with cyclic preferences. Theory of Computing Systems, 16 pages, January 2021, accepted subject to minor revisions. Revised, March 2021.
N. B. Dimitrov and C. G. Plaxton. Optimal cover time for a graph-based coupon collector process. Journal of Discrete Algorithms, 19:39-51, 2013.
N. B. Dimitrov and C. G. Plaxton. Competitive weighted matching in transversal matroids. Algorithmica, 62:333-348, 2012.
N. B. Dimitrov and C. G. Plaxton. Buyer-supplier games: Optimization over the core. Theoretical Computer Science, 412:614-625, 2011.
X. Li, J. Misra, and C. G. Plaxton. Maintaining the Ranch topology. Journal of Parallel and Distributed Computing, 70:1142-1156, 2010.
H. Attiya, F. Kuhn, C. G. Plaxton, M. Wattenhofer, and R. Wattenhofer. Efficient adaptive collect using randomization. Distributed Computing, 18:179-188, 2006.
X. Li, J. Misra, and C. G. Plaxton. Concurrent maintenance of rings. Distributed Computing, 19:126-148, 2006.
X. Li, C. G. Plaxton, M. Tiwari, and A. Venkataramani. Online hierarchical cooperative caching. Theory of Computing Systems, 39:851-874, 2006.
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. Optimal time bounds for approximate clustering. Machine Learning, 56:35-60, 2004.
R. R. Mettu and C. G. Plaxton. The online median problem. SIAM Journal on Computing, 32:816-832, 2003.
N. S. Arora, R. D. Blumofe, and C. G. Plaxton. Thread scheduling for multiprogrammed multiprocessors. Theory of Computing Systems, 34:115-144, 2001.
M. R. Korupolu, C. G. Plaxton, and R. Rajaraman. Placement algorithms for hierarchical cooperative caching. Journal of Algorithms, 38:260-302, 2001.
P. Berthome, A. Ferreira, B. M. Maggs, S. Perennes, and C. G. Plaxton. Sorting-based selection algorithms for hypercubic networks. Algorithmica, 26:237-254, 2000.
M. R. Korupolu, C. G. Plaxton, and R. Rajaraman. Analysis of a local search heuristic for facility location problems. Journal of Algorithms, 37:146-188, 2000.
C. G. Plaxton and T. Suel. A super-logarithmic lower bound for shuffle-unshuffle sorting networks. Theory of Computing Systems, 33:233-254, 2000.
J. E. Gehrke, C. G. Plaxton, and R. Rajaraman. Rapid convergence of a local load balancing algorithm for asynchronous rings. Theoretical Computer Science, 220:247-265, 1999.
B. Ghosh, F. T. Leighton, B. M. Maggs, S. Muthukrishnan, C. G. Plaxton, R. Rajaraman, A. W. Richa, R. E. Tarjan, and D. I. Zuckerman. Tight analyses of two local load balancing algorithms. SIAM Journal on Computing, 29:29-64, 1999.
C. G. Plaxton, R. Rajaraman, and A. W. Richa. Accessing nearby copies of replicated objects in a distributed environment. Theory of Computing Systems, 32:241-280, 1999.
G. E. Blelloch, C. E. Leiserson, B. M. Maggs, C. G. Plaxton, S. J. Smith, and M. Zagha. An experimental analysis of parallel sorting algorithms. Theory of Computing Systems, 31:135-167, March/April 1998.
P. D. MacKenzie, C. G. Plaxton, and R. Rajaraman. On contention resolution protocols and associated probabilistic phenomena. Journal of the ACM, 45:324-378, March 1998.
F. T. Leighton and C. G. Plaxton. Hypercubic sorting networks. SIAM Journal on Computing, 27:1-47, February 1998.
F. T. Leighton, Y. Ma, and C. G. Plaxton. Breaking the $\Theta(n\log^2n)$ barrier for sorting with faults. Journal of Computer and System Sciences, 54:265-304, April 1997.
S. K. Baruah, J. E. Gehrke, C. G. Plaxton, I. Stoica, H. Abdel-Wahab, and K. Jeffay. Fair on-line scheduling of a dynamic set of tasks on a single resource. Information Processing Letters, 64:43-51, 1997.
C. G. Plaxton and T. Suel. Lower bounds for Shellsort. Journal of Algorithms, 23:221-240, 1997.
S. K. Baruah, N. K. Cohen, C. G. Plaxton, and D. A. Varvel. Proportionate progress: A notion of fairness in resource allocation. Algorithmica, 15:600-625, 1996.
D. Kravets and C. G. Plaxton. All nearest smaller values on the hypercube. IEEE Transactions on Parallel and Distributed Systems, 7:456-462, 1996.
C. G. Plaxton and T. Suel. A lower bound for sorting networks based on the shuffle permutation. Mathematical Systems Theory, 27:491-508, 1994.
R. E. Cypher and C. G. Plaxton. Deterministic sorting in nearly logarithmic time on the hypercube and related computers. Journal of Computer and System Sciences, 47:501-548, December 1993.
E. W. Mayr and C. G. Plaxton. Pipelined parallel prefix computations, and sorting on a pipelined hypercube. Journal of Parallel and Distributed Computing, 17:374-380, 1993.
E. W. Mayr and C. G. Plaxton. On the spanning trees of weighted graphs. Combinatorica, 12:433-447, 1992.