Bureaucrats, editor, Administrators
28
edits
Changes
no edit summary
<li> Applied Algorithmics:
<li> Applied Algorithmics:
[http://www.umiacs.umd.edu/~joseph/ Joseph Ja'Ja'],
[http://www.umiacs.umd.edu/~joseph/ Joseph Ja'Ja'],
[http://www.cs.umd.edu/~hajiagha/ Mohammad Hajiaghayi],
[http://www.cs.umd.edu/~samir Samir Khuller],
[http://www.cs.umd.edu/~samir Samir Khuller],
[http://www.cs.umd.edu/~mount/ David Mount],
[http://www.cs.umd.edu/~mount/ David Mount],
<br>
<br>
Applying rigorously developed theory to practical problems arising in, e.g., networks, graphics, image processing, architecture, and social networks and epidemiology. Research at UMD in this area is often undertaken in collaboration with faculty in application areas. A sample of issues covered includes: how to schedule data upload in high-volume Web servers, nearest-neighbor searching, fast interpolation for ray-tracing, scheduling multimedia delivery from replicated sources, and exploiting the massive parallelism in upcoming parallel architectures.
Applying rigorously developed theory to practical problems arising in, e.g., networks, graphics, image processing, architecture, and social networks and epidemiology. Research at UMD in this area is often undertaken in collaboration with faculty in application areas. A sample of issues covered includes: how to schedule data upload in high-volume Web servers, nearest-neighbor searching, fast interpolation for ray-tracing, scheduling multimedia delivery from replicated sources, and exploiting the massive parallelism in upcoming parallel architectures.
<br><br>
<li> Algorithmic Game Theory:
[http://www.cs.umd.edu/~hajiagha/ Mohammad Hajiaghayi],
[http://www.cs.umd.edu/~srin/ Aravind Srinivasan],
<br>
Mechanism Design in particular Algorithmic Game Theory, which can be viewed as "incentive-aware algorithm design", has become an increasingly important part of (theoretical) computer science in recent years. Recent results show a strong relation between computer science (esp. networking) and economics (esp. game theory), and techniques from each seem well-poised to help with key problems of the other. Our main goal in this area is to study these connections which produce powerful mechanisms for adaptive and networked environments and several other applied areas, and improve the experience of users of the Web and the Internet. To this end, we do research in several topics such as algorithmic mechanism design; auctions (efficient, revenue-maximizing, sponsored search, etc.); congestion and potential games; cost sharing; existence, computation, and learning of equilibria; game theory in the Internet; network games; price of anarchy; selfish routing, etc.
<br><br>
<br><br>
<li> Approximation Algorithms:
<li> Approximation Algorithms:
[http://www.cs.umd.edu/~samir Samir Khuller],
[http://www.cs.umd.edu/~samir Samir Khuller],
[http://www.cs.umd.edu/~hajiagha/ Mohammad Hajiaghayi],
[http://www.cs.umd.edu/~srin/ Aravind Srinivasan],
[http://www.cs.umd.edu/~srin/ Aravind Srinivasan],
[http://www.umiacs.umd.edu/~vishkin/ Uzi Vishkin]
[http://www.umiacs.umd.edu/~vishkin/ Uzi Vishkin]
<br><br>
<br><br>
<li> Randomized Algorithms:
<li> Randomized Algorithms:
[http://www.cs.umd.edu/~hajiagha/ Mohammad Hajiaghayi],
[http://www.cs.umd.edu/~jkatz/ Jonathan Katz],
[http://www.cs.umd.edu/~jkatz/ Jonathan Katz],
[http://www.cs.umd.edu/~srin/ Aravind Srinivasan]
[http://www.cs.umd.edu/~srin/ Aravind Srinivasan]
distributed algorithms. On the more theoretical side, we are also interested in studying the limits to which randomization
distributed algorithms. On the more theoretical side, we are also interested in studying the limits to which randomization
can be useful in computation.
can be useful in computation.
</ul>
</ul>