default search action
Bala Kalyanasundaram
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j30]Bala Kalyanasundaram, Kirk Pruhs, Clifford Stein
:
A randomized algorithm for online metric b-matching. Oper. Res. Lett. 51(6): 591-594 (2023) - 2021
- [i2]Bala Kalyanasundaram, Calvin Newport:
On the Local Communication Complexity of Counting and Modular Arithmetic. CoRR abs/2111.11460 (2021)
2010 – 2019
- 2013
- [j29]Bala Kalyanasundaram, Mahe Velauthapillai:
Learning Behaviors of Functions with Teams. Fundam. Informaticae 124(3): 251-270 (2013) - 2012
- [j28]Bala Kalyanasundaram, Mahe Velauthapillai:
A Near Optimal Periodic Transmission Schedule in Bounded Degree Wireless Sensor Network. Theory Comput. Syst. 51(4): 474-491 (2012) - 2011
- [c36]Bala Kalyanasundaram, Mahe Velauthapillai:
Analysis of a Simple Randomized Protocol to Establish Communication in Bounded Degree Sensor Networks. ICDCN 2011: 269-280 - 2010
- [j27]Bala Kalyanasundaram, Mahe Velauthapillai:
Learning Behaviors of Functions. Fundam. Informaticae 98(2-3): 183-198 (2010)
2000 – 2009
- 2008
- [j26]Bala Kalyanasundaram, Mahendran Velauthapillai:
Taming teams with mind changes. J. Comput. Syst. Sci. 74(4): 513-526 (2008) - 2007
- [c35]Natarajan Ganesan, Bala Kalyanasundaram, Mahe Velauthapillai:
Bioinformatics Data Profiling Tools: A Prelude to Metabolic Profiling. Pacific Symposium on Biocomputing 2007: 127-132 - 2006
- [j25]Bala Kalyanasundaram, Mahendran Velauthapillai:
Capabilities of Thoughtful Machines. Fundam. Informaticae 74(2-3): 329-340 (2006) - 2005
- [j24]Bala Kalyanasundaram, Mahendran Velauthapillai, John G. Waclawsky:
Unlocking the Advantages of Dynamic Service Selection and Pricing. Theory Comput. Syst. 38(4): 393-410 (2005) - [j23]Bala Kalyanasundaram, Kirk Pruhs:
Fault-Tolerant Scheduling. SIAM J. Comput. 34(3): 697-719 (2005) - 2004
- [c34]Bala Kalyanasundaram, Mahendran Velauthapillai:
Fairness to All While Downsizing. ICALP 2004: 819-830 - 2003
- [j22]Bala Kalyanasundaram, Kirk Pruhs:
Minimizing flow time nonclairvoyantly. J. ACM 50(4): 551-567 (2003) - [j21]Bala Kalyanasundaram, Kirk Pruhs:
Maximizing job completions online. J. Algorithms 49(1): 63-85 (2003) - [j20]Kirk Pruhs, Bala Kalyanasundaram:
Editorial: Special Issue on On-line Scheduling. J. Sched. 6(2): 111-112 (2003) - [j19]Kirk Pruhs, Bala Kalyanasundaram:
Editorial: Special Issue on On-Line Scheduling. J. Sched. 6(3): 227-228 (2003) - [c33]Bala Kalyanasundaram, Mahendran Velauthapillai, John G. Waclawsky:
Unlocking the Advantages of Dynamic Service Selection and Pricing. CIAC 2003: 46-57 - [c32]Bala Kalyanasundaram, Mahendran Velauthapillai:
On-Demand Broadcasting Under Deadline. ESA 2003: 313-324 - 2002
- [j18]Bala Kalyanasundaram, John Noga, Kirk Pruhs, Gerhard J. Woeginger:
Caching for Web Searching. Algorithmica 33(3): 353-370 (2002) - 2001
- [j17]Bala Kalyanasundaram, Kirk Pruhs:
Eliminating Migration in Multi-processor Scheduling. J. Algorithms 38(1): 2-24 (2001) - [j16]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) - [i1]Andris Ambainis, Harry Buhrman, William I. Gasarch, Bala Kalyanasundaram, Leen Torenvliet:
The Communication Complexity of Enumeration, Elimination, and Selection. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [j15]Bala Kalyanasundaram, Kirk Pruhs:
Fault-Tolerant Real-Time Scheduling. Algorithmica 28(1): 125-144 (2000) - [j14]Bala Kalyanasundaram, Kirk Pruhs, Eric Torng:
Errata: A New Algorithm for Scheduling Periodic, Real-Time Tasks. Algorithmica 28(3): 269-270 (2000) - [j13]Bala Kalyanasundaram, Kirk Pruhs:
Speed is as powerful as clairvoyance. J. ACM 47(4): 617-643 (2000) - [j12]Bala Kalyanasundaram, Kirk Pruhs:
The Online Transportation Problem. SIAM J. Discret. Math. 13(3): 370-383 (2000) - [j11]Bala Kalyanasundaram, Kirk Pruhs:
An optimal deterministic algorithm for online b-matching. Theor. Comput. Sci. 233(1-2): 319-325 (2000) - [c31]Andris Ambainis, Harry Buhrman, William I. Gasarch, Bala Kalyanasundaram, Leen Torenvliet:
The Communication Complexity of Enumeration, Elimination, and Selection. CCC 2000: 44-53 - [c30]Bala Kalyanasundaram, Kirk Pruhs, Mahendran Velauthapillai:
Scheduling Broadcasts in Wireless Networks. ESA 2000: 290-301 - [c29]Bala Kalyanasundaram, Kirk Pruhs:
Dynamic Spectrum Allocation: The Impotency of Duration Notification. FSTTCS 2000: 421-428 - [c28]Bala Kalyanasundaram, John Noga, Kirk Pruhs, Gerhard J. Woeginger:
Caching for Web Searching. SWAT 2000: 150-163
1990 – 1999
- 1999
- [c27]Bala Kalyanasundaram, Kirk Pruhs:
Eliminating Migration in Multi-Processor Scheduling. SODA 1999: 499-506 - 1998
- [c26]Bala Kalyanasundaram, Kirk Pruhs:
Maximizing Job Completions Online. ESA 1998: 235-246 - 1997
- [j10]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) - [c25]Robert P. Daley, Bala Kalyanasundaram:
FINite Learning Capabilities and Their Limits. COLT 1997: 81-89 - [c24]Bala Kalyanasundaram, Kirk Pruhs:
Fault-Tolerant Real-Time Scheduling. ESA 1997: 296-307 - [c23]Bala Kalyanasundaram, Kirk Pruhs:
Minimizing Flow Time Nonclairvoyantly. FOCS 1997: 345-352 - 1996
- [c22]Bala Kalyanasundaram, Kirk Pruhs:
On-line Network Optimization Problems. Online Algorithms 1996: 268-280 - [c21]Bala Kalyanasundaram, Kirk Pruhs:
An Optimal Deterministic Algorithm for Online b-Matching. FSTTCS 1996: 193-199 - 1995
- [j9]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) - [c20]Bala Kalyanasundaram, Mahendran Velauthapillai:
Simulating Teams with Many Conjectures. ALT 1995: 201-214 - [c19]Bala Kalyanasundaram, Kirk Pruhs:
The Online Transportation Problem. ESA 1995: 484-493 - [c18]Bala Kalyanasundaram, Kirk Pruhs:
Speed is as Powerful as Clairvoyance. FOCS 1995: 214-221 - [c17]Robert P. Daley, Bala Kalyanasundaram:
Towards Reduction Argumentf for FINite Learning. GOSLER Final Report 1995: 63-75 - 1994
- [j8]Robert P. Daley, Bala Kalyanasundaram, Mahe Velauthapillai:
The power of probabilism in Popperian FINite learning. J. Exp. Theor. Artif. Intell. 6(1): 41-62 (1994) - [j7]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) - [j6]Bala Kalyanasundaram, Kirk Pruhs:
Constructing Competitive Tours from Local Information. Theor. Comput. Sci. 130(1): 125-138 (1994) - [c16]Bala Kalyanasundaram, Kirk Pruhs:
Fault-tolerant scheduling. STOC 1994: 115-124 - 1993
- [j5]Bala Kalyanasundaram, Kirk Pruhs:
A Competitive Analysis of Algorithms for Searching Unknown Scenes. Comput. Geom. 3: 139-155 (1993) - [j4]Bala Kalyanasundaram, Kirk Pruhs:
Online Weighted Matching. J. Algorithms 14(3): 478-488 (1993) - [c15]Robert P. Daley, Bala Kalyanasundaram:
Use of Reduction Arguments in Determining Popperian FIN-Type Learning Capabilities. ALT 1993: 173-186 - [c14]Robert P. Daley, Bala Kalyanasundaram:
Capabilities of Probabilistic Learners with Bounded Mind Changes. COLT 1993: 182-191 - [c13]Robert P. Daley, Bala Kalyanasundaram, Mahendran Velauthapillai:
Capabilities of fallible FINite Learning. COLT 1993: 199-208 - [c12]Bala Kalyanasundaram, Kirk Pruhs:
Constructing Competitive Tours From Local Information. ICALP 1993: 102-113 - [c11]Yossi Azar, Bala Kalyanasundaram, Serge A. Plotkin, Kirk Pruhs, Orli Waarts:
Online Load Balancing of Temporary Tasks. WADS 1993: 119-130 - [p2]Bala Kalyanasundaram:
1 Algorithms. Computational Statistics 1993: 1-16 - 1992
- [j3]Bala Kalyanasundaram, Georg Schnitger:
The Probabilistic Communication Complexity of Set Intersection. SIAM J. Discret. Math. 5(4): 545-557 (1992) - [c10]Robert P. Daley, Bala Kalyanasundaram, Mahendran Velauthapillai:
The Power of Probabilism in Popperian FINite Learning (extended abstract). AII 1992: 151-169 - [c9]Robert P. Daley, Bala Kalyanasundaram, Mahendran Velauthapillai:
Breaking the Probability 1/2 Barrier in FIN-Type Learning. COLT 1992: 203-217 - [c8]Robert P. Daley, Bala Kalyanasundaram:
Probabilistic and Pluralistic Learners with Mind Changes. MFCS 1992: 218-226 - [c7]Bala Kalyanasundaram, Kirk Pruhs:
A Competitive Analysis of Nearest Neighbor Based Algorithms for Searching Unknown Scenes (Preliminary Version). STACS 1992: 147-157 - [p1]Bala Kalyanasundaram, Georg Schnitger:
Communication Complexity and Lower Bounds for Sequential Computation. Informatik 1992: 253-268 - 1991
- [j2]Bala Kalyanasundaram, Georg Schnitger:
On the power of white pebbles. Comb. 11(2): 157-171 (1991) - [c6]Bala Kalyanasundaram, Kirk Pruhs:
Online Weighted Matching. On-Line Algorithms 1991: 93-94 - [c5]Bala Kalyanasundaram, Kirk Pruhs:
Visual Searching and Mapping. On-Line Algorithms 1991: 157-162 - [c4]Bala Kalyanasundaram, Kirk Pruhs:
On-Line Weighted Matching. SODA 1991: 234-240 - 1990
- [j1]Bala Kalyanasundaram, Georg Schnitger:
Rounds Versus Time for the Two Person Pebble Game. Inf. Comput. 88(1): 1-17 (1990)
1980 – 1989
- 1989
- [c3]Bala Kalyanasundaram, Georg Schnitger:
Rounds versus Time for the Two Person Pebble Game (Extended Abstract). STACS 1989: 517-529 - 1988
- [c2]Bala Kalyanasundaram, Georg Schnitger:
On the Power of White Pebbles (Extended Abstract). STOC 1988: 258-266 - 1987
- [c1]Georg Schnitger, Bala Kalyanasundaram:
The probabilistic communication complexity of set intersection. SCT 1987: 41-47
Coauthor Index
aka: Mahe Velauthapillai
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: