Nan Wang

According to our database, Nan Wang authored at least 8 papers between 2001 and 2007.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2007

Efficient Signature Schemes with Tight Reductions to the Diffie-Hellman Problems.

Eu-Jin Goh, Stanislaw Jarecki, Jonathan Katz, Nan Wang

J. Cryptol., 2007

2004

Structural and algorithmic aspects of massive social networks.

Stephen G. Eubank, V. S. Anil Kumar, Madhav V. Marathe, Aravind Srinivasan, Nan Wang

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Structure of Social Contact Networks and Their Impact on Epidemics.

Stephen G. Eubank, V. S. Anil Kumar, Madhav V. Marathe, Aravind Srinivasan, Nan Wang

Proceedings of the Discrete Methods in Epidemiology, 2004

2003

Integrality ratio for group Steiner trees and directed steiner trees.

Eran Halperin, Guy Kortsarz, Robert Krauthgamer, Aravind Srinivasan, Nan Wang

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Approximation Algorithms for Channel Allocation Problems in Broadcast Networks.

Rajiv Gandhi, Samir Khuller, Aravind Srinivasan, Nan Wang

Proceedings of the Approximation, 2003

Efficiency improvements for signature schemes with tight security reductions.

Jonathan Katz, Nan Wang

Proceedings of the 10th ACM Conference on Computer and Communications Security, 2003

2001

Optimizing Component Interaction.

Karin Högstedt, Doug Kimelman, Nan Wang

Proceedings of the 2001 ACM SIGPLAN Workshop on Optimization of Middleware and Distributed Systems, 2001

Optimizing Component Interaction.

Mark N. Wegman, Karin Högstedt, Doug Kimelman, V. T. Rajan, Tova Roth, Nan Wang

Proceedings of The Workshop on Languages, 2001