pre {mso-bidi-font-family:"Times New Roman";}

Ashish Goel ’s Research

 

 

Publications:

Chronological

By Subject:

Molecular algorithms

Internet and network algorithms

Internet commerce, social networks, decision making with sparse information, and game theory

General theory (eg. Approximation/online/stochastic/graph algorithms)

A small representative set

PhD Thesis

 

Research Interests:

Methodological: Algorithms, optimization, stochastics, graph theory.

Applications: Network and Internet algorithms; molecular algorithms; Internet commerce and social networks.

Help!! What is the largest known instance of precise counting in nature?

 

Conference

Program

Committees:

Current: ICALP 2009; DNA 2009; Local arrangements co-chair for EC 2009

 

Old: Approx 2008 (chair); DNA 2008 (chair); EC 2007; DNA 2007; SPAA 2006; EC 2006; FOCS 2005; Sigmetrics 2005; DNA 2005; Infocom 2004; CAAN 2004; Sigmetrics 2003; SODA 2002; APPROX 2002

 

Editorial Board: Algorithmica

 

PhD Students:

Current

Morteza Ibrahimi

Hamid Nazerzadeh (jointly advised with Amin Saberi)

Ian Post

Rajendra Shinde

 

Graduated

Mihaela Enachescu

Chris Luhrs

Rajat Bhattacharjee

Ho-Lin Chen

Mei Wang

Sung-Woo Cho

Pablo Moisset de espanes

Sanatan Rai

Hui Zhang

Debojyoti Dutta

Rishi Bhargava (MS)

 

 

 

Chronological list of most of my publications: 

 

(Technical notes, drafts etc):

 

A Security Protocol Gateway for a Scalable Web Service. With D. L. Caswell. Hewlett Packard Labs Technical Report HPL-96-07. 

 

Publications, roughly classified by topic (sometimes duplicated, sometimes omitted):

Molecular Algorithms.

During the last decade, bio-chemical molecules such as nucleic acids and proteins have been used in ingenious ways to perform engineering tasks in a laboratory setting in vitro (i.e. outside any biological cell). DNA and RNA in particular are very promising since their functionality is largely combinatorial which allows us to reason about these molecules algorithmically. The algorithmic primitives provided by nucleic acids and enzymes are both rich and powerful. How can we use these basic primitives (such as base pairing, enzymatic reactions,  strand invasion etc) to perform programmable engineering tasks such as self-assembly, computation, and actuation? While the hard work in this field is being done by experimentalists, I believe that theory also has an important role to play.

 

Internet and network algorithms.

 

Internet commerce, social networks, decision making with sparse information, and game theory.

 

General algorithms/theory papers.

 

A small representative set of publications: If you would like to get a quick flavor of my research (e.g., if you are a student), please look at the following papers. There are not my “best papers”, and I wouldn’t know how to define such a set, but they best represent my current and evolving research interests.

·       Pricing for fairness: distributed resource allocation for multiple objectives. S. Cho and A. Goel. To appear in ACM Symposium on Theory of Computing, 2006.

·       Sharp thresholds for monotone properties in random geometric graphs. A. Goel, S. Rai, and B. Krishnamachari. To appear in Annals of Applied Probability. Preliminary version in ACM Symposium on Theory of Computing, 2004.

·       Instability of FIFO at Arbitrarily Low Rates in the Adversarial Queueing Model. R. Bhattacharjee and A. Goel. IEEE Foundations of Computer Science, 2003.

·      Running time and program size for self-assembled squares. With L. Adleman, Q. Cheng, and M.-D. Huang. ACM Symposium on Theory of Computing, 2001.

·      Matching Output Queueing with a Combined Input Output Queued Switch. With S. Chuang, N. McKeown, and B. Prabhakar. In IEEE Infocom'99 and in the Journal on Selected Areas in Communication, June '99. (Invited talk at the Gigabit Networking Workshop, Infocom'98).

Thesis: Algorithms for Network Routing, Multicasting, Switching, and Design. Computer Science Department, Stanford University. July, 1999. Advisor: Serge Plotkin.

Copyright Notice: Since most of these papers are published, the copyright has been transferred to the respective publishers. Therefore, the papers cannot be duplicated for commercial purposes. The following is ACM's copyright notice; other publishers have similar ones (copyright notice itself copied from Chandra Chekuri’s webpageJ).

Copyright _ 199x by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that new copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted.