default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShuchi Chawla 0001
Person information
- affiliation: University of Texas at Austin, TX, USA
- affiliation (former): University of Wisconsin-Madison, Madison, WI, USA
- affiliation (former): Carnegie Mellon University, Pittburgh, PA, USA
- affiliation (former): Indian Institute of Technology, Delhi, India
Other persons with the same name
- Shuchi Chawla 0002 — Clemson University, SC, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[c67]Shuchi Chawla, Dimitris Christou, Trung Dang, Zhiyi Huang, Gregory Kehne, Rojin Rezvan:
A Multi-Dimensional Online Contention Resolution Scheme for Revenue Maximization. SODA 2025: 1720-1757- 2024
- [j23]Shuchi Chawla
, Nikhil R. Devanur, Thodoris Lykouris:
Static Pricing for Multi-unit Prophet Inequalities. Oper. Res. 72(4): 1388-1399 (2024) - [c66]Shuchi Chawla, Dimitris Christou:
Online Time-Windows TSP with Predictions. APPROX/RANDOM 2024: 2:1-2:21 - [c65]Shuchi Chawla, Kira Goldner, Anna R. Karlin, J. Benjamin Miller:
Non-Adaptive Matroid Prophet Inequalities. SAGT 2024: 389-404 - [c64]Shuchi Chawla, Kristin Sheridan:
Composition of nested embeddings with an application to outlier removal. SODA 2024: 1641-1668 - [i48]Shuchi Chawla, Dimitris Christou, Trung Dang, Zhiyi Huang, Gregory Kehne, Rojin Rezvan:
A Multi-Dimensional Online Contention Resolution Scheme for Revenue Maximization. CoRR abs/2404.14679 (2024) - [i47]Shuchi Chawla, Dimitris Christou, Amit Harlev, Ziv Scully:
Combinatorial Selection with Costly Information. CoRR abs/2412.03860 (2024) - 2023
- [c63]Shuchi Chawla, Evangelia Gergatsouli, Jeremy McMahan, Christos Tzamos:
Approximating Pandora's Box with Correlations. APPROX/RANDOM 2023: 26:1-26:24 - [c62]Shuchi Chawla, Rojin Rezvan, Yifeng Teng, Christos Tzamos:
Buy-Many Mechanisms for Many Unit-Demand Buyers. WINE 2023: 21-38 - [i46]Shuchi Chawla, Dimitris Christou:
Online Time-Windows TSP with Predictions. CoRR abs/2304.01958 (2023) - [i45]Shuchi Chawla, Kristin Sheridan:
Composition of nested embeddings with an application to outlier removal. CoRR abs/2306.11604 (2023) - 2022
- [j22]Shuchi Chawla, Yifeng Teng, Christos Tzamos:
Buy-many mechanisms are not much better than item pricing. Games Econ. Behav. 134: 104-116 (2022) - [j21]Shuchi Chawla, Nikhil R. Devanur, Anna R. Karlin, Balasubramanian Sivan:
Simple pricing schemes for consumers with evolving values. Games Econ. Behav. 134: 344-360 (2022) - [c61]Shuchi Chawla, Rojin Rezvan, Nathaniel Sauerberg:
Individually-Fair Auctions for Multi-Slot Sponsored Search. FORC 2022: 4:1-4:22 - [c60]Shuchi Chawla, Meena Jagadeesan:
Individual Fairness in Advertising Auctions Through Inverse Proportionality. ITCS 2022: 42:1-42:21 - [c59]Shuchi Chawla, Rojin Rezvan, Yifeng Teng, Christos Tzamos:
Pricing ordered items. STOC 2022: 722-735 - [i44]Ivan Stelmakh, Charvi Rastogi, Ryan Liu, Shuchi Chawla, Federico Echenique, Nihar B. Shah:
Cite-seeing and Reviewing: A Study on Citation Bias in Peer Review. CoRR abs/2203.17239 (2022) - [i43]Charvi Rastogi, Ivan Stelmakh, Xinwei Shen, Marina Meila, Federico Echenique, Shuchi Chawla, Nihar B. Shah:
To ArXiv or not to ArXiv: A Study Quantifying Pros and Cons of Posting Preprints Online. CoRR abs/2203.17259 (2022) - [i42]Shuchi Chawla, Rojin Rezvan, Yifeng Teng, Christos Tzamos:
Buy-Many Mechanisms for Many Unit-Demand Buyers. CoRR abs/2204.01962 (2022) - [i41]Shuchi Chawla, Rojin Rezvan, Nathaniel Sauerberg:
Individually-Fair Auctions for Multi-Slot Sponsored Search. CoRR abs/2204.04136 (2022) - 2021
- [j20]Shuchi Chawla, Joseph (Seffi) Naor, Debmalya Panigrahi, Mohit Singh, Seeun William Umboh:
Timing Matters: Online Dynamics in Broadcast Games. ACM Trans. Economics and Comput. 9(2): 11:1-11:22 (2021) - [c58]Shuchi Chawla, Nikhil R. Devanur, Thodoris Lykouris:
Static Pricing for Multi-unit Prophet Inequalities (Extended Abstract). WINE 2021: 545-546 - [e2]Péter Biró, Shuchi Chawla, Federico Echenique:
EC '21: The 22nd ACM Conference on Economics and Computation, Budapest, Hungary, July 18-23, 2021. ACM 2021, ISBN 978-1-4503-8554-1 [contents] - [i40]Shuchi Chawla, Rojin Rezvan, Yifeng Teng, Christos Tzamos:
Pricing Ordered Items. CoRR abs/2106.04704 (2021) - [i39]Shuchi Chawla, Jelani Nelson, Chris Umans, David P. Woodruff:
Visions in Theoretical Computer Science: A Report on the TCS Visioning Workshop 2020. CoRR abs/2107.02846 (2021) - [i38]Shuchi Chawla, Evangelia Gergatsouli, Jeremy McMahan, Christos Tzamos:
Approximating Pandora's Box with Correlations. CoRR abs/2108.12976 (2021) - 2020
- [j19]Shuchi Chawla, Yifeng Teng, Christos Tzamos:
Buy-many mechanisms: what are they and why should you care? SIGecom Exch. 18(1): 12-18 (2020) - [c57]Christina Ilvento, Meena Jagadeesan, Shuchi Chawla:
Multi-category fairness in sponsored search auctions. FAT* 2020: 348-358 - [c56]Shuchi Chawla, Evangelia Gergatsouli, Yifeng Teng, Christos Tzamos, Ruimin Zhang:
Pandora's Box with Correlations: Learning and Approximation. FOCS 2020: 1214-1225 - [c55]Kshiteej Mahajan, Arjun Balasubramanian, Arjun Singhvi, Shivaram Venkataraman, Aditya Akella, Amar Phanishayee, Shuchi Chawla:
Themis: Fair and Efficient GPU Cluster Scheduling. NSDI 2020: 289-304 - [c54]Shuchi Chawla, Yifeng Teng, Christos Tzamos:
Menu-size Complexity and Revenue Continuity of Buy-many Mechanisms. EC 2020: 475-476 - [e1]Shuchi Chawla:
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020. SIAM 2020, ISBN 978-1-61197-599-4 [contents] - [i37]Shuchi Chawla, Yifeng Teng, Christos Tzamos:
Menu-size Complexity and Revenue Continuity of Buy-many Mechanisms. CoRR abs/2003.10636 (2020) - [i36]Shuchi Chawla, Meena Jagadeesan:
Fairness in ad auctions through inverse proportionality. CoRR abs/2003.13966 (2020) - [i35]Shuchi Chawla, Nikhil R. Devanur, Thodoris Lykouris:
Static pricing for multi-unit prophet inequalities. CoRR abs/2007.07990 (2020) - [i34]Shuchi Chawla, Kira Goldner, Anna R. Karlin, J. Benjamin Miller:
Non-Adaptive Matroid Prophet Inequalities. CoRR abs/2011.09406 (2020)
2010 – 2019
- 2019
- [j18]Shuchi Chawla, Jason D. Hartline, Balasubramanian Sivan:
Optimal crowdsourcing contests. Games Econ. Behav. 113: 80-96 (2019) - [j17]Shuchi Chawla, Shaleen Deep, Paraschos Koutris, Yifeng Teng:
Revenue Maximization for Query Pricing. Proc. VLDB Endow. 13(1): 1-14 (2019) - [c53]Shuchi Chawla, Yifeng Teng, Christos Tzamos:
Buy-Many Mechanisms are Not Much Better than Item Pricing. EC 2019: 237-238 - [c52]Shuchi Chawla, J. Benjamin Miller, Yifeng Teng:
Pricing for Online Resource Allocation: Intervals and Paths. SODA 2019: 1962-1981 - [i33]Shuchi Chawla, Yifeng Teng, Christos Tzamos:
Reasonable multi-item mechanisms are not much better than item pricing. CoRR abs/1902.10315 (2019) - [i32]Shuchi Chawla, Christina Ilvento, Meena Jagadeesan:
Individual Fairness in Sponsored Search Auctions. CoRR abs/1906.08732 (2019) - [i31]Kshiteej Mahajan, Arjun Singhvi, Arjun Balasubramanian, Varun Batra, Surya Teja Chavali, Shivaram Venkataraman, Aditya Akella, Amar Phanishayee, Shuchi Chawla:
Themis: Fair and Efficient GPU Cluster Scheduling for Machine Learning Workloads. CoRR abs/1907.01484 (2019) - [i30]Shuchi Chawla, Shaleen Deep, Paraschos Koutris, Yifeng Teng:
Revenue Maximization for Query Pricing. CoRR abs/1909.00845 (2019) - [i29]Shuchi Chawla, Evangelia Gergatsouli, Yifeng Teng, Christos Tzamos, Ruimin Zhang:
Learning Optimal Search Algorithms from Data. CoRR abs/1911.01632 (2019) - 2018
- [c51]Kshiteej Mahajan, Mosharaf Chowdhury, Aditya Akella, Shuchi Chawla:
Dynamic Query Re-Planning using QOOP. OSDI 2018: 253-267 - [c50]Shuchi Chawla, Kira Goldner, J. Benjamin Miller, Emmanouil Pountourakis:
Revenue Maximization with an Uncertainty-Averse Buyer. SODA 2018: 2050-2068 - [c49]Shuchi Chawla, Joseph (Seffi) Naor, Debmalya Panigrahi, Mohit Singh, Seeun William Umboh:
Timing Matters: Online Dynamics in Broadcast Games. WINE 2018: 80-95 - 2017
- [c48]Shuchi Chawla, Nikhil R. Devanur, Janardhan Kulkarni, Rad Niazadeh:
Truth and Regret in Online Scheduling. EC 2017: 423-440 - [c47]Shuchi Chawla, Nikhil R. Devanur, Alexander E. Holroyd, Anna R. Karlin, James B. Martin, Balasubramanian Sivan:
Stability of service under time-of-use pricing. STOC 2017: 184-197 - [i28]Shuchi Chawla, Nikhil R. Devanur, Janardhan Kulkarni, Rad Niazadeh:
Truth and Regret in Online Scheduling. CoRR abs/1703.00484 (2017) - [i27]Shuchi Chawla, Kira Goldner, J. Benjamin Miller, Emmanouil Pountourakis:
Aversion to Uncertainty and Its Implications for Revenue Maximization. CoRR abs/1703.08607 (2017) - [i26]Shuchi Chawla, Nikhil R. Devanur, Alexander E. Holroyd, Anna R. Karlin, James B. Martin, Balasubramanian Sivan:
Stability of Service under Time-of-Use Pricing. CoRR abs/1704.02364 (2017) - [i25]Shuchi Chawla, J. Benjamin Miller, Dimitris Paparas, Yifeng Teng:
Pricing for Online Resource Allocation: Beyond Subadditive Values. CoRR abs/1708.00043 (2017) - [i24]Shuchi Chawla, Jason D. Hartline, Denis Nekipelov:
Mechanism Redesign. CoRR abs/1708.04699 (2017) - 2016
- [c46]Shuchi Chawla, Jason D. Hartline, Denis Nekipelov:
A/B Testing of Auctions. EC 2016: 19-20 - [c45]Shuchi Chawla, J. Benjamin Miller:
Mechanism Design for Subadditive Agents via an Ex Ante Relaxation. EC 2016: 579-596 - [c44]Shuchi Chawla, Nikhil R. Devanur, Anna R. Karlin, Balasubramanian Sivan:
Simple Pricing Schemes For Consumers With Evolving Values. SODA 2016: 1476-1490 - [r4]Shuchi Chawla:
Multicut. Encyclopedia of Algorithms 2016: 1363-1366 - [r3]Shuchi Chawla:
Sparsest Cut. Encyclopedia of Algorithms 2016: 2043-2045 - [i23]Shuchi Chawla, J. Benjamin Miller:
Mechanism Design for Subadditive Agents via an Ex-Ante Relaxation. CoRR abs/1603.03806 (2016) - [i22]Shuchi Chawla, Jason D. Hartline, Denis Nekipelov:
A/B Testing of Auctions. CoRR abs/1606.00908 (2016) - [i21]Shuchi Chawla, Joseph Naor, Debmalya Panigrahi, Mohit Singh, Seeun William Umboh:
Timing Matters: Online Dynamics in Broadcast Games. CoRR abs/1611.07745 (2016) - 2015
- [j16]Shuchi Chawla, David L. Malec, Balasubramanian Sivan:
The power of randomness in Bayesian optimal mechanism design. Games Econ. Behav. 91: 297-317 (2015) - [j15]Shuchi Chawla, Lisa Fleischer, Jason D. Hartline, Tim Roughgarden:
Introduction to the Special Issue - Algorithmic Game Theory - STOC/FOCS/SODA 2011. Games Econ. Behav. 92: 228-231 (2015) - [j14]Patrick Briest, Shuchi Chawla, Robert Kleinberg, S. Matthew Weinberg:
Pricing lotteries. J. Econ. Theory 156: 144-174 (2015) - [c43]Shuchi Chawla, Konstantin Makarychev, Tselil Schramm, Grigory Yaroslavtsev:
Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs. STOC 2015: 219-228 - 2014
- [j13]Shuchi Chawla, Balasubramanian Sivan:
Bayesian algorithmic mechanism design. SIGecom Exch. 13(1): 5-49 (2014) - [c42]Siddharth Barman, Shuchi Chawla, Seeun Umboh:
Network Design with Coverage Costs. APPROX-RANDOM 2014: 48-63 - [c41]Shuchi Chawla, Hu Fu, Anna R. Karlin:
Approximate revenue maximization in interdependent value settings. EC 2014: 277-294 - [c40]Shuchi Chawla, Jason D. Hartline, Denis Nekipelov:
Mechanism design for data science. EC 2014: 711-712 - [i20]Shuchi Chawla, Jason D. Hartline, Denis Nekipelov:
Mechanism Design for Data Science. CoRR abs/1404.5971 (2014) - [i19]Shuchi Chawla, Hu Fu, Anna R. Karlin:
Approximate Revenue Maximization in Interdependent Value Settings. CoRR abs/1408.4424 (2014) - [i18]Shuchi Chawla, Nikhil R. Devanur, Anna R. Karlin, Balasubramanian Sivan:
How to sell an app: pay-per-play or buy-it-now? CoRR abs/1411.1381 (2014) - [i17]Shuchi Chawla, Konstantin Makarychev, Tselil Schramm, Grigory Yaroslavtsev:
Near Optimal LP Rounding Algorithm for Correlation Clustering on Complete and Complete k-partite Graphs. CoRR abs/1412.0681 (2014) - 2013
- [j12]Shuchi Chawla, Prasad Raghavendra, Dana Randall:
Foreword to the Special Issue on SODA'11. ACM Trans. Algorithms 9(3): 20:1 (2013) - [c39]Shuchi Chawla, Jason D. Hartline:
Auctions with unique equilibria. EC 2013: 181-196 - [c38]Shuchi Chawla, Jason D. Hartline, David L. Malec, Balasubramanian Sivan:
Prior-independent mechanisms for scheduling. STOC 2013: 51-60 - [i16]Siddharth Barman, Shuchi Chawla, Seeun Umboh:
A 2-Approximation for Redundancy Aware Network Design with Laminar Demands. CoRR abs/1304.3868 (2013) - [i15]Shuchi Chawla, Jason D. Hartline, David L. Malec, Balasubramanian Sivan:
Prior-Independent Mechanisms for Scheduling. CoRR abs/1305.0597 (2013) - 2012
- [c37]Holly Esquivel, Chitra Muthukrishnan, Aditya Akella, Shuchi Chawla:
Better Internet routing through intrinsic support for selfishness. COMSNETS 2012: 1-10 - [c36]Siddharth Barman, Shuchi Chawla, Seeun Umboh:
A Bicriteria Approximation for the Reordering Buffer Problem. ESA 2012: 157-168 - [c35]Siddharth Barman, Seeun Umboh, Shuchi Chawla, David L. Malec:
Secretary Problems with Convex Costs. ICALP (1) 2012: 75-87 - [c34]Shuchi Chawla, Jason D. Hartline, Balasubramanian Sivan:
Optimal crowdsourcing contests. SODA 2012: 856-868 - [c33]Siddharth Barman, Shuchi Chawla:
Traffic-redundancy aware network design. SODA 2012: 1487-1498 - [c32]Shuchi Chawla, Nicole Immorlica, Brendan Lucier:
On the limits of black-box reductions in mechanism design. STOC 2012: 435-448 - [i14]Siddharth Barman, Shuchi Chawla, Seeun Umboh:
A Bicriteria Approximation for the Reordering Buffer Problem. CoRR abs/1204.5823 (2012) - [i13]Shuchi Chawla, Cynthia Dwork, Frank McSherry, Kunal Talwar:
On Privacy-Preserving Histograms. CoRR abs/1207.1371 (2012) - 2011
- [j11]Shuchi Chawla, Cynthia Dwork, Venkatesan Guruswami:
Special Section on the Fortieth Annual ACM Symposium On Theory Of Computing (STOC 2008). SIAM J. Comput. 40(6): 1738 (2011) - [c31]Shuchi Chawla, David L. Malec, Azarakhsh Malekian:
Bayesian mechanism design for budget-constrained agents. EC 2011: 253-262 - [c30]Aditya Akella, Shuchi Chawla, Holly Esquivel, Chitra Muthukrishnan:
De-ossifying internet routing through intrinsic support for end-network and ISP selfishness. SIGMETRICS 2011: 145-146 - [i12]Shuchi Chawla, David L. Malec, Azarakhsh Malekian:
Bayesian Mechanism Design for Budget-Constrained Agents. CoRR abs/1103.6280 (2011) - [i11]Shuchi Chawla, Nicole Immorlica, Brendan Lucier:
On the Impossibility of Black-Box Transformations in Mechanism Design. CoRR abs/1109.2067 (2011) - [i10]Siddharth Barman, Shuchi Chawla:
Traffic-Redundancy Aware Network Design. CoRR abs/1110.4150 (2011) - [i9]Shuchi Chawla, Jason D. Hartline, Balasubramanian Sivan:
Optimal Crowdsourcing Contests. CoRR abs/1111.2893 (2011) - [i8]Siddharth Barman, Seeun Umboh, Shuchi Chawla, David L. Malec:
Secretary Problems with Convex Costs. CoRR abs/1112.1136 (2011) - 2010
- [j10]Eric Bach, Shuchi Chawla, Seeun Umboh:
Threshold Rules for Online Sample Selection. Discret. Math. Algorithms Appl. 2(4): 625-642 (2010) - [c29]Shuchi Chawla, Jason D. Hartline, David L. Malec, Balasubramanian Sivan:
Multi-parameter mechanism design and sequential posted pricing. BQGT 2010: 22:1 - [c28]Eric Bach, Shuchi Chawla, Seeun Umboh:
Threshold Rules for Online Sample Selection. COCOON 2010: 489-499 - [c27]Shuchi Chawla, David L. Malec, Balasubramanian Sivan:
The power of randomness in bayesian optimal mechanism design. EC 2010: 149-158 - [c26]Siddharth Barman, Shuchi Chawla:
Region Growing for Multi-Route Cuts. SODA 2010: 404-418 - [c25]Patrick Briest, Shuchi Chawla, Robert Kleinberg, S. Matthew Weinberg:
Pricing Randomized Allocations. SODA 2010: 585-597 - [c24]Shuchi Chawla, Jason D. Hartline, David L. Malec, Balasubramanian Sivan:
Multi-parameter mechanism design and sequential posted pricing. STOC 2010: 311-320 - [i7]Shuchi Chawla, David L. Malec, Balasubramanian Sivan:
The power of randomness in Bayesian optimal mechanism design. CoRR abs/1002.3893 (2010) - [i6]Eric Bach, Shuchi Chawla, Seeun Umboh:
Threshold rules for online sample selection. CoRR abs/1002.5034 (2010)
2000 – 2009
- 2009
- [j9]Shuchi Chawla, Feng Niu, Tim Roughgarden:
Bertrand competition in networks. SIGecom Exch. 8(1) (2009) - [c23]Shuchi Chawla, Feng Niu:
The price of anarchy in bertrand games. EC 2009: 305-314 - [c22]Siddharth Barman, Shuchi Chawla:
Packing multiway cuts in capacitated graphs. SODA 2009: 1048-1057 - [i5]Patrick Briest, Shuchi Chawla, Robert D. Kleinberg, S. Matthew Weinberg:
Pricing Randomized Allocations. CoRR abs/0904.2400 (2009) - [i4]Shuchi Chawla, Jason D. Hartline, David L. Malec, Balasubramanian Sivan:
Sequential Posted Pricing and Multi-parameter Mechanism Design. CoRR abs/0907.2435 (2009) - [i3]Siddharth Barman, Shuchi Chawla:
Region growing for multi-route cuts. CoRR abs/0908.0350 (2009) - 2008
- [j8]Shuchi Chawla, Anupam Gupta, Harald Räcke:
Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut. ACM Trans. Algorithms 4(2): 22:1-22:18 (2008) - [c21]Shuchi Chawla, Tim Roughgarden:
Bertrand Competition in Networks. SAGT 2008: 70-82 - [r2]Shuchi Chawla:
Multicut. Encyclopedia of Algorithms 2008 - [r1]Shuchi Chawla:
Sparsest Cut. Encyclopedia of Algorithms 2008 - [i2]Shuchi Chawla, Jason D. Hartline, Robert Kleinberg:
Algorithmic Pricing via Virtual Valuations. CoRR abs/0808.1671 (2008) - [i1]Siddharth Barman, Shuchi Chawla:
Packing multiway cuts in capacitated graphs. CoRR abs/0810.0674 (2008) - 2007
- [j7]Avrim Blum, Shuchi Chawla, David R. Karger, Terran Lane, Adam Meyerson, Maria Minkoff:
Approximation Algorithms for Orienteering and Discounted-Reward TSP. SIAM J. Comput. 37(2): 653-670 (2007) - [c20]Shuchi Chawla, Jason D. Hartline, Robert D. Kleinberg:
Algorithmic pricing via virtual valuations. EC 2007: 243-251 - 2006
- [j6]Shuchi Chawla, Robert Krauthgamer, Ravi Kumar, Yuval Rabani, D. Sivakumar:
On the Hardness of Approximating Multicut and Sparsest-Cut. Comput. Complex. 15(2): 94-114 (2006) - [j5]Shuchi Chawla, Uday Rajan, R. Ravi, Amitabh Sinha:
Min-Max payoffs in a two-player location game. Oper. Res. Lett. 34(5): 499-507 (2006) - [c19]Shuchi Chawla, Tim Roughgarden:
Single-Source Stochastic Routing. APPROX-RANDOM 2006: 82-94 - [c18]Shuchi Chawla, Tim Roughgarden, Mukund Sundararajan:
Optimal Cost-Sharing Mechanisms for Steiner Forest Problems. WINE 2006: 112-123 - [c17]Shuchi Chawla, Jason D. Hartline, Uday Rajan, R. Ravi:
Bayesian Optimal No-Deficit Mechanism Design. WINE 2006: 136-148 - 2005
- [c16]Shuchi Chawla, Robert Krauthgamer, Ravi Kumar, Yuval Rabani, D. Sivakumar:
On the Hardness of Approximating Multicut and Sparsest-Cut. CCC 2005: 144-153 - [c15]Shuchi Chawla, Anupam Gupta, Harald Räcke:
Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut. SODA 2005: 102-111 - [c14]Shuchi Chawla, Cynthia Dwork, Frank McSherry, Adam D. Smith, Hoeteck Wee:
Toward Privacy in Public Databases. TCC 2005: 363-385 - [c13]Shuchi Chawla, Cynthia Dwork, Frank McSherry, Kunal Talwar:
On Privacy-Preserving Histograms. UAI 2005 - 2004
- [j4]Aditya Akella, Shuchi Chawla, Arvind Kannan, Srinivasan Seshan:
On the scaling of congestion in the internet graph. Comput. Commun. Rev. 34(3): 43-56 (2004) - [j3]Cuihong Li, Shuchi Chawla, Uday Rajan, Katia P. Sycara:
Mechanism design for coalition formation and cost sharing in group-buying markets. Electron. Commer. Res. Appl. 3(4): 341-354 (2004) - [j2]Nikhil Bansal, Avrim Blum, Shuchi Chawla:
Correlation Clustering. Mach. Learn. 56(1-3): 89-113 (2004) - [c12]Shuchi Chawla, Uday Rajan, R. Ravi, Amitabh Sinha:
Worst-case payoffs of a location game. EC 2004: 244-245 - [c11]Nikhil Bansal, Avrim Blum, Shuchi Chawla, Adam Meyerson:
Approximation algorithms for deadline-TSP and vehicle routing with time-windows. STOC 2004: 166-174 - 2003
- [j1]Avrim Blum, Shuchi Chawla, Adam Kalai:
Static Optimality and Dynamic Search-Optimality in Lists and Trees. Algorithmica 36(3): 249-260 (2003) - [c10]Cuihong Li, Uday Rajan, Shuchi Chawla, Katia Sycara-Cyranski:
Mechanisms for coalition formation and cost sharing in an electronic marketplace. ICEC 2003: 68-77 - [c9]Nikhil Bansal, Avrim Blum, Shuchi Chawla, Kedar Dhamdhere:
Scheduling for Flow-Time with Admission Control. ESA 2003: 43-54 - [c8]Avrim Blum, Shuchi Chawla, David R. Karger, Terran Lane, Adam Meyerson, Maria Minkoff:
Approximation Algorithms for Orienteering and Discounted-Reward TSP. FOCS 2003: 46-55 - [c7]Aditya Akella, Shuchi Chawla, Arvind Kannan, Srinivasan Seshan:
Scaling properties of the Internet graph. PODC 2003: 337-346 - [c6]Shuchi Chawla, D. Kitchin, Uday Rajan, R. Ravi, Amitabh Sinha:
Profit guaranteeing mechanisms for multicast networks. EC 2003: 190-191 - [c5]Nikhil Bansal, Avrim Blum, Shuchi Chawla, Adam Meyerson:
Online oblivious routing. SPAA 2003: 44-49 - 2002
- [c4]Nikhil Bansal, Avrim Blum, Shuchi Chawla:
Correlation Clustering. FOCS 2002: 238- - [c3]Avrim Blum, Shuchi Chawla, Adam Kalai:
Static optimality and dynamic search-optimality in lists and trees. SODA 2002: 1-8 - 2001
- [c2]Shuchi Chawla, Huzur Saran, Mitali Singh:
QoS based scheduling for incorporating variable rate coded voice in Bluetooth. ICC 2001: 1232-1237 - [c1]Avrim Blum, Shuchi Chawla:
Learning from Labeled and Unlabeled Data using Graph Mincuts. ICML 2001: 19-26
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-03-04 22:17 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:
