default search action
Zekun Ye
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c6]Ziyi Guan, Yunqi Huang, Penghui Yao, Zekun Ye:
Quantum and Classical Communication Complexity of Permutation-Invariant Functions. STACS 2024: 39:1-39:19 - [i7]Ziyi Guan, Yunqi Huang, Penghui Yao, Zekun Ye:
Quantum and Classical Communication Complexity of Permutation-Invariant Functions. CoRR abs/2401.00454 (2024) - 2023
- [j7]Zekun Ye, Lvzhou Li:
Characterization of Exact One-Query Quantum Algorithms for Partial Boolean Functions. J. Comput. Sci. Technol. 38(6): 1423-1430 (2023) - [c5]Supartha Podder, Penghui Yao, Zekun Ye:
On the Fine-Grained Query Complexity of Symmetric Functions. ISAAC 2023: 55:1-55:18 - [i6]Zekun Ye:
On the exact quantum query complexity of MODmn and EXACTk, ln. CoRR abs/2303.10935 (2023) - [i5]Supartha Podder, Penghui Yao, Zekun Ye:
On the Fine-Grained Query Complexity of Symmetric Functions. CoRR abs/2309.11279 (2023) - 2022
- [j6]Zekun Ye, Lvzhou Li:
Deterministic algorithms for the hidden subgroup problem. Inf. Comput. 289(Part): 104975 (2022) - [j5]Zekun Ye, Lvzhou Li:
Sample complexity of hidden subgroup problem. Theor. Comput. Sci. 922: 108-121 (2022) - [c4]Zifeng Yuan, Huey-Eng Chua, Sourav S. Bhowmick, Zekun Ye, Byron Choi, Wook-Shin Han:
PLAYPEN: Plug-and-Play Visual Graph Query Interfaces for Top-down and Bottom-Up Search on Large Networks. SIGMOD Conference 2022: 2381-2384 - 2021
- [j4]Zekun Ye, Yunqi Huang, Lvzhou Li, Yuyi Wang:
Query complexity of generalized Simon's problem. Inf. Comput. 281: 104790 (2021) - [j3]Zifeng Yuan, Huey-Eng Chua, Sourav S. Bhowmick, Zekun Ye, Wook-Shin Han, Byron Choi:
Towards Plug-and-Play Visual Graph Query Interfaces: Data-driven Canned Pattern Selection for Large Networks. Proc. VLDB Endow. 14(11): 1979-1991 (2021) - [c3]Junyong Deng, Qingqing Ma, Zekun Ye:
Performance Characterization of Rasterization Algorithms for Reconfigurable Graphics Processor. APSIPA ASC 2021: 133-140 - [i4]Zekun Ye, Lvzhou Li:
Sample complexity of hidden subgroup problem. CoRR abs/2107.02987 (2021) - [i3]Zifeng Yuan, Huey-Eng Chua, Sourav S. Bhowmick, Zekun Ye, Wook-Shin Han, Byron Choi:
Towards Plug-and-Play Visual Graph Query Interfaces: Data-driven Canned Pattern Selection for Large Networks. CoRR abs/2107.09952 (2021) - [i2]Zekun Ye, Lvzhou Li:
Deterministic Algorithms for the Hidden Subgroup Problem. CoRR abs/2110.00827 (2021) - 2020
- [j2]Zekun Ye, Lvzhou Li, Haozhen Situ, Yuyi Wang:
Quantum speedup of twin support vector machines. Sci. China Inf. Sci. 63(8): 1-3 (2020) - [c2]Zekun Ye, Weijie Deng, Shuigeng Zhou, Yi Xu, Jihong Guan:
Optimal Trade Execution Based on Deep Deterministic Policy Gradient. DASFAA (1) 2020: 638-654
2010 – 2019
- 2019
- [j1]Xia Cai, Zekun Ye:
Gaussian Weighting Reversion Strategy for Accurate Online Portfolio Selection. IEEE Trans. Signal Process. 67(21): 5558-5570 (2019) - [i1]Zekun Ye, Yunqi Huang, Yuyi Wang, Lvzhou Li:
Almost tight bound on the query complexity of generalized Simon's problem. CoRR abs/1907.07367 (2019) - 2017
- [c1]Zekun Ye, Kai Huang, Shuigeng Zhou, Jihong Guan:
Gaussian Weighting Reversion Strategy for Accurate On-Line Portfolio Selection. ICTAI 2017: 929-936
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-11-14 00:52 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint