Cristian Estan - Publications

Affiliations: 
University of Wisconsin, Madison, Madison, WI 
Area:
Computer Science

17 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2016 Falsafi B, Stan M, Skadron K, Jayasena N, Chen Y, Tao J, Nair R, Moreno J, Muralimanohar N, Sankaralingam K, Estan C. Near-Memory Data Services Ieee Micro. 36: 6-7. DOI: 10.1109/Mm.2016.9  0.329
2012 Harris EN, Wasmundt SL, De Carli L, Sankaralingam K, Estan C. LEAP: Latency- energy- and area-optimized lookup pipeline Ancs 2012 - Proceedings of the 8th Acm/Ieee Symposium On Architectures For Networking and Communications Systems. 175-185. DOI: 10.1145/2396556.2396595  0.479
2011 Luchaup D, Smith R, Estan C, Jha S. Speculative parallel pattern matching Ieee Transactions On Information Forensics and Security. 6: 438-451. DOI: 10.1109/Tifs.2011.2112647  0.394
2011 Vaish N, Kooburat T, De Carli L, Sankaralingam K, Estan C. Experiences in co-designing a packet classification algorithm and a flexible hardware platform Proceedings - 2011 7th Acm/Ieee Symposium On Architectures For Networking and Communications Systems, Ancs 2011. 189-199. DOI: 10.1109/ANCS.2011.35  0.453
2010 Ma Y, Banerjee S, Lu S, Estan C. Leveraging parallelism for multi-dimensional packet classification on software routers Performance Evaluation Review. 38: 227-238. DOI: 10.1145/1811099.1811065  0.328
2009 De Carli L, Pan Y, Kumar A, Estan C, Sankaralingam K. PLUG: Flexible lookup modules for rapid deployment of new protocols in high-speed routers Computer Communication Review. 39: 207-218. DOI: 10.1145/1594977.1592593  0.324
2009 Smith R, Goyal N, Ormont J, Sankaralingam K, Estan C. Evaluating GPUs for network packet signature matching Ispass 2009 - International Symposium On Performance Analysis of Systems and Software. 175-184. DOI: 10.1109/ISPASS.2009.4919649  0.419
2009 Luchaup D, Smith R, Estan C, Jha S. Multi-byte Regular Expression Matching with Speculation Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5758: 284-303. DOI: 10.1007/978-3-642-04342-0_15  0.512
2008 Kong S, Smith R, Estan C. Efficient signature matching with multiple Alphabet Compression Tables Proceedings of the 4th International Conference On Security and Privacy in Communication Networks, Securecomm'08. DOI: 10.1145/1460877.1460879  0.39
2008 Smith R, Estan C, Jha S. XFA: Faster signature matching with extended automata Proceedings - Ieee Symposium On Security and Privacy. 187-201. DOI: 10.1109/SP.2008.14  0.321
2008 Smith R, Estan C, Jha S, Siahaan I. Fast signature matching using extended finite automaton (XFA) Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5352: 158-172. DOI: 10.1007/978-3-540-89862-7_15  0.3
2006 Estan C, Varghese G, Fisk M. Bitmap algorithms for counting active flows on high-speed links Ieee/Acm Transactions On Networking. 14: 925-937. DOI: 10.1109/Tnet.2006.882836  0.451
2006 Smith R, Estan C, Jha S. Backtracking algorithmic complexity attacks against a NIDS Proceedings - Annual Computer Security Applications Conference, Acsac. 89-98. DOI: 10.1109/ACSAC.2006.17  0.389
2004 Estan C, Keys K, Moore D, Varghese G. Building a better NetFlow Computer Communication Review. 34: 245-256. DOI: 10.1145/1030194.1015495  0.434
2003 Estan C, Varghese G. New directions in traffic measurement and accounting: Focusing on the elephants, ignoring the mice Acm Transactions On Computer Systems. 21: 270-313. DOI: 10.1145/859716.859719  0.434
2003 Estan C, Varghese G, Fisk M. Bitmap algorithms for counting active flows on high speed links Proceedings of the Acm Sigcomm Internet Measurement Conference, Imc. 153-166.  0.592
2002 Estan C, Varghese G, Fisk M. Counting the number of active flows on a high speed link Computer Communication Review. 32: 10. DOI: 10.1145/571697.571699  0.594
Show low-probability matches.