Searching for Minimum Storage Regenerating Codes - Daniel Cullina; Alexandros G. Dimakis; Tracey Ho (CoRR, 2009)

A coloring approach to constructing deletion correcting codes from constant weight subgraphs. - Daniel Cullina; Ankur A. Kulkarni; Negar Kiyavash (ISIT, 2012)

Two Approaches to the Construction of Deletion Correcting Codes: Weight Partitioning and Optimal Colorings - Daniel Cullina; Ankur A. Kulkarni; Negar Kiyavash (CoRR, 2012)

Generalized sphere-packing upper bounds on the size of codes for combinatorial channels. - Daniel F. Cullina; Negar Kiyavash (ISIT, 2014)

Generalized sphere-packing and sphere-covering bounds on the size of codes for combinatorial channels. - Daniel Cullina; Negar Kiyavash (CoRR, 2014)

An Improvement to Levenshtein's Upper Bound on the Cardinality of Deletion Correcting Codes. - Daniel Cullina; Negar Kiyavash (IEEE Trans. Inf. Theory, 2014)

Combinatorial channels from partially ordered sets. - Daniel Cullina; Negar Kiyavash (ITW, 2015)

Speed optimization for tasks with two resources. - Alessandra Melani; Renato Mancuso 001; Daniel Cullina; Marco Caccamo; Lothar Thiele (DATE, 2016)

Rate-distance tradeoff for codes above graph capacity. - Daniel F. Cullina; Marco Dalai; Yury Polyanskiy (ISIT, 2016)

Message partitioning and limited auxiliary randomness: Alternatives to Honey Encryption. - AmirEmad Ghassami; Daniel F. Cullina; Negar Kiyavash (ISIT, 2016)

Improved Achievability and Converse Bounds for Erdos-Renyi Graph Matching. - Daniel Cullina; Negar Kiyavash (SIGMETRICS, 2016)

On the Simultaneous Preservation of Privacy and Community Structure in Anonymized Networks. - Daniel Cullina; Kushagra Singhal; Negar Kiyavash; Prateek Mittal (CoRR, 2016)

Generalized Sphere-Packing Bounds on the Size of Codes for Combinatorial Channels. - Daniel Cullina; Negar Kiyavash (IEEE Trans. Inf. Theory, 2016)

Restricted Composition Deletion Correcting Codes. - Daniel Cullina; Negar Kiyavash; Ankur A. Kulkarni (IEEE Trans. Inf. Theory, 2016)

Combinatorial channels from partially ordered sets - Daniel Cullina (2016)

Dimensionality Reduction as a Defense against Evasion Attacks on Machine Learning Classifiers. - Arjun Nitin Bhagoji; Daniel Cullina; Prateek Mittal (CoRR, 2017)

Significance of Side Information in the Graph Matching Problem. - Kushagra Singhal; Daniel Cullina; Negar Kiyavash (CoRR, 2017)

Exact alignment recovery for correlated Erdos Renyi graphs. - Daniel Cullina; Negar Kiyavash (CoRR, 2017)

Optimizing resource speed for two-stage real-time tasks. - Alessandra Melani; Renato Mancuso 001; Daniel Cullina; Marco Caccamo; Lothar Thiele (Real Time Syst., 2017)

Enhancing robustness of machine learning systems via data transformations. - Arjun Nitin Bhagoji; Daniel Cullina; Chawin Sitawarin; Prateek Mittal (CISS, 2018)

Fundamental Limits of Database Alignment. - Daniel Cullina; Prateek Mittal; Negar Kiyavash (ISIT, 2018)

PAC-learning in the presence of adversaries. - Daniel Cullina; Arjun Nitin Bhagoji; Prateek Mittal (NeurIPS, 2018)

On the Performance of a Canonical Labeling for Matching Correlated Erdős-Rényi Graphs. - Osman Emre Dai; Daniel Cullina; Negar Kiyavash; Matthias Grossglauser (CoRR, 2018)

PAC-learning in the presence of evasion adversaries. - Daniel Cullina; Arjun Nitin Bhagoji; Prateek Mittal (CoRR, 2018)

Database Alignment with Gaussian Features. - Osman Emre Dai; Daniel Cullina; Negar Kiyavash (AISTATS, 2019)

Analyzing the Robustness of Open-World Machine Learning. - Vikash Sehwag; Arjun Nitin Bhagoji; Liwei Song; Chawin Sitawarin; Daniel Cullina; Mung Chiang; Prateek Mittal (AISec@CCS, 2019)

Lower Bounds on Adversarial Robustness from Optimal Transport. - Arjun Nitin Bhagoji; Daniel Cullina; Prateek Mittal (NeurIPS, 2019)

Better the Devil you Know: An Analysis of Evasion Attacks using Out-of-Distribution Adversarial Examples. - Vikash Sehwag; Arjun Nitin Bhagoji; Liwei Song; Chawin Sitawarin; Daniel Cullina; Mung Chiang; Prateek Mittal (CoRR, 2019)

Partial Recovery of Erdðs-Rényi Graph Alignment via k-Core Alignment. - Daniel Cullina; Negar Kiyavash; Prateek Mittal; H. Vincent Poor (Proc. ACM Meas. Anal. Comput. Syst., 2019)

Analysis of a Canonical Labeling Algorithm for the Alignment of Correlated Erdos-Rényi Graphs. - Osman Emre Dai; Daniel Cullina; Negar Kiyavash; Matthias Grossglauser (Proc. ACM Meas. Anal. Comput. Syst., 2019)

Achievability of nearly-exact alignment for correlated Gaussian databases. - Osman Emre Dai; Daniel Cullina; Negar Kiyavash (ISIT, 2020)

Partial Recovery of Erdős-Rényi Graph Alignment via k-Core Alignment. - Daniel Cullina; Negar Kiyavash; Prateek Mittal; H. Vincent Poor (SIGMETRICS (Abstracts), 2020)

Lower Bounds on Cross-Entropy Loss in the Presence of Test-time Adversaries. - Arjun Nitin Bhagoji; Daniel Cullina; Vikash Sehwag; Prateek Mittal (ICML, 2021)

Characterizing the Optimal 0-1 Loss for Multi-class Classification with a Test-time Attacker. - Sihui Dai; Wenxin Ding; Arjun Nitin Bhagoji; Daniel Cullina; Heather Zheng; Ben Zhao; Prateek Mittal (NeurIPS, 2023)

Characterizing the Optimal 0-1 Loss for Multi-class Classification with a Test-time Attacker. - Sihui Dai; Wenxin Ding; Arjun Nitin Bhagoji; Daniel Cullina; Ben Y. Zhao; Haitao Zheng 001; Prateek Mittal (CoRR, 2023)

Gaussian Database Alignment and Gaussian Planted Matching. - Osman Emre Dai; Daniel Cullina; Negar Kiyavash (CoRR, 2023)