- M.S. in Electrical Engineering from the University of Wisconsin at Madison, USA, with specialization in communications and signal processing and research in wireless communications and information theory.
- B.S. in Electrical Engineering from Marquette University, Milwaukee, Wisconsin, USA, with a major in Electrical and Computer Engineering, a second major in Mathematics, and a minor in Computer Science.
- Prof. Ganesan’s research results for the past 22 years have been in the area of discrete applied mathematics. His work has been published in journals such as IEEE Transactions on Communications, Linear Algebra and its Applications, IEEE Transactions on Information Theory, Applied Mathematics Letters, Wireless Networks, Discrete Mathematics, Journal of Algebraic Combinatorics, Discrete Applied Mathematics, and IEEE/ACM Transactions on Networking.
- He has taught several subjects in computer science and engineering, including programming, data structures, design and analysis of algorithms, discrete mathematics and graph theory, computer networks, information security, engineering mathematics, theory of computation and compiler design, and mathematical foundations of computer science.
- He was a co-op engineer at Eaton Corporation, Milwaukee, Wisconsin, USA, where he developed mathematical models and software at the System Analysis and Design Division.
- He was a Research and Teaching Assistant at the University of Wisconsin at Madison and the University of California at Berkeley, and a faculty member at several engineering institutions.
- He has received many academic awards and honors, including the Top Scholar in Curriculum Award from Marquette University, the Frank Rogers Bacon Fellowship from UW-Madison, and the Regents’ Fellowship from UC-Berkeley. He is a member of Eta Kappa Nu, Pi Mu Epsilon, and Tau Beta Pi.
Areas of Expertise
- Data mining algorithms
- Distributed algorithms
- Graphs and algorithms in communication networks
- Discrete mathematics and graph theory
- Interconnection networks
- Applied combinatorics
Research & Professional Interests
His research areas include distributed algorithms, graphs and algorithms in communication networks, discrete mathematics and graph theory, interconnection networks, and applied combinatorics.
Lab/Research Group Affiliation
- Prof. Ganesan leads the Distributed Algorithms and Networks R&D group at INSOFE. He is also affiliated with the RASCoD, Supply Chain and Deep Learning R&D groups.