dblp.uni-trier.dewww.uni-trier.de

Bala Kalyanasundaram

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo
Home Page

2008
58EEBala Kalyanasundaram, Mahendran Velauthapillai: Taming teams with mind changes. J. Comput. Syst. Sci. 74(4): 513-526 (2008)
2007
57EENatarajan Ganesan, Bala Kalyanasundaram, Mahe Velauthapllai: Bioinformatics Data Profiling Tools: A Prelude to Metabolic Profiling. Pacific Symposium on Biocomputing 2007: 127-132
2006
56EEBala Kalyanasundaram, Mahendran Velauthapillai: Capabilities of Thoughtful Machines. Fundam. Inform. 74(2-3): 329-340 (2006)
2005
55EEBala Kalyanasundaram, Kirk Pruhs: Fault-Tolerant Scheduling. SIAM J. Comput. 34(3): 697-719 (2005)
54EEBala Kalyanasundaram, Mahendran Velauthapillai, John G. Waclawsky: Unlocking the Advantages of Dynamic Service Selection and Pricing. Theory Comput. Syst. 38(4): 393-410 (2005)
2004
53EEBala Kalyanasundaram, Mahendran Velauthapillai: Fairness to All While Downsizing. ICALP 2004: 819-830
2003
52EEBala Kalyanasundaram, Mahendran Velauthapillai, John G. Waclawsky: Unlocking the Advantages of Dynamic Service Selection and Pricing. CIAC 2003: 46-57
51EEBala Kalyanasundaram, Mahendran Velauthapillai: On-Demand Broadcasting Under Deadline. ESA 2003: 313-324
50EEBala Kalyanasundaram, Kirk Pruhs: Minimizing flow time nonclairvoyantly. J. ACM 50(4): 551-567 (2003)
49EEBala Kalyanasundaram, Kirk Pruhs: Maximizing job completions online. J. Algorithms 49(1): 63-85 (2003)
48 Kirk Pruhs, Bala Kalyanasundaram: Editorial: Special Issue on On-line Scheduling. J. Scheduling 6(2): 111-112 (2003)
47 Kirk Pruhs, Bala Kalyanasundaram: Editorial: Special Issue on On-Line Scheduling. J. Scheduling 6(3): 227-228 (2003)
2002
46EEBala Kalyanasundaram, John Noga, Kirk Pruhs, Gerhard J. Woeginger: Caching for Web Searching. Algorithmica 33(3): 353-370 (2002)
2001
45EEAndris Ambainis, Harry Buhrman, William I. Gasarch, Bala Kalyanasundaram, Leen Torenvliet: The Communication Complexity of Enumeration, Elimination, and Selection Electronic Colloquium on Computational Complexity (ECCC) 8(19): (2001)
44 Bala Kalyanasundaram, Kirk Pruhs: Eliminating Migration in Multi-processor Scheduling. J. Algorithms 38(1): 2-24 (2001)
43 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): 148-185 (2001)
2000
42 Bala Kalyanasundaram, Kirk Pruhs, Mahendran Velauthapillai: Scheduling Broadcasts in Wireless Networks. ESA 2000: 290-301
41EEBala Kalyanasundaram, Kirk Pruhs: Dynamic Spectrum Allocation: The Impotency of Duration Notification. FSTTCS 2000: 421-428
40EEAndris Ambainis, Harry Buhrman, William I. Gasarch, Bala Kalyanasundaram, Leen Torenvliet: The Communication Complexity of Enumeration, Elimination, and Selection. IEEE Conference on Computational Complexity 2000: 44-53
39EEBala Kalyanasundaram, John Noga, Kirk Pruhs, Gerhard J. Woeginger: Caching for Web Searching. SWAT 2000: 150-163
38EEBala Kalyanasundaram, Kirk Pruhs: Fault-Tolerant Real-Time Scheduling. Algorithmica 28(1): 125-144 (2000)
37EEBala Kalyanasundaram, Kirk Pruhs, Eric Torng: Errata: A New Algorithm for Scheduling Periodic, Real-Time Tasks. Algorithmica 28(3): 269-270 (2000)
36EEBala Kalyanasundaram, Kirk Pruhs: Speed is as powerful as clairvoyance. J. ACM 47(4): 617-643 (2000)
35EEBala Kalyanasundaram, Kirk Pruhs: The Online Transportation Problem. SIAM J. Discrete Math. 13(3): 370-383 (2000)
34EEBala Kalyanasundaram, Kirk Pruhs: An optimal deterministic algorithm for online b-matching. Theor. Comput. Sci. 233(1-2): 319-325 (2000)
1999
33EEBala Kalyanasundaram, Kirk Pruhs: Eliminating Migration in Multi-Processor Scheduling. SODA 1999: 499-506
1998
32EEBala Kalyanasundaram, Kirk Pruhs: Maximizing Job Completions Online. ESA 1998: 235-246
1997
31EERobert P. Daley, Bala Kalyanasundaram: FINite Learning Capabilities and Their Limits. COLT 1997: 81-89
30 Bala Kalyanasundaram, Kirk Pruhs: Fault-Tolerant Real-Time Scheduling. ESA 1997: 296-307
29EEBala Kalyanasundaram, Kirk Pruhs: Minimizing Flow Time Nonclairvoyantly. FOCS 1997: 345-352
28 Yossi Azar, Bala Kalyanasundaram, Serge A. Plotkin, Kirk Pruhs, Orli Waarts: On-Line Load Balancing of Temporary Tasks. J. Algorithms 22(1): 93-110 (1997)
1996
27 Bala Kalyanasundaram, Kirk Pruhs: An Optimal Deterministic Algorithm for Online b-Matching. FSTTCS 1996: 193-199
26 Bala Kalyanasundaram, Kirk Pruhs: On-line Network Optimization Problems. Online Algorithms 1996: 268-280
1995
25 Bala Kalyanasundaram, Mahendran Velauthapillai: Simulating Teams with Many Conjectures. ALT 1995: 201-214
24 Bala Kalyanasundaram, Kirk Pruhs: The Online Transportation Problem. ESA 1995: 484-493
23 Bala Kalyanasundaram, Kirk Pruhs: Speed is as Powerful as Clairvoyance. FOCS 1995: 214-221
22 Robert P. Daley, Bala Kalyanasundaram: Towards Reduction Argumentf for FINite Learning. GOSLER Final Report 1995: 63-75
21 Robert P. Daley, Bala Kalyanasundaram, Mahendran Velauthapillai: Breaking the Probability 1/2 Barrier in FIN-Type Learning. J. Comput. Syst. Sci. 50(3): 574-599 (1995)
1994
20EEBala Kalyanasundaram, Kirk Pruhs: Fault-tolerant scheduling. STOC 1994: 115-124
19 Vineet Bafna, Bala Kalyanasundaram, Kirk Pruhs: Not All Insertion Methods Yield Constant Approximate Tours in the Euclidean Plane. Theor. Comput. Sci. 125(2): 345-360 (1994)
18 Bala Kalyanasundaram, Kirk Pruhs: Constructing Competitive Tours from Local Information. Theor. Comput. Sci. 130(1): 125-138 (1994)
1993
17 Robert P. Daley, Bala Kalyanasundaram: Use of Reduction Arguments in Determining Popperian FIN-Type Learning Capabilities. ALT 1993: 173-186
16EERobert P. Daley, Bala Kalyanasundaram: Capabilities of Probabilistic Learners with Bounded Mind Changes. COLT 1993: 182-191
15EERobert P. Daley, Bala Kalyanasundaram, Mahendran Velauthapillai: Capabilities of fallible FINite Learning. COLT 1993: 199-208
14 Bala Kalyanasundaram, Kirk Pruhs: Constructing Competitive Tours From Local Information. ICALP 1993: 102-113
13 Yossi Azar, Bala Kalyanasundaram, Serge A. Plotkin, Kirk Pruhs, Orli Waarts: Online Load Balancing of Temporary Tasks. WADS 1993: 119-130
12 Bala Kalyanasundaram, Kirk Pruhs: A Competitive Analysis of Algorithms for Searching Unknown Scenes. Comput. Geom. 3: 139-155 (1993)
11 Bala Kalyanasundaram, Kirk Pruhs: Online Weighted Matching. J. Algorithms 14(3): 478-488 (1993)
1992
10 Robert P. Daley, Bala Kalyanasundaram, Mahendran Velauthapillai: The Power of Probabilism in Popperian FINite Learning (extended abstract). AII 1992: 151-169
9EERobert P. Daley, Bala Kalyanasundaram, Mahendran Velauthapillai: Breaking the Probability 1/2 Barrier in FIN-Type Learning. COLT 1992: 203-217
8 Robert P. Daley, Bala Kalyanasundaram: Probabilistic and Pluralistic Learners with Mind Changes. MFCS 1992: 218-226
7 Bala Kalyanasundaram, Kirk Pruhs: A Competitive Analysis of Nearest Neighbor Based Algorithms for Searching Unknown Scenes (Preliminary Version). STACS 1992: 147-157
6 Bala Kalyanasundaram, Georg Schnitger: The Probabilistic Communication Complexity of Set Intersection. SIAM J. Discrete Math. 5(4): 545-557 (1992)
1991
5 Bala Kalyanasundaram, Kirk Pruhs: On-Line Weighted Matching. SODA 1991: 234-240
4 Bala Kalyanasundaram, Georg Schnitger: On the power of white pebbles. Combinatorica 11(2): 157-171 (1991)
1990
3 Bala Kalyanasundaram, Georg Schnitger: Rounds Versus Time for the Two Person Pebble Game Inf. Comput. 88(1): 1-17 (1990)
1989
2 Bala Kalyanasundaram, Georg Schnitger: Rounds versus Time for the Two Person Pebble Game (Extended Abstract). STACS 1989: 517-529
1988
1 Bala Kalyanasundaram, Georg Schnitger: On the Power of White Pebbles (Extended Abstract) STOC 1988: 258-266

Coauthor Index

1Andris Ambainis [40] [43] [45]
2Yossi Azar [13] [28]
3Vineet Bafna [19]
4Harry Buhrman [40] [43] [45]
5Robert P. Daley [8] [9] [10] [15] [16] [17] [21] [22] [31]
6Natarajan Ganesan [57]
7William I. Gasarch [40] [43] [45]
8John Noga [39] [46]
9Serge A. Plotkin [13] [28]
10Kirk Pruhs [5] [7] [11] [12] [13] [14] [18] [19] [20] [23] [24] [26] [27] [28] [29] [30] [32] [33] [34] [35] [36] [37] [38] [39] [41] [42] [44] [46] [47] [48] [49] [50] [55]
11Georg Schnitger [1] [2] [3] [4] [6]
12Leen Torenvliet [40] [43] [45]
13Eric Torng [37]
14Mahendran Velauthapillai [9] [10] [15] [21] [25] [42] [51] [52] [53] [54] [56] [58]
15Mahe Velauthapllai [57]
16Orli Waarts [13] [28]
17John G. Waclawsky [52] [54]
18Gerhard J. Woeginger [39] [46]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)