Internet packet filter management and rectangle geometry
暂无分享,去创建一个
[1] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[2] Jon Louis Bentley,et al. Multidimensional binary search trees used for associative searching , 1975, CACM.
[3] Robert E. Tarjan,et al. Applications of Path Compression on Balanced Trees , 1979, JACM.
[4] Robert E. Tarjan,et al. A Linear-Time Algorithm for a Special Case of Disjoint Set Union , 1985, J. Comput. Syst. Sci..
[5] Mark H. Overmars,et al. New upper bounds in Klee's measure problem , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[6] Stephen Alstrup,et al. Optimal On-Line Decremental Connectivity in Trees , 1997, Inf. Process. Lett..
[7] Bernhard Plattner,et al. Router plugins: a software architecture for next generation routers , 1998, SIGCOMM '98.
[8] Faith Ellen,et al. Optimal bounds for the predecessor problem , 1999, STOC '99.
[9] Mark de Berg,et al. Multi-method dispatching: a geometric approach with applications to string matching problems , 1999, STOC '99.
[10] Anja Feldmann,et al. Tradeoffs for packet classification , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).
[11] Guru M. Parulkar,et al. Detecting and resolving packet filter conflicts , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).
[12] Bernhard Plattner,et al. Router plugins: a software architecture for next-generation routers , 2000, TNET.