Bit-Map Trie : A Data Structure for Fast Forwarding Lookups
Full metadata record
| DC Field |
Value |
Language |
| dc.contributor.author | 안종석 | - |
| dc.date.accessioned | 2024-10-30T01:58:30Z | - |
| dc.date.available | 2024-10-30T01:58:30Z | - |
| dc.date.issued | 2001-11-25 | - |
| dc.identifier.uri | https://scholarworks.dongguk.edu/handle/sw.dongguk/35776 | - |
| dc.title | Bit-Map Trie : A Data Structure for Fast Forwarding Lookups | - |
| dc.type | Conference | - |
| dc.citation.conferenceName | IEEE Globecom 2001 | - |
| dc.citation.conferencePlace | 미국 | - |
| dc.citation.conferencePlace | San Antonio | - |
| dc.citation.conferenceDate | 2001-11-25 ~ 2001-11-29 | - |
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Advanced Convergence Engineering > Department of Computer Science and Artificial Intelligence > 2. Conference Papers

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