| 2007 |
|---|
| 13 | EE | Kun Suk Kim,
Sartaj Sahni:
Efficient Construction of Pipelined Multibit-Trie Router-Tables.
IEEE Trans. Computers 56(1): 32-43 (2007) |
| 2005 |
|---|
| 12 | EE | Haibin Lu,
Kun Suk Kim,
Sartaj K. Sahni:
Prefix and Interval-Partitioned Dynamic IP Router-Tables.
IEEE Trans. Computers 54(5): 545-557 (2005) |
| 2004 |
|---|
| 11 | EE | Sartaj Sahni,
Kun Suk Kim:
An O(log n) Dynamic Router-Table Design.
IEEE Trans. Computers 53(3): 351-363 (2004) |
| 10 | EE | Sartaj Sahni,
Kun Suk Kim:
Efficient Dynamic Lookup For Bursty Access Patterns.
Int. J. Found. Comput. Sci. 15(4): 567-591 (2004) |
| 2003 |
|---|
| 9 | EE | Kun Suk Kim,
Sartaj Sahni:
IP Lookup By Binary Search On Prefix Length.
ISCC 2003: 77-82 |
| 8 | EE | Sartaj Sahni,
Kun Suk Kim:
Efficient construction of multibit tries for IP lookup.
IEEE/ACM Trans. Netw. 11(4): 650-662 (2003) |
| 7 | EE | Sartaj Sahni,
Kun Suk Kim,
Haibin Lu:
Data Structures for One-Dimensional Packet Classification Using Most-Specific-Rule Matching.
Int. J. Found. Comput. Sci. 14(3): 337-358 (2003) |
| 2002 |
|---|
| 6 | EE | Sartaj Sahni,
Kun Suk Kim:
O(log n) dynamic packet routing.
ISCC 2002: 443-448 |
| 5 | EE | Sartaj Sahni,
Kun Suk Kim,
Haibin Lu:
Data Structures For One-Dimensional Packet Classification Using Most-Specific-Rule Matching.
ISPAN 2002: 3- |
| 4 | EE | Sartaj Sahni,
Kun Suk Kim:
Efficient Construction of Variable-Stride Multibit Tries for IP Lookup.
SAINT 2002: 220-229 |
| 3 | EE | Kun Suk Kim,
Sartaj Sahni:
IP Lookup by Binary Search on Prefix Length.
Journal of Interconnection Networks 3(3-4): 105-128 (2002) |
| 2001 |
|---|
| 2 | EE | Sartaj Sahni,
Kun Suk Kim:
Efficient Construction of Fixed-Stride Multibit Tries for IP Lookup.
FTDCS 2001: 178-184 |
| 1997 |
|---|
| 1 | | Kun Suk Kim,
Tae Man Han,
Pyung Dong Cho:
Performance Evaluation of Communications Module in PSTN Access Subsystem for Interworking with PSDN.
ICC (2) 1997: 555-559 |
