The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Bala Kalyanasundaram: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  57. Bioinformatics Data Profiling Tools: A Prelude to Metabolic Profiling. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.460secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002