DSpace at EWHA: Binary search on trie levels with a bloom filter for longest prefix match

Browse

My Repository

DSpace at EWHA공과대학 전자전기공학전공 Journal papers

View : 635 Download: 0

Binary search on trie levels with a bloom filter for longest prefix match

Title: Binary search on trie levels with a bloom filter for longest prefix match

Authors: Lee J.; Lim H.

Ewha Authors: 임혜숙

SCOPUS Author ID: 임혜숙

Issue Date: 2014

Journal Title: 2014 IEEE 15th International Conference on High Performance Switching and Routing, HPSR 2014

Citation: 2014 IEEE 15th International Conference on High Performance Switching and Routing, HPSR 2014, pp. 38 - 43

Publisher: Institute of Electrical and Electronics Engineers Inc.

Indexed: SCOPUS

Document Type: Conference Paper

DOI: 10.1109/HPSR.2014.6900879

ISBN: 9781479916337

Appears in Collections:: 공과대학 > 전자전기공학전공 > Journal papers

Files in This Item:

Export: RIS (EndNote); XLS (Excel); XML

Show full item record

Find@EWHA

qrcode

: search

BROWSE