Ruiwen Chen

ScholarGPS® ID: 62721586311236

Affiliation

University of Oxford, Oxford, United Kingdom

Affiliation History

Field

Engineering and Computer Science

Discipline

Computer Science

Top Specialties

Combinatorics

Metrics Summary

Publication Count

Predicted Citations

363

Predicted h-index

Ranking

Publications and Citation History

Publications based on Top Specialties

Types of Publication

Publications
Books
Patents
NIH/NSF

Add Delete
An Average-Case Lower Bound Against $$\mathsf {ACC}^0$$ (book chapter) In LATIN 2018: Theoretical Informatics Chen, Ruiwen \| Oliveira, Igor C. \| Santhanam, Rahul Springer International Publishing (2018) 10.1007/978-3-319-77404-6_24 Cited by (10) \| Cite \| Source
Correlation bounds and #SAT algorithms for small linear-size circuits (journal article) Chen, Ruiwen \| Kabanets, Valentine Theoretical Computer Science, volume 654 (2016). 10.1016/j.tcs.2016.05.005 Cited by (7) \| Cite \| Source \| Open Access
An Improved Deterministic #SAT Algorithm for Small de Morgan Formulas (journal article) Chen, Ruiwen \| Kabanets, Valentine \| Saurabh, Nitin Algorithmica, volume 76, issue 1, pages 68-87 (2016). 10.1007/s00453-015-0020-z Cited by (3) \| Cite \| Source \| Open Access
Average-case lower bounds and satisfiability algorithms for small threshold circuits (conference) Chen, Ruiwen \| Santhanam, Rahul \| Srinivasan, Srikanth Conference on Computational Complexity (2016) 10.4230/LIPIcs.CCC.2016.1 Cited by (7) \| Cite \| Source
Satisfiability on Mixed Instances (conference) Chen, Ruiwen \| Santhanam, Rahul ITCS'16: Innovations in Theoretical Computer Science (2016) Cambridge Massachusetts USA 10.1145/2840728.2840768 Cited by (1) \| Cite \| Source \| Open Access
Mining Circuit Lower Bound Proofs for Meta-Algorithms (journal article) Chen, Ruiwen \| Kabanets, Valentine \| Kolokolova, Antonina \| Shaltiel, Ronen \| Zuckerman, David computational complexity, volume 24, issue 2, pages 333-392 (2015). 10.1007/s00037-015-0100-0 Cited by (36) \| Cite \| Source \| Open Access
Correlation Bounds and #SAT Algorithms for Small Linear-Size Circuits (book chapter) In Computing and Combinatorics Chen, Ruiwen \| Kabanets, Valentine Springer International Publishing (2015) 10.1007/978-3-319-21398-9_17 Cited by (116) \| Cite \| Source \| Open Access
Satisfiability Algorithms and Lower Bounds for Boolean Formulas over Finite Bases (book chapter) In Mathematical Foundations of Computer Science 2015 Chen, Ruiwen Springer Berlin Heidelberg (2015) 10.1007/978-3-662-48054-0_19 Cited by (3) \| Cite \| Source \| Open Access
Improved Algorithms for Sparse MAX-SAT and MAX-k-CSP (book chapter) In Theory and Applications of Satisfiability Testing -- SAT 2015 Chen, Ruiwen \| Santhanam, Rahul Springer International Publishing (2015) 10.1007/978-3-319-24318-4_4 Cited by (18) \| Cite \| Source
Lower Bounds Against Weakly-Uniform Threshold Circuits (journal article) Chen, Ruiwen \| Kabanets, Valentine \| Kinne, Jeff Algorithmica, volume 70, issue 1, pages 47-75 (2014). 10.1007/s00453-013-9823-y Cited by (1) \| Cite \| Source
Mining Circuit Lower Bound Proofs for Meta-algorithms (conference) Chen, Ruiwen \| Kabanets, Valentine \| Kolokolova, Antonina \| Shaltiel, Ronen \| Zuckerman, David 2014 IEEE Conference on Computational Complexity (CCC) (2014) Vancouver, BC, Canada 10.1109/CCC.2014.34 Cited by (19) \| Cite \| Source \| Open Access
An Improved Deterministic #SAT Algorithm for Small De Morgan Formulas (book chapter) In Mathematical Foundations of Computer Science 2014 Chen, Ruiwen \| Kabanets, Valentine \| Saurabh, Nitin Springer Berlin Heidelberg (2014) 10.1007/978-3-662-44465-8_15 Cited by (15) \| Cite \| Source \| Open Access
Managing massive graphs in relational DBMS (conference) Chen, Ruiwen 2013 IEEE International Conference on Big Data (2013) Silicon Valley, CA, USA 10.1109/BigData.2013.6691776 Cited by (2) \| Cite \| Source
Lower Bounds against Weakly Uniform Circuits (book chapter) In Computing and Combinatorics Chen, Ruiwen \| Kabanets, Valentine Springer Berlin Heidelberg (2012) 10.1007/978-3-642-32241-9_35 Cited by (4) \| Cite \| Source