default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Cullina
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c19]Sihui Dai, Wenxin Ding, Arjun Nitin Bhagoji, Daniel Cullina, Heather Zheng, Ben Zhao, Prateek Mittal:
Characterizing the Optimal 0-1 Loss for Multi-class Classification with a Test-time Attacker. NeurIPS 2023- [i20]Sihui Dai, Wenxin Ding, Arjun Nitin Bhagoji
, Daniel Cullina, Ben Y. Zhao, Haitao Zheng, Prateek Mittal:
Characterizing the Optimal 0-1 Loss for Multi-class Classification with a Test-time Attacker. CoRR abs/2302.10722 (2023) - [i19]Osman Emre Dai, Daniel Cullina, Negar Kiyavash:
Gaussian Database Alignment and Gaussian Planted Matching. CoRR abs/2307.02459 (2023) - 2021
- [c18]Arjun Nitin Bhagoji, Daniel Cullina, Vikash Sehwag, Prateek Mittal:
Lower Bounds on Cross-Entropy Loss in the Presence of Test-time Adversaries. ICML 2021: 863-873 - [i18]Arjun Nitin Bhagoji, Daniel Cullina, Vikash Sehwag, Prateek Mittal:
Lower Bounds on Cross-Entropy Loss in the Presence of Test-time Adversaries. CoRR abs/2104.08382 (2021) - 2020
- [c17]Osman Emre Dai, Daniel Cullina, Negar Kiyavash:
Achievability of nearly-exact alignment for correlated Gaussian databases. ISIT 2020: 1230-1235 - [c16]Daniel Cullina, Negar Kiyavash, Prateek Mittal, H. Vincent Poor:
Partial Recovery of Erdős-Rényi Graph Alignment via k-Core Alignment. SIGMETRICS (Abstracts) 2020: 99-100
2010 – 2019
- 2019
- [j6]Osman Emre Dai, Daniel Cullina, Negar Kiyavash, Matthias Grossglauser:
Analysis of a Canonical Labeling Algorithm for the Alignment of Correlated Erdos-Rényi Graphs. Proc. ACM Meas. Anal. Comput. Syst. 3(2): 36:1-36:25 (2019) - [j5]Daniel Cullina, Negar Kiyavash, Prateek Mittal, H. Vincent Poor:
Partial Recovery of Erdðs-Rényi Graph Alignment via k-Core Alignment. Proc. ACM Meas. Anal. Comput. Syst. 3(3): 54:1-54:21 (2019) - [c15]Osman Emre Dai, Daniel Cullina, Negar Kiyavash:
Database Alignment with Gaussian Features. AISTATS 2019: 3225-3233 - [c14]Vikash Sehwag, Arjun Nitin Bhagoji, Liwei Song, Chawin Sitawarin, Daniel Cullina, Mung Chiang, Prateek Mittal:
Analyzing the Robustness of Open-World Machine Learning. AISec@CCS 2019: 105-116 - [c13]Arjun Nitin Bhagoji, Daniel Cullina, Prateek Mittal:
Lower Bounds on Adversarial Robustness from Optimal Transport. NeurIPS 2019: 7496-7508 - [c12]Osman Emre Dai, Daniel Cullina, Negar Kiyavash, Matthias Grossglauser:
Analysis of a Canonical Labeling Algorithm for the Alignment of Correlated Erdős-Rényi Graphs. SIGMETRICS (Abstracts) 2019: 97-98 - [i17]Osman Emre Dai, Daniel Cullina, Negar Kiyavash:
Database Alignment with Gaussian Features. CoRR abs/1903.01422 (2019) - [i16]Vikash Sehwag, Arjun Nitin Bhagoji, Liwei Song, Chawin Sitawarin, Daniel Cullina, Mung Chiang, Prateek Mittal:
Better the Devil you Know: An Analysis of Evasion Attacks using Out-of-Distribution Adversarial Examples. CoRR abs/1905.01726 (2019) - [i15]Arjun Nitin Bhagoji, Daniel Cullina, Prateek Mittal:
Lower Bounds on Adversarial Robustness from Optimal Transport. CoRR abs/1909.12272 (2019) - 2018
- [c11]Arjun Nitin Bhagoji, Daniel Cullina, Chawin Sitawarin, Prateek Mittal:
Enhancing robustness of machine learning systems via data transformations. CISS 2018: 1-5 - [c10]Daniel Cullina, Prateek Mittal, Negar Kiyavash:
Fundamental Limits of Database Alignment. ISIT 2018: 651-655 - [c9]Daniel Cullina, Arjun Nitin Bhagoji, Prateek Mittal:
PAC-learning in the presence of adversaries. NeurIPS 2018: 228-239 - [i14]Osman Emre Dai, Daniel Cullina, Negar Kiyavash, Matthias Grossglauser:
On the Performance of a Canonical Labeling for Matching Correlated Erdős-Rényi Graphs. CoRR abs/1804.09758 (2018) - [i13]Daniel Cullina, Prateek Mittal, Negar Kiyavash:
Fundamental Limits of Database Alignment. CoRR abs/1805.03829 (2018) - [i12]Daniel Cullina, Arjun Nitin Bhagoji, Prateek Mittal:
PAC-learning in the presence of evasion adversaries. CoRR abs/1806.01471 (2018) - [i11]Daniel Cullina, Negar Kiyavash, Prateek Mittal, H. Vincent Poor:
Partial Recovery of Erdős-Rényi Graph Alignment via k-Core Alignment. CoRR abs/1809.03553 (2018) - 2017
- [j4]Alessandra Melani, Renato Mancuso, Daniel Cullina, Marco Caccamo, Lothar Thiele:
Optimizing resource speed for two-stage real-time tasks. Real Time Syst. 53(1): 82-120 (2017) - [i10]Arjun Nitin Bhagoji, Daniel Cullina, Prateek Mittal:
Dimensionality Reduction as a Defense against Evasion Attacks on Machine Learning Classifiers. CoRR abs/1704.02654 (2017) - [i9]Kushagra Singhal, Daniel Cullina, Negar Kiyavash:
Significance of Side Information in the Graph Matching Problem. CoRR abs/1706.06936 (2017) - [i8]Daniel Cullina, Negar Kiyavash:
Exact alignment recovery for correlated Erdos Renyi graphs. CoRR abs/1711.06783 (2017) - 2016
- [b1]Daniel Cullina:
Combinatorial channels from partially ordered sets. University of Illinois Urbana-Champaign, USA, 2016 - [j3]Daniel Cullina, Negar Kiyavash:
Generalized Sphere-Packing Bounds on the Size of Codes for Combinatorial Channels. IEEE Trans. Inf. Theory 62(8): 4454-4465 (2016) - [j2]Daniel Cullina, Negar Kiyavash, Ankur A. Kulkarni:
Restricted Composition Deletion Correcting Codes. IEEE Trans. Inf. Theory 62(9): 4819-4832 (2016) - [c8]Alessandra Melani, Renato Mancuso, Daniel Cullina, Marco Caccamo, Lothar Thiele:
Speed optimization for tasks with two resources. DATE 2016: 1072-1077 - [c7]Daniel F. Cullina, Marco Dalai, Yury Polyanskiy:
Rate-distance tradeoff for codes above graph capacity. ISIT 2016: 1331-1335 - [c6]AmirEmad Ghassami, Daniel F. Cullina, Negar Kiyavash:
Message partitioning and limited auxiliary randomness: Alternatives to Honey Encryption. ISIT 2016: 1371-1375 - [c5]Daniel Cullina, Negar Kiyavash:
Improved Achievability and Converse Bounds for Erdos-Renyi Graph Matching. SIGMETRICS 2016: 63-72 - [i7]Daniel Cullina, Negar Kiyavash:
Improved Achievability and Converse Bounds for Erdős-Rényi Graph Matching. CoRR abs/1602.01042 (2016) - [i6]Daniel Cullina, Kushagra Singhal, Negar Kiyavash, Prateek Mittal:
On the Simultaneous Preservation of Privacy and Community Structure in Anonymized Networks. CoRR abs/1603.08028 (2016) - [i5]Daniel Cullina, Marco Dalai, Yury Polyanskiy:
Rate-distance tradeoff for codes above graph capacity. CoRR abs/1607.06384 (2016) - 2015
- [c4]Daniel Cullina, Negar Kiyavash:
Combinatorial channels from partially ordered sets. ITW 2015: 1-5 - 2014
- [j1]Daniel Cullina, Negar Kiyavash:
An Improvement to Levenshtein's Upper Bound on the Cardinality of Deletion Correcting Codes. IEEE Trans. Inf. Theory 60(7): 3862-3870 (2014) - [c3]Daniel F. Cullina, Negar Kiyavash:
Generalized sphere-packing upper bounds on the size of codes for combinatorial channels. ISIT 2014: 1266-1270 - [i4]Daniel Cullina, Negar Kiyavash:
Generalized sphere-packing and sphere-covering bounds on the size of codes for combinatorial channels. CoRR abs/1405.1464 (2014) - 2013
- [c2]Daniel Cullina, Negar Kiyavash:
An improvement to Levenshtein's upper bound on the cardinality of deletion correcting codes. ISIT 2013: 699-703 - [i3]Daniel Cullina, Negar Kiyavash:
An Improvement to Levenshtein's Upper Bound on the Cardinality of Deletion Correcting Codes. CoRR abs/1302.6562 (2013) - 2012
- [c1]Daniel Cullina, Ankur A. Kulkarni, Negar Kiyavash:
A coloring approach to constructing deletion correcting codes from constant weight subgraphs. ISIT 2012: 513-517 - [i2]Daniel Cullina, Ankur A. Kulkarni, Negar Kiyavash:
Two Approaches to the Construction of Deletion Correcting Codes: Weight Partitioning and Optimal Colorings. CoRR abs/1211.4056 (2012)
2000 – 2009
- 2009
- [i1]Daniel Cullina, Alexandros G. Dimakis, Tracey Ho:
Searching for Minimum Storage Regenerating Codes. CoRR abs/0910.2245 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
