View : 21 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
임혜숙scopus
Issue Date
2014
Journal Title
2014 IEEE 15th International Conference on High Performance Switching and Routing, HPSR 2014
Publisher
Institute of Electrical and Electronics Engineers Inc.
Indexed
SCOPUS scopus
DOI
10.1109/HPSR.2014.6900879
ISBN
9781479916337
Appears in Collections:
엘텍공과대학 > 전자공학과 > Journal papers
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE