Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Kate Keahey

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 Mert Cevik

> Home > Persons > Kate Keahey

Publications

2021
[c52]
- view
  authority control:
- export record
  dblp key:
  - conf/infocom/RuthKCZWA21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/infocom/RuthKCZWA21
Paul Ruth, Kate Keahey, Mert Cevik, Zhuo Zhen, Cong Wang, Jason Anderson:
Overcast: Running Controlled Experiments Spanning Research and Commercial Clouds. INFOCOM Workshops 2021: 1-6
2020
[c51]
- view
  - electronic edition @ usenix.org (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/usenix/KeaheyAZRRSCCGH20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/usenix/KeaheyAZRRSCCGH20
Kate Keahey, Jason Anderson, Zhuo Zhen, Pierre Riteau, Paul Ruth, Dan Stanzione, Mert Cevik, Jacob Colleran, Haryadi S. Gunawi, Cody Hammock, Joe Mambretti, Alexander Barnes, François Halbach, Alex Rocha, Joe Stubbs:
Lessons Learned from the Chameleon Testbed. USENIX Annual Technical Conference 2020: 219-233
2019
[c46]
- view
  authority control:
- export record
  dblp key:
  - conf/infocom/CevikRKR19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/infocom/CevikRKR19
Mert Cevik, Paul Ruth, Kate Keahey, Pierre Riteau:
Wide-area Software Defined Networking Experiments using Chameleon. INFOCOM Workshops 2019: 811-816

a service of

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.