معرفی
Andras Farago is a Professor of Computer Science at the University of Texas at Dallas (UT Dallas) within the Erik Jonsson School of Engineering and Computer Science. He holds concurrent roles including Szechenyi Professor at the Technical University of Budapest (1997–2018) and previously held senior research and academic positions globally. His professional preparation includes multiple doctorates: Dr. Habil. (1997), Dr. Sci. (1996), and Ph.D. (1981) in Electrical Engineering from the Technical University of Budapest and Hungarian Academy of Sciences.
Research interests focus on algorithms for communication networks, wireless architectures, and high-speed protocols. Notable areas include topology control in ad hoc networks, scalability analysis, and optimization techniques like simulated annealing. His work bridges theoretical foundations (e.g., random graph models) with practical applications in network design.
Publications emphasize algorithmic challenges in networking, with recent work exploring cognitive radio networks and large-scale network topology analysis. His research has been supported by NSF grants totaling over $1.5M, including projects on multi-layer optical networks and protocol assessment frameworks.
- Awards: Niveau Award (1988), Senior IEEE Membership (2004)
- Editorships: Wireless Networks Journal, Journal on Applications of Graph Theory in Wireless Networks
- Teaching: Courses include Computer Networks, Discrete Mathematics, and Algorithmic Telecommunication Networks.
He directed the High Speed Networks Laboratory at the Technical University of Budapest (1992–1997) and has held visiting roles at institutions like the University of Massachusetts and Virginia Tech. Current research trends prioritize algorithm development for modern networking challenges, reflecting his vision of algorithms as a transformative field in software engineering.
