Optimizing Component Interaction. - Mark N. Wegman; Karin Högstedt; Doug Kimelman; V. T. Rajan; Tova Roth; Nan Wang 001 (LCTES/OM, 2001)

Optimizing Component Interaction. - Karin Högstedt; Doug Kimelman; Nan Wang 001 (OM@PLDI, 2001)

Efficiency improvements for signature schemes with tight security reductions. - Jonathan Katz; Nan Wang 001 (CCS, 2003)

Structure of Social Contact Networks and Their Impact on Epidemics. - Stephen G. Eubank; V. S. Anil Kumar 001; Madhav V. Marathe; Aravind Srinivasan; Nan Wang 001 (Discrete Methods in Epidemiology, 2004)

Structural and algorithmic aspects of massive social networks. - Stephen G. Eubank; V. S. Anil Kumar 001; Madhav V. Marathe; Aravind Srinivasan; Nan Wang 001 (SODA, 2004)

Approximation algorithms for channel allocation problems in broadcast networks. - Rajiv Gandhi; Samir Khuller; Aravind Srinivasan; Nan Wang 001 (Networks, 2006)

Efficient Signature Schemes with Tight Reductions to the Diffie-Hellman Problems. - Eu-Jin Goh; Stanislaw Jarecki; Jonathan Katz; Nan Wang 001 (J. Cryptol., 2007)

Integrality Ratio for Group Steiner Trees and Directed Steiner Trees. - Eran Halperin; Guy Kortsarz; Robert Krauthgamer; Aravind Srinivasan; Nan Wang 001 (SIAM J. Comput., 2007)