Alejandro López-Ortiz

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 Gabriel Scalosub

> Home > Persons > Alejandro López-Ortiz

Publications

2016
[j43]
- view
  authority control:
- export record
  dblp key:
  - journals/jnca/KoganLNSS16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jnca/KoganLNSS16
Kirill Kogan, Alejandro López-Ortiz, Sergey I. Nikolenko, Gabriel Scalosub, Michael Segal:
Large profits or fast gains: A dilemma in maximizing throughput with applications to network processors. J. Netw. Comput. Appl. 74: 31-43 (2016)
2014
[c97]
- view
  authority control:
- export record
  dblp key:
  - conf/comsnets/KoganLNSS14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/comsnets/KoganLNSS14
Kirill Kogan, Alejandro López-Ortiz, Sergey I. Nikolenko, Gabriel Scalosub, Michael Segal:
Balancing work and size with bounded buffers. COMSNETS 2014: 1-8
2012
[i11]
- view
  - electronic edition @ arxiv.org (open access)
  - details & citations
- export record
  dblp key:
  - journals/corr/abs-1202-5755
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1202-5755
Kirill Kogan, Alejandro López-Ortiz, Gabriel Scalosub, Michael Segal:
Large Profits or Fast Gains: A Dilemma in Maximizing Throughput with Applications to Network Processors. CoRR abs/1202.5755 (2012)

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.