On the Power of White Pebbles (Extended Abstract) - Bala Kalyanasundaram; Georg Schnitger (STOC, 1988)

Rounds versus Time for the Two Person Pebble Game (Extended Abstract). - Bala Kalyanasundaram; Georg Schnitger (STACS, 1989)

Rounds Versus Time for the Two Person Pebble Game - Bala Kalyanasundaram; Georg Schnitger (Inf. Comput., 1990)

Visual Searching and Mapping. - Bala Kalyanasundaram; Kirk Pruhs (On-Line Algorithms, 1991)

On-Line Weighted Matching. - Bala Kalyanasundaram; Kirk Pruhs (SODA, 1991)

On the power of white pebbles. - Bala Kalyanasundaram; Georg Schnitger (Comb., 1991)

Communication Complexity and Lower Bounds for Sequential Computation. - Bala Kalyanasundaram; Georg Schnitger (Informatik, 1992)

The Power of Probabilism in Popperian FINite Learning (extended abstract). - Robert P. Daley; Bala Kalyanasundaram; Mahendran Velauthapillai (AII, 1992)

Breaking the Probability 1/2 Barrier in FIN-Type Learning. - Robert P. Daley; Bala Kalyanasundaram; Mahendran Velauthapillai (COLT, 1992)

Probabilistic and Pluralistic Learners with Mind Changes. - Robert P. Daley; Bala Kalyanasundaram (MFCS, 1992)

A Competitive Analysis of Nearest Neighbor Based Algorithms for Searching Unknown Scenes (Preliminary Version). - Bala Kalyanasundaram; Kirk Pruhs (STACS, 1992)

The Probabilistic Communication Complexity of Set Intersection. - Bala Kalyanasundaram; Georg Schnitger (SIAM J. Discret. Math., 1992)

1 Algorithms. - Bala Kalyanasundaram (Computational Statistics, 1993)

Use of Reduction Arguments in Determining Popperian FIN-Type Learning Capabilities. - Robert P. Daley; Bala Kalyanasundaram (ALT, 1993)

Capabilities of Probabilistic Learners with Bounded Mind Changes. - Robert P. Daley; Bala Kalyanasundaram (COLT, 1993)

Capabilities of fallible FINite Learning. - Robert P. Daley; Bala Kalyanasundaram; Mahendran Velauthapillai (COLT, 1993)

Online Load Balancing of Temporary Tasks. - Yossi Azar; Bala Kalyanasundaram; Serge A. Plotkin; Kirk Pruhs; Orli Waarts (WADS, 1993)

A Competitive Analysis of Algorithms for Searching Unknown Scenes. - Bala Kalyanasundaram; Kirk Pruhs (Comput. Geom., 1993)

Online Weighted Matching. - Bala Kalyanasundaram; Kirk Pruhs (J. Algorithms, 1993)

The power of probabilism in Popperian FINite learning. - Robert P. Daley; Bala Kalyanasundaram; Mahe Velauthapillai (J. Exp. Theor. Artif. Intell., 1994)

Not All Insertion Methods Yield Constant Approximate Tours in the Euclidean Plane. - Vineet Bafna; Bala Kalyanasundaram; Kirk Pruhs (Theor. Comput. Sci., 1994)

Constructing Competitive Tours from Local Information. - Bala Kalyanasundaram; Kirk Pruhs (Theor. Comput. Sci., 1994)

Simulating Teams with Many Conjectures. - Bala Kalyanasundaram; Mahendran Velauthapillai (ALT, 1995)

Towards Reduction Argumentf for FINite Learning. - Robert P. Daley; Bala Kalyanasundaram (GOSLER Final Report, 1995)

Breaking the Probability 1/2 Barrier in FIN-Type Learning. - Robert P. Daley; Bala Kalyanasundaram; Mahendran Velauthapillai (J. Comput. Syst. Sci., 1995)

On-line Network Optimization Problems. - Bala Kalyanasundaram; Kirk Pruhs (Online Algorithms, 1996)

FINite Learning Capabilities and Their Limits. - Robert P. Daley; Bala Kalyanasundaram (COLT, 1997)

On-Line Load Balancing of Temporary Tasks. - Yossi Azar; Bala Kalyanasundaram; Serge A. Plotkin; Kirk Pruhs; Orli Waarts (J. Algorithms, 1997)

