Bala Kalyanasundaram

Publication Activity (10 Years)

Years Active: 1987-2023
Publications (10 Years): 2

Top Topics

Online Algorithms

Randomized Algorithm

Communication Cost

Top Venues

Oper. Res. Lett.

Publications

Bala Kalyanasundaram, Kirk Pruhs, Clifford Stein
A randomized algorithm for online metric b-matching. Oper. Res. Lett. 51 (6) (2023)
Bala Kalyanasundaram, Calvin Newport
On the Local Communication Complexity of Counting and Modular Arithmetic. CoRR (2021)
Bala Kalyanasundaram, Mahe Velauthapillai
Learning Behaviors of Functions with Teams. Fundam. Informaticae 124 (3) (2013)
Bala Kalyanasundaram, Mahe Velauthapillai
A Near Optimal Periodic Transmission Schedule in Bounded Degree Wireless Sensor Network. Theory Comput. Syst. 51 (4) (2012)
Bala Kalyanasundaram, Mahe Velauthapillai
Analysis of a Simple Randomized Protocol to Establish Communication in Bounded Degree Sensor Networks. ICDCN (2011)
Bala Kalyanasundaram, Mahe Velauthapillai
Learning Behaviors of Functions. Fundam. Informaticae 98 (2-3) (2010)
Bala Kalyanasundaram, Mahendran Velauthapillai
Taming teams with mind changes. J. Comput. Syst. Sci. 74 (4) (2008)
Natarajan Ganesan, Bala Kalyanasundaram, Mahe Velauthapillai
Bioinformatics Data Profiling Tools: A Prelude to Metabolic Profiling. Pacific Symposium on Biocomputing (2007)
Bala Kalyanasundaram, Mahendran Velauthapillai
Capabilities of Thoughtful Machines. Fundam. Informaticae 74 (2-3) (2006)
Bala Kalyanasundaram, Kirk Pruhs
Fault-Tolerant Scheduling. SIAM J. Comput. 34 (3) (2005)
Bala Kalyanasundaram, Mahendran Velauthapillai, John G. Waclawsky
Unlocking the Advantages of Dynamic Service Selection and Pricing. Theory Comput. Syst. 38 (4) (2005)
Bala Kalyanasundaram, Mahendran Velauthapillai
Fairness to All While Downsizing. ICALP (2004)
Bala Kalyanasundaram, Mahendran Velauthapillai
On-Demand Broadcasting Under Deadline. ESA (2003)
Bala Kalyanasundaram, Kirk Pruhs
Minimizing flow time nonclairvoyantly. J. ACM 50 (4) (2003)
Kirk Pruhs, Bala Kalyanasundaram
Editorial: Special Issue on On-line Scheduling. J. Sched. 6 (2) (2003)
Kirk Pruhs, Bala Kalyanasundaram
Editorial: Special Issue on On-Line Scheduling. J. Sched. 6 (3) (2003)
Bala Kalyanasundaram, Mahendran Velauthapillai, John G. Waclawsky
Unlocking the Advantages of Dynamic Service Selection and Pricing. CIAC (2003)
Bala Kalyanasundaram, Kirk Pruhs
Maximizing job completions online. J. Algorithms 49 (1) (2003)
Bala Kalyanasundaram, John Noga, Kirk Pruhs, Gerhard J. Woeginger
Caching for Web Searching. Algorithmica 33 (3) (2002)
Bala Kalyanasundaram, Kirk Pruhs
Eliminating Migration in Multi-processor Scheduling. J. Algorithms 38 (1) (2001)
Andris Ambainis, Harry Buhrman, William I. Gasarch, Bala Kalyanasundaram, Leen Torenvliet
The Communication Complexity of Enumeration, Elimination, and Selection. J. Comput. Syst. Sci. 63 (2) (2001)
Andris Ambainis, Harry Buhrman, William I. Gasarch, Bala Kalyanasundaram, Leen Torenvliet
The Communication Complexity of Enumeration, Elimination, and Selection Electron. Colloquium Comput. Complex. 8 (19) (2001)
Bala Kalyanasundaram, Kirk Pruhs, Eric Torng
Errata: A New Algorithm for Scheduling Periodic, Real-Time Tasks. Algorithmica 28 (3) (2000)
Bala Kalyanasundaram, Kirk Pruhs
Fault-Tolerant Real-Time Scheduling. Algorithmica 28 (1) (2000)
Bala Kalyanasundaram, Kirk Pruhs
The Online Transportation Problem. SIAM J. Discret. Math. 13 (3) (2000)
Bala Kalyanasundaram, Kirk Pruhs
Speed is as powerful as clairvoyance. J. ACM 47 (4) (2000)
Bala Kalyanasundaram, Kirk Pruhs
An optimal deterministic algorithm for online b-matching. Theor. Comput. Sci. 233 (1-2) (2000)
Bala Kalyanasundaram, Kirk Pruhs
Dynamic Spectrum Allocation: The Impotency of Duration Notification. FSTTCS (2000)
Bala Kalyanasundaram, Kirk Pruhs, Mahendran Velauthapillai
Scheduling Broadcasts in Wireless Networks. ESA (2000)
Andris Ambainis, Harry Buhrman, William I. Gasarch, Bala Kalyanasundaram, Leen Torenvliet
The Communication Complexity of Enumeration, Elimination, and Selection. Computational Complexity Conference (2000)
Bala Kalyanasundaram, John Noga, Kirk Pruhs, Gerhard J. Woeginger
Caching for Web Searching. SWAT (2000)
Bala Kalyanasundaram, Kirk Pruhs
Eliminating Migration in Multi-Processor Scheduling. SODA (1999)
Bala Kalyanasundaram, Kirk Pruhs
Maximizing Job Completions Online. ESA (1998)
Bala Kalyanasundaram, Kirk Pruhs
Fault-Tolerant Real-Time Scheduling. ESA (1997)
Bala Kalyanasundaram, Kirk Pruhs
Minimizing Flow Time Nonclairvoyantly. FOCS (1997)
Yossi Azar, Bala Kalyanasundaram, Serge A. Plotkin, Kirk Pruhs, Orli Waarts
On-Line Load Balancing of Temporary Tasks. J. Algorithms 22 (1) (1997)
Robert P. Daley, Bala Kalyanasundaram
FINite Learning Capabilities and Their Limits. COLT (1997)
Bala Kalyanasundaram, Kirk Pruhs
An Optimal Deterministic Algorithm for Online b-Matching. FSTTCS (1996)
Bala Kalyanasundaram, Kirk Pruhs
On-line Network Optimization Problems. Online Algorithms (1996)
Bala Kalyanasundaram, Mahendran Velauthapillai
Simulating Teams with Many Conjectures. ALT (1995)
Robert P. Daley, Bala Kalyanasundaram
Towards Reduction Argumentf for FINite Learning. GOSLER Final Report (1995)
Bala Kalyanasundaram, Kirk Pruhs
The Online Transportation Problem. ESA (1995)
Bala Kalyanasundaram, Kirk Pruhs
Speed is as Powerful as Clairvoyance. FOCS (1995)
Robert P. Daley, Bala Kalyanasundaram, Mahendran Velauthapillai
Breaking the Probability 1/2 Barrier in FIN-Type Learning. J. Comput. Syst. Sci. 50 (3) (1995)
Vineet Bafna, Bala Kalyanasundaram, Kirk Pruhs
Not All Insertion Methods Yield Constant Approximate Tours in the Euclidean Plane. Theor. Comput. Sci. 125 (2) (1994)
Robert P. Daley, Bala Kalyanasundaram, Mahe Velauthapillai
The power of probabilism in Popperian FINite learning. J. Exp. Theor. Artif. Intell. 6 (1) (1994)
Bala Kalyanasundaram, Kirk Pruhs
Fault-tolerant scheduling. STOC (1994)
Bala Kalyanasundaram, Kirk Pruhs
Constructing Competitive Tours from Local Information. Theor. Comput. Sci. 130 (1) (1994)
Robert P. Daley, Bala Kalyanasundaram, Mahendran Velauthapillai
Capabilities of fallible FINite Learning. COLT (1993)
Bala Kalyanasundaram, Kirk Pruhs
Online Weighted Matching. J. Algorithms 14 (3) (1993)
Yossi Azar, Bala Kalyanasundaram, Serge A. Plotkin, Kirk Pruhs, Orli Waarts
Online Load Balancing of Temporary Tasks. WADS (1993)
Robert P. Daley, Bala Kalyanasundaram
Capabilities of Probabilistic Learners with Bounded Mind Changes. COLT (1993)
Bala Kalyanasundaram, Kirk Pruhs
Constructing Competitive Tours From Local Information. ICALP (1993)
Bala Kalyanasundaram, Kirk Pruhs
A Competitive Analysis of Algorithms for Searching Unknown Scenes. Comput. Geom. 3 (1993)
Robert P. Daley, Bala Kalyanasundaram
Use of Reduction Arguments in Determining Popperian FIN-Type Learning Capabilities. ALT (1993)
Robert P. Daley, Bala Kalyanasundaram, Mahendran Velauthapillai
The Power of Probabilism in Popperian FINite Learning (extended abstract). AII (1992)
Robert P. Daley, Bala Kalyanasundaram
Probabilistic and Pluralistic Learners with Mind Changes. MFCS (1992)
Bala Kalyanasundaram, Georg Schnitger
The Probabilistic Communication Complexity of Set Intersection. SIAM J. Discret. Math. 5 (4) (1992)
Robert P. Daley, Bala Kalyanasundaram, Mahendran Velauthapillai
Barrier in FIN-Type Learning. COLT (1992)
Bala Kalyanasundaram, Kirk Pruhs
A Competitive Analysis of Nearest Neighbor Based Algorithms for Searching Unknown Scenes (Preliminary Version). STACS (1992)
Bala Kalyanasundaram, Kirk Pruhs
Visual Searching and Mapping. On-Line Algorithms (1991)
Bala Kalyanasundaram, Kirk Pruhs
On-Line Weighted Matching. SODA (1991)
Bala Kalyanasundaram, Kirk Pruhs
Online Weighted Matching. On-Line Algorithms (1991)
Bala Kalyanasundaram, Georg Schnitger
On the power of white pebbles. Comb. 11 (2) (1991)
Bala Kalyanasundaram, Georg Schnitger
Rounds Versus Time for the Two Person Pebble Game Inf. Comput. 88 (1) (1990)
Bala Kalyanasundaram, Georg Schnitger
Rounds versus Time for the Two Person Pebble Game (Extended Abstract). STACS (1989)
Bala Kalyanasundaram, Georg Schnitger
On the Power of White Pebbles (Extended Abstract) STOC (1988)
Georg Schnitger, Bala Kalyanasundaram
The probabilistic communication complexity of set intersection. Computational Complexity Conference (1987)