Follow
Daniel Cullina
Title
Cited by
Cited by
Year
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
2552018
Dimensionality reduction as a defense against evasion attacks on machine learning classifiers
AN Bhagoji, D Cullina, P Mittal
arXiv preprint arXiv:1704.02654 2 (1), 2017
2012017
Pac-learning in the presence of adversaries
D Cullina, AN Bhagoji, P Mittal
Advances in Neural Information Processing Systems 31, 2018
1572018
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
1212016
Lower bounds on adversarial robustness from optimal transport
AN Bhagoji, D Cullina, P Mittal
Advances in Neural Information Processing Systems 32, 2019
1072019
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
982019
Exact alignment recovery for correlated Erd\H {o} sR\'enyi graphs
D Cullina, N Kiyavash
arXiv preprint arXiv:1711.06783, 2017
812017
Searching for minimum storage regenerating codes
D Cullina, AG Dimakis, T Ho
arXiv preprint arXiv:0910.2245, 2009
792009
Analysis of a canonical labeling algorithm for the alignment of correlated erdos-rényi graphs
OE Dai, D Cullina, N Kiyavash, M Grossglauser
Proceedings of the ACM on Measurement and Analysis of Computing Systems 3 (2 …, 2019
60*2019
Partial recovery of Erdős-Rényi graph alignment via k-core alignment
D Cullina, N Kiyavash, P Mittal, HV Poor
ACM SIGMETRICS Performance Evaluation Review 48 (1), 99-100, 2020
552020
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
532014
Fundamental limits of database alignment
D Cullina, P Mittal, N Kiyavash
2018 IEEE International Symposium on Information Theory (ISIT), 651-655, 2018
422018
Database alignment with gaussian features
OE Dai, D Cullina, N Kiyavash
The 22nd International Conference on Artificial Intelligence and Statistics …, 2019
342019
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
232012
Achievability of nearly-exact alignment for correlated Gaussian databases
OE Dai, D Cullina, N Kiyavash
2020 IEEE International Symposium on Information Theory (ISIT), 1230-1235, 2020
162020
Better the devil you know: An analysis of evasion attacks using out-of-distribution adversarial examples
V Sehwag, AN Bhagoji, L Song, C Sitawarin, D Cullina, M Chiang, P Mittal
arXiv preprint arXiv:1905.01726, 2019
162019
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
162016
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
152016
Restricted composition deletion correcting codes
D Cullina, N Kiyavash, AA Kulkarni
IEEE Transactions on Information Theory 62 (9), 4819-4832, 2016
142016
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
72014
The system can't perform the operation now. Try again later.
Articles 1–20