Scheduling Broadcasts in Wireless Networks. - Bala Kalyanasundaram; Kirk Pruhs; Mahendran Velauthapillai (ESA, 2000)

Dynamic Spectrum Allocation: The Impotency of Duration Notification. - Bala Kalyanasundaram; Kirk Pruhs (FSTTCS, 2000)

Fault-Tolerant Real-Time Scheduling. - Bala Kalyanasundaram; Kirk Pruhs (Algorithmica, 2000)

Errata: A New Algorithm for Scheduling Periodic, Real-Time Tasks. - Bala Kalyanasundaram; Kirk Pruhs; Eric Torng (Algorithmica, 2000)

Speed is as powerful as clairvoyance. - Bala Kalyanasundaram; Kirk Pruhs (J. ACM, 2000)

The Online Transportation Problem. - Bala Kalyanasundaram; Kirk Pruhs (SIAM J. Discret. Math., 2000)

An optimal deterministic algorithm for online b-matching. - Bala Kalyanasundaram; Kirk Pruhs (Theor. Comput. Sci., 2000)

Eliminating Migration in Multi-processor Scheduling. - Bala Kalyanasundaram; Kirk Pruhs (J. Algorithms, 2001)

The Communication Complexity of Enumeration, Elimination, and Selection. - Andris Ambainis; Harry Buhrman; William I. Gasarch; Bala Kalyanasundaram; Leen Torenvliet (J. Comput. Syst. Sci., 2001)

Caching for Web Searching. - Bala Kalyanasundaram; John Noga; Kirk Pruhs; Gerhard J. Woeginger (Algorithmica, 2002)

On-Demand Broadcasting Under Deadline. - Bala Kalyanasundaram; Mahendran Velauthapillai (ESA, 2003)

Minimizing flow time nonclairvoyantly. - Bala Kalyanasundaram; Kirk Pruhs (J. ACM, 2003)

Maximizing job completions online. - Bala Kalyanasundaram; Kirk Pruhs (J. Algorithms, 2003)

Editorial: Special Issue on On-line Scheduling. - Kirk Pruhs; Bala Kalyanasundaram (J. Sched., 2003)

Fairness to All While Downsizing. - Bala Kalyanasundaram; Mahendran Velauthapillai (ICALP, 2004)

Unlocking the Advantages of Dynamic Service Selection and Pricing. - Bala Kalyanasundaram; Mahendran Velauthapillai; John G. Waclawsky (Theory Comput. Syst., 2005)

Fault-Tolerant Scheduling. - Bala Kalyanasundaram; Kirk Pruhs (SIAM J. Comput., 2005)

Capabilities of Thoughtful Machines. - Bala Kalyanasundaram; Mahendran Velauthapillai (Fundam. Informaticae, 2006)

Bioinformatics Data Profiling Tools: A Prelude to Metabolic Profiling. - Natarajan Ganesan; Bala Kalyanasundaram; Mahe Velauthapillai (Pacific Symposium on Biocomputing, 2007)

Taming teams with mind changes. - Bala Kalyanasundaram; Mahendran Velauthapillai (J. Comput. Syst. Sci., 2008)

Learning Behaviors of Functions. - Bala Kalyanasundaram; Mahe Velauthapillai (Fundam. Informaticae, 2010)

Analysis of a Simple Randomized Protocol to Establish Communication in Bounded Degree Sensor Networks. - Bala Kalyanasundaram; Mahe Velauthapillai (ICDCN, 2011)

A Near Optimal Periodic Transmission Schedule in Bounded Degree Wireless Sensor Network. - Bala Kalyanasundaram; Mahe Velauthapillai (Theory Comput. Syst., 2012)

Learning Behaviors of Functions with Teams. - Bala Kalyanasundaram; Mahe Velauthapillai (Fundam. Informaticae, 2013)

On the Local Communication Complexity of Counting and Modular Arithmetic. - Bala Kalyanasundaram; Calvin Newport (CoRR, 2021)

A randomized algorithm for online metric b-matching. - Bala Kalyanasundaram; Kirk Pruhs; Clifford Stein 001 (Oper. Res. Lett., 2023)