Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Alex C. Snoeren

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 Rob McGuinness

> Home > Persons > Alex C. Snoeren

Publications

2020
[c95]
- view
  - electronic edition @ usenix.org (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/nsdi/MelletteDGMSP20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/nsdi/MelletteDGMSP20
William M. Mellette, Rajdeep Das, Yibo Guo, Rob McGuinness, Alex C. Snoeren, George Porter:
Expanding across time to deliver bandwidth efficiency and low latency. NSDI 2020: 1-18
2019
[i3]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1903-12307
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1903-12307
William M. Mellette, Rajdeep Das, Yibo Guo, Rob McGuinness, Alex C. Snoeren, George Porter:
Expanding across time to deliver bandwidth efficiency and low latency. CoRR abs/1903.12307 (2019)
2017
[c78]
- view
  authority control:
- export record
  dblp key:
  - conf/sigcomm/MelletteMRFPSP17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sigcomm/MelletteMRFPSP17
William M. Mellette, Rob McGuinness, Arjun Roy, Alex Forencich, George Papen, Alex C. Snoeren, George Porter:
RotorNet: A Scalable, Low-complexity, Optical Datacenter Network. SIGCOMM 2017: 267-280

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.