default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRuiwen Chen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j7]Xiaocheng Hu, Heng Zhu, Ruiwen Chen, Sideng Hu, Zheng Jia, Honghui Yu, Shaoxing Qu
:
Design of 3D Magnetic Tactile Sensors with High Sensing Accuracy Guided by the Theoretical Model. Adv. Intell. Syst. 5(5) (2023)- [j6]Chirag Parsania, Ruiwen Chen, Pooja Sethiya, Zhengqiang Miao, Liguo Dong, Koon Ho Wong:
FungiExpresZ: an intuitive package for fungal gene expression data analysis, visualization and discovery. Briefings Bioinform. 24(2) (2023)
2010 – 2019
- 2018
- [j5]Ruiwen Chen, Rahul Santhanam, Srikanth Srinivasan:
Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits. Theory Comput. 14(1): 1-55 (2018) - [c13]Ruiwen Chen, Igor C. Oliveira, Rahul Santhanam:
An Average-Case Lower Bound Against \mathsf ACC^0 ACC 0. LATIN 2018: 317-330 - [i10]Ruiwen Chen, Rahul Santhanam, Srikanth Srinivasan:
Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits. CoRR abs/1806.06290 (2018) - 2017
- [i9]Igor Carboni Oliveira, Ruiwen Chen, Rahul Santhanam:
An Average-Case Lower Bound against ACC^0. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j4]Ruiwen Chen, Valentine Kabanets, Nitin Saurabh:
An Improved Deterministic #SAT Algorithm for Small de Morgan Formulas. Algorithmica 76(1): 68-87 (2016) - [j3]Ruiwen Chen, Valentine Kabanets:
Correlation bounds and #SAT algorithms for small linear-size circuits. Theor. Comput. Sci. 654: 2-10 (2016) - [c12]Ruiwen Chen, Rahul Santhanam, Srikanth Srinivasan:
Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits. CCC 2016: 1:1-1:35 - [c11]Ruiwen Chen, Rahul Santhanam:
Satisfiability on Mixed Instances. ITCS 2016: 393-402 - 2015
- [j2]Ruiwen Chen, Valentine Kabanets, Antonina Kolokolova, Ronen Shaltiel, David Zuckerman:
Mining Circuit Lower Bound Proofs for Meta-Algorithms. Comput. Complex. 24(2): 333-392 (2015) - [c10]Ruiwen Chen, Valentine Kabanets:
Correlation Bounds and #SAT Algorithms for Small Linear-Size Circuits. COCOON 2015: 211-222 - [c9]Ruiwen Chen:
Satisfiability Algorithms and Lower Bounds for Boolean Formulas over Finite Bases. MFCS (2) 2015: 223-234 - [c8]Ruiwen Chen, Rahul Santhanam:
Improved Algorithms for Sparse MAX-SAT and MAX-k-CSP. SAT 2015: 33-45 - [i8]Ruiwen Chen:
Satisfiability Algorithms and Lower Bounds for Boolean Formulas over Finite Bases. Electron. Colloquium Comput. Complex. TR15 (2015) - [i7]Ruiwen Chen, Rahul Santhanam:
Improved Algorithms for Sparse MAX-SAT and MAX-k-CSP. Electron. Colloquium Comput. Complex. TR15 (2015) - [i6]Ruiwen Chen, Rahul Santhanam:
Satisfiability on Mixed Instances. Electron. Colloquium Comput. Complex. TR15 (2015) - [i5]Ruiwen Chen, Rahul Santhanam, Srikanth Srinivasan:
Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j1]Ruiwen Chen, Valentine Kabanets, Jeff Kinne:
Lower Bounds Against Weakly-Uniform Threshold Circuits. Algorithmica 70(1): 47-75 (2014) - [c7]Ruiwen Chen, Valentine Kabanets, Antonina Kolokolova, Ronen Shaltiel, David Zuckerman:
Mining Circuit Lower Bound Proofs for Meta-algorithms. CCC 2014: 262-273 - [c6]Ruiwen Chen, Valentine Kabanets, Nitin Saurabh:
An Improved Deterministic #SAT Algorithm for Small De Morgan Formulas. MFCS (2) 2014: 165-176 - [i4]Ruiwen Chen, Valentine Kabanets:
Correlation Bounds and #SAT Algorithms for Small Linear-Size Circuits. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [c5]Ruiwen Chen:
Managing massive graphs in relational DBMS. IEEE BigData 2013: 1-8 - [i3]Ruiwen Chen, Valentine Kabanets, Antonina Kolokolova, Ronen Shaltiel, David Zuckerman:
Mining Circuit Lower Bound Proofs for Meta-Algorithms. Electron. Colloquium Comput. Complex. TR13 (2013) - [i2]Ruiwen Chen, Valentine Kabanets, Nitin Saurabh:
An Improved Deterministic #SAT Algorithm for Small De Morgan Formulas. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [c4]Ruiwen Chen, Valentine Kabanets:
Lower Bounds against Weakly Uniform Circuits. COCOON 2012: 408-419 - [i1]Ruiwen Chen, Valentine Kabanets:
Lower Bounds against Weakly Uniform Circuits. Electron. Colloquium Comput. Complex. TR12 (2012) - 2010
- [c3]Ruiwen Chen, Yongyi Mao, Iluju Kiringa:
Generator-Recognizer Networks: A unified approach to probabilistic databases. ICDE 2010: 169-172 - [c2]Ruiwen Chen, Iluju Kiringa, Yongyi Mao:
Graphical models for dependencies and queries in uncertain data. ICDE Workshops 2010: 301-304 - [c1]Ruiwen Chen, Yongyi Mao, Iluju Kiringa:
GRN model of probabilistic databases: construction, transition and querying. SIGMOD Conference 2010: 291-302
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:24 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:
