default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYunhong Zhou
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j19]Mingxing Hu, Zhen Liu, Yunhong Zhou:
Efficient post-quantum secure deterministic wallet scheme. Cybersecur. 7(1): 24 (2024)- [j18]Mingxing Hu
, Zhen Liu, Xiaojun Ren, Yunhong Zhou:
Linkable ring signature scheme with stronger security guarantees. Inf. Sci. 680: 121164 (2024) - 2023
- [i1]Mingxing Hu, Yunhong Zhou:
Ring Signature from Bonsai Tree: How to Preserve the Long-Term Anonymity. CoRR abs/2305.16135 (2023) - 2022
- [c36]Ken Long, Jinsong Lin, Guifang Zhao, Yunhong Zhou, Yangzhou Mei:
DRL-based Joint Beamforming Design for RIS-assisted mmWave MU-MISO system. WCSP 2022: 1131-1136 - 2021
- [j17]Yunhong Zhou, Jiahao Jiang, Pan Hu, Ye Yuan:
A Novel Dual-Channel Bearingless Switched Reluctance Motor. IEEE Access 9: 122373-122384 (2021) - [j16]Yunhong Zhou, Jiahao Jiang, Yukun Sun, Pan Hu:
Principles and Implementation of a Novel Radial-Anti-Disturbance Bearingless Switched Reluctance Motor. IEEE Access 9: 162743-162755 (2021) - [j15]Yunhong Zhou, Jiehui Nan, Licheng Wang:
Fine-Grained Attribute-Based Multikeyword Search for Shared Multiowner in Internet of Things. Secur. Commun. Networks 2021: 6649119:1-6649119:14 (2021) - 2020
- [j14]Yunhong Zhou, Shihui Zheng, Licheng Wang:
Privacy-Preserving and Efficient Public Key Encryption with Keyword Search Based on CP-ABE in Cloud. Cryptogr. 4(4): 28 (2020) - [j13]Yunhong Zhou, Na Li, Yanmei Tian, Dezhi An, Licheng Wang:
Public Key Encryption with Keyword Search in Cloud: A Survey. Entropy 22(4): 421 (2020) - [c35]Yunhong Zhou, Aimin Zhang, Hang Zhang, Jingjing Huang, Yudong Du, Lei Zhang, Wei Zhang:
A Model Predictive Control with Online inductance estimator for Three-Phase VIENNA Rectifiers. IECON 2020: 4607-4611 - [c34]Kai Shu, Liangda Li, Suhang Wang, Yunhong Zhou, Huan Liu:
Joint Local and Global Sequence Modeling in Temporal Correlation Networks for Trending Topic Detection. WebSci 2020: 335-344
2010 – 2019
- 2019
- [c33]Ruirui Li, Liangda Li, Xian Wu, Yunhong Zhou, Wei Wang:
Click Feedback-Aware Query Recommendation Using Adversarial Examples. WWW 2019: 2978-2984 - 2018
- [c32]Yudong Du, Yunhong Zhou, Aimin Zhang, Yang Yu, Weipeng Yang, Hang Zhang:
The Design and Implementation of Control Strategy and Power Modular for STATCOM Application. ICIT 2018: 326-332 - 2014
- [j12]Yang Sun, Yunhong Zhou, Xiaotie Deng:
Optimal reserve prices in weighted GSP auctions. Electron. Commer. Res. Appl. 13(3): 178-187 (2014) - 2012
- [c31]Yang Sun, Yunhong Zhou, Ming Yin, Xiaotie Deng:
On the convergence and robustness of reserve pricing in keyword auctions. ICEC 2012: 113-120 - 2010
- [c30]Xiaotie Deng, Yang Sun, Ming Yin, Yunhong Zhou:
Mechanism Design for Multi-slot Ads Auction in Sponsored Search Markets. FAW 2010: 11-22
2000 – 2009
- 2009
- [c29]Andrew Byde, Terence Kelly, Yunhong Zhou, Robert Endre Tarjan:
Efficiently Generating k-Best Solutions to Procurement Auctions. AAIM 2009: 68-84 - [e1]Andrew V. Goldberg, Yunhong Zhou:
Algorithmic Aspects in Information and Management, 5th International Conference, AAIM 2009, San Francisco, CA, USA, June 15-17, 2009. Proceedings. Lecture Notes in Computer Science 5564, Springer 2009, ISBN 978-3-642-02157-2 [contents] - 2008
- [j11]Anshul Kothari, Subhash Suri, Yunhong Zhou:
Bandwidth-Constrained Allocation in Grid Computing. Algorithmica 52(4): 487-501 (2008) - [c28]Yunhong Zhou, Dennis M. Wilkinson, Robert Schreiber, Rong Pan:
Large-Scale Parallel Collaborative Filtering for the Netflix Prize. AAIM 2008: 337-348 - [c27]Rong Pan, Yunhong Zhou, Bin Cao, Nathan Nan Liu, Rajan M. Lukose, Martin Scholz, Qiang Yang:
One-Class Collaborative Filtering. ICDM 2008: 502-511 - [c26]Yunhong Zhou, Deeparnab Chakrabarty, Rajan M. Lukose:
Budget Constrained Bidding in Keyword Auctions and Online Knapsack Problems. WINE 2008: 566-576 - [c25]Yunhong Zhou, Victor Naroditskiy:
Algorithm for stochastic multiple-choice knapsack problem and application to keywords bidding. WWW 2008: 1175-1176 - [c24]Yunhong Zhou, Deeparnab Chakrabarty, Rajan M. Lukose:
Budget constrained bidding in keyword auctions and online knapsack problems. WWW 2008: 1243-1244 - 2007
- [j10]Subhash Suri, Csaba D. Tóth, Yunhong Zhou:
Selfish Load Balancing and Atomic Congestion Games. Algorithmica 47(1): 79-96 (2007) - [j9]Kamalika Chaudhuri, Anshul Kothari, Rudi Pendavingh, Ram Swaminathan, Robert Endre Tarjan, Yunhong Zhou:
Server Allocation Algorithms for Tiered Systems. Algorithmica 48(2): 129-146 (2007) - [c23]Yunhong Zhou, Rajan M. Lukose:
Vindictive bidding in keyword auctions. ICEC 2007: 141-146 - [c22]Chiranjeeb Buragohain, Subhash Suri, Csaba D. Tóth, Yunhong Zhou:
Improved Throughput Bounds for Interference-Aware Routing in Wireless Networks. COCOON 2007: 210-221 - [c21]Maxim A. Babenko, Jonathan Derryberry, Andrew V. Goldberg, Robert Endre Tarjan, Yunhong Zhou:
Experimental Evaluation of Parametric Max-Flow Algorithms. WEA 2007: 256-269 - 2006
- [j8]Subhash Suri, Csaba D. Tóth, Yunhong Zhou:
Range Counting over Multidimensional Data Streams. Discret. Comput. Geom. 36(4): 633-655 (2006) - [j7]Rajeev Joshi, Greg Nelson, Yunhong Zhou:
Denali: A practical algorithm for generating optimal code. ACM Trans. Program. Lang. Syst. 28(6): 967-989 (2006) - [c20]Robert Endre Tarjan, Julie Ward, Bin Zhang, Yunhong Zhou, Jia Mao:
Balancing Applied to Maximum Network Flow Problems. ESA 2006: 612-623 - [c19]Yunhong Zhou:
Improved Multi-unit Auction Clearing Algorithms with Interval (Multiple-Choice) Knapsack Problems. ISAAC 2006: 494-506 - 2005
- [c18]Anshul Kothari, Subhash Suri, Yunhong Zhou:
Interval Subset Sum and Uniform-Price Auction Clearing. COCOON 2005: 608-620 - [c17]Kamalika Chaudhuri, Anshul Kothari, Rudi Pendavingh, Ram Swaminathan, Robert Endre Tarjan, Yunhong Zhou:
Server Allocation Algorithms for Tiered Systems. COCOON 2005: 632-643 - [c16]Yunhong Zhou, Terence Kelly, Janet L. Wiener, Eric Anderson:
An Extended Evaluation of Two-Phase Scheduling Methods for Animation Rendering. JSSPP 2005: 123-145 - [c15]Eric Anderson, Dirk Beyer, Kamalika Chaudhuri, Terence Kelly, Norman Salazar, Cipriano A. Santos, Ram Swaminathan, Robert Endre Tarjan, Janet L. Wiener, Yunhong Zhou:
Deadline scheduling for animation rendering. SIGMETRICS 2005: 384-385 - [c14]Eric Anderson, Dirk Beyer, Kamalika Chaudhuri, Terence Kelly, Norman Salazar, Cipriano A. Santos, Ram Swaminathan, Robert Endre Tarjan, Janet L. Wiener, Yunhong Zhou:
Value-maximizing deadline scheduling and its application to animation rendering. SPAA 2005: 299-308 - 2004
- [c13]Anshul Kothari, Subhash Suri, Csaba D. Tóth, Yunhong Zhou:
Congestion Games, Load Balancing, and Price of Anarchy. CAAN 2004: 13-27 - [c12]Subhash Suri, Csaba D. Tóth, Yunhong Zhou:
Range counting over multidimensional data streams. SCG 2004: 160-169 - [c11]Subhash Suri, Csaba D. Tóth, Yunhong Zhou:
Uncoordinated Load Balancing and Congestion Games in P2P Systems. IPTPS 2004: 123-130 - [c10]Subhash Suri, Csaba D. Tóth, Yunhong Zhou:
Selfish load balancing and atomic congestion games. SPAA 2004: 188-195 - 2003
- [j6]Yunhong Zhou, Subhash Suri:
Geometric permutations of balls with bounded size disparity. Comput. Geom. 26(1): 3-20 (2003) - [j5]Meir Katchalski, Subhash Suri, Yunhong Zhou:
A Constant Bound for Geometric Permutations of Disjoint Unit Balls. Discret. Comput. Geom. 29(2): 161-173 (2003) - [j4]Tamara Munzner, François Guimbretière, Serdar Tasiran, Li Zhang, Yunhong Zhou:
TreeJuxtaposer: scalable tree comparison using Focus+Context with guaranteed visibility. ACM Trans. Graph. 22(3): 453-462 (2003) - [c9]Valerie King, Li Zhang, Yunhong Zhou:
On the complexity of distance-based evolutionary tree reconstruction. SODA 2003: 444-453 - [c8]Anshul Kothari, Subhash Suri, Yunhong Zhou:
Bandwidth-Constrained Allocation in Grid Computing. WADS 2003: 67-78 - 2002
- [j3]Tuomas Sandholm, Yunhong Zhou:
Surplus equivalence of leveled commitment contracts. Artif. Intell. 142(2): 239-264 (2002) - [j2]Yunhong Zhou, Subhash Suri:
Algorithms for a Minimum Volume Enclosing Simplex in Three Dimensions. SIAM J. Comput. 31(5): 1339-1357 (2002) - [c7]K. Rustan M. Leino, Arnd Poetzsch-Heffter, Yunhong Zhou:
Using Data Groups to Specify and Check Side Effects. PLDI 2002: 246-257 - 2001
- [c6]Yunhong Zhou, Subhash Suri:
Geometric permutations of balls with bounded size disparity. CCCG 2001: 177-180 - [c5]Yunhong Zhou, Subhash Suri:
Shape sensitive geometric permutations. SODA 2001: 234-243 - 2000
- [c4]Yunhong Zhou, Subhash Suri:
Collision Detection Using Bounding Boxes: Convexity Helps. ESA 2000: 437-448 - [c3]Tuomas Sandholm, Yunhong Zhou:
Surplus Equivalence of Leveled Commitment Contracts. ICMAS 2000: 247-254 - [c2]Yunhong Zhou, Subhash Suri:
Algorithms for minimum volume enclosing simplex in R3. SODA 2000: 500-509
1990 – 1999
- 1999
- [j1]Yunhong Zhou, Subhash Suri:
Analysis of a bounding box heuristic for object intersection. J. ACM 46(6): 833-857 (1999) - [c1]Yunhong Zhou, Subhash Suri:
Analysis of a Bounding Box Heuristic for Object Intersection. SODA 1999: 830-839
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-08-13 20:49 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:
