![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Christine Chung 0001
Person information
- affiliation: Connecticut College, Department of Computer Science, New London, CT, USA
- affiliation (PhD 2009): University of Pittsburgh, Department of Computer Science, PA, USA
Other persons with the same name
- Christine Chung — disambiguation page
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c22]Barbara M. Anthony
, Christine Chung
, Ananya Christman, David S. Yuen
:
Earliest Deadline First Is a 2-Approximation for DARP with Time Windows. COCOA (2) 2023: 97-110 - 2022
- [j7]Ananya Christman
, Christine Chung
, Nicholas Jaczko, Scott Westvold, David S. Yuen:
Robustly assigning unstable items. J. Comb. Optim. 44(3): 1556-1577 (2022) - 2021
- [j6]Ananya D. Christman
, Christine Chung
, Nicholas Jaczko, Tianzhi Li, Scott Westvold, Xinyue Xu, David S. Yuen:
Improved Bounds for Revenue Maximization in Time-Limited Online Dial-a-Ride. Oper. Res. Forum 2(3) (2021) - [c21]Barbara M. Anthony
, Ananya D. Christman
, Christine Chung
, David S. Yuen
:
Serving Rides of Equal Importance for Time-Limited Dial-a-Ride. MOTOR 2021: 35-50 - 2020
- [j5]Barbara M. Anthony, Christine Chung:
Equilibria in Doodle polls under three tie-breaking rules. Theor. Comput. Sci. 822: 61-71 (2020) - [c20]Ananya Christman
, Christine Chung
, Nicholas Jaczko, Tianzhi Li, Scott Westvold, Xinyue Xu, David S. Yuen
:
New Bounds for Maximizing Revenue in Online Dial-a-Ride. IWOCA 2020: 180-194
2010 – 2019
- 2019
- [c19]Barbara M. Anthony
, Ricky Birnbaum, Sara Boyd, Ananya Christman
, Christine Chung
, Patrick Davis, Jigar Dhimar, David S. Yuen:
Maximizing the Number of Rides Served for Dial-a-Ride. ATMOS 2019: 11:1-11:15 - [i1]Ananya Christman, Christine Chung, Nicholas Jaczko, Tianzhi Li, Scott Westvold, Xinyue Xu:
The SBP Algorithm for Maximizing Revenue in Online Dial-a-Ride. CoRR abs/1912.06300 (2019) - 2018
- [c18]Barbara M. Anthony, Christine Chung:
How Bad is Selfish Doodle Voting? AAMAS 2018: 1856-1858 - [c17]Ananya Christman, Christine Chung, Nicholas Jaczko, Scott Westvold, David S. Yuen:
Robustly Assigning Unstable Items. COCOA 2018: 402-420 - [c16]Barbara M. Anthony
, Christine Chung
:
Inefficiency of Equilibria in Doodle Polls. COCOA 2018: 707-721 - 2017
- [c15]Ananya Christman, Christine Chung, Nicholas Jaczko, Marina Milan, Anna Vasilchenko, Scott Westvold:
Revenue Maximization in Online Dial-A-Ride. ATMOS 2017: 1:1-1:15 - 2016
- [j4]Barbara M. Anthony
, Christine Chung
:
Serve or skip: the power of rejection in online bottleneck matching. J. Comb. Optim. 32(4): 1232-1253 (2016) - [c14]Danya Alrawi, Barbara M. Anthony
, Christine Chung
:
How Well Do Doodle Polls Do? SocInfo (1) 2016: 3-23 - 2014
- [j3]Barbara M. Anthony
, Christine Chung
:
Online bottleneck matching. J. Comb. Optim. 27(1): 100-114 (2014) - [c13]Barbara M. Anthony
, Christine Chung
:
The Power of Rejection in Online Bottleneck Matching. COCOA 2014: 395-411 - [c12]Christine Chung
, Shenoda Guirguis, Anastasia Kurdia:
Competitive Cost-Savings in Data Stream Management Systems. COCOON 2014: 129-140 - 2013
- [c11]Barbara M. Anthony
, Christine Chung
:
Data plan throttling: A simple consumer choice mechanism. GLOBECOM 2013: 3151-3156 - [c10]Barbara M. Anthony, Lisa Bender, Christine Chung, Mark Lewis:
Trends in CS enrollment at small, liberal arts institutions (abstract only). SIGCSE 2013: 751 - 2012
- [j2]Christine Chung
, Katrina Ligett
, Kirk Pruhs, Aaron Roth
:
The Power of Fair Pricing Mechanisms. Algorithmica 63(3): 634-644 (2012) - [j1]Lory Al Moakar, Panos K. Chrysanthis
, Christine Chung, Shenoda Guirguis, Alexandros Labrinidis, Panayiotis Neophytou, Kirk Pruhs:
Auction-based Admission Control for Continuous Queries in a Multi-Tenant DSMS. Int. J. Next Gener. Comput. 3(3) (2012) - [c9]Barbara M. Anthony
, Christine Chung
:
Online Bottleneck Matching. COCOA 2012: 257-268 - [c8]Bo Xiong, Christine Chung
:
Completion Time Scheduling and the WSRPT Algorithm. ISCO 2012: 416-426 - 2010
- [c7]Lory Al Moakar, Panos K. Chrysanthis
, Christine Chung
, Shenoda Guirguis, Alexandros Labrinidis, Panayiotis Neophytou, Kirk Pruhs:
Admission control mechanisms for continuous queries in the cloud. ICDE 2010: 409-412 - [c6]Christine Chung
, Katrina Ligett
, Kirk Pruhs, Aaron Roth
:
The Power of Fair Pricing Mechanisms. LATIN 2010: 554-564 - [c5]Christine Chung, Tim Nonner, Alexander Souza:
SRPT is 1.86-Competitive for Completion Time Scheduling. SODA 2010: 1373-1388
2000 – 2009
- 2009
- [c4]Christine Chung
, Evangelia Pyrga:
Stochastic Stability in Internet Router Congestion Games. SAGT 2009: 183-195 - [c3]George Christodoulou
, Christine Chung
, Katrina Ligett
, Evangelia Pyrga, Rob van Stee:
On the Price of Stability for Undirected Network Design. WAOA 2009: 86-97 - 2008
- [c2]Christine Chung, Kirk Pruhs, Patchrawat Uthaisombut:
The Online Transportation Problem: On the Exponential Boost of One Extra Server. LATIN 2008: 228-239 - [c1]Christine Chung, Katrina Ligett
, Kirk Pruhs, Aaron Roth
:
The Price of Stochastic Anarchy. SAGT 2008: 303-314
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
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-05-13 20:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint