Jun Li 0003

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 Jeffrey Fong

> Home > Persons > Jun Li 0003

Publications

2014
[j8]
- view
  authority control:
- export record
  dblp key:
  - journals/tc/YangFJXL14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tc/YangFJXL14
Baohua Yang, Jeffrey Fong, Weirong Jiang, Yibo Xue, Jun Li:
Practical Multituple Packet Classification Using Dynamic Discrete Bit Selection. IEEE Trans. Computers 63(2): 424-434 (2014)
2012
[c38]
- view
  authority control:
- export record
  dblp key:
  - conf/hoti/FongWQ0J12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/hoti/FongWQ0J12
Jeffrey Fong, Xiang Wang, Yaxuan Qi, Jun Li, Weirong Jiang:
ParaSplit: A Scalable Architecture on FPGA for Terabit Packet Classification. Hot Interconnects 2012: 1-8
2011
[c31]
- view
  authority control:
- export record
  dblp key:
  - conf/infocom/QiWFXLJP11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/infocom/QiWFXLJP11
Yaxuan Qi, Kai Wang, Jeffrey Fong, Yibo Xue, Jun Li, Weirong Jiang, Viktor K. Prasanna:
FEACAN: Front-end acceleration for content-aware network processing. INFOCOM 2011: 2114-2122
2010
[c30]
- view
  authority control:
- export record
  dblp key:
  - conf/fpt/QiFJXLP10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fpt/QiFJXLP10
Yaxuan Qi, Jeffrey Fong, Weirong Jiang, Bo Xu, Jun Li, Viktor K. Prasanna:
Multi-dimensional packet classification on FPGA: 100 Gbps and beyond. FPT 2010: 241-248

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.