Rottenstreich, Ori and Tapolcai, János (2017) Optimal Rule Caching and Lossy Compression for Longest Prefix Matching. IEEE-ACM TRANSACTIONS ON NETWORKING, 25 (2). pp. 864-878. ISSN 1063-6692
![[img]](http://real.mtak.hu/style/images/fileicons/text.png) |
Text
rottenstreich2015lossy.pdf Restricted to Repository staff only Download (541kB) | Request a copy |
Official URL: https://doi.org/10.1109/TNET.2016.2611482
| Item Type: | Article |
|---|---|
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 26 Sep 2017 06:41 |
| Last Modified: | 26 Sep 2017 06:41 |
| URI: | http://real.mtak.hu/id/eprint/63701 |
Actions (login required)
 |
Edit Item |
