F. Li, C. G. Plaxton, and V. B. Sinha. The obnoxious facility location game with dichotomous preferences. Technical Report arXiv:2109.05396, 34 pages, September 2021. Revised, May 2023.
F. Li, C. G. Plaxton, and V. B. Sinha. Egalitarian resource sharing over multiple rounds. Technical Report arXiv:2106.02688, 25 pages, June 2021. Revised, July 2022.
F. Li, C. G. Plaxton, and V. B. Sinha. Object allocation over a network of objects: Mobile agents with strict preferences. Technical Report arXiv:2103.01394, 39 pages, March 2021.
C.-K. Lam and C. G. Plaxton. On the existence of three-dimensional stable matchings with cyclic preferences. Technical Report arXiv:1905.02844, 13 pages, May 2019.
C.-K. Lam and C. G. Plaxton. A (ln 4)-approximation algorithm for maximum stable matching with one-sided ties and incomplete lists. Department of Computer Science, University of Texas at Austin, Technical Report TR-18-01, 25 pages, April 2018. See the SODA 2019 version for an improved bound.
N. O. Domanic, C.-K. Lam, and C. G. Plaxton. Group strategyproof Pareto-stable marriage with indifferences via the generalized assignment game. Technical Report arXiv:1707.01496, 33 pages, July 2017. Updated version of UTCS TR-17-05.
N. O. Domanic, C.-K. Lam, and C. G. Plaxton. Group strategyproof Pareto-stable marriage with indifferences via the generalized assignment game. Department of Computer Science, University of Texas at Austin, Technical Report TR-17-05, 33 pages, May 2017.
N. O. Domanic, C.-K. Lam, and C. G. Plaxton. Strategyproof Pareto-stable mechanisms for two-sided matching with indifferences. Technical Report arXiv:1703.10598, 28 pages, March 2017. Updated version of UTCS TR-16-19.
N. O. Domanic, C.-K. Lam, and C. G. Plaxton. Strategyproof Pareto-stable mechanisms for two-sided matching with indifferences. Department of Computer Science, University of Texas at Austin, Technical Report TR-16-19, 27 pages, November 2016.
N. O. Domanic, C.-K. Lam, and C. G. Plaxton. Bipartite matching with linear edge weights. Department of Computer Science, University of Texas at Austin, Technical Report TR-16-15, 38 pages, October 2016.
N. O. Domanic and C. G. Plaxton. Scheduling unit jobs with a common deadline to minimize the sum of weighted completion times and rejection penalties. Department of Computer Science, University of Texas at Austin, Technical Report TR-14-11, 27 pages, September 2014.
C. G. Plaxton. Vertex-weighted matching in two-directional orthogonal ray graphs. Department of Computer Science, University of Texas at Austin, Technical Report TR-13-16, 18 pages, September 2013.
C. G. Plaxton. A simple family of Top Trading Cycles mechanisms for housing markets with indifferences. Department of Computer Science, University of Texas at Austin, Technical Report TR-12-21, 19 pages, October 2012.
C. Krishnappa and C. G. Plaxton. A dynamic unit-demand auction with bid revision and sniping fees. Department of Computer Science, University of Texas at Austin, Technical Report TR-11-30, 12 pages, June 2011.
C. Krishnappa and C. G. Plaxton. A sealed-bid unit-demand auction with put options. Department of Computer Science, University of Texas at Austin, Technical Report TR-11-04, 50 pages, February 2011.
C. Krishnappa and C. G. Plaxton. A dynamic unit-demand auction supporting bid revision. Department of Computer Science, University of Texas at Austin, Technical Report TR-10-24, 43 pages, July 2010.
N. B. Dimitrov and C. G. Plaxton. Competitive weighted matching in transversal matroids. Department of Computer Science, University of Texas at Austin, Technical Report TR-08-03, 14 pages, January 2008.
C. G. Plaxton, Y. Sun, M. Tiwari, and H. Vin. Reconfigurable resource scheduling with variable delay bounds. Department of Computer Science, University of Texas at Austin, Technical Report TR-06-29, 18 pages, July 2006.
C. G. Plaxton, M. Tiwari, and P. Yalagandula. Online aggregation over trees. Department of Computer Science, University of Texas at Austin, Technical Report TR-06-30, 30 pages, May 2006.
N. B. Dimitrov and C. G. Plaxton. Buyer-supplier games: Core characterization and computation. Department of Computer Science, University of Texas at Austin, Technical Report TR-06-19, 29 pages, April 2006.
N. B. Dimitrov and C. G. Plaxton. Optimal cover time for a graph-based coupon collector process. Department of Computer Science, University of Texas at Austin, Technical Report TR-05-01, 17 pages, January 2005.
X. Li and C. G. Plaxton. On name resolution in peer-to-peer networks. Department of Computer Science, University of Texas at Austin, Technical Report TR-02-61, 22 pages, November 2002.
C. G. Plaxton. Approximation algorithms for hierarchical location problems. Department of Computer Science, University of Texas at Austin, Technical Report TR-02-60, 17 pages, November 2002.
R. R. Mettu and C. G. Plaxton. Optimal time bounds for approximate clustering. Department of Computer Science, University of Texas at Austin, Technical Report TR-01-17, 19 pages, May 2001.
R. R. Mettu and C. G. Plaxton. The online median problem. Department of Computer Science, University of Texas at Austin, Technical Report TR-99-34, 13 pages, November 1999.
R. D. Blumofe, C. G. Plaxton, and S. Ray. Verification of a concurrent deque implementation. Department of Computer Science, University of Texas at Austin, Technical Report TR-99-11, 20 pages, June 1999.
M. R. Korupolu, C. G. Plaxton, and R. Rajaraman. Placement algorithms for hierarchical cooperative caching. Department of Computer Science, University of Texas at Austin, Technical Report TR-99-16, 29 pages, June 1999.
M. R. Korupolu, C. G. Plaxton, and R. Rajaraman. Analysis of a local search heuristic for facility location problems. DIMACS, Technical Report 98-30, 37 pages, June 1998.
C. G. Plaxton, R. Rajaraman, and A. W. Richa. Accessing nearby copies of replicated objects in a distributed environment. Department of Computer Science, University of Texas at Austin, Technical Report TR-97-11, 23 pages, April 1997.
C. G. Plaxton and R. Rajaraman. Fast fault-tolerant concurrent access to shared objects. Department of Computer Science, University of Texas at Austin, Technical Report TR-96-21, 31 pages, December 1996.
S. K. Baruah, J. E. Gehrke, and C. G. Plaxton. Fair on-line scheduling of a dynamic set of tasks on a single resource. Department of Computer Science, University of Texas at Austin, Technical Report TR-96-03, 12 pages, February 1996.
S. K. Baruah, J. E. Gehrke, and C. G. Plaxton. Fast scheduling of periodic tasks on multiple resources. Department of Computer Science, University of Texas at Austin, Technical Report TR-95-02, 21 pages, February 1995.
D. Kravets and C. G. Plaxton. An optimal hypercube algorithm for the all nearest smaller values problem. Department of Computer Science, University of Texas at Austin, Technical Report TR-94-25, 17 pages, October 1994.
F. T. Leighton and C. G. Plaxton. Hypercubic sorting networks. Department of Computer Science, University of Texas at Austin, Technical Report TR-94-18, 52 pages, May 1994.
P. D. MacKenzie, C. G. Plaxton, and R. Rajaraman. On contention resolution protocols and associated probabilistic phenomena. Department of Computer Science, University of Texas at Austin, Technical Report TR-94-06, 43 pages, April 1994.
C. G. Plaxton and T. Suel. A super-logarithmic lower bound for hypercubic sorting networks. Department of Computer Science, University of Texas at Austin, Technical Report TR-94-08, 24 pages, April 1994.
A. Aggarwal and C. G. Plaxton. Optimal parallel sorting in multi-level storage. Department of Computer Science, University of Texas at Austin, Technical Report TR-93-22, 24 pages, November 1993.
P. Berthome, A. Ferreira, B. M. Maggs, S. Perennes, and C. G. Plaxton. Sorting-based selection algorithms for hypercubic networks. Laboratoire de l'Informatique du Parallelisme, Institut IMAG, Ecole Normale Superieure de Lyon, Technical Report 92-38, 15 pages, July 1992.
B. M. Maggs and C. G. Plaxton. Sorting-based selection algorithms for hypercubic networks. Department of Computer Science, University of Texas at Austin, Technical Report TR-92-22, 13 pages, April 1992.
C. G. Plaxton and T. Suel. A lower bound for sorting networks based on the shuffle permutation. Department of Computer Science, University of Texas at Austin, Technical Report TR-92-07, 17 pages, March 1992.
R. E. Cypher and C. G. Plaxton. Techniques for shared key sorting. Computer Science Department, IBM Almaden Research Center, Technical Report RJ 7347, 10 pages, March 1990.
C. G. Plaxton. Efficient computation on sparse interconnection networks. Department of Computer Science, Stanford University, Technical Report STAN-CS-89-1283, 120 pages, September 1989.
C. G. Plaxton. On the network complexity of selection. Department of Computer Science, Stanford University, Technical Report STAN-CS-89-1276, 18 pages, August 1989.
C. G. Plaxton. Load balancing on the hypercube and shuffle-exchange. Department of Computer Science, Stanford University, Technical Report STAN-CS-89-1281, 20 pages, August 1989.
E. W. Mayr and C. G. Plaxton. Pipelined parallel prefix computations, and sorting on a pipelined hypercube. Department of Computer Science, Stanford University, Technical Report STAN-CS-89-1261, 16 pages, May 1989.
E. W. Mayr and C. G. Plaxton. Network implementations of the DTEP algorithm. Department of Computer Science, Stanford University, Technical Report STAN-CS-87-1157, 22 pages, May 1987.