default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDC. Greg Plaxton
C. Gregory Plaxton
Person information
- affiliation: University of Texas at Austin, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j34]Fu Li, C. Gregory Plaxton, Vaibhav B. Sinha
:
The obnoxious facility location game with dichotomous preferences. Theor. Comput. Sci. 961: 113930 (2023)- 2022
- [j33]Chi-Kit Lam, C. Gregory Plaxton:
Maximum Stable Matching with One-Sided Ties of Bounded Length. Theory Comput. Syst. 66(3): 645-678 (2022) - [j32]Chi-Kit Lam, C. Gregory Plaxton:
On the Existence of Three-Dimensional Stable Matchings with Cyclic Preferences. Theory Comput. Syst. 66(3): 679-695 (2022) - 2021
- [c53]Fu Li, C. Gregory Plaxton, Vaibhav B. Sinha:
Object Allocation Over a Network of Objects: Mobile Agents with Strict Preferences. AAMAS 2021: 1578-1580 - [c52]Fu Li, C. Gregory Plaxton, Vaibhav B. Sinha:
The Obnoxious Facility Location Game with Dichotomous Preferences. ICTCS 2021: 219-233 - [i7]Fu Li, C. Gregory Plaxton, Vaibhav B. Sinha:
Object Allocation Over a Network of Objects: Mobile Agents with Strict Preferences. CoRR abs/2103.01394 (2021) - [i6]Fu Li, C. Gregory Plaxton, Vaibhav B. Sinha:
Egalitarian Resource Sharing Over Multiple Rounds. CoRR abs/2106.02688 (2021) - [i5]Fu Li, C. Gregory Plaxton, Vaibhav B. Sinha:
The Obnoxious Facility Location Game with Dichotomous Preferences. CoRR abs/2109.05396 (2021)
2010 – 2019
- 2019
- [c51]Chi-Kit Lam, C. Gregory Plaxton:
On the Existence of Three-Dimensional Stable Matchings with Cyclic Preferences. SAGT 2019: 329-342 - [c50]Chi-Kit Lam, C. Gregory Plaxton:
Maximum Stable Matching with One-Sided Ties of Bounded Length. SAGT 2019: 343-356 - [c49]Chi-Kit Lam, C. Gregory Plaxton:
A (1 + 1/e)-Approximation Algorithm for Maximum Stable Matching with One-Sided Ties and Incomplete Lists. SODA 2019: 2823-2840 - [i4]Chi-Kit Lam, C. Gregory Plaxton:
On the Existence of Three-Dimensional Stable Matchings with Cyclic Preferences. CoRR abs/1905.02844 (2019) - 2017
- [c48]Nevzat Onur Domaniç, Chi-Kit Lam, C. Gregory Plaxton:
Group Strategyproof Pareto-Stable Marriage with Indifferences via the Generalized Assignment Game. SAGT 2017: 280-291 - [i3]Nevzat Onur Domaniç, Chi-Kit Lam, C. Gregory Plaxton:
Strategyproof Pareto-Stable Mechanisms for Two-Sided Matching with Indifferences. CoRR abs/1703.10598 (2017) - [i2]Nevzat Onur Domaniç, Chi-Kit Lam, C. Gregory Plaxton:
Group Strategyproof Pareto-Stable Marriage with Indifferences via the Generalized Assignment Game. CoRR abs/1707.01496 (2017) - 2016
- [c47]Nevzat Onur Domaniç, Chi-Kit Lam, C. Gregory Plaxton:
Bipartite Matching with Linear Edge Weights. ISAAC 2016: 28:1-28:13 - 2014
- [c46]Nevzat Onur Domaniç, C. Gregory Plaxton:
Scheduling Unit Jobs with a Common Deadline to Minimize the Sum of Weighted Completion Times and Rejection Penalties. ISAAC 2014: 646-657 - 2013
- [j31]Nedialko B. Dimitrov, C. Greg Plaxton:
Optimal cover time for a graph-based coupon collector process. J. Discrete Algorithms 19: 39-51 (2013) - [c45]C. Gregory Plaxton:
Vertex-Weighted Matching in Two-Directional Orthogonal Ray Graphs. ISAAC 2013: 524-534 - [i1]Ramgopal R. Mettu, C. Greg Plaxton:
Optimal Time Bounds for Approximate Clustering. CoRR abs/1301.0587 (2013) - 2012
- [j30]Nedialko B. Dimitrov, C. Greg Plaxton:
Competitive Weighted Matching in Transversal Matroids. Algorithmica 62(1-2): 333-348 (2012) - 2011
- [j29]Nedialko B. Dimitrov, C. Greg Plaxton:
Buyer-supplier games: Optimization over the core. Theor. Comput. Sci. 412(7): 614-625 (2011) - [c44]Chinmayi Krishnappa, C. Greg Plaxton:
A dynamic unit-demand auction supporting bid revision. ICEC 2011: 4:1-4:10 - 2010
- [j28]Xiaozhou Li, Jayadev Misra, C. Greg Plaxton:
Maintaining the Ranch topology. J. Parallel Distributed Comput. 70(11): 1142-1158 (2010)
2000 – 2009
- 2008
- [c43]C. Greg Plaxton:
Fast Scheduling of Weighted Unit Jobs with Release Times and Deadlines. ICALP (1) 2008: 222-233 - [c42]Nedialko B. Dimitrov, C. Greg Plaxton:
Competitive Weighted Matching in Transversal Matroids. ICALP (1) 2008: 397-408 - [c41]C. Greg Plaxton, Yu Sun, Mitul Tiwari, Harrick M. Vin:
Online Compression Caching. SWAT 2008: 414-425 - 2007
- [c40]C. Greg Plaxton, Yu Sun, Mitul Tiwari, Harrick M. Vin:
Reconfigurable Resource Scheduling with Variable Delay Bounds. IPDPS 2007: 1-10 - [c39]C. Greg Plaxton, Mitul Tiwari, Praveen Yalagandula:
Online Aggregation over Trees. IPDPS 2007: 1-10 - [c38]Nedialko B. Dimitrov, C. Greg Plaxton:
Buyer-Supplier Games: Optimization over the Core. WAOA 2007: 27-40 - 2006
- [j27]Hagit Attiya, Fabian Kuhn, C. Greg Plaxton, Mirjam Wattenhofer, Roger Wattenhofer:
Efficient adaptive collect using randomization. Distributed Comput. 18(3): 179-188 (2006) - [j26]Xiaozhou Li, Jayadev Misra, C. Greg Plaxton:
Concurrent Maintenance of Rings. Distributed Comput. 19(2): 126-148 (2006) - [j25]C. Greg Plaxton:
Approximation algorithms for hierarchical location problems. J. Comput. Syst. Sci. 72(3): 425-443 (2006) - [j24]Xiaozhou Li, C. Greg Plaxton, Mitul Tiwari, Arun Venkataramani:
Online Hierarchical Cooperative Caching. Theory Comput. Syst. 39(6): 851-874 (2006) - [c37]C. Greg Plaxton, Yu Sun, Mitul Tiwari, Harrick M. Vin:
Reconfigurable resource scheduling. SPAA 2006: 93-102 - 2005
- [c36]Nedialko B. Dimitrov, C. Greg Plaxton:
Optimal Cover Time for a Graph-Based Coupon Collector Process. ICALP 2005: 702-716 - 2004
- [j23]Ramgopal R. Mettu, C. Greg Plaxton:
Optimal Time Bounds for Approximate Clustering. Mach. Learn. 56(1-3): 35-60 (2004) - [c35]Xiaozhou Li, Jayadev Misra, C. Greg Plaxton:
Brief announcement: concurrent maintenance of rings. PODC 2004: 376 - [c34]Xiaozhou Li, C. Greg Plaxton, Mitul Tiwari, Arun Venkataramani:
Online hierarchical cooperative caching. SPAA 2004: 74-83 - [c33]Xiaozhou Li, Jayadev Misra, C. Greg Plaxton:
Active and Concurrent Topology Maintenance. DISC 2004: 320-334 - 2003
- [j22]Ramgopal R. Mettu, C. Greg Plaxton:
The Online Median Problem. SIAM J. Comput. 32(3): 816-832 (2003) - [c32]C. Greg Plaxton:
Approximation algorithms for hierarchical location problems. STOC 2003: 40-49 - 2002
- [c31]Xiaozhou (Steve) Li, C. Greg Plaxton:
On name resolution in peer-to-peer networks. POMC 2002: 82-89 - [c30]Ramgopal R. Mettu, C. Greg Plaxton:
Optimal Time Bounds for Approximate Clustering. UAI 2002: 344-351 - 2001
- [j21]Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman:
Placement Algorithms for Hierarchical Cooperative Caching. J. Algorithms 38(1): 260-302 (2001) - [j20]Nimar S. Arora, Robert D. Blumofe, C. Greg Plaxton:
Thread Scheduling for Multiprogrammed Multiprocessors. Theory Comput. Syst. 34(2): 115-144 (2001) - 2000
- [j19]Pascal Berthomé, Afonso Ferreira, Bruce M. Maggs, Stephane Perennes, C. Greg Plaxton:
Sorting-Based Selection Algorithms for Hypercubic Networks. Algorithmica 26(2): 237-254 (2000) - [j18]Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman:
Analysis of a Local Search Heuristic for Facility Location Problems. J. Algorithms 37(1): 146-188 (2000) - [j17]C. Greg Plaxton, Torsten Suel:
A Superlogarithmic Lower Bound for Shuffle-Unshuffle Sorting Networks. Theory Comput. Syst. 33(3): 233-254 (2000) - [c29]Ramgopal R. Mettu, C. Greg Plaxton:
The Online Median Problem. FOCS 2000: 339-348
1990 – 1999
- 1999
- [j16]C. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa:
Accessing Nearby Copies of Replicated Objects in a Distributed Environment. Theory Comput. Syst. 32(3): 241-280 (1999) - [j15]Bhaskar Ghosh, Frank Thomson Leighton, Bruce M. Maggs, S. Muthukrishnan, C. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa, Robert Endre Tarjan, David Zuckerman:
Tight Analyses of Two Local Load Balancing Algorithms. SIAM J. Comput. 29(1): 29-64 (1999) - [j14]Johannes Gehrke, C. Greg Plaxton, Rajmohan Rajaraman:
Rapid Convergence of a Local Load Balancing Algorithm for Asynchronous Rings. Theor. Comput. Sci. 220(1): 247-265 (1999) - [c28]Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman:
Placement Algorithms for Hierarchical Cooperative Caching. SODA 1999: 586-595 - 1998
- [j13]Philip D. MacKenzie, C. Greg Plaxton, Rajmohan Rajaraman:
On Contention Resolution Protocols and Associated Probabilistic Phenomena. J. ACM 45(2): 324-378 (1998) - [j12]Bruce M. Maggs, C. Greg Plaxton, Stephen J. Smith, Marco Zagha:
Sorting Algorithms. Theory Comput. Syst. 31(2): 135-167 (1998) - [j11]Frank Thomson Leighton, C. Greg Plaxton:
Hypercubic Sorting Networks. SIAM J. Comput. 27(1): 1-47 (1998) - [c27]Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman:
Analysis of a Local Search Heuristic for Facility Location Problems. SODA 1998: 1-10 - [c26]Nimar S. Arora, Robert D. Blumofe, C. Greg Plaxton:
Thread Scheduling for Multiprogrammed Multiprocessors. SPAA 1998: 119-129 - 1997
- [j10]Sanjoy K. Baruah, Johannes Gehrke, C. Greg Plaxton, Ion Stoica, Hussein M. Abdel-Wahab, Kevin Jeffay:
Fair On-Line Scheduling of a Dynamic Set of Tasks on a Single Resource. Inf. Process. Lett. 64(1): 43-51 (1997) - [j9]C. Greg Plaxton, Torsten Suel:
Lower Bounds for Shellsort. J. Algorithms 23(2): 221-240 (1997) - [j8]Frank Thomson Leighton, Yuan Ma, C. Greg Plaxton:
Breaking the Theta (n log² n) Barrier for Sorting with Faults. J. Comput. Syst. Sci. 54(2): 265-304 (1997) - [c25]C. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa:
Accessing Nearby Copies of Replicated Objects in a Distributed Environment. SPAA 1997: 311-320 - [c24]Johannes Gehrke, C. Greg Plaxton, Rajmohan Rajaraman:
Rapid Convergence of a Local Load Balancing Algorithm for Asynchronous Rings. WDAG 1997: 81-95 - 1996
- [j7]Sanjoy K. Baruah, N. K. Cohen, C. Greg Plaxton, Donald A. Varvel:
Proportionate Progress: A Notion of Fairness in Resource Allocation. Algorithmica 15(6): 600-625 (1996) - [j6]Guy E. Blelloch, Charles E. Leiserson, Bruce M. Maggs, C. Greg Plaxton, Stephen J. Smith, Marco Zagha:
A Comparison of Sorting Algorithms for the Connection Machine CM-2. Commun. ACM 39(12es): 273-297 (1996) - [j5]Dina Kravets, C. Greg Plaxton:
All Nearest Smaller Values on the Hypercube. IEEE Trans. Parallel Distributed Syst. 7(5): 456-462 (1996) - [c23]C. Greg Plaxton, Rajmohan Rajaraman:
Fast Fault-Tolerant Concurrent Access to Shared Objects. FOCS 1996: 570-579 - [c22]Ion Stoica, Hussein M. Abdel-Wahab, Kevin Jeffay, Sanjoy K. Baruah, Johannes Gehrke, C. Greg Plaxton:
A proportional share resource allocation algorithm for real-time, time-shared systems. RTSS 1996: 288-299 - 1995
- [c21]C. Greg Plaxton:
Tight Bounds for a Distributed Selection Game with Applications to Fixed-Connection Machines. FOCS 1995: 114-122 - [c20]Sanjoy K. Baruah, Johannes Gehrke, C. Greg Plaxton:
Fast scheduling of periodic tasks on multiple resources. IPPS 1995: 280-288 - [c19]Nabil Kahalé, Frank Thomson Leighton, Yuan Ma, C. Greg Plaxton, Torsten Suel, Endre Szemerédi:
Lower bounds for sorting networks. STOC 1995: 437-446 - [c18]Bhaskar Ghosh, Frank Thomson Leighton, Bruce M. Maggs, S. Muthukrishnan, C. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa, Robert Endre Tarjan, David Zuckerman:
Tight analyses of two local load balancing algorithms. STOC 1995: 548-558 - 1994
- [j4]C. Greg Plaxton, Torsten Suel:
A Lower Bound for Sorting Networks Based on the Shuffle Permutation. Math. Syst. Theory 27(5): 491-508 (1994) - [c17]C. Greg Plaxton, Torsten Suel:
A Super-Logarithmic Lower Bound for Hypercubic Sorting Networks. ICALP 1994: 618-629 - [c16]Alok Aggarwal, C. Greg Plaxton:
Optimal Parallel Sorting in Multi-Level Storage. SODA 1994: 659-668 - [c15]Dina Kravets, C. Greg Plaxton:
An optimal hypercube algorithm for the all nearest smaller values problem. SPDP 1994: 505-512 - [c14]Philip D. MacKenzie, C. Greg Plaxton, Rajmohan Rajaraman:
On contention resolution protocols and associated probabilistic phenomena. STOC 1994: 153-162 - 1993
- [j3]Robert Cypher, C. Greg Plaxton:
Deterministic Sorting in Nearly Logarithmic Time on the Hypercube and Related Computers. J. Comput. Syst. Sci. 47(3): 501-548 (1993) - [j2]Ernst W. Mayr, C. Greg Plaxton:
Pipelined Parallel Prefix Computations, and Sorting on a Pipelined Hypercube. J. Parallel Distributed Comput. 17(4): 374-380 (1993) - [c13]Pascal Berthomé, Afonso Ferreira, Bruce M. Maggs, Stephane Perennes, C. Greg Plaxton:
Sorting-Based Selection Algorithms for Hypercube Networks. IPPS 1993: 89-95 - [c12]Sanjoy K. Baruah, N. K. Cohen, C. Greg Plaxton, Donald A. Varvel:
Proportionate progress: a notion of fairness in resource allocation. STOC 1993: 345-354 - 1992
- [j1]Ernst W. Mayr, C. Greg Plaxton:
On the spanning trees of weighted graphs. Comb. 12(4): 433-447 (1992) - [c11]C. Greg Plaxton, Bjorn Poonen, Torsten Suel:
Improved Lower Bounds for Shellsort. FOCS 1992: 226-235 - [c10]C. Greg Plaxton, Torsten Suel:
A Lower Bound for Sorting Networks Based on the Shuffle Permutation. SPAA 1992: 70-79 - [c9]C. Greg Plaxton:
A Hypercubic Sorting Network with Nearly Logarithmic Depth. STOC 1992: 405-416 - [c8]Michael Klugerman, C. Greg Plaxton:
Small-Depth Counting Networks. STOC 1992: 417-428 - 1991
- [c7]Frank Thomson Leighton, Yuan Ma, C. Greg Plaxton:
Highly Fault-Tolerant Sorting Circuits. FOCS 1991: 458-469 - [c6]Guy E. Blelloch, Charles E. Leiserson, Bruce M. Maggs, C. Greg Plaxton, Stephen J. Smith, Marco Zagha:
A Comparison of Sorting Algorithms for the Connection Machine CM-2. SPAA 1991: 3-16 - 1990
- [c5]Frank Thomson Leighton, C. Greg Plaxton:
A (fairly) Simple Circuit that (usually) Sorts. FOCS 1990: 264-274 - [c4]Robert Cypher, C. Greg Plaxton:
Deterministic Sorting in Nearly Logarithmic Time on the Hypercube and Related Computers. STOC 1990: 193-203
1980 – 1989
- 1989
- [b1]C. Gregory Plaxton:
Efficient computation on sparse interconnection networks. Stanford University, USA, 1989 - [c3]C. Greg Plaxton:
On the Network Complexity of Selection. FOCS 1989: 396-401 - [c2]C. Greg Plaxton:
Load Balancing, Selection Sorting on the Hypercube. SPAA 1989: 64-73 - 1988
- [c1]Ernst W. Mayr, C. Greg Plaxton:
On the Spanning Trees of Weighted Graphs. WG 1988: 394-405
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
