Track: Software Technology
Minitrack: Algorithmic Challenges in Emerging Applications of
--------------- Computing

Algorithmic challenges arise in many emerging areas of computing. Security, bioinformatics, quantum computing, power management and algorithmic game theory are examples of such areas. For instance, in the area of algorithmic game theory, economic agents are in varying degrees of collaboration and competition, and questions about equilibria arise.  The study of combinatorial auctions gives insight into complex interactions of such agents on the Internet. In the area of power management for mobile devices like PDAs, sensors, cell phones and laptops, improvements in battery technology lag behind the dramatic improvement in hardware.  Online algorithms allow power management schemes to schedule resources without full knowledge of future demands.  In information security, investigations into efficient algorithms for secure dissemination of information, cyberforensics, and prevention of cybercrime are in great demand.

Topics and research areas include, but are not limited to:
* Algorithmic challenges involving online and randomized algorithms, scheduling theory, approximation algorithms, optimization, and algorithmic complexity

Co-chairs:
Linda Morales (Primary Contact)
Computer Science Department
Erik Jonsson School of Engineering and Computer Science
University of Texas at Dallas
EC32, P.O. Box 830688, Richardson, TX 75083-0688, USA
Direct phone: +1-214-642-0728
Departmental phone: +1-972-883-2808
Fax: +1-972-883-2399
Email: lmorales@utdallas.edu

Wolfgang W. Bein
Center for the Advanced Study of Algorithms (CASA)
Howard R. Hughes College of Engineering
School of Computer Science            
University of Nevada, Las Vegas  89154-4019
Direct phone: +1-702-895-1477
Departmental phone: +1-702-895-3681
Fax: +1-702-895-5222
Email: bein@cs.unlv.edu