Bala Kalyanasundaram

2.0k total citations
37 papers, 861 citations indexed

About

Bala Kalyanasundaram is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Artificial Intelligence. According to data from OpenAlex, Bala Kalyanasundaram has authored 37 papers receiving a total of 861 indexed citations (citations by other indexed papers that have themselves been cited), including 21 papers in Computer Networks and Communications, 16 papers in Computational Theory and Mathematics and 13 papers in Artificial Intelligence. Recurrent topics in Bala Kalyanasundaram's work include Optimization and Search Problems (20 papers), Scheduling and Optimization Algorithms (10 papers) and Computability, Logic, AI Algorithms (10 papers). Bala Kalyanasundaram is often cited by papers focused on Optimization and Search Problems (20 papers), Scheduling and Optimization Algorithms (10 papers) and Computability, Logic, AI Algorithms (10 papers). Bala Kalyanasundaram collaborates with scholars based in United States, Netherlands and Switzerland. Bala Kalyanasundaram's co-authors include Kirk Pruhs, Georg Schnitger, Robert Daley, Serge Plotkin, Orli Waarts, Yossi Azar, Vineet Bafna, Andris Ambainis, Harry Buhrman and Eric Torng and has published in prestigious journals such as Journal of the ACM, SIAM Journal on Computing and BioTechniques.

In The Last Decade

Bala Kalyanasundaram

35 papers receiving 786 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Bala Kalyanasundaram United States 15 544 359 278 186 136 37 861
Orli Waarts United States 17 893 1.6× 225 0.6× 249 0.9× 119 0.6× 178 1.3× 35 1.1k
Joan Boyar Denmark 16 388 0.7× 230 0.6× 442 1.6× 110 0.6× 166 1.2× 74 835
Y. Bartal Israel 13 654 1.2× 354 1.0× 179 0.6× 82 0.4× 107 0.8× 24 938
Marco Protasi Italy 8 373 0.7× 500 1.4× 300 1.1× 79 0.4× 175 1.3× 29 979
Ola Svensson Switzerland 16 377 0.7× 315 0.9× 149 0.5× 114 0.6× 278 2.0× 69 789
Harald Räcke United States 16 904 1.7× 525 1.5× 214 0.8× 101 0.5× 65 0.5× 50 1.3k
Julia Chuzhoy United States 21 546 1.0× 645 1.8× 89 0.3× 86 0.5× 126 0.9× 62 961
Shalev Ben-David Canada 10 403 0.7× 188 0.5× 198 0.7× 139 0.7× 74 0.5× 29 610
Jeffery Westbrook United States 17 479 0.9× 356 1.0× 223 0.8× 56 0.3× 84 0.6× 34 766
Irène Charon France 17 393 0.7× 415 1.2× 326 1.2× 99 0.5× 124 0.9× 47 879

Countries citing papers authored by Bala Kalyanasundaram

Since Specialization
Citations

This map shows the geographic impact of Bala Kalyanasundaram's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Bala Kalyanasundaram with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Bala Kalyanasundaram more than expected).

Fields of papers citing papers by Bala Kalyanasundaram

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Bala Kalyanasundaram. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Bala Kalyanasundaram. The network helps show where Bala Kalyanasundaram may publish in the future.

Co-authorship network of co-authors of Bala Kalyanasundaram

This figure shows the co-authorship network connecting the top 25 collaborators of Bala Kalyanasundaram. A scholar is included among the top collaborators of Bala Kalyanasundaram based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Bala Kalyanasundaram. Bala Kalyanasundaram is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Morin, B., C. J. G. Plummer, Bala Kalyanasundaram, et al.. (2023). A fast analytical tool to investigate effects of railway superstructure components on track dynamics. 1. 1–5.
2.
Kalyanasundaram, Bala, et al.. (2010). Learning Behaviors of Functions. Fundamenta Informaticae. 98(2-3). 183–198.
3.
Kalyanasundaram, Bala, et al.. (2006). Capabilities of Thoughtful Machines. Fundamenta Informaticae. 74(2-3). 329–340. 1 indexed citations
4.
Kalyanasundaram, Bala & Kirk Pruhs. (2003). Minimizing flow time nonclairvoyantly. Journal of the ACM. 50(4). 551–567. 32 indexed citations
5.
Kalyanasundaram, Bala & Kirk Pruhs. (2002). Speed is as powerful as clairvoyance [scheduling problems]. 214–221. 29 indexed citations
6.
Ambainis, Andris, Harry Buhrman, William Gasarch, Bala Kalyanasundaram, & Leen Torenvliet. (2002). The communication complexity of enumeration, elimination, and selection. 41. 44–53. 1 indexed citations
7.
Ambainis, Andris, et al.. (2001). The Communication Complexity of Enumeration, Elimination, and Selection. Journal of Computer and System Sciences. 63(2). 148–185. 4 indexed citations
8.
Kalyanasundaram, Bala & Kirk Pruhs. (2000). Dynamic spectrum allocation: the impotency of duration notification. Journal of Scheduling. 3(5). 289–295. 1 indexed citations
9.
Kalyanasundaram, Bala & Kirk Pruhs. (2000). An optimal deterministic algorithm for online b-matching. Theoretical Computer Science. 233(1-2). 319–325. 106 indexed citations
10.
Kalyanasundaram, Bala, et al.. (2000). Errata: A New Algorithm for Scheduling Periodic, Real-Time Tasks. Algorithmica. 28(3). 269–270. 4 indexed citations
11.
Kalyanasundaram, Bala & Kirk Pruhs. (2000). Fault-Tolerant Real-Time Scheduling. Algorithmica. 28(1). 125–144. 9 indexed citations
12.
Kalyanasundaram, Bala & Kirk Pruhs. (1994). Constructing competitive tours from local information. Theoretical Computer Science. 130(1). 125–138. 33 indexed citations
13.
Bafna, Vineet, Bala Kalyanasundaram, & Kirk Pruhs. (1994). Not all insertion methods yield constant approximate tours in the Euclidean plane. Theoretical Computer Science. 125(2). 345–353. 8 indexed citations
14.
Daley, Robert, et al.. (1994). The power of probabilism in Popperian FINite learning. Journal of Experimental & Theoretical Artificial Intelligence. 6(1). 41–62. 7 indexed citations
15.
Daley, Robert, et al.. (1993). Capabilities of fallible FINite learning. 199–208. 3 indexed citations
16.
Daley, Robert & Bala Kalyanasundaram. (1993). Capabilities of probabilistic learners with bounded mind changes. 182–191. 6 indexed citations
17.
Kalyanasundaram, Bala & Kirk Pruhs. (1991). On-line weighted matching. Symposium on Discrete Algorithms. 234–240. 13 indexed citations
18.
Kalyanasundaram, Bala & Georg Schnitger. (1991). On the power of white pebbles. COMBINATORICA. 11(2). 157–171. 10 indexed citations
19.
Kalyanasundaram, Bala & Georg Schnitger. (1990). Rounds versus time for the two person pebble game. Information and Computation. 88(1). 1–17. 1 indexed citations
20.
Schnitger, Georg & Bala Kalyanasundaram. (1987). The probabilistic communication complexity of set intersection.. 45 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026