( en | de | ru )

 

Disambiguation of "Kalyanasundaram, Bala"

Author of the publication

copydeleteadd this publication to your clipboard
A Competitive Analysis of Nearest Neighbor Based Algorithms for Searching Unknown Scenes (Preliminary Version).

, and . STACS, volume 577 of Lecture Notes in Computer Science, page 147-157. Springer, (1992)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Kiran Bala

Kavita Bala

Andreas Bala

Sruti Bala

Juraj Balà

 

Other publications of authors with the same name

On-Demand Broadcasting Under Deadline., and . ESA, volume 2832 of Lecture Notes in Computer Science, page 313-324. Springer, (2003)Visual Searching and Mapping., and . On-Line Algorithms, volume 7 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 157-162. DIMACS/AMS, (1991)Constructing Competitive Tours from Local Information., and . Theor. Comput. Sci., 130 (1): 125-138 (1994)The Power of Probabilism in Popperian FINite Learning (extended abstract)., , and . AII, volume 642 of Lecture Notes in Computer Science, page 151-169. Springer, (1992)An Optimal Deterministic Algorithm for Online b-Matching., and . FSTTCS, volume 1180 of Lecture Notes in Computer Science, page 193-199. Springer, (1996)The Online Transportation Problem., and . ESA, volume 979 of Lecture Notes in Computer Science, page 484-493. Springer, (1995)Scheduling Broadcasts in Wireless Networks., , and . ESA, volume 1879 of Lecture Notes in Computer Science, page 290-301. Springer, (2000)Fault-Tolerant Real-Time Scheduling., and . ESA, volume 1284 of Lecture Notes in Computer Science, page 296-307. Springer, (1997)On-Line Load Balancing of Temporary Tasks., , , , and . J. Algorithms, 22 (1): 93-110 (1997)Unlocking the Advantages of Dynamic Service Selection and Pricing., , and . Theory Comput. Syst., 38 (4): 393-410 (2005)