Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYuan Zhou 0007
Person information
- affiliation: Tsinghua University, Yau Mathematical Sciences Center, Beijing, China
- affiliation (former): University of Illinois at Urbana-Champaign, Department of Industrial and Enterprise Systems Engineering, IL, USA
- affiliation (former): Indiana University at Bloomington, IN, USA
- affiliation (former): Massachusetts Institute of Technology (MIT), Department of Mathematics, Cambridge, MA, USA
- affiliation (former, PhD): Carnegie Mellon University, Pittsburgh, PA, USA
Other persons with the same name
- Yuan Zhou — disambiguation page
- Yuan Zhou 0001
![[0000-0002-9198-6586]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0002-9198-6586")
— Tsinghua University, School of Public Policy and Management, Beijing, China - Yuan Zhou 0002 — University of California Davis, Department of Electrical and Computer Engineering, Davis, CA, USA
- Yuan Zhou 0003 — University of South Florida, Department of Mathematics and Statistics, Tampa, FL, USA
- Yuan Zhou 0004 — University of Florida, Department of Computer and Information Science and Engineering, Gainesville, FL, USA
- Yuan Zhou 0005 — Nanyang Technological University, School of Computer Science and Engineering, Singapore (and 1 more)
- Yuan Zhou 0006 — Tianjin University, School of Electrical and Information Engineering, China (and 1 more)
- Yuan Zhou 0008 — Network Emergency Response Technical Team/Coordination Center, China
- Yuan Zhou 0009 — Chinese Academy of Sciences, Institute of Psychology, Beijing, China
- Yuan Zhou 0010 — University of Siegen, Germany
- Yuan Zhou 0011 — University of Texas at Dallas, Department of Electrical and Computer Engineering, Richardson, TX, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j12]Yingkai Li, Yining Wang, Yuan Zhou:
Nearly Minimax-Optimal Regret for Linearly Parameterized Bandits. IEEE Trans. Inf. Theory 70(1): 372-388 (2024)- 2023
- [c54]Xin Chen, Zexing Xu, Zishuo Zhao, Yuan Zhou:
Personalized Pricing with Group Fairness Constraint. FAccT 2023: 1520-1530 - [c53]Yijie Wang, Yuan Zhou, Xiaoqing Huang, Kun Huang, Jie Zhang, Jianzhu Ma:
Learning Sparse Group Models Through Boolean Relaxation. ICLR 2023 - [c52]Jinpeng Zhang, Yufeng Zheng, Chuheng Zhang, Li Zhao, Lei Song, Yuan Zhou, Jiang Bian:
Robust Situational Reinforcement Learning in Face of Context Disturbances. ICML 2023: 41973-41989 - 2022
- [j11]Boxiao Chen, David Simchi-Levi, Yining Wang, Yuan Zhou:
Dynamic Pricing and Inventory Control with Fixed Ordering Cost and Incomplete Demand Information. Manag. Sci. 68(8): 5684-5703 (2022) - [c51]Tanmay Gangwani, Yuan Zhou, Jian Peng:
Imitation Learning from Observations under Transition Model Disparity. ICLR 2022 - [c50]Zhizhou Ren, Ruihan Guo, Yuan Zhou, Jian Peng:
Learning Long-Term Reward Redistribution via Randomized Return Decomposition. ICLR 2022 - [c49]Beining Han, Zhizhou Ren, Zuofan Wu, Yuan Zhou, Jian Peng:
Off-Policy Reinforcement Learning with Delayed Rewards. ICML 2022: 8280-8303 - [c48]Zhizhou Ren, Jiahan Li, Fan Ding, Yuan Zhou, Jianzhu Ma, Jian Peng:
Proximal Exploration for Model-guided Protein Sequence Design. ICML 2022: 18520-18536 - [c47]Zishuo Zhao, Xi Chen, Xuefeng Zhang, Yuan Zhou:
Dynamic Car Dispatching and Pricing: Revenue and Fairness for Ridesharing Platforms. IJCAI 2022: 4701-4708 - [c46]Zihan Zhang, Yuhang Jiang, Yuan Zhou, Xiangyang Ji:
Near-Optimal Regret Bounds for Multi-batch Reinforcement Learning. NeurIPS 2022 - [i48]Tanmay Gangwani, Yuan Zhou, Jian Peng:
Imitation Learning from Observations under Transition Model Disparity. CoRR abs/2204.11446 (2022) - [i47]Zishuo Zhao, Xi Chen, Xuefeng Zhang, Yuan Zhou:
Dynamic Car Dispatching and Pricing: Revenue and Fairness for Ridesharing Platforms. CoRR abs/2207.06318 (2022) - [i46]Xi Chen, Jiameng Lyu, Yining Wang, Yuan Zhou:
Fairness-aware Network Revenue Management with Demand Learning. CoRR abs/2207.11159 (2022) - [i45]Zishuo Zhao, Xi Chen, Yuan Zhou:
Bayesian-Nash-Incentive-Compatible Mechanism for Blockchain Transaction Fee Allocation. CoRR abs/2209.13099 (2022) - [i44]Xin Chen, Jiachun Li, Menglong Li, Tiancheng Zhao, Yuan Zhou:
Assortment Optimization Under the Multivariate MNL Model. CoRR abs/2209.15220 (2022) - [i43]Zihan Zhang, Yuhang Jiang, Yuan Zhou, Xiangyang Ji:
Near-Optimal Regret Bounds for Multi-batch Reinforcement Learning. CoRR abs/2210.08238 (2022) - 2021
- [j10]Xi Chen, Yining Wang, Yuan Zhou:
Optimal Policy for Dynamic Assortment Planning Under Multinomial Logit Models. Math. Oper. Res. 46(4): 1639-1657 (2021) - [c45]Guangyu Xi, Chao Tao, Yuan Zhou:
Near-Optimal MNL Bandits Under Risk Criteria. AAAI 2021: 10397-10404 - [c44]Yingkai Li, Yining Wang, Xi Chen, Yuan Zhou:
Tight Regret Bounds for Infinite-armed Linear Contextual Bandits. AISTATS 2021: 370-378 - [c43]Zihan Zhang, Yuan Zhou, Xiangyang Ji:
Model-Free Reinforcement Learning: from Clipped Pseudo-Regret to Sample Complexity. ICML 2021: 12653-12662 - [c42]Yufei Ruan, Jiaqi Yang, Yuan Zhou:
Linear bandits with limited adaptivity and learning distributional optimal design. STOC 2021: 74-87 - [i42]Beining Han, Zhizhou Ren, Zuofan Wu, Yuan Zhou, Jian Peng:
Off-Policy Reinforcement Learning with Delayed Rewards. CoRR abs/2106.11854 (2021) - [i41]Yuanyi Zhong, Yuan Zhou, Jian Peng:
Coordinate-wise Control Variates for Deep Policy Gradients. CoRR abs/2107.04987 (2021) - [i40]Zihan Zhang, Xiangyang Ji, Yuan Zhou:
Almost Optimal Batch-Regret Tradeoff for Batch Linear Contextual Bandits. CoRR abs/2110.08057 (2021) - [i39]Zhizhou Ren, Ruihan Guo, Yuan Zhou, Jian Peng:
Learning Long-Term Reward Redistribution via Randomized Return Decomposition. CoRR abs/2111.13485 (2021) - 2020
- [j9]Xi Chen, Yining Wang, Yuan Zhou:
Dynamic Assortment Optimization with Changing Contextual Information. J. Mach. Learn. Res. 21: 216:1-216:44 (2020) - [c41]Xiaojin Zhang, Honglei Zhuang, Shengyu Zhang, Yuan Zhou:
Adaptive Double-Exploration Tradeoff for Outlier Detection. AAAI 2020: 6837-6844 - [c40]Yue Qin, Jian Peng, Yuan Zhou:
A PTAS for the Bayesian Thresholding Bandit Problem. AISTATS 2020: 2455-2464 - [c39]Kefan Dong, Jian Peng, Yining Wang, Yuan Zhou:
Root-n-Regret for Learning in Markov Decision Processes with Function Approximation and Low Bellman Rank. COLT 2020: 1554-1557 - [c38]Tanmay Gangwani, Jian Peng, Yuan Zhou:
Harnessing Distribution Ratio Estimators for Learning Agents with Quality and Diversity. CoRL 2020: 2206-2215 - [c37]Nikolai Karpov, Qin Zhang, Yuan Zhou:
Collaborative Top Distribution Identifications with Limited Interaction (Extended Abstract). FOCS 2020: 160-171 - [c36]Kefan Dong, Yingkai Li, Qin Zhang, Yuan Zhou:
Multinomial Logit Bandit with Low Switching Cost. ICML 2020: 2607-2615 - [c35]Yuan Xie, Yulong Pei, Yun Lu, Haixu Tang, Yuan Zhou:
Learning Structural Genetic Information via Graph Neural Embedding. ISBRA 2020: 250-261 - [c34]Tanmay Gangwani, Yuan Zhou, Jian Peng:
Learning Guidance Rewards with Trajectory-space Smoothing. NeurIPS 2020 - [c33]Zihan Zhang, Yuan Zhou, Xiangyang Ji:
Almost Optimal Model-Free Reinforcement Learningvia Reference-Advantage Decomposition. NeurIPS 2020 - [i38]Nikolai Karpov, Qin Zhang, Yuan Zhou:
Collaborative Top Distribution Identifications with Limited Interaction. CoRR abs/2004.09454 (2020) - [i37]Zihan Zhang, Yuan Zhou, Xiangyang Ji:
Almost Optimal Model-Free Reinforcement Learning via Reference-Advantage Decomposition. CoRR abs/2004.10019 (2020) - [i36]Xiaojin Zhang, Honglei Zhuang, Shengyu Zhang, Yuan Zhou:
Adaptive Double-Exploration Tradeoff for Outlier Detection. CoRR abs/2005.06092 (2020) - [i35]Zihan Zhang, Yuan Zhou, Xiangyang Ji:
Model-Free Reinforcement Learning: from Clipped Pseudo-Regret to Sample Complexity. CoRR abs/2006.03864 (2020) - [i34]Yufei Ruan, Jiaqi Yang, Yuan Zhou:
Linear Bandits with Limited Adaptivity and Learning Distributional Optimal Design. CoRR abs/2007.01980 (2020) - [i33]Kefan Dong, Yingkai Li, Qin Zhang, Yuan Zhou:
Multinomial Logit Bandit with Low Switching Cost. CoRR abs/2007.04876 (2020) - [i32]Yuanyi Zhong, Yuan Zhou, Jian Peng:
Efficient Competitive Self-Play Policy Optimization. CoRR abs/2009.06086 (2020) - [i31]Guangyu Xi, Chao Tao, Yuan Zhou:
Near-Optimal MNL Bandits Under Risk Criteria. CoRR abs/2009.12511 (2020) - [i30]Tanmay Gangwani, Yuan Zhou, Jian Peng:
Learning Guidance Rewards with Trajectory-space Smoothing. CoRR abs/2010.12718 (2020) - [i29]Tanmay Gangwani, Jian Peng, Yuan Zhou:
Harnessing Distribution Ratio Estimators for Learning Agents with Quality and Diversity. CoRR abs/2011.02614 (2020)
2010 – 2019
- 2019
- [j8]Xi Chen, Tengyu Ma, Jiawei Zhang, Yuan Zhou:
Optimal Design of Process Flexibility for General Production Systems. Oper. Res. 67(2): 516-531 (2019) - [c32]Yingkai Li, Yining Wang, Yuan Zhou:
Nearly Minimax-Optimal Regret for Linearly Parameterized Bandits. COLT 2019: 2173-2174 - [c31]Chao Tao, Qin Zhang, Yuan Zhou:
Collaborative Learning with Limited Interaction: Tight Bounds for Distributed Exploration in Multi-armed Bandits. FOCS 2019: 126-146 - [c30]Yuan Xie, Boyi Liu, Qiang Liu, Zhaoran Wang, Yuan Zhou, Jian Peng:
Off-Policy Evaluation and Learning from Logged Bandit Feedback: Error Reduction via Surrogate Policy. ICLR (Poster) 2019 - [c29]Chao Tao, Saúl A. Blanco, Jian Peng, Yuan Zhou:
Thresholding Bandit with Optimal Aggregate Regret. NeurIPS 2019: 11659-11668 - [c28]Zhizhou Ren, Kefan Dong, Yuan Zhou, Qiang Liu, Jian Peng:
Exploration via Hindsight Goal Generation. NeurIPS 2019: 13464-13474 - [i28]Yingkai Li, Yining Wang, Yuan Zhou:
Nearly Minimax-Optimal Regret for Linearly Parameterized Bandits. CoRR abs/1904.00242 (2019) - [i27]Chao Tao, Qin Zhang, Yuan Zhou:
Collaborative Learning with Limited Interaction: Tight Bounds for Distributed Exploration in Multi-Armed Bandits. CoRR abs/1904.03293 (2019) - [i26]Yingkai Li, Yining Wang, Yuan Zhou:
Tight Regret Bounds for Infinite-armed Linear Contextual Bandits. CoRR abs/1905.01435 (2019) - [i25]Chao Tao, Saúl A. Blanco, Jian Peng, Yuan Zhou:
Thresholding Bandit with Optimal Aggregate Regret. CoRR abs/1905.11046 (2019) - [i24]Zhizhou Ren, Kefan Dong, Yuan Zhou, Qiang Liu, Jian Peng:
Exploration via Hindsight Goal Generation. CoRR abs/1906.04279 (2019) - [i23]Kefan Dong, Jian Peng, Yining Wang, Yuan Zhou:
√n-Regret for Learning in Markov Decision Processes with Function Approximation and Low Bellman Rank. CoRR abs/1909.02506 (2019) - 2018
- [c27]Chao Tao, Saúl A. Blanco, Yuan Zhou:
Best Arm Identification in Linear Bandits with Linear Dimension Dependency. ICML 2018: 4884-4893 - [c26]Yining Wang, Xi Chen, Yuan Zhou:
Near-Optimal Policies for Dynamic Multinomial Logit Assortment Selection Models. NeurIPS 2018: 3105-3114 - [c25]Jiecao Chen, Qin Zhang, Yuan Zhou:
Tight Bounds for Collaborative PAC Learning via Multiplicative Weights. NeurIPS 2018: 3602-3611 - [i22]Yining Wang, Xi Chen, Yuan Zhou:
Near-Optimal Policies for Dynamic Multinomial Logit Assortment Selection Models. CoRR abs/1805.04785 (2018) - [i21]Jiecao Chen, Qin Zhang, Yuan Zhou:
Tight Bounds for Collaborative PAC Learning via Multiplicative Weights. CoRR abs/1805.09217 (2018) - [i20]Xi Chen, Tengyu Ma, Jiawei Zhang, Yuan Zhou:
Optimal Design of Process Flexibility for General Production Systems. CoRR abs/1806.02894 (2018) - [i19]Xi Chen, Yining Wang, Yuan Zhou:
Dynamic Assortment Selection under the Nested Logit Models. CoRR abs/1806.10410 (2018) - [i18]Yuan Xie, Boyi Liu, Qiang Liu, Zhaoran Wang, Yuan Zhou, Jian Peng:
Off-Policy Evaluation and Learning from Logged Bandit Feedback: Error Reduction via Surrogate Policy. CoRR abs/1808.00232 (2018) - [i17]Xi Chen, Yining Wang, Yuan Zhou:
Dynamic Assortment Optimization with Changing Contextual Information. CoRR abs/1810.13069 (2018) - 2017
- [c24]Jiecao Chen, Xi Chen, Qin Zhang, Yuan Zhou:
Adaptive Multiple-Arm Identification. ICML 2017: 722-730 - [c23]Xue Chen, Yuan Zhou:
Parameterized Algorithms for Constraint Satisfaction Problems Above Average with Global Cardinality Constraints. SODA 2017: 358-377 - [i16]Jiecao Chen, Xi Chen, Qin Zhang, Yuan Zhou:
Adaptive Multiple-Arm Identification. CoRR abs/1706.01026 (2017) - 2016
- [j7]Julia Chuzhoy, Yury Makarychev, Aravindan Vijayaraghavan, Yuan Zhou:
Approximation Algorithms and Hardness of the k-Route Cut Problem. ACM Trans. Algorithms 12(1): 2:1-2:40 (2016) - 2015
- [j6]Xi Chen, Jiawei Zhang, Yuan Zhou:
Optimal Sparse Designs for Process Flexibility via Probabilistic Expanders. Oper. Res. 63(5): 1159-1176 (2015) - [j5]Ryan O'Donnell, Yi Wu, Yuan Zhou:
Hardness of Max-2Lin and Max-3Lin over Integers, Reals, and Large Cyclic Groups. ACM Trans. Comput. Theory 7(2): 9:1-9:16 (2015) - [c22]Konstantin Makarychev, Yury Makarychev, Yuan Zhou:
Satisfiability of Ordering CSPs above Average is Fixed-Parameter Tractable. FOCS 2015: 975-993 - [i15]Konstantin Makarychev, Yury Makarychev, Yuan Zhou:
Satisfiability of Ordering CSPs Above Average. CoRR abs/1503.03851 (2015) - [i14]Xue Chen, Yuan Zhou:
Parameterized Algorithms for Constraint Satisfaction Problems Above Average with Global Cardinality Constraints. CoRR abs/1511.00648 (2015) - 2014
- [j4]Venkatesan Guruswami, Ali Kemal Sinop, Yuan Zhou:
Constant Factor Lasserre Integrality Gaps for Graph Partitioning Problems. SIAM J. Optim. 24(4): 1698-1717 (2014) - [j3]Ryan O'Donnell, Yi Wu, Yuan Zhou:
Optimal Lower Bounds for Locality-Sensitive Hashing (Except When q is Tiny). ACM Trans. Comput. Theory 6(1): 5:1-5:13 (2014) - [c21]Raghu Meka, Omer Reingold, Yuan Zhou:
Deterministic Coupon Collection and Better Strong Dispersers. APPROX-RANDOM 2014: 872-884 - [c20]Madhur Tulsiani, John Wright, Yuan Zhou:
Optimal Strong Parallel Repetition for Projection Games on Low Threshold Rank Graphs. ICALP (1) 2014: 1003-1014 - [c19]Yuan Zhou, Xi Chen, Jian Li:
Optimal PAC Multiple Arm Identification with Applications to Crowdsourcing. ICML 2014: 217-225 - [c18]Parikshit Gopalan, Salil P. Vadhan, Yuan Zhou:
Locally testable codes and cayley graphs. ITCS 2014: 81-92 - [c17]Yuichi Yoshida, Yuan Zhou:
Approximation schemes via Sherali-Adams hierarchy for dense constraint satisfaction problems and assignment problems. ITCS 2014: 423-438 - [c16]Manuel Kauers, Ryan O'Donnell, Li-Yang Tan, Yuan Zhou:
Hypercontractive inequalities via SOS, and the Frankl-Rödl graph. SODA 2014: 1644-1658 - [c15]Ryan O'Donnell, John Wright, Chenggang Wu, Yuan Zhou:
Hardness of Robust Graph Isomorphism, Lasserre Gaps, and Asymmetry of Random Graphs. SODA 2014: 1659-1677 - [i13]Ryan O'Donnell, John Wright, Chenggang Wu, Yuan Zhou:
Hardness of robust graph isomorphism, Lasserre gaps, and asymmetry of random graphs. CoRR abs/1401.2436 (2014) - 2013
- [c14]Ryan O'Donnell, Yuan Zhou:
Approximability and proof complexity. SODA 2013: 1537-1556 - [i12]Parikshit Gopalan, Salil P. Vadhan, Yuan Zhou:
Locally Testable Codes and Cayley Graphs. CoRR abs/1308.5158 (2013) - [i11]Parikshit Gopalan, Salil P. Vadhan, Yuan Zhou:
Locally Testable Codes and Cayley Graphs. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j2]Venkatesan Guruswami, Yuan Zhou:
Tight Bounds on the Approximability of Almost-Satisfiable Horn SAT and Exact Hitting Set. Theory Comput. 8(1): 239-267 (2012) - [c13]Venkatesan Guruswami, Yuan Zhou:
Approximating Bounded Occurrence Ordering CSPs. APPROX-RANDOM 2012: 158-169 - [c12]Gábor Kun, Ryan O'Donnell, Suguru Tamaki, Yuichi Yoshida, Yuan Zhou:
Linear programming, width-1 CSPs, and robust satisfaction. ITCS 2012: 484-495 - [c11]Aditya Bhaskara, Moses Charikar, Aravindan Vijayaraghavan, Venkatesan Guruswami, Yuan Zhou:
Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph. SODA 2012: 388-405 - [c10]Julia Chuzhoy, Yury Makarychev, Aravindan Vijayaraghavan, Yuan Zhou:
Approximation algorithms and hardness of the k-route cut problem. SODA 2012: 780-799 - [c9]Boaz Barak, Fernando G. S. L. Brandão, Aram W. Harrow, Jonathan A. Kelner, David Steurer, Yuan Zhou:
Hypercontractivity, sum-of-squares proofs, and their applications. STOC 2012: 307-326 - [i10]Venkatesan Guruswami, Ali Kemal Sinop, Yuan Zhou:
Constant Factor Lasserre Integrality Gaps for Graph Partitioning Problems. CoRR abs/1202.6071 (2012) - [i9]Boaz Barak, Fernando G. S. L. Brandão, Aram W. Harrow, Jonathan A. Kelner, David Steurer, Yuan Zhou:
Hypercontractivity, Sum-of-Squares Proofs, and their Applications. CoRR abs/1205.4484 (2012) - [i8]Ryan O'Donnell, Yuan Zhou:
Approximability and proof complexity. CoRR abs/1211.1958 (2012) - [i7]Manuel Kauers, Ryan O'Donnell, Li-Yang Tan, Yuan Zhou:
Hypercontractive inequalities via SOS, with an application to Vertex-Cover. CoRR abs/1212.5324 (2012) - [i6]Venkatesan Guruswami, Yuan Zhou:
Approximating Bounded Occurrence Ordering CSPs. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [c8]Zhiyi Huang, Lei Wang, Yuan Zhou:
Black-Box Reductions in Mechanism Design. APPROX-RANDOM 2011: 254-265 - [c7]Ryan O'Donnell, Yi Wu, Yuan Zhou:
Hardness of Max-2Lin and Max-3Lin over Integers, Reals, and Large Cyclic Groups. CCC 2011: 23-33 - [c6]Ryan O'Donnell, John Wright, Yuan Zhou:
The Fourier Entropy-Influence Conjecture for Certain Classes of Boolean Functions. ICALP (1) 2011: 330-341 - [c5]Ryan O'Donnell, Yi Wu, Yuan Zhou:
Optimal lower bounds for locality sensitive hashing (except when q is tiny). ICS 2011: 275-283 - [c4]Venkatesan Guruswami, Yury Makarychev, Prasad Raghavendra, David Steurer, Yuan Zhou:
Finding Almost-Perfect Graph Bisections. ICS 2011: 321-337 - [c3]Venkatesan Guruswami, Yuan Zhou:
Tight Bounds on the Approximability of Almost-satisfiable Horn SAT and Exact Hitting Set. SODA 2011: 1574-1589 - [i5]Aditya Bhaskara, Moses Charikar, Venkatesan Guruswami, Aravindan Vijayaraghavan, Yuan Zhou:
Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph. CoRR abs/1110.1360 (2011) - [i4]Julia Chuzhoy, Yury Makarychev, Aravindan Vijayaraghavan, Yuan Zhou:
Approximation Algorithms and Hardness of the k-Route Cut Problem. CoRR abs/1112.3611 (2011) - 2010
- [j1]Leizhen Cai, Yongxi Cheng, Elad Verbin, Yuan Zhou:
Surviving Rates of Graphs with Bounded Treewidth for the Firefighter Problem. SIAM J. Discret. Math. 24(4): 1322-1335 (2010) - [i3]Venkatesan Guruswami, Yuan Zhou:
Tight Bounds on the Approximability of Almost-satisfiable Horn SAT and Exact Hitting Set}. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [c2]Wei Chen, Shang-Hua Teng, Yajun Wang, Yuan Zhou:
On the alpha-Sensitivity of Nash Equilibria in PageRank-Based Network Reputation Games. FAW 2009: 63-73 - [c1]Pinyan Lu, Yajun Wang, Yuan Zhou:
Tighter Bounds for Facility Games. WINE 2009: 137-148 - [i2]Ryan O'Donnell, Yi Wu, Yuan Zhou:
Optimal lower bounds for locality sensitive hashing (except when q is tiny). CoRR abs/0912.0250 (2009) - [i1]Ryan O'Donnell, Yi Wu, Yuan Zhou:
Optimal lower bounds for locality sensitive hashing (except when q is tiny). Electron. Colloquium Comput. Complex. TR09 (2009)
Coauthor Index
a service of 
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-06-13 20:56 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:
