1. Tor Instead of IP
    V. Liu, S. Han, A. Krishnamurthy, T. Anderson
    HotNets, 2011

  2. FairCloud: Sharing The Network In Cloud Computing
    L. Popa, A. Krishnamurthy, S. Ratnasamy, I. Stoica
    HotNets, 2011

  3. Machiavellian Routing: Poisoning ISPs to Avoid Routing Problems
    E. Katz-Bassett, D. Choffnes, C. Scott, I. Cunha, T. Anderson, A. Krishnamurthy
    HotNets, 2011

  4. Scalable Consistency in Scatter
    L. Glendenning, I. Beschastnikh, A. Krishnamurthy, T. Anderson
    SOSP, 2011

  5. Mining Temporal Invariants from Partially Ordered Logs
    I. Beschastnikh, Y. Brun, M. D. Ernst, A. Krishnamurthy, T. Anderson
    SLAML, 2011

  6. deSEO: Combating Search-Result Poisoning
    J. John, F. Yu, Y. Xie, A. Krishnamurthy, M. Abadi
    Usenix Security, 2011

  7. Heat-seeking honeypots: design and experience
    J. John, F. Yu, Y. Xie, A. Krishnamurthy, M. Abadi
    WWW, 2011

  8. ETTM: A Scalable Fault Tolerant Network Manager
    C. Dixon, H. Uppal, V. Brajkovic, D, Brandon, T. Anderson, A. Krishnamurthy
    NSDI, 2011.

  9. A Cost Comparison of Datacenter Network Architectures
    L. Popa, S. Ratnasamy, G. Iannaccone, A. Krishnamurthy, I. Stoica
    CoNEXT, 2010.

  10. Resolving IP Aliases with Prespecified Timestamps
    J. Sherry, E. Katz-Bassett, M. Pimenova, H. Madhyastha, T. Anderson, A. Krishnamurthy
    IMC, 2010.

  11. Comet: An Active Distributed Key-Value Store
    R. Geambasu, A. Levy, T. Kohno, A. Krishnamurthy, H. Levy
    OSDI, 2010.

  12. Retaining Sandbox Containment Despite Bugs in Privileged Memory-safe Code
    J. Cappos, A. Dadgar, J. Rasley, J. Samuel, I. Beschastnikh, C. Barsan, A. Krishnamurthy, T. Anderson
    CCS, 2010.

  13. Improving the Performance and Robustness of P2P Live Streaming with Contracts
    M. Piatek, A. Krishnamurthy
    ;login, 2010

  14. Privacy-preserving P2P data sharing with OneSwarm
    T. Isdal, M. Piatek, A. Krishnamurthy, T. Anderson
    Sigcomm, 2010.

  15. Searching the searchers using SearchAudit
     J. John, F. Yu, Y. Xie, M. Abadi, A. Krishnamurthy
    Usenix Security, 2010.

  16. Reverse Traceroute
    E. Katz-Bassett, H. Madhyastha, V. Adhikari, C. Scott, J. Sherry, P. van Wessep, T. Anderson, A. Krishnamurthy
    NSDI, 2010.

  17. Contracts: Practical Contribution Incentives for P2P Live Streaming
    M. Piatek, A. Krishnamurthy, A. Venkataramani, R. Yang, D. Zhang
    NSDI, 2010.

  18. Moving Beyond End-to-End Path Information to Optimize CDN Performance
     R. Krishnan, H. Madhyastha, S. Srinivasan, S. Jain, A. Krishnamurthy, T. Anderson, J. Gao
    IMC, 2009.
  19. Pitfalls for ISP-friendly P2P Design
     M. Piatek, H. Madhyastha, J. John, A. Krishnamurthy, T. Anderson
    Hotnets, 2009.

  20. An End to the Middle
     C. Dixon, A. Krishnamurthy, T. Anderson
    HotOS, 2009.

  21. Studying Spamming Botnets using Botlab
     J. John, A. Moshchuk, S. Gribble, A. Krishnamurthy
    NSDI, 2009.

  22. iPlane Nano: Path Prediction for Peer-to-Peer Applications
     H. Madhyastha, E. Katz-Bassett, T. Anderson, A. Krishnamurthy, A. Venkataramani
    NSDI, 2009.

  23. Seattle: The Internet as a Testbed
    J. Cappos, I. Beschastnikh, A. Krishnamurthy, T. Anderson.
    SIGCSE, 2009

  24. P4P: Provider Portal for (P2P) Applications
     H. Xie, R. Yang, A. Krishnamurthy, Y. Liu, A. Silberschatz
    Sigcomm, 2008.

  25. Privacy-Preserving Location Tracking of Lost or Stolen Devices:
    Cryptographic Techniques and Replacing Trusted Third Parties with DHTs
    T. Ristenpart, G. Maganis, A. Krishnamurthy, and T. Kohno
    Usenix Security, 2008.

  26. Challenges and Directions for Monitoring P2P File Sharing Networks -or-
    Why My Printer Received a DMCA Takedown Notice
     M. Piatek, T. Kohno, and A. Krishnamurthy
    HotSec, 2008.

  27. Consensus routing: the Internet as a distributed system
     J. John, E. Katz-Bassett, A. Krishnamurthy, T. Anderson, A. Venkataramani
    NSDI, 2008.

  28. Phalanx: Withstanding multimillion-node botnets
     C. Dixon, T. Anderson, A. Krishnamurthy
    NSDI, 2008.

  29. Studying blackholes in the Internet with Hubble
     E. Katz-Bassett, H. Madhyastha, J. John, A. Krishnamurthy, D. Wetherall, T. Anderson
    NSDI, 2008.

  30. One hop Reputations for Peer to Peer File Sharing Workloads
     M. Piatek, T. Isdal, A. Krishnamurthy, T. Anderson
    NSDI, 2008.

  31. Profiling a million user DHT
     J. Falkner, M. Piatek, J. John, A. Krishnamurthy, T. Anderson
    IMC, 2007.

  32. A case for holistic incentive design
     M. Piatek, T. Anderson, A. Krishnamurthy
    FuDiCo, 2007

  33. Building BitTyrant, a (More) Strategic BitTorrent Client
     M. Piatek, T. Isdal, T. Anderson, A. Krishnamurthy, A. Venkataramani
    ;login: (August 2007).

  34. Do incentives build robustness in BitTorrent?
    M. Piatek, T. Isdal, T. Anderson, A. Krishnamurthy, A. Venkataramani
    NSDI, 2007.

  35. Leveraging BitTorrent for End Host Measurements
     T. Isdal, M. Piatek, A. Krishnamurthy, T. Anderson
    PAM, 2007.

  36. Towards IP Geolocation using Delay and Topology Measurements
     E. Katz-Bassett, J. John, A. Krishnamurthy, D. Wetherall, T. Anderson, Y. Chawathe
    IMC, 2006.

  37. A Structural Approach to Latency Prediction
     H. Madhyastha, T. Anderson, A. Krishnamurthy, N. Spring, A. Venkataramani
    IMC, 2006.

  38. iPlane: An Information Plane for Distributed Services
     H. Madhyastha, T. Isdal, M. Piatek, C. Dixon, T. Anderson, A. Krishnamurthy, A. Venkataramani
    OSDI, 2006.

  39. Optimal Capacity Sharing of Network with Multiple Overlays
     Z. Ma, J. Chen, R. Yang, A. Krishnamurthy
    IWQoS, 2006.

  40. PCP: Efficient Endpoint Congestion Control
     T. Anderson, A. Collins, A. Krishnamurthy, J. Zahorjan.
    NSDI, 2006.

  41. Oasis: An Overlay-Aware Network Stack
     H. Madhyastha, A. Venkataramani, A. Krishnamurthy, T. Anderson
    Operating Systems Review, 2006.

  42. Secure Routing
    I. Avramopoulos, H. Kobayashi, A. Krishnamurthy, R. Wang
    Network Security, Wiley, 2006.

  43. Stable Route Selection for Interdomain Traffic Engineering
    R. Yang, H. Xie, H. Wang, L. Li, Y. Liu, A. Silberschatz, A. Krishnamurthy
    IEEE Network, 2005.

  44. Combining Flexibility and Scalability in a Peer-to-Peer Publish/Subscribe System
    C. Zhang, A. Krishnamurthy, R. Wang
    Middleware, 2005.

  45. Network Localization in Partially Localizable Networks
    D. Goldenberg, A. Krishnamurthy, W. Maness, R. Yang, A. Young, A. Savvides.
    Infocom 2005.

  46. A Collision Model for Randomized Routing in Fat-Tree Networks
    V. Strumpen, A. Krishnamurthy
    Journal of Parallel and Distributed Computing, 2005

  47. Brushwood: Distributed Trees in Peer-to-Peer Systems
    C. Zhang, A. Krishnamurthy, R. Wang.
    IPTPS, 2005.

  48. Bridging the digital divide: storage media + postal network = generic high-b/w communication
    N. Garg, S. Sobti, F. Zheng, J.Lai, K. Li, A. Krishnamurthy, R. Wang.
    ACM Transactions on Storage Systems, 2005.

  49. Turning the Postal System into a Generic Digital Communication Mechanism
    R. Wang, N. Garg, S. Sobti, E. Ziskind, J. Lai, A. Krishnamurthy.
    Sigcomm 2004.

  50. Managing a Portfolio of Overlay Paths
    D. Antonova, A. Krishnamurthy, Z. Ma, and R. Sundaram.
    NOSSDAV, 2004.

  51. Load Balancing and Locality in Range-Queriable Data Structures
    J. Aspnes, J. Kirsch, A. Krishnamurthy.
    PODC, 2004.

  52. A Transport Layer Approach for Improving End-to-End Performance Using Redundant Paths
    M. Zhang, J. Lai, A. Krishnamurthy, L. Peterson, R. Wang.
    Usenix Annual Technical Conference, 2004.

  53. Segank: A Distributed Mobile Storage System
    S. Sobti, N. Garg, F. Zheng, J. Lai, A. Krishnamurthy, R. Wang.
    FAST, 2004.

  54. Network-Embedded Programmable Storage and Its Applications
    S. Sobti, J. Lai, Y. Shao, N. Garg, C. Zhang, F. Zheng, A. Krishnamurthy, R. Wang
    IFIP Conference on Networking, 2004.

  55. Overlay Mesh Construction Using Interleaved Spanning Trees
    A. Young, J. Chen, Z. Ma, A. Krishnamurthy, L. Peterson, R. Wang.
    Infocom 2004.

  56. Highly Secure and Efficient Routing
    I. Avramopoulos, H. Kobayashi, R. Wang, and A. Krishnamurthy.
    Infocom 2004. Ammendment

  57. Polynomial-time algorithms for enforcing sequential consistency in SPMD programs with arrays
    W. Chen, A. Krishnamurthy, K. Yelick.
    Languages and Compilers for Parallel Computing, 2003.

  58. Considering the Energy Consumption of Mobile Storage Alternatives
    F. Zheng, S. Sobti, N. Garg, C. Zhang, A. Krishnamurthy, R. Wang.
    IEEE Symposium on Modeling, Analysis and Simulation of Computer Systems, 2003.

  59. Approximation and Collusion in Multicast Cost Sharing
    A. Archer, J. Feigenbaum, A. Krishnamurthy, R. Sami, S. Shenker.
    Games and Economic Behavior, 2003.

  60. Exploiting Bias in the Hysteresis Bit of 2-bit Saturating Counters in Branch Predictors
    G. Loh, D. Henry, A. Krishnamurthy.
    Journal of Instruction Level Parallelism, 2003.

  61. Modeling Hard Disk Power Consumption
    J. Zedlewski, S. Sobti, N. Garg, A. Krishnamurthy, R. Wang.
    FAST, 2003.

  62. Hardness results for multicast cost sharing
    J. Feigenbaum, A. Krishnamurthy, R. Sami, S. Shenker.
    Theoretical Computer Science, 2003.
    Conference version in FSTTCS 2002.

  63. Probabilistic Packet Scheduling: Achieving Proportional Bandwidth Allocation
    M. Zhang, R. Wang, L. Peterson, A. Krishnamurthy.
    Infocom 2002.

  64. Configuring and Scheduling an Eager-Writing Disk Array
    C. Zhang, X. Yu, A. Krishnamurthy, R. Wang.
    FAST, 2002

  65. PersonalRAID: Mobile Storage for Distributed and Disconnected Computers
    S. Sobti, N. Garg, X. Yu, C. Zhang, A. Krishnamurthy, R. Wang.
    FAST, 2002

  66. Approximation and Collusion in Multicast Cost Sharing
    J. Feigenbaum, A. Krishnamurthy, R. Sami, S. Shenker.
    ACM Conference on E-Commerce, 2001.

  67. Trading Capacity for Performance in Disk Array
    X. Yu, R. Wang, K. Li, A. Krishnamurthy, T. Anderson.
    OSDI, 2000.

  68. Modeling Communication Pipeline Latency
    R. Wang, A. Krishnamurthy, R. Martin, T. Anderson, D. Culler.
    SIGMETRICS, 1998.

  69. Titanium: A High-Performance Java Dialect
    ACM Workshop on Java for High-Performance Network Computing. Also in Concurrency: Practice and Experience, 1998.

  70. Analyses and Optimizations for Shared Address Space Programs
    A. Krishnamurthy and K. Yelick.
    Journal of Parallel and Distributed Computation, 1996.

  71. Evaluation of Architectural Support for Global Address-Based Communication in Large Scale Parallel Machines
    A. Krishnamurthy, K. Schauser, C. Scheiman, R. Wang, D. Culler, K. Yelick,
    ASPLOS, 1996.

  72. Towards Modeling the Performance of a Fast Connected Components Algorithm on Parallel Machines
    S. Lumetta, A. Krishnamurthy, D. Culler, Supercomputing '95.

  73. Empirical Evaluation of the CRAY-T3D: A Compiler Perspective
    R. Arpaci, D. Culler, A. Krishnamurthy, S. Steinberg, K. Yelick,
    ISCA, 1995.

  74. Optimizing Parallel Programs with Explicit Synchronization
    A. Krishnamurthy and K. Yelick
    PLDI, 1995.

  75. Portable Parallel Irregular Applications.
    K. Yelick, C.-P. Wen, S. Chakrabarti, E. Deprit, J. Jones, A. Krishnamurthy,
    Workshop on Parallel Symbolic Languages and Systems, 1995.

  76. Runtime Support for Portable Distributed Data Structures.
    C.-P. Wen, S. Chakrabarti, E. Deprit, A. Krishnamurthy and K. Yelick,
    Workshop on Languages, Compilers, and Runtime Systems for Scalable Computers, 1995.

  77. Efficient Parallel Algorithms for Permutation Graphs
    A. Krishnamurthy, V. Kamakoti, C. P. Rangan
    Journal of Parallel and Distributed Computing, 1995.

  78. Connected Components on Distributed Memory Machines
    A. Krishnamurthy, S. Lumetta, D. Culler, K. Yelick,
    Parallel Algorithms, Dimacs Series in Discrete Mathematics and Theoretical Computer Science, 1994.

  79. Optimizing Parallel SPMD Programs
    A. Krishnamurthy and K. Yelick,
    Workshop on Languages and Compilers for Parallel Computing, 1994.

  80. Connected domination and Steiner set on Weighted Permutation Graphs
    A. Krishnamurthy, C. P. Rangan
    Information Processing Letters, 1993.

  81. Data Structures for Irregular Applications
    K. Yelick, S. Chakrabarti, E. Deprit, J. Jones, A. Krishnamurthy, C.-P. Wen,
    DIMACS Workshop on Parallel Algorithms for Unstructured and Dynamic Problems, 1993.

  82. Parallel Programming in Split-C
    D. Culler, A. Dusseau, S. Goldstein, A. Krishnamurthy, S. Lumetta, T. von Eicken, K. Yelick.
    Supercomputing, 1993.