Daniel Cullina

Interests

Selected Papers

• Exact alignment recovery for correlated Erdős-Rényi graphs
  Daniel Cullina, Negar Kiyavash
  arxiv 1711.06783


• PAC-learning in the presence of evasion adversaries
  Daniel Cullina, Arjun N. Bhagoji, Prateek Mittal
  Neural Information Processing Systems (NeurIPS), 2018.
  arxiv 1806.01471


• Partial Recovery of Erdős-Rényi Graph Alignment Via k-Core Alignment
  Daniel Cullina, Negar Kiyavash, Prateek Mittal, H. Vincent Poor
  arxiv 1809.03553

Preprints

• Partial Recovery of Erdős-Rényi Graph Alignment Via k-Core Alignment
  Daniel Cullina, Negar Kiyavash, Prateek Mittal, H. Vincent Poor
  arxiv 1809.03553


• On the Performance of a Canonical Labeling for Matching Correlated Erdős-Rényi Graphs
  Osman Emre Dai, Daniel Cullina, Negar Kiyavash, Matthias Grossglauser
  arxiv 1804.09758


• Exact alignment recovery for correlated Erdős-Rényi graphs
  Daniel Cullina, Negar Kiyavash
  arxiv 1711.06783


• Enhancing Robustness of Machine Learning Systems via Data Transformations
  Arjun Nitin Bhagoji, Daniel Cullina, Chawin Sitawarin, Prateek Mittal
  arxiv 1704.02654

Journal Articles

• Non-uniform sphere-packing bounds on the size of codes for combinatorial channels
  Daniel Cullina, Negar Kiyavash
  IEEE Transactions on Information Theory Vol. 62, No. 8, pp. 4454-4465, 2016.


• Bounds on the Sizes of Restricted-Composition Deletion Correcting Codes
  Daniel Cullina, Ankur Kulkarni, Negar Kiyavash
  IEEE Transactions on Information Theory Vol. 62, No. 9, pp. 4819-4832, 2016.


• Optimizing Resource Speed for Two-Stage Real-Time Tasks
  A. Melani, R. Mancuso, D. Cullina, M. Caccamo, L. Thiele
  Real-Time Systems Vol. 53, No 1, pp 82–120, 2017


• An Improvement to Levenshtein's Upper Bound on the Cardinality of Deletion Correcting Codes
  Daniel Cullina, Negar Kiyavash
  IEEE Transactions on Information Theory Vol. 60, No. 7, pp. 3862-3870, 2014.

Conference and Workshop Papers

• PAC-learning in the presence of evasion adversaries
  Daniel Cullina, Arjun N. Bhagoji, Prateek Mittal
  Neural Information Processing Systems (NeurIPS), 2018.
  arxiv 1806.01471


• Fundamental Limits of Database Alignment
  Daniel Cullina, Negar Kiyavash, Prateek Mittal
  IEEE International Symposium on Information Theory (ISIT), 2018.
  arxiv 1805.03829


• Rate-distance tradeoff for codes above graph capacity,
  D. Cullina, M. Dalai, Y. Polyanskiy,
  IEEE International Symposium on Information Theory (ISIT), 2016.
  arxiv 1607.06384


• Message Partitioning and Limited Auxiliary Randomness: Alternatives to Honey Encryption,
  A. Ghassami, D. Cullina, N. Kiyavash,
  IEEE International Symposium on Information Theory (ISIT), 2016.


• Improved Achievability and Converse Bounds for Erdos-Renyi Graph Matching,
  D. Cullina, N. Kiyavash,
  SIGMETRICS, 2016.
  arxiv 1602.01042


• Speed Optimization for Tasks with Two Resources,
  A. Melani, R. Mancuso, D. Cullina, M. Caccamo, L. Thiele,
  Design, Automation and Test in Europe, 2016.
  


• Combinatorial Channels from Partially Ordered Sets,
  D. Cullina,
  IEEE Workshop on Information Theory (ITW), 2015. Invited Paper
  


• Generalized sphere-packing upper bounds on the size of codes for combinatorial channels,
  D. Cullina, N. Kiyavash,
  IEEE International Symposium on Information Theory (ISIT), 2014.
  


• An Improvement to Levenshtein's Upper Bound on the Cardinality of Deletion Correcting Codes,
  D. Cullina, N. Kiyavash,
  IEEE International Symposium on Information Theory (ISIT), 2013.
  


• A Coloring Approach to Constructing Deletion Correcting Codes from Constant Weight Subgraphs,
  D. Cullina, A. Kulkarni, N. Kiyavash,
  IEEE International Symposium on Information Theory (ISIT), 2012.


• Searching for minimum storage regenerating codes,
  D. Cullina, A. Dimakis, T. Ho,
  Allerton Conference on Communication, Control and Computing, 2009.
  arxiv 0910.2245