default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDQian Li 0012
Person information
- affiliation: Shenzhen University, Guangdong Province Key Laboratory of Popular High Performance Computers, Shenzhen, China
- affiliation: Chinese Academy of Sciences, Institute of Computing Technology, Beijing, China
- affiliation: University of Chinese Academy of Sciences, Beijing, China
Other persons with the same name
- Qian Li — disambiguation page
- Qian Li 0001
![[0000-0002-5738-0484]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-5738-0484")
— Harbin Institute of Technology, Department of Electrical Engineering and Automation, China - Qian Li 0002 — Beijing University of Posts and Telecommunications, MoE Key Laboratory of Universal Wireless Communications, China
- Qian Li 0003 — Curtin University, Perth, WA, Australia (and 2 more)
- Qian Li 0004 — Boston University, Department of Biomedical Engineering, MA, USA
- Qian Li 0005 — University of California, Santa Cruz, Computer Engineering Department, CA, USA
- Qian Li 0006 — University of Technology Sydney, FEIT, Ultimo, Australia
- Qian Li 0007 — Xidian University, State Key Laboratory of ISN, Xi'an, China
- Qian Li 0008 — Nanjing University, School of Management and Engineering, China
- Qian Li 0009 — Beijing University of Posts and Telecommunications, Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia, China (and 1 more)
- Qian Li 0010 — Chinese Academy of Sciences, Changchun Institute of Optics, Fine Mechanics and Physics, China
- Qian Li 0011 — University of Foreign Studies, Guangzhou, China
- Qian Li 0013 — Xi'an Jiaotong University, Department of Computer Science and Technology, Xi'an, China
- Qian Li 0014 — National University of Defense Technology, College of Meteorology and Oceanography, Nanjing, China (and 2 more)
- Qian (Clara) Li (aka: Qian Li 0015) — Intel Corporation, Communication and Devices Group, Santa Clara, CA, USA (and 2 more)
- Qian Li 0016 — Nankai University, College of Computer and Control Engineering, Tianjin, China
- Qian Li 0017 — Ningbo University of Finance and Economics, College of Digital Technology and Engineering, Ningbo, China (and 1 more)
- Qian Li 0018 — Renmin University of China, School of Information, Beijing, China
- Qian Li 0019 — Wuhan Institute of Technology, School of Electrical and Information Engineering, Wuhan, China
- Qian Li 0020 — East China Jiaotong University, School of Electrical and Automation Engineering, Nanchang, China
- Qian Li 0021 — Zhejiang University, College of Energy Engineering, Hangzhou, China
- Qian Li 0022 — Beijing Wuzi University, School of Information, Beijing, China
- Qian Li 0023 — University of South Florida, Health Informatics Institute, Tampa, FL, USA (and 1 more)
- Qian Li 0024 — Xi'an Jiaotong University, Xi'an, China
- Qian Li 0025 — University of Twente, Department of Communication Science, Enschede, Netherlands
- Qian Li 0026 — Xidian University, School of Telecommunications Engineering, State Key Laboratory of Integrated Service Networks, Xi'an, China
- Qian Li 0027 — DBOS Inc., Sunnyvale. CA, USA (and 2 more)
- Qian Li 0028 — Boston University, Department of Physics, Center for Polymer Studies, Boston, MA, USA
- Qian Li 0029 — Capital University of Economics and Business, School of Management and Engineering, Beijing, China
- Qian Li 0030 — Chinese Academy of Sciences, Xinjiang Institute of Ecology and Geography, Urumqi, China
- Qian Li 0031 — Stony Brook University, Department of Applied Mathematics and Statistics, Stony Brook, NY, USA
- Qian Li 0032 — Harvard Medical School, Massachusetts General Hospital, Department of Radiology, Center for Ultrasound Research & Translation (CURT), Boston, MA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Zhihuai Chen, Siyao Guo, Qian Li, Chengyu Lin, Xiaoming Sun:
New Distinguishers for Negation-Limited Weak Pseudorandom Functions. Theory Comput. 20: 1-19 (2024)- 2023
- [c10]Wei Zi, Qian Li, Xiaoming Sun:
Optimal Synthesis of Multi-Controlled Qudit Gates. DAC 2023: 1-6 - [c9]Kun He, Qian Li, Xiaoming Sun:
Moser-Tardos Algorithm: Beyond Shearer's Bound. SODA 2023: 3362-3387 - [i9]Jianer Chen, Qin Huang, Iyad Kanj, Qian Li, Ge Xia:
Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time. CoRR abs/2310.10815 (2023) - 2022
- [i8]Zhihuai Chen, Siyao Guo, Qian Li, Chengyu Lin, Xiaoming Sun:
New Distinguishers for Negation-Limited Weak Pseudorandom Functions. CoRR abs/2203.12246 (2022) - 2021
- [j5]Qian Li, Xiaoming Sun:
On the Sensitivity Complexity of k-Uniform Hypergraph Properties. ACM Trans. Comput. Theory 13(2): 12:1-12:13 (2021) - [c8]Jianer Chen, Qin Huang, Iyad Kanj, Qian Li, Ge Xia:
Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time. ISAAC 2021: 48:1-48:17 - [i7]Kun He, Qian Li, Xiaoming Sun:
Moser-Tardos Algorithm: Beyond Shearer's Bound. CoRR abs/2111.06527 (2021) - 2020
- [j4]Qian Li, Xiaoming Sun, Jialin Zhang:
On the Optimality of Tape Merge of Two Lists with Similar Size. Algorithmica 82(7): 2107-2132 (2020) - [j3]Wenfei Fan, Kun He, Qian Li, Yue Wang:
Graph algorithms: parallelization and scalability. Sci. China Inf. Sci. 63(10): 1-21 (2020) - [j2]Qian Li, Xiaoming Sun:
On the modulo degree complexity of Boolean functions. Theor. Comput. Sci. 818: 32-40 (2020) - [c7]Zhihuai Chen, Qian Li, Xiaoming Sun, Lirong Xia, Jialin Zhang:
Approximate Single-Peakedness in Large Elections. ICKG 2020: 433-440
2010 – 2019
- 2019
- [j1]Kun He, Qian Li, Xiaoming Sun:
A tighter relation between sensitivity complexity and certificate complexity. Theor. Comput. Sci. 762: 1-12 (2019) - [c6]Kun He, Qian Li, Xiaoming Sun, Jiapeng Zhang:
Quantum Lovász local lemma: Shearer's bound is tight. STOC 2019: 461-472 - 2018
- [i6]Kun He, Qian Li, Xiaoming Sun, Jiapeng Zhang:
Quantum Lovász Local Lemma: Shearer's Bound is Tight. CoRR abs/1804.07055 (2018) - [i5]Kun He, Qian Li, Xiaoming Sun, Jiapeng Zhang:
Quantum Lovász Local Lemma: Shearer's Bound is Tight. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [c5]Jia Zhang, Zheng Wang, Qian Li, Jialin Zhang, Yanyan Lan, Qiang Li, Xiaoming Sun:
Efficient Delivery Policy to Minimize User Traffic Consumption in Guaranteed Advertising. AAAI 2017: 252-258 - [c4]Kun He, Qian Li, Xiaoming Sun:
A Tighter Relation Between Sensitivity Complexity and Certificate Complexity. COCOON 2017: 262-274 - [c3]Qian Li, Xiaoming Sun:
On the Modulo Degree Complexity of Boolean Functions. COCOON 2017: 384-395 - [c2]Qian Li, Xiaoming Sun:
On the Sensitivity Complexity of k-Uniform Hypergraph Properties. STACS 2017: 51:1-51:12 - 2016
- [c1]Qian Li, Xiaoming Sun, Jialin Zhang:
On the Optimality of Tape Merge of Two Lists with Similar Size. ISAAC 2016: 51:1-51:17 - [i4]Qian Li, Xiaoming Sun:
On the Sensitivity Complexity of $k$-Uniform Hypergraph Properties. CoRR abs/1608.06724 (2016) - [i3]Kun He, Qian Li, Xiaoming Sun:
A Tighter Relation between Sensitivity and Certificate Complexity. CoRR abs/1609.04342 (2016) - [i2]Qian Li, Xiaoming Sun, Jialin Zhang:
On the Optimality of Tape Merge of Two Lists with Similar Size. CoRR abs/1610.03266 (2016) - [i1]Jia Zhang, Zheng Wang, Qian Li, Jialin Zhang, Yanyan Lan, Qiang Li, Xiaoming Sun:
Efficient Delivery Policy to Minimize User Traffic Consumption in Guaranteed Advertising. CoRR abs/1611.07599 (2016)
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 2025-01-31 23:42 CET 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:
