AT&T Home | AT&T Labs, Inc.
Search Research

HOME

WHO WE ARE
About Us
Innovators
Our People
In the Community
Locations
Career Opportunities

WHAT WE DO
Research Areas
Projects
Software Tools
Licensing Portfolio
Patents

COLLABORATION
Universities
Industry

NEWS & INFORMATION
AT&T Labs News
Publications

SITE FEEDBACK

David Johnson

 

DAVID S JOHNSON
email: dsj@research.att.com
180 PARK AVE - BUILDING 103
FLORHAM PARK, NJ, 07932

HomePage: http://www.research.att.com/~dsj


My Projects

-> AS-Level Traceroute
-> Algorithms and Optimization

Selected Publications

-> Compressing Rectilinear Pictures and Minimizing Access Control Lists. David Applegate, Gruia Calinescu, David S. Johnson, Howard Karloff, Katrina Ligett, and Jia Wang. Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA), 2007

-> Scalable and Accurate Identification of AS-Level Forwarding Paths. Zhuoqing Mao, David Johnson, Jennifer Rexford, Jia Wang, and Randy Katz. Proceedings of IEEE INFOCOM, Hong Kong, China, 2004

-> Efficient and Robust Streaming Provisioning in VPNs. Zhuoqing M. Mao, David S. Johnson, Oliver Spatscheck, Jacobus E. Van Der Merwe, Jia Wang. International World Wide Web Conference: Proceedings of the 12th International Conference on World Wide Web, May 20-24, 2003, 2003

-> Experimental Analysis of Heuristics for the ATSP. David Johnson, M.A. McGeoch. The Traveling Salesman Problem and its Variations; Kluwer Academic Publishers, 2002

-> Experimental Analysis of Heuristics for the STSP. David Johnson, M.A. McGeoch. The Traveling Salesman Problem and its Variations; Kluwer Academic Publishers, 2002

-> Perfect Packing Theorems and the Average-Case Behavior of Optimal and Online Bin Packing. E. G. Coffman, David S. Johnson, Peter W. Shor, C. Courcoubetis, M. R. Garey, R. R. Weber, M. Yannakakis. SIAM Review, 2002

-> Approximation Algorithms for Bin Packing: A Survey. David Johnson, Dorit S. Hochbaum, E. G. Coffman, Jr., M. R. Garey. Approximation Algorithms for NP-Hard Problems, 1996