| Dimensionality reduction as a defense against evasion attacks on machine learning classifiers AN Bhagoji, D Cullina, P Mittal arXiv preprint arXiv:1704.02654 2, 2017 | 108 | 2017 |
| Enhancing robustness of machine learning systems via data transformations AN Bhagoji, D Cullina, C Sitawarin, P Mittal 2018 52nd Annual Conference on Information Sciences and Systems (CISS), 1-5, 2018 | 86 | 2018 |
| Searching for minimum storage regenerating codes D Cullina, AG Dimakis, T Ho arXiv preprint arXiv:0910.2245, 2009 | 76 | 2009 |
| Improved achievability and converse bounds for erdos-rényi graph matching D Cullina, N Kiyavash ACM SIGMETRICS Performance Evaluation Review 44 (1), 63-72, 2016 | 56 | 2016 |
| PAC-learning in the presence of evasion adversaries D Cullina, AN Bhagoji, P Mittal arXiv preprint arXiv:1806.01471, 2018 | 53 | 2018 |
| An improvement to Levenshtein's upper bound on the cardinality of deletion correcting codes D Cullina, N Kiyavash IEEE Transactions on Information Theory 60 (7), 3862-3870, 2014 | 32 | 2014 |
| Exact alignment recovery for correlated Erd\H {o} sR\'enyi graphs D Cullina, N Kiyavash arXiv preprint arXiv:1711.06783, 2017 | 28 | 2017 |
| Lower bounds on adversarial robustness from optimal transport AN Bhagoji, D Cullina, P Mittal arXiv preprint arXiv:1909.12272, 2019 | 21 | 2019 |
| On the performance of a canonical labeling for matching correlated Erdös-Rényi graphs OE Dai, D Cullina, N Kiyavash, M Grossglauser arXiv preprint arXiv:1804.09758, 2018 | 21* | 2018 |
| A coloring approach to constructing deletion correcting codes from constant weight subgraphs D Cullina, AA Kulkarni, N Kiyavash 2012 IEEE International Symposium on Information Theory Proceedings, 513-517, 2012 | 20 | 2012 |
| Analyzing the robustness of open-world machine learning V Sehwag, AN Bhagoji, L Song, C Sitawarin, D Cullina, M Chiang, P Mittal Proceedings of the 12th ACM Workshop on Artificial Intelligence and Security …, 2019 | 13 | 2019 |
| Restricted composition deletion correcting codes D Cullina, N Kiyavash, AA Kulkarni IEEE Transactions on Information Theory 62 (9), 4819-4832, 2016 | 12 | 2016 |
| Partial Recovery of Erdđs-Rényi Graph Alignment via k-Core Alignment D Cullina, N Kiyavash, P Mittal, HV Poor Proceedings of the ACM on Measurement and Analysis of Computing Systems 3 (3 …, 2019 | 11 | 2019 |
| Fundamental limits of database alignment D Cullina, P Mittal, N Kiyavash 2018 IEEE International Symposium on Information Theory (ISIT), 651-655, 2018 | 10 | 2018 |
| Database alignment with Gaussian features OE Dai, D Cullina, N Kiyavash The 22nd International Conference on Artificial Intelligence and Statistics …, 2019 | 7 | 2019 |
| On the simultaneous preservation of privacy and community structure in anonymized networks D Cullina, K Singhal, N Kiyavash, P Mittal arXiv preprint arXiv:1603.08028, 2016 | 6 | 2016 |
| Generalized sphere-packing upper bounds on the size of codes for combinatorial channels D Cullina, N Kiyavash 2014 IEEE International Symposium on Information Theory, 1266-1270, 2014 | 6 | 2014 |
| Message partitioning and limited auxiliary randomness: Alternatives to Honey Encryption AE Ghassami, D Cullina, N Kiyavash 2016 IEEE International Symposium on Information Theory (ISIT), 1371-1375, 2016 | 5 | 2016 |
| Generalized sphere-packing bounds on the size of codes for combinatorial channels D Cullina, N Kiyavash IEEE Transactions on Information Theory 62 (8), 4454-4465, 2016 | 5 | 2016 |
| Significance of side information in the graph matching problem K Singhal, D Cullina, N Kiyavash arXiv preprint arXiv:1706.06936, 2017 | 4 | 2017 |
Negar KiyavashÉcole polytechnique fédérale de Lausanne (EPFL)Verified email at epfl.ch
