G. Shah

Skip graphs

James Aspnes, Gauri Shah, J. Aspnes, 2003, SODA '03.

Greedy Routing in Peer-to-Peer Systems ∗

J. Aspnes, G. Shah, Zoë Diamadi, 2006 .

A pr 2 00 9 Ulam ’ s conjecture is true for connected graphs ∗

J. Aspnes, G. Shah, 2003 .

Fault-tolerant routing in peer-to-peer systems

James Aspnes, Zoë Diamadi, Gauri Shah, 2002, PODC '02.

A Combinatorial Toolbox for Protein Sequence Design and Landscape Analysis in the Grand Canonical Model

Ming-Yang Kao, James Aspnes, Junhyong Kim, 2001, J. Comput. Biol..

Searching service repositories by combining semantic and ontological matching

Tanveer F. Syeda-Mahmood, Richard Goodwin, Rama Akkiraju, 2005, IEEE International Conference on Web Services (ICWS'05).

Semantic search of schema repositories

Tanveer F. Syeda-Mahmood, Lingling Yan, Gauri Shah, 2005, WWW '05.