default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFelix Zhou 0002
Person information
- affiliation: Yale University, New Haven, CT, USA
- affiliation (former): University of Waterloo, Waterloo, ON, Canada
Other persons with the same name
- Felix Zhou 0001
![[0000-0003-4463-1165]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0003-4463-1165")
— UT Southwestern Medical Center, Dallas, TX, USA (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j1]Jochen Könemann, Justin Toth, Felix Zhou:
On the complexity of nucleolus computation for bipartite b-matching games. Theor. Comput. Sci. 998: 114476 (2024)- [c4]Alkis Kalavasis, Amin Karbasi, Kasper Green Larsen, Grigoris Velegkas, Felix Zhou:
Replicable Learning of Large-Margin Halfspaces. ICML 2024 - [i7]Alkis Kalavasis, Amin Karbasi, Kasper Green Larsen, Grigoris Velegkas, Felix Zhou:
Replicable Learning of Large-Margin Halfspaces. CoRR abs/2402.13857 (2024) - [i6]Quanquan C. Liu, Grigoris Velegkas, Yuichi Yoshida, Felix Zhou:
Pointwise Lipschitz Continuous Graph Algorithms via Proximal Gradient Analysis. CoRR abs/2405.08938 (2024) - [i5]Alkis Kalavasis, Amin Karbasi, Grigoris Velegkas, Felix Zhou:
On the Computational Landscape of Replicable Learning. CoRR abs/2405.15599 (2024) - [i4]Alessandro Epasto, Quanquan C. Liu, Tamalika Mukherjee, Felix Zhou:
The Power of Graph Sparsification in the Continual Release Model. CoRR abs/2407.17619 (2024) - 2023
- [c3]Hossein Esfandiari, Amin Karbasi, Vahab Mirrokni, Grigoris Velegkas, Felix Zhou:
Replicable Clustering. NeurIPS 2023 - [c2]Amin Karbasi, Grigoris Velegkas, Lin Yang, Felix Zhou:
Replicability in Reinforcement Learning. NeurIPS 2023 - [i3]Hossein Esfandiari, Amin Karbasi, Vahab Mirrokni, Grigoris Velegkas, Felix Zhou:
Replicable Clustering. CoRR abs/2302.10359 (2023) - [i2]Amin Karbasi, Grigoris Velegkas, Lin F. Yang, Felix Zhou:
Replicability in Reinforcement Learning. CoRR abs/2305.19562 (2023) - 2021
- [c1]Jochen Könemann, Justin Toth, Felix Zhou:
On the Complexity of Nucleolus Computation for Bipartite b-Matching Games. SAGT 2021: 171-185 - [i1]Jochen Könemann, Justin Toth, Felix Zhou:
On the Complexity of Nucleolus Computation for Bipartite b-Matching Games. CoRR abs/2105.07161 (2021)
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:20 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:
