Javascript must be enabled to use this form.

UTDallas Research Explorer
 View Profile
    Faculty Profile — Is this you? Login to edit.Last Modified Time: 09:52:14 AM Thu, 17 Jun 2010 

This site is going away soon - please visit the new URL for this page.

You will be automatically redirected in 10 seconds.

Image of  Andras  Farago
 Contact InformationHelpHelp  
Andras Farago
Professor-Computer Science
Office MailstopMail Box: EC31, Room No.: ECS4204 
Email Address    Primary Phone Number 972-883-6885    Fax Number 972-883-2349    URL Faculty Homepage    Media Contact
Administrative Assistant:  Help  
Gary, Lynda
 Professional Preparation
 Dr. Habil.Electrical EngineeringTechnical University of Budapest1997
 Dr. Sci.Electrical EngineeringHungarian Academy of Sciences1996
 Ph.D.Electrical EngineeringTechnical University of Budapest1981
 M.ScElectrical EngineeringTechnical University of Budapest1979
 B.ScElectrical EngineeringTechnical University of Budapest1976
Collapse Section Expand Section Research and Expertise
Research Interests
Web Link
  • Algorithms, optimization and design problems in communication networks
  • Wireless network architectures and protocols, topology control, scalability analysis
  • High speed networks and protocols
Collapse Section Expand Section Publications
 2 3 4 Next>> 8>>  
  YearPublication  Type
In Press
Hongbing Lian and A. Farago, Optimizing Call Admission Control for Cognitive Radio Networks Using a New Heuristic Optimization Method", Science Academy Transactions on Computer and Commu- nication Networks, in press.
In Press
A. Farago, Analysis of Large Random Network Topologies", Invited Paper, Infocommunications Journal, in press.
A. Farago, Asymptotically Optimal Trade-O® Between Local and Global Connectivity in Wireless Networks", Performance Evaluation, vol. 68, 2011/2, pp. 142{156.
Hongbing Lian and A. Farago, Analysis of Call Admission Control for Multiservice Cognitive Radio Networks", Journal of Selected Areas in Telecommunications (JSAT), October 2011, pp. 18{25.
\ A. Farago, On the Structure of Classes of Random Graphs", Chicago Journal of Theoretical Computer Science, June 2010, Article 2010-5 (online journal,
Collapse Section Expand Section Presentations and Projects
Start DateEnd DatePresentation/Project
10/25/2002 10/25/2002 On Algorithmic Challenges in Networking
Invited Lecture:
Dept. of Computer Science, The University of Chicago
09/2001 09/2001 Improving the Simulated Annealing Optimization Technique via Parallelization
Invited Lecture:
University of Texas at Arlington
07/29/2005 07/29/2005 Random Graph Models for Ad Hoc Networks
Invited Lecture:
Dept. of Computer Science, The University of Chicago
05/2000 05/2000 Modeling Ad Hoc Network Topologies via Random Graphs
Invited Lecture:
High Speed Networking  International Workshop, Balatonfured, Hungary
05/1999 05/1999 Exact Reduced Load Equations
Invited Lecture:
High Speed Networking and Ericsson Simulation Techniques and Performance Analysis Joint International Workshop, Balatonfured, Hungary
Collapse Section Expand Section Appointments
DurationRankDepartment / SchoolCollege / OfficeUniversity / Company
1998-PresentProfessor of Computer ScienceDepartment of Computer Science University of Texas at Dallas
1997Szechenyi ProfessorDepartment of Telecommunications and Telematics Technical University of Budapest
1996Senior Research AssociateDepartment of Electrical and Computer Engineering Boston University
1995Senior Associate ProfessorDepartment of Telecommunications and Telematics Technical University of Budapest
1992-1997Director of Research of the High Speed Networks Laboratory  Technical University of Budapest
1991-1992(Sabbatical) Senior Research FellowDepartment of Electrical and Computer Engineering University of Massachusetts at Amherst
1982-1995Associate ProfessorDepartment of Telecommunications and Telematics Technical University of Budapest
1980-1981Visiting ScholarDepartment of Mathematics Virginia Polytechnic Institute
1976-1982Assistant ProfessorDepartment of Mathematics Technical University of Budapest
9/15/10-9/14/13Modeling and Analysis of Very Large NetworksNSFaccepted for fundingCurrent
9/01/01-8/31/06Meta-MAC Protocols: A New Dimension to Adaptation in Medium Access ControlNSF$300,000Previous
1/01/01-12/31/04Differentiated Reliability in Multi-layer Optical NetworksNSF$500,119Previous
10/01/06-9/30/10Collaborative Project (with Northeastern Univ.): Modeling Networks with Multiple Physical LayersNSF$350,000Current
10/01/02-9/30/07MERIT: A Formal Framework for Systematic Protocol AssessmentNSF$431,086Previous
 News Articles
Prof Says Tech Entering the Age of the Algorithm
UT Dallas News Center

Software professionals may soon have a whole new category of colleagues: algorithm developers.
That’s the conclusion of a UT Dallas researcher who speculates that as algorithms increasingly become the differentiator in software, algorithm developer jobs and algorithm engineering degrees may not be far behind.
Netflix paid $1 million two years ago for an algorithm – one of the basic building blocks of software programs – that would more accurately predict which films a customer would like. And with a California physicians network now staging a $3 million contest for a healthcare-related algorithm, “We may be witnessing the emergence of a new historic trend,” said Dr. András Faragó, a computer science professor in the Erik Jonsson School of Engineering and Computer Science.
The rise in the importance of algorithms, he added, parallels the earlier ascendance of software itself, which once played a secondary role to the original star, hardware.

       Teaching HelpHelp  
 Additional Information
  • Editor, Wireless Networks Journal
  • Editor, Journal on Applications of Graph Theory in Wireless Ad Hoc Networks and Sensor Networks

Professional Societies and Awards
  • Senior Member, IEEE (2004)
  • Member, IEEE (1999)
  • Founder member of the Hungarian Chapter of ACM (1992)
  • Member Janos Bolyai Mathematical Society (Hungary, 1990)
  • Niveau Award, Journal on Communications, 1988
  • Member, Scientific Society for Telecommunications (Hungary, 1983)

Courses Taught at UT Dallas
  • CS 4390   Computer Networks
  • CS 2305   Discrete Math for Computing I.
  • CS 3305   Discrete Math for Computing II.
  • CS 4349  Advanced Data Structures and Algorithms
  • CS 6385  Algorithmic Aspects of Telecommunication Networks

Please verify the information in this request and mention any changes or suggestions in the comments section. Email notifications and confirmations regarding this will be sent to you at fromEmail and the profile owner. If you would like to receive it at a different email address, please change the email address listed on your profile.
© 2018-2019 The University of Texas at Dallas About Explorer | Accessibility | Contact Explorer Team