Sylvia Ratnasamy

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Mark Handley

> Home > Persons > Sylvia Ratnasamy

Publications

2009
[c32]
- view
  authority control:
- export record
  dblp key:
  - conf/npc/EgiGHIMMR09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/npc/EgiGHIMMR09
Norbert Egi, Adam Greenhalgh, Mark Handley, Gianluca Iannaccone, Maziar Manesh, Laurent Mathy, Sylvia Ratnasamy:
Improved Forwarding Architecture and Resource Management for Multi-Core Software Routers. NPC 2009: 117-124
2002
[c9]
- view
  authority control:
- export record
  dblp key:
  - conf/infocom/RatnasamyHKS02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/infocom/RatnasamyHKS02
Sylvia Ratnasamy, Mark Handley, Richard M. Karp, Scott Shenker:
Topologically-Aware Overlay Construction and Server Selection. INFOCOM 2002: 1190-1199
2001
[c4]
- view
  authority control:
- export record
  dblp key:
  - conf/ngc/RatnasamyHKS01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ngc/RatnasamyHKS01
Sylvia Ratnasamy, Mark Handley, Richard M. Karp, Scott Shenker:
Application-Level Multicast Using Content-Addressable Networks. Networked Group Communication 2001: 14-29
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/sigcomm/RatnasamyFHKS01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sigcomm/RatnasamyFHKS01
Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard M. Karp, Scott Shenker:
A scalable content-addressable network. SIGCOMM 2001: 161-172

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.