Daniel Cullina

44 papers A* 5A 2B 5Misc 1Journal 27Unranked 3

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Evaluating the Adversarial Robustness of CNNs Layer by Layer. Trans. Mach. Learn. Res. Yaowen Wang, Daniel Cullina
2023	A*	`conf`	Characterizing the Optimal 0-1 Loss for Multi-class Classification with a Test-time Attacker. NeurIPS Sihui Dai, Wenxin Ding, Arjun Nitin Bhagoji, Daniel Cullina, Heather Zheng, Ben Zhao, Prateek Mittal
2023	J	`jnl`	Characterizing the Optimal 0-1 Loss for Multi-class Classification with a Test-time Attacker. CoRR Sihui Dai, Wenxin Ding, Arjun Nitin Bhagoji, Daniel Cullina, Ben Y. Zhao, Haitao Zheng, Prateek Mittal
2023	J	`jnl`	Gaussian Database Alignment and Gaussian Planted Matching. CoRR Osman Emre Dai, Daniel Cullina, Negar Kiyavash
2021	A*	`conf`	Lower Bounds on Cross-Entropy Loss in the Presence of Test-time Adversaries. ICML Arjun Nitin Bhagoji, Daniel Cullina, Vikash Sehwag, Prateek Mittal
2021	J	`jnl`	Lower Bounds on Cross-Entropy Loss in the Presence of Test-time Adversaries. CoRR Arjun Nitin Bhagoji, Daniel Cullina, Vikash Sehwag, Prateek Mittal
2020	B	`conf`	Achievability of nearly-exact alignment for correlated Gaussian databases. ISIT Osman Emre Dai, Daniel Cullina, Negar Kiyavash
2020	—	`conf`	Partial Recovery of Erdős-Rényi Graph Alignment via k-Core Alignment. SIGMETRICS (Abstracts) Daniel Cullina, Negar Kiyavash, Prateek Mittal, H. Vincent Poor
2019	J	`jnl`	Analysis of a Canonical Labeling Algorithm for the Alignment of Correlated Erdos-Rényi Graphs. Proc. ACM Meas. Anal. Comput. Syst. Osman Emre Dai, Daniel Cullina, Negar Kiyavash, Matthias Grossglauser
2019	—	`conf`	Analysis of a Canonical Labeling Algorithm for the Alignment of Correlated Erdős-Rényi Graphs. SIGMETRICS (Abstracts) Osman Emre Dai, Daniel Cullina, Negar Kiyavash, Matthias Grossglauser
2019	—	`conf`	Analyzing the Robustness of Open-World Machine Learning. AISec@CCS Vikash Sehwag, Arjun Nitin Bhagoji, Liwei Song, Chawin Sitawarin, Daniel Cullina, Mung Chiang, Prateek Mittal
2019	J	`jnl`	Better the Devil you Know: An Analysis of Evasion Attacks using Out-of-Distribution Adversarial Examples. CoRR Vikash Sehwag, Arjun Nitin Bhagoji, Liwei Song, Chawin Sitawarin, Daniel Cullina, Mung Chiang, Prateek Mittal
2019	A	`conf`	Database Alignment with Gaussian Features. AISTATS Osman Emre Dai, Daniel Cullina, Negar Kiyavash
2019	J	`jnl`	Database Alignment with Gaussian Features. CoRR Osman Emre Dai, Daniel Cullina, Negar Kiyavash
2019	A*	`conf`	Lower Bounds on Adversarial Robustness from Optimal Transport. NeurIPS Arjun Nitin Bhagoji, Daniel Cullina, Prateek Mittal
2019	J	`jnl`	Lower Bounds on Adversarial Robustness from Optimal Transport. CoRR Arjun Nitin Bhagoji, Daniel Cullina, Prateek Mittal
2019	J	`jnl`	Partial Recovery of Erdðs-Rényi Graph Alignment via k-Core Alignment. Proc. ACM Meas. Anal. Comput. Syst. Daniel Cullina, Negar Kiyavash, Prateek Mittal, H. Vincent Poor
2018	Misc	`conf`	Enhancing robustness of machine learning systems via data transformations. CISS Arjun Nitin Bhagoji, Daniel Cullina, Chawin Sitawarin, Prateek Mittal
2018	B	`conf`	Fundamental Limits of Database Alignment. ISIT Daniel Cullina, Prateek Mittal, Negar Kiyavash
2018	J	`jnl`	Fundamental Limits of Database Alignment. CoRR Daniel Cullina, Prateek Mittal, Negar Kiyavash
2018	J	`jnl`	On the Performance of a Canonical Labeling for Matching Correlated Erdős-Rényi Graphs. CoRR Osman Emre Dai, Daniel Cullina, Negar Kiyavash, Matthias Grossglauser
2018	A*	`conf`	PAC-learning in the presence of adversaries. NeurIPS Daniel Cullina, Arjun Nitin Bhagoji, Prateek Mittal
2018	J	`jnl`	PAC-learning in the presence of evasion adversaries. CoRR Daniel Cullina, Arjun Nitin Bhagoji, Prateek Mittal
2018	J	`jnl`	Partial Recovery of Erdős-Rényi Graph Alignment via k-Core Alignment. CoRR Daniel Cullina, Negar Kiyavash, Prateek Mittal, H. Vincent Poor
2017	J	`jnl`	Dimensionality Reduction as a Defense against Evasion Attacks on Machine Learning Classifiers. CoRR Arjun Nitin Bhagoji, Daniel Cullina, Prateek Mittal
2017	J	`jnl`	Exact alignment recovery for correlated Erdos Renyi graphs. CoRR Daniel Cullina, Negar Kiyavash
2017	J	`jnl`	Optimizing resource speed for two-stage real-time tasks. Real Time Syst. Alessandra Melani, Renato Mancuso, Daniel Cullina, Marco Caccamo, Lothar Thiele
2017	J	`jnl`	Significance of Side Information in the Graph Matching Problem. CoRR Kushagra Singhal, Daniel Cullina, Negar Kiyavash
2016	—	`—`	Combinatorial channels from partially ordered sets Daniel Cullina
2016	J	`jnl`	Generalized Sphere-Packing Bounds on the Size of Codes for Combinatorial Channels. IEEE Trans. Inf. Theory Daniel Cullina, Negar Kiyavash
2016	A*	`conf`	Improved Achievability and Converse Bounds for Erdos-Renyi Graph Matching. SIGMETRICS Daniel Cullina, Negar Kiyavash
2016	J	`jnl`	Improved Achievability and Converse Bounds for Erdős-Rényi Graph Matching. CoRR Daniel Cullina, Negar Kiyavash
2016	J	`jnl`	On the Simultaneous Preservation of Privacy and Community Structure in Anonymized Networks. CoRR Daniel Cullina, Kushagra Singhal, Negar Kiyavash, Prateek Mittal
2016	J	`jnl`	Rate-distance tradeoff for codes above graph capacity. CoRR Daniel Cullina, Marco Dalai, Yury Polyanskiy
2016	J	`jnl`	Restricted Composition Deletion Correcting Codes. IEEE Trans. Inf. Theory Daniel Cullina, Negar Kiyavash, Ankur A. Kulkarni
2016	A	`conf`	Speed optimization for tasks with two resources. DATE Alessandra Melani, Renato Mancuso, Daniel Cullina, Marco Caccamo, Lothar Thiele
2015	B	`conf`	Combinatorial channels from partially ordered sets. ITW Daniel Cullina, Negar Kiyavash
2014	J	`jnl`	An Improvement to Levenshtein's Upper Bound on the Cardinality of Deletion Correcting Codes. IEEE Trans. Inf. Theory Daniel Cullina, Negar Kiyavash
2014	J	`jnl`	Generalized sphere-packing and sphere-covering bounds on the size of codes for combinatorial channels. CoRR Daniel Cullina, Negar Kiyavash
2013	J	`jnl`	An Improvement to Levenshtein's Upper Bound on the Cardinality of Deletion Correcting Codes CoRR Daniel Cullina, Negar Kiyavash
2013	B	`conf`	An improvement to Levenshtein's upper bound on the cardinality of deletion correcting codes. ISIT Daniel Cullina, Negar Kiyavash
2012	B	`conf`	A coloring approach to constructing deletion correcting codes from constant weight subgraphs. ISIT Daniel Cullina, Ankur A. Kulkarni, Negar Kiyavash
2012	J	`jnl`	Two Approaches to the Construction of Deletion Correcting Codes: Weight Partitioning and Optimal Colorings CoRR Daniel Cullina, Ankur A. Kulkarni, Negar Kiyavash
2009	J	`jnl`	Searching for Minimum Storage Regenerating Codes CoRR Daniel Cullina, Alexandros G. Dimakis, Tracey Ho