1. Lecture Notes in Computer Science;P. Bose,2009
2. Lecture Notes in Computer Science;P. Bose,2010
3. Cheung, G., McCanne, S.: Optimal Routing Table Design for IP Address Lookups under Memory Constraints. In: Proceedings of IEEE Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM 1999, vol. 3, pp. 1437–1444. IEEE Press, New York (1999)
4. Degermark, M., Brodnik, A., Carlsson, S., Pink, S.: Small forwarding tables for fast routing lookups. ACM SIGCOMM Computer Communication Review 27(4), 3–14 (1997)
5. Evans, W., Kirkpatrick, D.: Restructuring ordered binary trees. In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 477–486. SIAM, Philadelphia (2000)