Photo of Daniel Cullina

Daniel Cullina

Charles H. Fetter Endowed Fellow Assistant Professor

Affiliation(s):

  • School of Electrical Engineering and Computer Science
  • Electrical Engineering

111H Electrical Engineering West

dqc5596@psu.edu

814-863-9885

Research Areas:

Communications, Information Theory, and Coding over Networked Systems; Data Science and Artificial Intelligence; Security and Privacy

 
 

 

Education

  • BS, Electrical Engineering; Business, Economics, and Management, California Institute of Technology, 2010
  • Ph D, Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, 2016

Publications

Journal Articles

  • Osman Emre Dai, Daniel Cullina, Negar Kiyavash and Matthias Grossglauser, 2019, "Analysis of a Canonical Labeling Algorithm for the Alignment of Correlated Erdos-Rényi Graphs", ACM SIGMETRICS Performance Evaluation Review, 47, (1), pp. 96-97
  • Daniel Cullina, Negar Kiyavash, Prateek Mittal and H. Vincent Poor, 2019, "Partial Recovery of Erdðs-Rényi Graph Alignment via k-Core Alignment", Proceedings of the ACM on Measurement and Analysis of Computing Systems, 3, (3), pp. 1-21
  • Alessandra Melani, Renato Mancuso, Daniel Cullina, Marco Caccamo and Lothar Thiele, 2017, "Optimizing resource speed for two-stage real-time tasks", Real-Time Systems, 53, (1), pp. 82-120
  • Daniel Cullina, Negar Kiyavash and Ankur A. Kulkarni, 2016, "Restricted Composition Deletion Correcting Codes", IEEE Transactions on Information Theory, 62, (9), pp. 4819-4832
  • Daniel Cullina and Negar Kiyavash, 2016, "Generalized Sphere-Packing Bounds on the Size of Codes for Combinatorial Channels", IEEE Transactions on Information Theory, 62, (8), pp. 4454-4465
  • Daniel Cullina and Negar Kiyavash, 2016, "Improved Achievability and Converse Bounds for Erdos-Renyi Graph Matching", ACM SIGMETRICS Performance Evaluation Review, 44, (1), pp. 63-72
  • Daniel Cullina and Negar Kiyavash, 2014, "An Improvement to Levenshtein's Upper Bound on the Cardinality of Deletion Correcting Codes", IEEE Transactions on Information Theory, 60, (7), pp. 3862-3870

Conference Proceedings

  • Arjun Nitin Bhagoji, Daniel Cullina and Prateek Mittal, 2019, "Lower bounds on adversarial robustness from optimal transport", pp. 7496--7508
  • Vikash Sehwag, Arjun Nitin Bhagoji, Liwei Song, Chawin Sitawarin, Daniel Cullina, Mung Chiang and Prateek Mittal, 2019, "Analyzing the Robustness of Open-World Machine Learning", ACM Press
  • Daniel Cullina, Prateek Mittal and Negar Kiyavash, 2018, "Fundamental Limits of Database Alignment", IEEE
  • Arjun Nitin Bhagoji, Daniel Cullina, Chawin Sitawarin and Prateek Mittal, 2018, "Enhancing robustness of machine learning systems via data transformations", IEEE
  • AmirEmad Ghassami, Daniel Cullina and Negar Kiyavash, 2016, "Message partitioning and limited auxiliary randomness: Alternatives to Honey Encryption", IEEE
  • Daniel Cullina, Marco Dalai and Yury Polyanskiy, 2016, "Rate-distance tradeoff for codes above graph capacity", IEEE
  • Alessandra Melani, Renato Mancuso, Daniel Cullina, Marco Caccamo and Lothar Thiele, 2016, "Speed Optimization for Tasks with Two Resources", Research Publishing Services
  • Daniel Cullina and Negar Kiyavash, 2016, "Improved Achievability and Converse Bounds for Erdos-Renyi Graph Matching", ACM Press
  • Daniel Cullina and Negar Kiyavash, 2015, "Combinatorial channels from partially ordered sets", IEEE
  • Daniel Cullina and Negar Kiyavash, 2014, "Generalized sphere-packing upper bounds on the size of codes for combinatorial channels", IEEE
  • Daniel Cullina and Negar Kiyavash, 2013, "An improvement to Levenshtein's upper bound on the cardinality of deletion correcting codes", IEEE
  • Daniel Cullina, Ankur A. Kulkarni and Negar Kiyavash, 2012, "A coloring approach to constructing deletion correcting codes from constant weight subgraphs", IEEE

Research Projects

Honors and Awards

Service

Service to Penn State:

Service to External Organizations:

 


 

About

The School of Electrical Engineering and Computer Science was created in the spring of 2015 to allow greater access to courses offered by both departments for undergraduate and graduate students in exciting collaborative research fields.

We offer B.S. degrees in electrical engineering, computer science, computer engineering and data science and graduate degrees (master's degrees and Ph.D.'s) in electrical engineering and computer science and engineering. EECS focuses on the convergence of technologies and disciplines to meet today’s industrial demands.

School of Electrical Engineering and Computer Science

The Pennsylvania State University

207 Electrical Engineering West

University Park, PA 16802

814-863-6740

Department of Computer Science and Engineering

814-865-9505

Department of Electrical Engineering

814-865-7667