Daniel Cullina
TitleCited byYear
Searching for minimum storage regenerating codes
D Cullina, AG Dimakis, T Ho
arXiv preprint arXiv:0910.2245, 2009
742009
Dimensionality reduction as a defense against evasion attacks on machine learning classifiers
AN Bhagoji, D Cullina, P Mittal
arXiv preprint arXiv:1704.02654, 2017
642017
Improved achievability and converse bounds for erdos-renyi graph matching
D Cullina, N Kiyavash
ACM SIGMETRICS Performance Evaluation Review 44 (1), 63-72, 2016
352016
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
272018
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
252014
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
192012
Exact alignment recovery for correlated Erd\H {o} sR\'enyi graphs
D Cullina, N Kiyavash
arXiv preprint arXiv:1711.06783, 2017
152017
PAC-learning in the presence of adversaries
D Cullina, AN Bhagoji, P Mittal
Advances in Neural Information Processing Systems, 230-241, 2018
132018
Restricted composition deletion correcting codes
D Cullina, N Kiyavash, AA Kulkarni
IEEE Transactions on Information Theory 62 (9), 4819-4832, 2016
112016
On the Performance of a Canonical Labeling for Matching Correlated Erd\H {o} sR\'enyi Graphs
OE Dai, D Cullina, N Kiyavash, M Grossglauser
arXiv preprint arXiv:1804.09758, 2018
72018
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
62014
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
52016
Partial Recovery of Erd\H{o}s-R\'{e}nyi Graph Alignment via -Core Alignment
D Cullina, N Kiyavash, P Mittal, HV Poor
arXiv preprint arXiv:1809.03553, 2018
42018
Fundamental limits of database alignment
D Cullina, P Mittal, N Kiyavash
2018 IEEE International Symposium on Information Theory (ISIT), 651-655, 2018
42018
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
42016
Speed optimization for tasks with two resources
A Melani, R Mancuso, D Cullina, M Caccamo, L Thiele
Proceedings of the 2016 Conference on Design, Automation & Test in Europe …, 2016
32016
Database Alignment with Gaussian Features
OE Dai, D Cullina, N Kiyavash
arXiv preprint arXiv:1903.01422, 2019
22019
Significance of side information in the graph matching problem
K Singhal, D Cullina, N Kiyavash
arXiv preprint arXiv:1706.06936, 2017
22017
Optimizing resource speed for two-stage real-time tasks
A Melani, R Mancuso, D Cullina, M Caccamo, L Thiele
Real-Time Systems 53 (1), 82-120, 2017
22017
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
22016
The system can't perform the operation now. Try again later.
Articles 1–20