Follow
Clayton Thomas
Clayton Thomas
Verified email at princeton.edu - Homepage
Title
Cited by
Cited by
Year
Complexins: cytosolic proteins that regulate SNAP receptor function
HT McMahon, M Missler, C Li, TC Südhof
Cell 83 (1), 111-119, 1995
5921995
Strategyproofness-exposing mechanism descriptions
YA Gonczarowski, O Heffetz, C Thomas
National Bureau of Economic Research, 2023
152023
The short-side advantage in random matching markets
L Cai, C Thomas
Symposium on Simplicity in Algorithms (SOSA), 257-267, 2022
122022
Exponential communication separations between notions of selfishness
A Rubinstein, RR Saxena, C Thomas, SM Weinberg, J Zhao
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
102021
Classification of priorities such that deferred acceptance is obviously strategyproof
C Thomas
arXiv preprint arXiv:2011.12367, 2020
92020
Tiered random matching markets: Rank is proportional to popularity
I Ashlagi, M Braverman, A Saberi, C Thomas, G Zhao
arXiv preprint arXiv:2009.05124, 2020
82020
Classification of priorities such that deferred acceptance is osp implementable
C Thomas
Proceedings of the 22nd ACM Conference on Economics and Computation, 860-860, 2021
62021
Implementation in advised strategies: Welfare guarantees from posted-price mechanisms when demand queries are np-hard
L Cai, C Thomas, SM Weinberg
arXiv preprint arXiv:1910.04342, 2019
62019
Representing all stable matchings by walking a maximal chain
L Cai, C Thomas
arXiv preprint arXiv:1910.04401, 2019
42019
Maximally recoverable codes: The bounded case
V Gandikota, E Grigorescu, C Thomas, M Zhu
2017 55th Annual Allerton Conference on Communication, Control, and …, 2017
32017
Self-explanatory strategyproof mechanisms
Y Gonczarowski, O Heffetz, C Thomas
Presentation at Harvard Theory of Computation Seminar on March 23, 2022
12022
Priority-Neutral Matching Lattices Are Not Distributive
C Thomas
arXiv preprint arXiv:2404.02142, 2024
2024
Structural Complexities of Matching Mechanisms
YA Gonczarowski, C Thomas
arXiv preprint arXiv:2212.08709, 2022
2022
On the Complexities of Understanding Matching Mechanisms.
YA Gonczarowski, C Thomas
CoRR, 2022
2022
Expansion in the Johnson Graph
C Thomas, U Girish
2019
New Lower Bound Techniques for the Query Complexity of Truthful Mechanisms
C Thomas, U Girish
2019
Verifying Robustness of Programs Under Structural Perturbations
C Thomas, J Bond
2017
Maximally Recoverable Codes: the Bounded Case
C Thomas, V Gandikota, E Grigorescu, M Zhu
2017
cer of u
C Thomas
You Can’t Handle the Lie: Next-Hop Verification in BGP
C Thomas, G Hirsch
The system can't perform the operation now. Try again later.
Articles 1–20