default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRudy Zhou
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j3]Benjamin Moseley, Kirk Pruhs, Clifford Stein, Rudy Zhou
:
A competitive algorithm for throughput maximization on identical machines. Math. Program. 206(1): 497-514 (2024)- [j2]Konstantina Mellou, Marco Molinaro, Rudy Zhou:
The Power of Migrations in Dynamic Bin Packing. Proc. ACM Meas. Anal. Comput. Syst. 8(3): 45:1-45:28 (2024) - [i7]Konstantina Mellou, Marco Molinaro, Rudy Zhou:
The Power of Migrations in Dynamic Bin Packing. CoRR abs/2408.13178 (2024) - 2023
- [c7]Konstantina Mellou, Marco Molinaro, Rudy Zhou:
Online Demand Scheduling with Failovers. ICALP 2023: 92:1-92:20 - [c6]Franziska Eberle, Anupam Gupta, Nicole Megow, Benjamin Moseley, Rudy Zhou:
Configuration Balancing for Stochastic Requests. IPCO 2023: 127-141 - [c5]Anupam Gupta, Benjamin Moseley, Rudy Zhou:
Minimizing Completion Times for Stochastic Jobs via Batched Free Times. SODA 2023: 1905-1930 - 2022
- [c4]Benjamin Moseley, Kirk Pruhs, Clifford Stein, Rudy Zhou:
A Competitive Algorithm for Throughput Maximization on Identical Machines. IPCO 2022: 402-414 - [i6]Anupam Gupta, Benjamin Moseley, Rudy Zhou:
Minimizing Completion Times for Stochastic Jobs via Batched Free Times. CoRR abs/2208.13696 (2022) - [i5]Franziska Eberle, Anupam Gupta, Nicole Megow, Benjamin Moseley, Rudy Zhou:
Configuration Balancing for Stochastic Requests. CoRR abs/2208.13702 (2022) - [i4]Konstantina Mellou, Marco Molinaro, Rudy Zhou:
Online Demand Scheduling with Failovers. CoRR abs/2209.00710 (2022) - 2021
- [j1]Sungjin Im, Benjamin Moseley, Rudy Zhou:
The Matroid Cup Game. Oper. Res. Lett. 49(3): 405-411 (2021) - [c3]Anupam Gupta, Benjamin Moseley, Rudy Zhou:
Structural Iterative Rounding for Generalized k-Median Problems. ICALP 2021: 77:1-77:18 - [c2]Silvio Lattanzi, Benjamin Moseley, Sergei Vassilvitskii, Yuyan Wang, Rudy Zhou:
Robust Online Correlation Clustering. NeurIPS 2021: 4688-4698 - [i3]Benjamin Moseley, Kirk Pruhs, Clifford Stein, Rudy Zhou:
A Competitive Algorithm for Throughout Maximization on Identical Machines. CoRR abs/2111.06564 (2021) - 2020
- [c1]Sungjin Im, Mahshid Montazer Qaem, Benjamin Moseley, Xiaorui Sun, Rudy Zhou:
Fast Noise Removal for k-Means Clustering. AISTATS 2020: 456-466 - [i2]Sungjin Im, Mahshid Montazer Qaem, Benjamin Moseley, Xiaorui Sun, Rudy Zhou:
Fast Noise Removal for k-Means Clustering. CoRR abs/2003.02433 (2020) - [i1]Anupam Gupta, Benjamin Moseley, Rudy Zhou:
Structural Iterative Rounding for Generalized k-Median Problems. CoRR abs/2009.00808 (2020)
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-27 00:45 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:
