Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Felipe Huici

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 Vladimir Andrei Olteanu

> Home > Persons > Felipe Huici

Publications

2015
[c22]
- view
  authority control:
- export record
  dblp key:
  - conf/eurosys/StoenescuOPAMBM15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/eurosys/StoenescuOPAMBM15
Radu Stoenescu, Vladimir Andrei Olteanu, Matei Popovici, Mohamed Ahmed, João Martins, Roberto Bifulco, Filipe Manco, Felipe Huici, Georgios Smaragdakis, Mark Handley, Costin Raiciu:
In-Net: in-network processing for the masses. EuroSys 2015: 23:1-23:15
[c19]
- view
  authority control:
- export record
  dblp key:
  - conf/sigcomm/OlteanuHR15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sigcomm/OlteanuHR15
Vladimir Andrei Olteanu, Felipe Huici, Costin Raiciu:
Lost in Network Address Translation: Lessons from Scaling the World's Simplest Middlebox. HotMiddlebox@SIGCOMM 2015: 19-24
2014
[c17]
- view
  - electronic edition @ usenix.org (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/nsdi/MartinsAROHBH14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/nsdi/MartinsAROHBH14
João Martins, Mohamed Ahmed, Costin Raiciu, Vladimir Andrei Olteanu, Michio Honda, Roberto Bifulco, Felipe Huici:
ClickOS and the Art of Network Function Virtualization. NSDI 2014: 459-473

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.