Daniel Cullina

Orcid: 0000-0002-7471-2102

According to our database1, Daniel Cullina authored at least 36 papers between 2009 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Gaussian Database Alignment and Gaussian Planted Matching.
CoRR, 2023

Characterizing the Optimal 0-1 Loss for Multi-class Classification with a Test-time Attacker.
CoRR, 2023

Characterizing the Optimal 0-1 Loss for Multi-class Classification with a Test-time Attacker.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

2021
Lower Bounds on Cross-Entropy Loss in the Presence of Test-time Adversaries.
Proceedings of the 38th International Conference on Machine Learning, 2021

2020
Partial Recovery of Erdős-Rényi Graph Alignment via k-Core Alignment.
Proceedings of the Abstracts of the 2020 SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer Systems, 2020

Achievability of nearly-exact alignment for correlated Gaussian databases.
Proceedings of the IEEE International Symposium on Information Theory, 2020

2019
Analysis of a Canonical Labeling Algorithm for the Alignment of Correlated Erdos-Rényi Graphs.
Proc. ACM Meas. Anal. Comput. Syst., 2019

Partial Recovery of Erdðs-Rényi Graph Alignment via k-Core Alignment.
Proc. ACM Meas. Anal. Comput. Syst., 2019

Better the Devil you Know: An Analysis of Evasion Attacks using Out-of-Distribution Adversarial Examples.
CoRR, 2019

Lower Bounds on Adversarial Robustness from Optimal Transport.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Analyzing the Robustness of Open-World Machine Learning.
Proceedings of the 12th ACM Workshop on Artificial Intelligence and Security, 2019

Database Alignment with Gaussian Features.
Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

2018
PAC-learning in the presence of evasion adversaries.
CoRR, 2018

On the Performance of a Canonical Labeling for Matching Correlated Erdős-Rényi Graphs.
CoRR, 2018

PAC-learning in the presence of adversaries.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Fundamental Limits of Database Alignment.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Enhancing robustness of machine learning systems via data transformations.
Proceedings of the 52nd Annual Conference on Information Sciences and Systems, 2018

2017
Optimizing resource speed for two-stage real-time tasks.
Real Time Syst., 2017

Exact alignment recovery for correlated Erdos Renyi graphs.
CoRR, 2017

Significance of Side Information in the Graph Matching Problem.
CoRR, 2017

Dimensionality Reduction as a Defense against Evasion Attacks on Machine Learning Classifiers.
CoRR, 2017

2016
Combinatorial channels from partially ordered sets
PhD thesis, 2016

Restricted Composition Deletion Correcting Codes.
IEEE Trans. Inf. Theory, 2016

Generalized Sphere-Packing Bounds on the Size of Codes for Combinatorial Channels.
IEEE Trans. Inf. Theory, 2016

On the Simultaneous Preservation of Privacy and Community Structure in Anonymized Networks.
CoRR, 2016

Improved Achievability and Converse Bounds for Erdos-Renyi Graph Matching.
Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science, 2016

Message partitioning and limited auxiliary randomness: Alternatives to Honey Encryption.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Rate-distance tradeoff for codes above graph capacity.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Speed optimization for tasks with two resources.
Proceedings of the 2016 Design, Automation & Test in Europe Conference & Exhibition, 2016

2015
Combinatorial channels from partially ordered sets.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

2014
An Improvement to Levenshtein's Upper Bound on the Cardinality of Deletion Correcting Codes.
IEEE Trans. Inf. Theory, 2014

Generalized sphere-packing and sphere-covering bounds on the size of codes for combinatorial channels.
CoRR, 2014

Generalized sphere-packing upper bounds on the size of codes for combinatorial channels.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2012
Two Approaches to the Construction of Deletion Correcting Codes: Weight Partitioning and Optimal Colorings
CoRR, 2012

A coloring approach to constructing deletion correcting codes from constant weight subgraphs.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2009
Searching for Minimum Storage Regenerating Codes
CoRR, 2009


  Loading...