| Width-parameterized SAT: Time-space tradeoffs E Allender, S Chen, T Lou, P Papakonstantinou, B Tang Theory of Computing 10 (12), 297-339, 2014 | 32 | 2014 |
| Minimizing interference for the highway model in wireless ad-hoc and sensor networks H Tan, T Lou, FCM Lau, Y Wang, S Chen SOFSEM 2011: Theory and Practice of Computer Science: 37th Conference on …, 2011 | 15 | 2011 |
| Space-bounded communication complexity JE Brody, S Chen, PA Papakonstantinou, H Song, X Sun Proceedings of the 4th conference on Innovations in Theoretical Computer …, 2013 | 14 | 2013 |
| Depth reduction for composites S Chen, PA Papakonstantinou SIAM Journal on Computing 48 (2), 668-686, 2019 | 13 | 2019 |
| Exponential Lower Bounds for the PPSZ k-SAT Algorithm S Chen, D Scheder, N Talebanfard, B Tang Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete …, 2013 | 12 | 2013 |
| From independent sets and vertex colorings to isotropic spaces and isotropic decompositions: Another bridge between graphs and alternating matrix spaces X Bei, S Chen, J Guan, Y Qiao, X Sun SIAM Journal on Computing 50 (3), 924-971, 2021 | 11* | 2021 |
| Reconstructing numbers from pairwise function values S Chen, Z Huang, S Kannan Algorithms and Computation: 20th International Symposium, ISAAC 2009 …, 2009 | 3 | 2009 |
| Data structure lower bounds on random access to grammar-compressed strings S Chen, E Verbin, W Yu arXiv preprint arXiv:1203.1080, 2012 | 2 | 2012 |
| Correlation lower bounds from correlation upper bounds S Chen, PA Papakonstantinou Information Processing Letters 116 (8), 537-540, 2016 | 1 | 2016 |
| On the power of dominated players in team competitions K Jin, P Tang, S Chen arXiv preprint arXiv:1602.02063, 2016 | 1 | 2016 |
| Circuits with composite moduli S Chen Tsinghua University, 2016 | | 2016 |
| Width-Parameterized SAT E Allender, S Chen, T Lou, P Papakonstantinou, B Tang | | 2011 |
Tiancheng LouGoogleVerified email at google.com
