default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXi Chen 0001
Person information
- affiliation: Columbia University, New York City, NY, USA
- affiliation (former): Princeton University, NJ, USA
- affiliation (former): University of Southern California, Los Angeles, LA, USA
Other persons with the same name
- Xi Chen — disambiguation page
- Xi Chen 0002
![[0000-0003-2254-460X]](https://dblp.org/img/orcid-mark.12x12.png "0000-0003-2254-460X")
— Huazhong University of Science and Technology, School of Automation, Wuhan, China - Xi Chen 0003 — Tencent Inc., Jarvis Research Center, Shenzhen, China (and 1 more)
- Xi Chen 0004 — Harbin Institute of Technology, Department of Information Engineering, China (and 1 more)
- Xi Chen 0005 — Xidian University, National Key Laboratory of Antennas and Microwave Technology, Xi'an, China
- Xi Chen 0006 — Chinese Academy of Sciences, Institute of Atmospheric Physics, Beijing, China
- Xi Chen 0007 — Chinese Academy of Sciences, State Key Laboratory of Desert and Oasis Ecology, Urumqi, China
- Xi Chen 0008 — University of Michigan-Dearborn, Department of Industrial & Manufacturing Systems Engineering, MI, USA (and 1 more)
- Xi Chen 0009 — Samsung AI Center Montreal, QC, Canada (and 1 more)
- Xi Chen 0010 — New York University, Stern School of Business, NY, USA (and 2 more)
- Xi Chen 0011 — Chinese Academy of Sciences, Xinjiang Institute of Geography and Ecology, Urumqi, China
- Xi Chen 0012 — Peking University, Institute of Remote Sensing and GIS, School of Earth and Space Science, Beijing, China (and 1 more)
- Xi Chen 0013 — National University of Defense Technology, College of Science, Changsha, China
- Xi Chen 0014 — Global Energy Interconnection Research Institute North America, Santa Clara, CA, USA (and 3 more)
- Xi Chen 0015 — Imperial College London, UK
- Xi Chen 0016 — University of Maryland, College Park, MD, USA
- Xi Chen 0017 — Aalto University, Helsinki, Finland
- Xi Chen 0018 — Nokia Bell Labs, Murray Hill, NJ, USA (and 1 more)
- Xi Chen 0019 — Nanjing University, School of Business, China
- Xi Chen 0020 — University of Science and Technology of China, Department of Automation, Hefei, China
- Xi Chen 0021 — Nanjing University of Science and Technology, School of Mechanical Engineering, China
- Xi Chen 0022 (aka: Peter Xi Chen) — covariant.ai, Emeryville, CA, USA (and 1 more)
- Xi Chen 0023 — Wuhan University, School of Computer Science, China
- Xi Chen 0024 — SpringSoft Inc., San Jose, CA, USA (and 2 more)
- Xi Chen 0025 — Zhejiang University, School of Management, Hangzhou, China (and 1 more)
- Xi Chen 0026 — Southwest University for Nationalities, Southwest University for Nationalities, Chengdu, China
- Xi Chen 0027 — Broadcom Corporation, Irvine, CA, USA
- Xi Chen 0028 — Beihang University, Fundamental Science on Novel Inertial Instrument and Navigation System Technology Laboratory, Beijing, China
- Xi Chen 0029 — Northeast Petroleum University, College of Chemistry and Chemical Engineering, Daqing, China (and 1 more)
- Xi Chen 0030 — University of Texas at Dallas, Center for Vital Longevity, School of Behavioral and Brain Sciences, TX, USA
- Xi Chen 0031 — Chinese Academy of Sciences, Institute of Automation, Beijing, China
- Xi Chen 0032 — Nanjing University of Aeronautics and Astronautics, School of Civil Aviation, China (and 2 more)
- Xi Chen 0033 — NVIDIA, Inc., Santa Clara, CA, USA (and 1 more)
- Xi Chen 0034 — RWTH Aachen University, Chair of Databases and Information Systems, Germany
- Xi Chen 0035 — Tianjin University, Institute of Surface-Earth System Science, Tianjin, China
- Xi Chen 0036 — Tsinghua University, Department of Automation, Center for Intelligent and Networked System, Beijing, China
- Xi Chen 0037 — Nanjing University, School of Management, Department of E-Commerce, Nanjing, China
- Xi Chen 0038 — Vrije Universiteit Amsterdam, The Netherlands (and 1 more)
- Xi Chen 0039 — Southern University of Science and Technology, Department of Biology, Shenzhen, China (and 3 more)
- Xi Chen 0040 — Virginia Tech, Department of Industrial and Systems Engineering, Blacksburg, VA, USA (and 1 more)
- Xi Chen 0041 — Wuhan University, School of Electronic Information, China
- Xi Chen 0042 — Department of Computer Science, University of Bath, Bath, UK (and 1 more)
- Xi Chen 0043 — National University of Defense Technology, Institute of Meteorology and Oceanography, Nanjing, China
- Xi Chen 0044 — Hebei University of Technology, School of Electronic and Information Engineering, Tianjin, China (and 1 more)
- Xi Chen 0045 — Henan Key Laboratory of Network Cryptography Technology, Zhengzhou, China
- Xi Chen 0046 — Jiangsu University, School of Electrical and Information Engineering, Zhenjiang, China
- Xi Chen 0047 — China Three Gorges University, College of Electrical Engineering and New Energy, Yichang, China
- Xi Chen 0048 — Guizhou Normal University, School of Big Data and Computer Science, Guiyang, China (and 1 more)
- Xi Chen 0049 — LinkedIn Corporation, Sunnyvale, CA, USA (and 1 more)
- Xi Chen 0051 — KTH Royal Institute of Technology, Stockholm, Sweden (and 1 more)
- Xi Chen 0052 — China Earthquake Administration, Institute of Crustal Dynamics, Beijing, China
- Xi Chen 0053 — Cedars-Sinai Medical Center, Department of Imaging and Medicine, Los Angeles, CA, USA
- Xi Chen 0054 — University of Kentucky, Department of Molecular and Cellular Biochemistry, Lexington, KY, USA
- Xi Chen 0055 — Peking University, Advanced Institute of Information Technology, Hangzhou, China
- Xi Chen 0056 — Simons Foundation, Flatiron Institute, Center for Computational Biology, New York, NY, USA (and 1 more)
- Xi Chen 0057 — Huazhong University of Science and Technology, School of Electrical and Electronic Engineering, Wuhan, China
- Xi Chen 0058 — Tsinghua University, National Research Center for Information Science and Technology, Beijing, China
- Xi Chen 0059 — Shanghai University, Department of Physics, China (and 2 more)
- Xi Chen 0060 — Pennsylvania State University, Department of Mechanical Engineering, University Park, PA, USA
- Xi Chen 0061 — National University of Defense Technology, College of Systems Engineering, Changsha, China
- Xi Chen 0062 — Shanghai Jiao Tong University, Department of Micro/Nano Electronics, China
- Xi Chen 0063 — Linklogis, Shenzhen, China (and 1 more)
- Xi Chen 0064 — Tianjin University, School of Electrical and Information Engineering, China
- Xi Chen 0065 — Tianjin University, State Key Laboratory of Precision Measuring Technology and Instruments, China
- Xi Chen 0066 — Southwest Jiaotong University, MoE Key Laboratory of Magnetic Suspension Technology and Maglev Vehicle, Chengdu, China
- Xi Chen 0067 — Fujian Normal University, College of Physics and Energy, Fuzhou, China (and 1 more)
- Xi Chen 0068 — University of Michigan, Electrical Engineering and Computer Science Department, USA
- Xi Chen 0069 — Nanyang Technological University, School of Computer Engineering, Singapore
- Xi Chen 0070 — University College Dublin, UCD, School of Electrical and Electronic Engineering, Ireland
- Xi Chen 0071 — Google DeepMind, Google Research, Mountain View, USA (and 1 more)
- Xi Chen 0072 — Fudan University, Shanghai, China
- Xi Chen 0073 — University of Science and Technology of China, School of Computer Science and Technology, Hefei, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2022
[j25]Xi Chen, Ilias Diakonikolas, Anthi Orfanou, Dimitris Paparas, Xiaorui Sun, Mihalis Yannakakis:
On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms for a Unit-Demand Buyer. SIAM J. Comput. 51(3): 492-548 (2022)- [j24]Xi Chen, Tim Randolph, Rocco A. Servedio, Timothy Sun:
A Lower Bound on Cycle-Finding in Sparse Digraphs. ACM Trans. Algorithms 18(4): 31:1-31:23 (2022) - 2019
- [j23]Jin-Yi Cai, Xi Chen:
A decidable dichotomy theorem on directed graph homomorphisms with non-negative weights. Comput. Complex. 28(3): 345-408 (2019) - [j22]Zhengyang Liu, Xi Chen, Rocco A. Servedio, Ying Sheng, Jinyu Xie:
Distribution-free Junta Testing. ACM Trans. Algorithms 15(1): 1:1-1:23 (2019) - 2018
- [j21]Xi Chen, Ilias Diakonikolas, Dimitris Paparas, Xiaorui Sun, Mihalis Yannakakis:
The complexity of optimal multidimensional pricing for a unit-demand buyer. Games Econ. Behav. 110: 139-164 (2018) - [j20]Xi Chen, Rocco A. Servedio, Li-Yang Tan, Erik Waingarten, Jinyu Xie:
Settling the Query Complexity of Non-adaptive Junta Testing. J. ACM 65(6): 40:1-40:18 (2018) - 2017
- [j19]Jin-Yi Cai, Xi Chen:
Complexity of Counting CSP with Complex Weights. J. ACM 64(3): 19:1-19:39 (2017) - [j18]Xi Chen, Dimitris Paparas, Mihalis Yannakakis:
The Complexity of Non-Monotone Markets. J. ACM 64(3): 20:1-20:56 (2017) - 2016
- [j17]Jin-Yi Cai, Xi Chen, Pinyan Lu:
Nonnegative Weighted #CSP: An Effective Complexity Dichotomy. SIAM J. Comput. 45(6): 2177-2198 (2016) - 2015
- [j16]Xi Chen, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Pinyan Lu, Colin McQuillan, David Richerby:
The complexity of approximating conservative counting CSPs. J. Comput. Syst. Sci. 81(1): 311-329 (2015) - 2013
- [j15]Jin-Yi Cai, Xi Chen, Pinyan Lu:
Graph Homomorphisms with Complex Values: A Dichotomy Theorem. SIAM J. Comput. 42(3): 924-1029 (2013) - [j14]Boaz Barak, Mark Braverman, Xi Chen, Anup Rao:
How to Compress Interactive Communication. SIAM J. Comput. 42(3): 1327-1363 (2013) - 2011
- [j13]Xi Chen, Xiaotie Deng, Becky Jie Liu:
On Incentive Compatible Competitive Selection Protocols. Algorithmica 61(2): 447-462 (2011) - [j12]Xi Chen, Neeraj Kayal, Avi Wigderson:
Partial Derivatives in Arithmetic Complexity and Beyond. Found. Trends Theor. Comput. Sci. 6(1-2): 1-138 (2011) - [j11]Xi Chen:
Guest column: complexity dichotomies of counting problems. SIGACT News 42(4): 54-76 (2011) - 2010
- [j10]Xi Chen, Xiaoming Sun, Shang-Hua Teng:
Quantum Separation of Local Search and Fixed Point Computation. Algorithmica 56(3): 364-382 (2010) - [j9]Jin-yi Cai, Xi Chen, Dong Li:
Quadratic Lower Bound for Permanent Vs. Determinant in any Characteristic. Comput. Complex. 19(1): 37-56 (2010) - 2009
- [j8]Xi Chen, Xiaotie Deng:
A Simplicial Approach for Discrete Fixed Point Theorems. Algorithmica 53(2): 250-262 (2009) - [j7]Xi Chen, Xiaotie Deng, Shang-Hua Teng:
Settling the complexity of computing two-player Nash equilibria. J. ACM 56(3): 14:1-14:57 (2009) - [j6]Xi Chen, Li-Sha Huang, Shang-Hua Teng:
Market equilibria with hybrid linear-Leontief utilities. Theor. Comput. Sci. 410(17): 1573-1580 (2009) - [j5]Xi Chen, Xiaotie Deng:
On the complexity of 2D discrete fixed point problem. Theor. Comput. Sci. 410(44): 4448-4456 (2009) - 2008
- [j4]Xi Chen, Xiaotie Deng:
Matching algorithmic bounds for finding a Brouwer fixed point. J. ACM 55(3): 13:1-13:26 (2008) - 2007
- [j3]Xi Chen, Xiaotie Deng:
Recent development in computational complexity characterization of Nash equilibrium. Comput. Sci. Rev. 1(2): 88-99 (2007) - [j2]Yongxi Cheng, Xi Chen, Yiqun Lisa Yin:
On searching a table consistent with division poset. Theor. Comput. Sci. 370(1-3): 240-253 (2007) - [j1]Lan Liu, Xi Chen, Jing Xiao, Tao Jiang:
Complexity and approximation of the minimum recombinant haplotype configuration problem. Theor. Comput. Sci. 378(3): 316-330 (2007)
Conference and Workshop Papers
- 2024
- [c81]Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio:
Trace Reconstruction from Local Statistical Queries. APPROX/RANDOM 2024: 52:1-52:24 - [c80]Xi Chen, Anindya De, Yuhao Li, Shivam Nadimpalli, Rocco A. Servedio:
Testing Intersecting and Union-Closed Families. ITCS 2024: 33:1-33:23 - [c79]Xi Chen, Anindya De, Yuhao Li, Shivam Nadimpalli, Rocco A. Servedio:
Mildly Exponential Lower Bounds on Tolerant Testers for Monotonicity, Unateness, and Juntas. SODA 2024: 4321-4337 - [c78]Xi Chen, Cassandra Marcussen:
Uniformity Testing over Hypergrids with Subcube Conditioning. SODA 2024: 4338-4370 - [c77]Xi Chen, Chenghao Guo, Emmanouil V. Vlatakis-Gkaragkounis, Mihalis Yannakakis:
Smoothed Complexity of SWAP in Local Graph Partitioning. SODA 2024: 5057-5083 - [c76]Xi Chen, Yumou Fei, Shyamal Patel:
Distribution-Free Testing of Decision Lists with a Sublinear Number of Queries. STOC 2024: 1051-1062 - [c75]Xi Chen, Yuhao Li, Mihalis Yannakakis:
Computing a Fixed Point of Contraction Maps in Polynomial Queries. STOC 2024: 1364-1373 - 2023
- [c74]Xi Chen, Yaonan Jin, Tim Randolph, Rocco A. Servedio:
Subset Sum in Time 2n/2 / poly(n). APPROX/RANDOM 2023: 39:1-39:18 - [c73]Xi Chen, Yuhao Li, Mihalis Yannakakis:
Reducing Tarski to Unique Tarski (In the Black-Box Model). CCC 2023: 21:1-21:23 - [c72]Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio, Sandip Sinha:
Approximate Trace Reconstruction from a Single Trace. SODA 2023: 605-637 - [c71]Xi Chen, Vincent Cohen-Addad, Rajesh Jayaram, Amit Levi, Erik Waingarten:
Streaming Euclidean MST to a Constant Factor. STOC 2023: 156-169 - [c70]Xi Chen, Binghui Peng:
Complexity of Equilibria in First-Price Auctions under General Tie-Breaking Rules. STOC 2023: 698-709 - 2022
- [c69]Xi Chen, Christos H. Papadimitriou, Binghui Peng:
Memory Bounds for Continual Learning. FOCS 2022: 519-530 - [c68]Xi Chen, Yuhao Li:
Improved Upper Bounds for Finding Tarski Fixed Points. EC 2022: 1108-1118 - [c67]Xi Chen, Yaonan Jin, Tim Randolph, Rocco A. Servedio:
Average-Case Subset Balancing Problems. SODA 2022: 743-778 - [c66]Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio, Sandip Sinha:
Near-Optimal Average-Case Approximate Trace Reconstruction from Few Traces. SODA 2022: 779-821 - [c65]Thomas Chen, Xi Chen, Binghui Peng, Mihalis Yannakakis:
Computational Hardness of the Hylland-Zeckhauser Scheme. SODA 2022: 2253-2268 - [c64]Xi Chen, Rajesh Jayaram, Amit Levi, Erik Waingarten:
New streaming algorithms for high dimensional EMD and MST. STOC 2022: 222-233 - [c63]Xi Chen, Binghui Peng:
On the complexity of dynamic submodular maximization. STOC 2022: 1685-1698 - 2021
- [c62]Xi Chen, Rajesh Jayaram, Amit Levi, Erik Waingarten:
Learning and testing junta distributions with sub cube conditioning. COLT 2021: 1060-1113 - [c61]Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio, Sandip Sinha:
Polynomial-Time Trace Reconstruction in the Low Deletion Rate Regime. ITCS 2021: 20:1-20:20 - [c60]Xi Chen, Christian Kroer, Rachitesh Kumar:
The Complexity of Pacing for Second-Price Auctions. EC 2021: 318 - [c59]Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio, Sandip Sinha:
Polynomial-time trace reconstruction in the smoothed complexity model. SODA 2021: 54-73 - [c58]Clément L. Canonne, Xi Chen, Gautam Kamath, Amit Levi, Erik Waingarten:
Random Restrictions of High Dimensional Distributions and Uniformity Testing with Subcube Conditioning. SODA 2021: 321-336 - [c57]Xi Chen, Christian Kroer, Rachitesh Kumar:
Throttling Equilibria in Auction Markets. WINE 2021: 551 - 2020
- [c56]Xi Chen, Binghui Peng:
Hedging in games: Faster convergence of external and swap regrets. NeurIPS 2020 - [c55]Xi Chen, Amit Levi, Erik Waingarten:
Nearly optimal edge estimation with independent set queries. SODA 2020: 2916-2935 - [c54]Xi Chen, Tim Randolph, Rocco A. Servedio, Timothy Sun:
A Lower Bound on Cycle-Finding in Sparse Digraphs. SODA 2020: 2936-2952 - [c53]Xi Chen, Chenghao Guo, Emmanouil V. Vlatakis-Gkaragkounis, Mihalis Yannakakis, Xinzhi Zhang:
Smoothed complexity of local max-cut and binary max-CSP. STOC 2020: 1052-1065 - 2019
- [c52]Xi Chen, Christos H. Papadimitriou, Tim Roughgarden:
An Axiomatic Approach to Block Rewards. AFT 2019: 124-131 - [c51]Frank Ban, Xi Chen, Rocco A. Servedio, Sandip Sinha:
Efficient Average-Case Population Recovery in the Presence of Insertions and Deletions. APPROX-RANDOM 2019: 44:1-44:18 - [c50]Frank Ban, Xi Chen, Adam Freilich, Rocco A. Servedio, Sandip Sinha:
Beyond Trace Reconstruction: Population Recovery from the Deletion Channel. FOCS 2019: 745-768 - [c49]Wei Yang, Luchen Tan, Chunwei Lu, Anqi Cui, Han Li, Xi Chen, Kun Xiong, Muzi Wang, Ming Li, Jian Pei, Jimmy Lin:
Detecting Customer Complaint Escalation with Recurrent Neural Networks and Manually-Engineered Features. NAACL-HLT (2) 2019: 56-63 - [c48]Xi Chen, Erik Waingarten:
Testing unateness nearly optimally. STOC 2019: 547-558 - 2018
- [c47]Xi Chen, George Matikas, Dimitris Paparas, Mihalis Yannakakis:
On the Complexity of Simple and Optimal Deterministic Mechanisms for an Additive Buyer. SODA 2018: 2036-2049 - [c46]Zhengyang Liu, Xi Chen, Rocco A. Servedio, Ying Sheng, Jinyu Xie:
Distribution-free junta testing. STOC 2018: 749-759 - 2017
- [c45]Xi Chen, Adam Freilich, Rocco A. Servedio, Timothy Sun:
Sample-Based High-Dimensional Convexity Testing. APPROX-RANDOM 2017: 37:1-37:20 - [c44]Xi Chen, Rocco A. Servedio, Li-Yang Tan, Erik Waingarten:
Adaptivity Is Exponentially Powerful for Testing Monotonicity of Halfspaces. APPROX-RANDOM 2017: 38:1-38:21 - [c43]Xi Chen, Rocco A. Servedio, Li-Yang Tan, Erik Waingarten, Jinyu Xie:
Settling the Query Complexity of Non-Adaptive Junta Testing. CCC 2017: 26:1-26:19 - [c42]Xi Chen, Erik Waingarten, Jinyu Xie:
Boolean Unateness Testing with Õ(n3/4) Adaptive Queries. FOCS 2017: 868-879 - [c41]Xi Chen, Yu Cheng, Bo Tang:
Well-Supported vs. Approximate Nash Equilibria: Query Complexity of Large Games. ITCS 2017: 57:1-57:9 - [c40]Xi Chen, Erik Waingarten, Jinyu Xie:
Beyond Talagrand functions: new lower bounds for testing monotonicity and unateness. STOC 2017: 523-536 - [c39]Xi Chen, Igor C. Oliveira, Rocco A. Servedio:
Addition is exponentially harder than counting for shallow monotone circuits. STOC 2017: 1232-1245 - 2016
- [c38]Xi Chen, Yu Cheng, Bo Tang:
On the Recursive Teaching Dimension of VC Classes. NIPS 2016: 2164-2171 - [c37]Xi Chen, Jinyu Xie:
Tight Bounds for the Distribution-Free Testing of Monotone Conjunctions. SODA 2016: 54-71 - [c36]Xi Chen, Igor C. Oliveira, Rocco A. Servedio, Li-Yang Tan:
Near-optimal small-depth lower bounds for small distance connectivity. STOC 2016: 612-625 - 2015
- [c35]Xi Chen, Ilias Diakonikolas, Anthi Orfanou, Dimitris Paparas, Xiaorui Sun, Mihalis Yannakakis:
On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms. FOCS 2015: 1464-1479 - [c34]Xi Chen, David Durfee, Anthi Orfanou:
On the Complexity of Nash Equilibria in Anonymous Games. STOC 2015: 381-390 - [c33]Xi Chen, Anindya De, Rocco A. Servedio, Li-Yang Tan:
Boolean Function Monotonicity Testing Requires (Almost) n1/2 Non-adaptive Queries. STOC 2015: 519-528 - 2014
- [c32]Xi Chen, Rocco A. Servedio, Li-Yang Tan:
New Algorithms and Lower Bounds for Monotonicity Testing. FOCS 2014: 286-295 - [c31]Xi Chen, Ilias Diakonikolas, Dimitris Paparas, Xiaorui Sun, Mihalis Yannakakis:
The Complexity of Optimal Multidimensional Pricing. SODA 2014: 1319-1328 - 2013
- [c30]László Babai, Xi Chen, Xiaorui Sun, Shang-Hua Teng, John Wilmes:
Faster Canonical Forms for Strongly Regular Graphs. FOCS 2013: 157-166 - [c29]Xi Chen, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Pinyan Lu, Colin McQuillan, David Richerby:
The complexity of approximating conservative counting CSPs. STACS 2013: 148-159 - [c28]Xi Chen, Dimitris Paparas, Mihalis Yannakakis:
The complexity of non-monotone markets. STOC 2013: 181-190 - [c27]Xi Chen, Xiaorui Sun, Shang-Hua Teng:
Multi-stage design for quasipolynomial-time isomorphism testing of steiner 2-systems. STOC 2013: 271-280 - 2012
- [c26]Jin-Yi Cai, Xi Chen, Heng Guo, Pinyan Lu:
Inapproximability after Uniqueness Phase Transition in Two-Spin Systems. COCOA 2012: 336-347 - [c25]Jin-Yi Cai, Xi Chen:
Complexity of counting CSP with complex weights. STOC 2012: 909-920 - 2011
- [c24]Jin-yi Cai, Xi Chen, Pinyan Lu:
Non-negatively Weighted #CSP: An Effective Complexity Dichotomy. CCC 2011: 45-54 - [c23]Xi Chen, Shang-Hua Teng:
A Complexity View of Markets with Social Influence. ICS 2011: 141-154 - 2010
- [c22]Xi Chen, Decheng Dai, Ye Du, Shang-Hua Teng:
On the complexity of equilibria in markets with additively separable utilities. BQGT 2010: 61:1 - [c21]Jin-yi Cai, Xi Chen, Richard J. Lipton, Pinyan Lu:
On Tractable Exponential Sums. FAW 2010: 148-159 - [c20]Jin-yi Cai, Xi Chen:
A Decidable Dichotomy Theorem on Directed Graph Homomorphisms with Non-negative Weights. FOCS 2010: 437-446 - [c19]Jin-yi Cai, Xi Chen, Pinyan Lu:
Graph Homomorphisms with Complex Values: A Dichotomy Theorem. ICALP (1) 2010: 275-286 - [c18]Boaz Barak, Mark Braverman, Xi Chen, Anup Rao:
How to compress interactive communication. STOC 2010: 67-76 - 2009
- [c17]Xi Chen, Decheng Dai, Ye Du, Shang-Hua Teng:
Settling the Complexity of Arrow-Debreu Equilibria in Markets with Additively Separable Utilities. FOCS 2009: 273-282 - [c16]Xi Chen, Shang-Hua Teng:
Spending Is Not Easier Than Trading: On the Computational Equivalence of Fisher and Arrow-Debreu Equilibria. ISAAC 2009: 647-656 - 2008
- [c15]Xi Chen, Xiaoming Sun, Shang-Hua Teng:
Quantum Separation of Local Search and Fixed Point Computation. COCOON 2008: 170-179 - [c14]Jin-yi Cai, Xi Chen, Dong Li:
A quadratic lower bound for the permanent and determinant problem over any characteristic != 2. STOC 2008: 491-498 - 2007
- [c13]Jing Zhang, Xi Chen, Ming Li:
Computing Exact p-Value for Structured Motif. CPM 2007: 162-172 - [c12]Xi Chen, Shang-Hua Teng:
Paths Beyond Local Search: A Tight Bound for Randomized Fixed-Point Computation. FOCS 2007: 124-134 - [c11]Xi Chen, Shang-Hua Teng, Paul Valiant:
The approximation complexity of win-lose games. SODA 2007: 159-168 - 2006
- [c10]Xi Chen, Xiaotie Deng:
Lattice Embedding of Direction-Preserving Correspondence over Integrally Convex Set. AAIM 2006: 53-63 - [c9]Xi Chen, Xiaotie Deng:
A Simplicial Approach for Discrete Fixed Point Theorems. COCOON 2006: 3-12 - [c8]Xi Chen, Xiaotie Deng, Becky Jie Liu:
On Incentive Compatible Competitive Selection Protocol. COCOON 2006: 13-22 - [c7]Xi Chen, Xiaotie Deng:
Settling the Complexity of Two-Player Nash Equilibrium. FOCS 2006: 261-272 - [c6]Xi Chen, Xiaotie Deng, Shang-Hua Teng:
Computing Nash Equilibria: Approximation and Smoothed Complexity. FOCS 2006: 603-612 - [c5]Xi Chen, Xiaotie Deng:
On the Complexity of 2D Discrete Fixed Point Problem. ICALP (1) 2006: 489-500 - [c4]Xi Chen, Xiaotie Deng, Shang-Hua Teng:
Sparse Games Are Hard. WINE 2006: 262-273 - [c3]Xi Chen, Li-Sha Huang, Shang-Hua Teng:
Market Equilibria with Hybrid Linear-Leontief Utilities. WINE 2006: 274-285 - 2005
- [c2]Lan Liu, Xi Chen, Jing Xiao, Tao Jiang:
Complexity and Approximation of the Minimum Recombination Haplotype Configuration Problem. ISAAC 2005: 370-379 - [c1]Xi Chen, Xiaotie Deng:
On algorithms for discrete and approximate brouwer fixed points. STOC 2005: 323-330
Reference Works
- 2016
- [r5]Jin-Yi Cai, Xi Chen, Pinyan Lu:
Complexity Dichotomies for Counting Graph Homomorphisms. Encyclopedia of Algorithms 2016: 366-369 - [r4]Xi Chen, Xiaotie Deng:
Non-approximability of Bimatrix Nash Equilibria. Encyclopedia of Algorithms 2016: 1412-1414 - 2008
- [r3]Xi Chen, Xiaotie Deng:
Complexity of Bimatrix Nash Equilibria. Encyclopedia of Algorithms 2008 - [r2]Xi Chen, Xiaotie Deng:
Incentive Compatible Selection. Encyclopedia of Algorithms 2008 - [r1]Xi Chen, Xiaotie Deng:
Non-approximability of Bimatrix Nash Equilibria. Encyclopedia of Algorithms 2008
Informal and Other Publications
- 2024
- [i74]Xi Chen, Shivam Nadimpalli, Tim Randolph, Rocco A. Servedio, Or Zamir:
Testing Sumsets is Hard. CoRR abs/2401.07242 (2024) - [i73]Xi Chen, Yuhao Li, Mihalis Yannakakis:
Computing a Fixed Point of Contraction Maps in Polynomial Queries. CoRR abs/2403.19911 (2024) - [i72]Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio:
Trace reconstruction from local statistical queries. CoRR abs/2407.11177 (2024) - [i71]Xi Chen, Yuhao Li, Mihalis Yannakakis:
Computing a Fixed Point of Contraction Maps in Polynomial Queries. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [i70]Xi Chen, Yaonan Jin, Tim Randolph, Rocco A. Servedio:
Subset Sum in Time 2n/2/poly(n). CoRR abs/2301.07134 (2023) - [i69]Xi Chen, Binghui Peng:
Complexity of Equilibria in First-Price Auctions under General Tie-Breaking Rules. CoRR abs/2303.16388 (2023) - [i68]Xi Chen, Chenghao Guo, Emmanouil V. Vlatakis-Gkaragkounis, Mihalis Yannakakis:
Smoothed Complexity of SWAP in Local Graph Partitioning. CoRR abs/2305.15804 (2023) - [i67]Xi Chen, Binghui Peng:
Memory-Query Tradeoffs for Randomized Convex Optimization. CoRR abs/2306.12534 (2023) - [i66]Xi Chen, Anindya De, Yuhao Li, Shivam Nadimpalli, Rocco A. Servedio:
Mildly Exponential Lower Bounds on Tolerant Testers for Monotonicity, Unateness, and Juntas. CoRR abs/2309.12513 (2023) - [i65]Xi Chen, Anindya De, Yuhao Li, Shivam Nadimpalli, Rocco A. Servedio:
Testing Intersecting and Union-Closed Families. CoRR abs/2311.11119 (2023) - [i64]Xi Chen, Yuhao Li, Mihalis Yannakakis:
Reducing Tarski to Unique Tarski (in the Black-box Model). Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [i63]Xi Chen, Yuhao Li:
Improved Upper Bounds for Finding Tarski Fixed Points. CoRR abs/2202.05913 (2022) - [i62]Xi Chen, Christos H. Papadimitriou, Binghui Peng:
Memory Bounds for Continual Learning. CoRR abs/2204.10830 (2022) - [i61]Jingfan Yu, Mengqian Zhang, Xi Chen, Zhixuan Fang:
SoK: Play-to-Earn Projects. CoRR abs/2211.01000 (2022) - [i60]Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio, Sandip Sinha:
Approximate Trace Reconstruction from a Single Trace. CoRR abs/2211.03292 (2022) - [i59]Vincent Cohen-Addad, Xi Chen, Rajesh Jayaram, Amit Levi, Erik Waingarten:
Streaming Euclidean MST to a Constant Factor. CoRR abs/2212.06546 (2022) - 2021
- [i58]Xi Chen, Christian Kroer, Rachitesh Kumar:
The Complexity of Pacing for Second-Price Auctions. CoRR abs/2103.13969 (2021) - [i57]Thomas Chen, Xi Chen, Binghui Peng, Mihalis Yannakakis:
Computational Hardness of the Hylland-Zeckhauser Scheme. CoRR abs/2107.05746 (2021) - [i56]Xi Chen, Christian Kroer, Rachitesh Kumar:
Throttling Equilibria in Auction Markets. CoRR abs/2107.10923 (2021) - [i55]Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio, Sandip Sinha:
Near-Optimal Average-Case Approximate Trace Reconstruction from Few Traces. CoRR abs/2107.11530 (2021) - [i54]Xi Chen, Yaonan Jin, Tim Randolph, Rocco A. Servedio:
Average-Case Subset Balancing Problems. CoRR abs/2110.14607 (2021) - [i53]Xi Chen, Binghui Peng:
On the Complexity of Dynamic Submodular Maximization. CoRR abs/2111.03198 (2021) - [i52]Xi Chen, Rajesh Jayaram, Amit Levi, Erik Waingarten:
New Streaming Algorithms for High Dimensional EMD and MST. CoRR abs/2111.03528 (2021) - 2020
- [i51]Xi Chen, Rajesh Jayaram, Amit Levi, Erik Waingarten:
Learning and Testing Junta Distributions with Subcube Conditioning. CoRR abs/2004.12496 (2020) - [i50]Xi Chen, Binghui Peng:
Hedging in games: Faster convergence of external and swap regrets. CoRR abs/2006.04953 (2020) - [i49]Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio, Sandip Sinha:
Polynomial-time trace reconstruction in the smoothed complexity model. CoRR abs/2008.12386 (2020) - [i48]Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio, Sandip Sinha:
Polynomial-time trace reconstruction in the low deletion rate regime. CoRR abs/2012.02844 (2020) - 2019
- [i47]Xi Chen, Erik Waingarten:
Testing Unateness Nearly Optimally. CoRR abs/1904.05309 (2019) - [i46]Frank Ban, Xi Chen, Adam Freilich, Rocco A. Servedio, Sandip Sinha:
Beyond trace reconstruction: Population recovery from the deletion channel. CoRR abs/1904.05532 (2019) - [i45]Xi Chen, Amit Levi, Erik Waingarten:
Nearly optimal edge estimation with independent set queries. CoRR abs/1907.04381 (2019) - [i44]Frank Ban, Xi Chen, Rocco A. Servedio, Sandip Sinha:
Efficient average-case population recovery in the presence of insertions and deletions. CoRR abs/1907.05964 (2019) - [i43]Xi Chen, Tim Randolph, Rocco A. Servedio, Timothy Sun:
A Lower Bound on Cycle-Finding in Sparse Digraphs. CoRR abs/1907.12106 (2019) - [i42]Xi Chen, Christos H. Papadimitriou, Tim Roughgarden:
An Axiomatic Approach to Block Rewards. CoRR abs/1909.10645 (2019) - [i41]Clément L. Canonne, Xi Chen, Gautam Kamath, Amit Levi, Erik Waingarten:
Random Restrictions of High-Dimensional Distributions and Uniformity Testing with Subcube Conditioning. CoRR abs/1911.07357 (2019) - [i40]Xi Chen, Chenghao Guo, Emmanouil V. Vlatakis-Gkaragkounis, Mihalis Yannakakis, Xinzhi Zhang:
Smoothed complexity of local Max-Cut and binary Max-CSP. CoRR abs/1911.10381 (2019) - [i39]Clément L. Canonne, Xi Chen, Gautam Kamath, Amit Levi, Erik Waingarten:
Random Restrictions of High-Dimensional Distributions and Uniformity Testing with Subcube Conditioning. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [i38]Xi Chen, Zhengyang Liu, Rocco A. Servedio, Ying Sheng, Jinyu Xie:
Distribution-free Junta Testing. CoRR abs/1802.04859 (2018) - 2017
- [i37]Xi Chen, Erik Waingarten, Jinyu Xie:
Beyond Talagrand Functions: New Lower Bounds for Testing Monotonicity and Unateness. CoRR abs/1702.06997 (2017) - [i36]Xi Chen, George Matikas, Dimitris Paparas, Mihalis Yannakakis:
On the Complexity of Bundle-Pricing and Simple Mechanisms. CoRR abs/1702.07032 (2017) - [i35]Xi Chen, Rocco A. Servedio, Li-Yang Tan, Erik Waingarten, Jinyu Xie:
Settling the query complexity of non-adaptive junta testing. CoRR abs/1704.06314 (2017) - [i34]Xi Chen, Rocco A. Servedio, Li-Yang Tan, Erik Waingarten:
Adaptivity is exponentially powerful for testing monotonicity of halfspaces. CoRR abs/1706.05556 (2017) - [i33]Xi Chen, Adam Freilich, Rocco A. Servedio, Timothy Sun:
Sample-based high-dimensional convexity testing. CoRR abs/1706.09362 (2017) - [i32]Xi Chen, Erik Waingarten, Jinyu Xie:
Boolean Unateness Testing with Õ(n3/4) Adaptive Queries. CoRR abs/1708.05786 (2017) - [i31]Xi Chen, Rocco A. Servedio, Li-Yang Tan, Erik Waingarten, Jinyu Xie:
Settling the query complexity of non-adaptive junta testing. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [i30]Xi Chen, Yu Cheng, Bo Tang:
A Note on Teaching for VC Classes. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [i29]Xi Chen, Igor C. Oliveira, Rocco A. Servedio:
Addition is exponentially harder than counting for shallow monotone circuits. CoRR abs/1508.03061 (2015) - [i28]Xi Chen, Igor C. Oliveira, Rocco A. Servedio, Li-Yang Tan:
Near-optimal small-depth lower bounds for small distance connectivity. CoRR abs/1509.07476 (2015) - [i27]Xi Chen, Yu Cheng, Bo Tang:
Well-Supported versus Approximate Nash Equilibria: Query Complexity of Large Games. CoRR abs/1511.00785 (2015) - [i26]Xi Chen, Jinyu Xie:
Tight Bounds for the Distribution-Free Testing of Monotone Conjunctions. CoRR abs/1511.03333 (2015) - [i25]Xi Chen, Igor Carboni Oliveira, Rocco A. Servedio:
Addition is exponentially harder than counting for shallow monotone circuits. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [i24]Xi Chen, Rocco A. Servedio, Li-Yang Tan:
New algorithms and lower bounds for monotonicity testing. CoRR abs/1412.5655 (2014) - [i23]Xi Chen, Anindya De, Rocco A. Servedio, Li-Yang Tan:
Boolean function monotonicity testing requires (almost) n1/2 non-adaptive queries. CoRR abs/1412.5657 (2014) - [i22]Xi Chen, David Durfee, Anthi Orfanou:
On the Complexity of Nash Equilibria in Anonymous Games. CoRR abs/1412.5681 (2014) - 2013
- [i21]Xi Chen, Ilias Diakonikolas, Dimitris Paparas, Xiaorui Sun, Mihalis Yannakakis:
The Complexity of Optimal Multidimensional Pricing. CoRR abs/1311.2138 (2013) - 2012
- [i20]Jin-Yi Cai, Xi Chen, Heng Guo, Pinyan Lu:
Inapproximability After Uniqueness Phase Transition in Two-Spin Systems. CoRR abs/1205.2934 (2012) - [i19]Xi Chen, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Pinyan Lu, Colin McQuillan, David Richerby:
The complexity of approximating conservative counting CSPs. CoRR abs/1208.1783 (2012) - [i18]Xi Chen, Dimitris Paparas, Mihalis Yannakakis:
The Complexity of Non-Monotone Markets. CoRR abs/1211.4918 (2012) - 2011
- [i17]Jin-yi Cai, Xi Chen:
Complexity of Counting CSP with Complex Weights. CoRR abs/1111.2384 (2011) - 2010
- [i16]Jin-yi Cai, Xi Chen, Richard J. Lipton, Pinyan Lu:
On Tractable Exponential Sums. CoRR abs/1005.2632 (2010) - [i15]Jin-yi Cai, Xi Chen:
A Decidable Dichotomy Theorem on Directed Graph Homomorphisms with Non-negative Weights. CoRR abs/1008.0915 (2010) - [i14]Xi Chen, Shang-Hua Teng:
A Complexity View of Markets with Social Influence. CoRR abs/1009.0309 (2010) - [i13]Jin-yi Cai, Xi Chen, Pinyan Lu:
Non-negative Weighted #CSPs: An Effective Complexity Dichotomy. CoRR abs/1012.5659 (2010) - 2009
- [i12]Jin-yi Cai, Xi Chen, Pinyan Lu:
Graph Homomorphisms with Complex Values: A Dichotomy Theorem. CoRR abs/0903.4728 (2009) - [i11]Xi Chen, Decheng Dai, Ye Du, Shang-Hua Teng:
Settling the Complexity of Arrow-Debreu Equilibria in Markets with Additively Separable Utilities. CoRR abs/0904.0644 (2009) - [i10]Xi Chen, Shang-Hua Teng:
Spending is not Easier than Trading: On the Computational Equivalence of Fisher and Arrow-Debreu Equilibria. CoRR abs/0907.4130 (2009) - [i9]Boaz Barak, Mark Braverman, Xi Chen, Anup Rao:
Direct Sums in Randomized Communication Complexity. Electron. Colloquium Comput. Complex. TR09 (2009) - 2007
- [i8]Xi Chen, Xiaotie Deng, Shang-Hua Teng:
Settling the Complexity of Computing Two-Player Nash Equilibria. CoRR abs/0704.1678 (2007) - [i7]Xi Chen, Shang-Hua Teng:
Paths Beyond Local Search: A Nearly Tight Bound for Randomized Fixed-Point Computation. CoRR abs/cs/0702088 (2007) - 2006
- [i6]Xi Chen, Xiaotie Deng, Shang-Hua Teng:
Computing Nash Equilibria: Approximation and Smoothed Complexity. CoRR abs/cs/0602043 (2006) - [i5]Xi Chen, Xiaotie Deng:
On the Complexity of 2D Discrete Fixed Point Problem. Electron. Colloquium Comput. Complex. TR06 (2006) - [i4]Xi Chen, Xiaotie Deng, Shang-Hua Teng:
Computing Nash Equilibria: Approximation and Smoothed Complexity. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [i3]Yongxi Cheng, Xi Chen, Yiqun Lisa Yin:
On Searching a Table Consistent with Division Poset. CoRR abs/cs/0505075 (2005) - [i2]Xi Chen, Xiaotie Deng:
3-NASH is PPAD-Complete. Electron. Colloquium Comput. Complex. TR05 (2005) - [i1]Xi Chen, Xiaotie Deng:
Settling the Complexity of 2-Player Nash-Equilibrium. Electron. Colloquium Comput. Complex. TR05 (2005)
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-09-19 23:45 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:
