Thomas Wild

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 Kimon Karras

> Home > Persons > Thomas Wild

Publications

2011
[j5]
- view
  authority control:
- export record
  dblp key:
  - journals/thipeac/LlorenteKWH11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/thipeac/LlorenteKWH11
Daniel Llorente, Kimon Karras, Thomas Wild, Andreas Herkersdorf:
Advanced Packet Segmentation and Buffering Algorithms in Network Processors. Trans. High Perform. Embed. Archit. Compil. 4: 334-353 (2011)
2010
[c22]
- view
  authority control:
- export record
  dblp key:
  - conf/ancs/KarrasWH10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ancs/KarrasWH10
Kimon Karras, Thomas Wild, Andreas Herkersdorf:
A folded pipeline network processor architecture for 100 Gbit/s networks. ANCS 2010: 2
2008
[c16]
- view
  authority control:
- export record
  dblp key:
  - conf/asap/LlorenteKWH08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/asap/LlorenteKWH08
Daniel Llorente, Kimon Karras, Thomas Wild, Andreas Herkersdorf:
Buffer allocation for advanced packet segmentation in Network Processors. ASAP 2008: 221-226
[c12]
- view
  authority control:
- export record
  dblp key:
  - conf/samos/KarrasLWH08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/samos/KarrasLWH08
Kimon Karras, Daniel Llorente, Thomas Wild, Andreas Herkersdorf:
Improving memory subsystem performance in network processors with smart packet segmentation. ICSAMOS 2008: 210-217

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.