Bala Kalyanasundaram

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