Changes

='''Algorithms and Theory Group'''=  

='''Algorithms and Theory Group'''=  

'''Department of Computer Science[http://www.cs.umd.edu/], University of Maryland, College Park[http://www.umd.edu/]'''.

'''[http://www.cs.umd.edu/ Department of Computer Science], [http://www.umd.edu/ University of Maryland, College Park]'''.

<br>

<br>

Welcome to the Wiki for our group!

Welcome to the Wiki for our group! You also follow us on Twitter [https://twitter.com/theorycsumd @theorycsumd ]

Theoretical Computer Science (TCS), broadly speaking, is concerned with understanding the very nature of computation:

Research in Theory of Computation includes three parts. <BR>

What problems can be solved by computers? And how efficiently can such problems be solved? Can `hard' problems be used to our advantage in any way? TCS encompasses research in such diverse areas as complexity theory, algorithms, cryptography, distributed computing, machine learning, and more; the common thread is a focus on precise models and rigorous mathematical analysis of particular problems within those models.

  '''<li>'''

  Abstract salient features of a computational task; the outcome of abstraction  is usually a mathematical model.

  Go back and relate the contributions of studies within the model to the motivating computational task.

We have a strong group of faculty actively working in this area. We also have a large number of students who are encouraged to get involved early by attending weekly TCS reading groups run by the group. Brief descriptions of faculty research interests follow.

The motivation may arise from a specific application, a whole application area, or from more foundational considerations. The former cases lead to designing and analyzing algorithms useful for the understanding of the motivating application. In the latter case, perhaps more similar to traditional areas of Mathematics, practical applicability may sometimes emerge as a by-product.  

== '''''Main Research Areas''''': ==

== '''''Main Research Areas''''': ==

<li> '''Algorithmic Game Theory''':

<li> '''Algorithmic Game Theory''':

[http://www.cs.umd.edu/~hajiagha/ Mohammad Hajiaghayi],

[http://www.cs.umd.edu/~hajiagha/ Mohammad Hajiaghayi],

[http://www.cs.umd.edu/~srin/ Aravind Srinivasan],

[http://www.cs.umd.edu/~srin/ Aravind Srinivasan]

<br>

<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.

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>'''Bioinformatics and Computational Biology''':

<li>'''Bioinformatics and Computational Biology''':

[http://www.cbcb.umd.edu/~mpop Mihai Pop]

[http://www.cbcb.umd.edu/~mpop Mihai Pop]

<br>

<br>

<br>

<br>

Strings of characters (or bits) is an elementary form for representing information. Pattern matching problems on strings have provided a fertile ground for idea-driven algorithmic research.

Strings of characters (or bits) is an elementary form for representing information. Pattern matching problems on strings have provided a fertile ground for idea-driven algorithmic research.

<br><br>

<br><br>