Shuchi Chawla | Academic Influence

Shuchi Chawla's AcademicInfluence.com Rankings

Shuchi Chawla

Computer Science

#3282

World Rank

#3439

Historical Rank

Database

#8750

World Rank

#9187

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Shuchi Chawla's Degrees

PhD Computer Science Stanford University

Similar Degrees You Can Earn

Best Online PhD of Computer Science (Doctorates) 2025

Why Is Shuchi Chawla Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Shuchi Chawla is an Indian computer scientist who works in the design and analysis of algorithms, and is known for her research on correlation clustering, information privacy, mechanism design, approximation algorithms, hardness of approximation, and algorithmic bias. She works as a professor of computer science at the University of Texas at Austin.

(See a Problem?)

Shuchi Chawla's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Learning from Labeled and Unlabeled Data using Graph Mincuts (2001) (1095)
Multi-parameter mechanism design and sequential posted pricing (2010) (448)
Correlation Clustering (2002) (400)
Toward Privacy in Public Databases (2005) (319)
Approximation algorithms for orienteering and discounted-reward TSP (2003) (280)
Algorithmic pricing via virtual valuations (2007) (275)
ON THE HARDNESS OF APPROXIMATING MULTICUT AND SPARSEST-CUT (2005) (251)
Approximation algorithms for deadline-TSP and vehicle routing with time-windows (2004) (219)
The power of randomness in bayesian optimal mechanism design (2010) (168)
Multi-parameter mechanism design and sequential posted pricing (2010) (120)
Pricing randomized allocations (2009) (105)
Map cube: A visualization tool for spatial data warehouses (2001) (103)
Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut (2005) (97)
Themis: Fair and Efficient GPU Cluster Scheduling (2019) (94)
Bayesian algorithmic mechanism design (2014) (91)
Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs (2014) (86)
Mechanism Design for Subadditive Agents via an Ex Ante Relaxation (2016) (83)
Mechanisms for coalition formation and cost sharing in an electronic marketplace (2003) (68)
Static Optimality and Dynamic Search-Optimality in Lists and Trees (2002) (61)
Mechanism design for coalition formation and cost sharing in group-buying markets (2004) (59)
Auctions with unique equilibria (2013) (59)
Bertrand competition in networks (2008) (56)
Mechanism design for data science (2014) (50)
Bayesian mechanism design for budget-constrained agents (2011) (40)
Online oblivious routing (2003) (38)
Pricing lotteries (2015) (37)
Approximate revenue maximization in interdependent value settings (2014) (35)
Sequential Posted Pricing and Multi-parameter Mechanism Design (2009) (33)
Optimal Cost-Sharing Mechanisms for Steiner Forest Problems (2006) (31)
Simple Pricing Schemes For Consumers With Evolving Values (2016) (30)
Prior-independent mechanisms for scheduling (2013) (30)
Revenue Maximization for Query Pricing (2019) (29)
On Privacy-Preserving Histograms (2005) (29)
On the Utility of Privacy-Preserving Histograms (2004) (29)
On the limits of black-box reductions in mechanism design (2012) (28)
Multi-category fairness in sponsored search auctions (2019) (27)
Scaling properties of the Internet graph (2003) (26)
Stability of service under time-of-use pricing (2017) (25)
Min-Max payoffs in a two-player location game (2006) (24)
Scheduling for Flow-Time with Admission Control (2003) (22)
Dynamic Query Re-Planning using QOOP (2018) (22)
Secretary Problems with Convex Costs (2011) (22)
QoS based scheduling for incorporating variable rate coded voice in Bluetooth (2001) (20)
Pandora's Box with Correlations: Learning and Approximation (2019) (20)
A/B Testing of Auctions (2016) (20)
The price of anarchy in bertrand games (2009) (18)
Pricing for Online Resource Allocation: Intervals and Paths (2017) (17)
Themis: Fair and Efficient GPU Cluster Scheduling for Machine Learning Workloads (2019) (15)
Truth and Regret in Online Scheduling (2017) (12)
Instruction scheduling for the Motorola 88110 (1993) (12)
A Bicriteria Approximation for the Reordering Buffer Problem (2012) (12)
On the scaling of congestion in the internet graph (2004) (12)
Fairness in ad auctions through inverse proportionality (2020) (11)
Single-Source Stochastic Routing (2006) (10)
Menu-size Complexity and Revenue Continuity of Buy-many Mechanisms (2020) (10)
Profit Maximizing Mechanisms for the Extended Multicasting Game (2002) (9)
Buy-Many Mechanisms are Not Much Better than Item Pricing (2019) (9)
RouteBazaar: An Economic Framework for Flexible Routing (2009) (9)
Revenue Maximization with an Uncertainty-Averse Buyer (2017) (8)
Sparsest Cut (2008) (7)
Region growing for multi-route cuts (2009) (7)
Graph algorithms for planning and partitioning (2005) (7)
Individual Fairness in Advertising Auctions Through Inverse Proportionality (2020) (7)
Static pricing for multi-unit prophet inequalities (2020) (6)
Bayesian Optimal No-Deficit Mechanism Design (2006) (6)
Worst-case payoffs of a location game (2004) (5)
Mechanism Redesign (2017) (5)
On the Impossibility of Black-Box Transformations in Mechanism Design (2011) (4)
Profit guaranteeing mechanisms for multicast networks (2003) (4)
Traffic-redundancy aware network design (2011) (4)
Learning Optimal Search Algorithms from Data (2019) (4)
Pricing for Online Resource Allocation: Beyond Subadditive Values (2017) (4)
Minmax payoffs of a location game (2003) (3)
To ArXiv or not to ArXiv: A Study Quantifying Pros and Cons of Posting Preprints Online (2022) (3)
Non-Adaptive Matroid Prophet Inequalities (2020) (3)
Approximating Pandora's Box with Correlations (2021) (3)
Cite-seeing and Reviewing: A Study on Citation Bias in Peer Review (2022) (3)
Mechanisms for Internet Routing: A Study (2002) (2)
Realistic Models for Selfish Routing in the Internet (2003) (2)
Pricing ordered items (2021) (2)
Static Pricing for Multi-unit Prophet Inequalities (Extended Abstract) (2021) (1)
Individual Fairness in Sponsored Search Auctions (2019) (1)
Visions in Theoretical Computer Science: A Report on the TCS Visioning Workshop 2020 (2021) (1)
Online Time-Windows TSP with Predictions (2023) (1)
Network Design with Coverage Costs (2013) (1)
Better Internet routing through intrinsic support for selfishness (2012) (1)
Dynamic Query RePlanning Using QOOP (2018) (1)
Special Section on the Fortieth Annual ACM Symposium On Theory Of Computing (STOC 2008) (2011) (1)
Multi-Category Fairness in Sponsored Search (2019) (1)
Packing multiway cuts in capacitated graphs (2008) (1)
Prior robust optimization (2013) (1)
Computer Sciences Department RouteBazaar: An Economic Framework for Flexible Routing (2009) (1)
Reasonable multi-item mechanisms are not much better than item pricing (2019) (0)
Cs880: Approximations Algorithms 7.2 Max-cut 7.2.1 the Problem (2007) (0)
3.1 Routing to Minimize Congestion 13.1.1 Ilp Formulation with Exponential Number of Variables and Constraints (2007) (0)
A 2-Approximation for Redundancy Aware Network Design with Laminar Demands (2013) (0)
Cs787: Advanced Algorithms 3.1 Sequence Alignment (2007) (0)
1.1 Facility Location (2007) (0)
De-ossifying internet routing through intrinsic support for end-network and ISP selfishness (2011) (0)
25.1 Pac Learning (2007) (0)
How to sell an app: pay-per-play or buy-it-now? (2014) (0)
Cs880: Approximations Algorithms 21.1 Graph Coloring: Overview 21.2 Sdp Formulation (2007) (0)
6.1 Metric Multiway Cut 16.1.1 Problem Setup and Lp 16.1.2 Rounding (2007) (0)
Timing Matters: Online Dynamics in Broadcast Games (2016) (0)
26.1 Metropolis Method 26.1.1 Mcmc Review 26.1.2 Metropolis Filter (2007) (0)
Session details: Tutorial (2008) (0)
Threshold Rules for Online Sample Selection (2010) (0)
2.1 Complexity Classes (0)
Buy-many mechanisms (2020) (0)
Aversion to Uncertainty and Its Implications for Revenue Maximization (2017) (0)
Approximations in bayesian mechanism design for multi-parameter settings (2014) (0)
Timing Matters (2021) (0)
De-ossifying internet routing through intrinsic support for end-network and ISP selfishness (2011) (0)
Introduction to the Special Issue - Algorithmic Game Theory - STOC/FOCS/SODA 2011 (2015) (0)
Approximation algorithms for network design and partitioning problems (2012) (0)
Session details: 13B (2008) (0)
26.1 Review of Last Class 26.1.1 Pac-learnability and Consistency (2007) (0)
Cs880: Approximations Algorithms 1.1 Introduction 1.2 Motivation (2007) (0)
2.1 Randomized Rounding 12.1.1 Min Congestion Routing Problem (2007) (0)
5.1 Introduction and Recap 5.2 Bipartite Matching Fig 1 : Bipartite Graph (2007) (0)
Individually-Fair Auctions for Multi-Slot Sponsored Search (2022) (0)
Cs787: Advanced Algorithms 7.1 Randomized Load Balancing and Balls and Bins Problem (2007) (0)
Cs787: Advanced Algorithms 9.1 Cook-levin Theorem (0)
Foreword to the Special Issue on SODA’11 (2013) (0)
3.1 Linear Programming Duality (2007) (0)
Session details: 4B (2008) (0)
Cs880: Approximations Algorithms 29.1 Vertex Cover (2007) (0)
Buy-Many Mechanisms for Many Unit-Demand Buyers (2022) (0)

This paper list is powered by the following services:

Other Resources About Shuchi Chawla

en.wikipedia.org

What Schools Are Affiliated With Shuchi Chawla?

Shuchi Chawla is affiliated with the following schools: