Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

From Clustering Supersequences to Entropy Minimizing Subsequences for Single and Double Deletions.

A. Atashpendar, M. Beunardeau, A. Connolly, R. Géraud, D. Mestel, A. Roscoe, and P. Ryan. CoRR, (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Atashpendar, Arash

add a person with the name Atashpendar, Arash

Other publications of authors with the same name

A Native Approach to Semantics and Inference in Fine-Grained Documents.A. Atashpendar, L. Kirsch, J. Botev, and S. Rothkugel. JIST, volume 7774 of Lecture Notes in Computer Science, page 267-277. Springer, (2012)A parallel cooperative coevolutionary SMPSO algorithm for multi-objective optimization.A. Atashpendar, B. Dorronsoro, G. Danoy, and P. Bouvry. HPCS, page 713-720. IEEE, (2016)Information Leakage Due to Revealing Randomly Selected Bits.A. Atashpendar, A. Roscoe, and P. Ryan. Security Protocols Workshop, volume 9379 of Lecture Notes in Computer Science, page 325-341. Springer, (2015)Revisiting Deniability in Quantum Key Exchange - via Covert Communication and Entanglement Distillation.A. Atashpendar, G. Policharla, P. Rønne, and P. Ryan. NordSec, volume 11252 of Lecture Notes in Computer Science, page 104-120. Springer, (2018)A Proof of Entropy Minimization for Outputs in Deletion Channels via Hidden Word Statistics.A. Atashpendar, D. Mestel, A. Roscoe, and P. Ryan. CoRR, (2018)A scalable parallel cooperative coevolutionary PSO algorithm for multi-objective optimization.A. Atashpendar, B. Dorronsoro, G. Danoy, and P. Bouvry. J. Parallel Distrib. Comput., (2018)From Information Theory Puzzles in Deletion Channels to Deniability in Quantum Cryptography.A. Atashpendar. University of Luxembourg, (2019)base-search.net (ftunivluxembourg:oai:orbilu.uni.lu:10993/38825).Information Leakage Due to Revealing Randomly Selected Bits (Transcript of Discussion).A. Atashpendar. Security Protocols Workshop, volume 9379 of Lecture Notes in Computer Science, page 342-349. Springer, (2015)From Clustering Supersequences to Entropy Minimizing Subsequences for Single and Double Deletions.A. Atashpendar, M. Beunardeau, A. Connolly, R. Géraud, D. Mestel, A. Roscoe, and P. Ryan. CoRR, (2018)Coercion-Resistant Voting in Linear Time via Fully Homomorphic Encryption: Towards a Quantum-Safe Scheme.P. Rønne, A. Atashpendar, K. Gjøsteen, and P. Ryan. CoRR, (2019)

PUMA

Disambiguation of "Atashpendar, Arash"

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

From Clustering Supersequences to Entropy Minimizing Subsequences for Single and Double Deletions.

Please choose a person to relate this publication to

Other publications of authors with the same name

Disambiguation

PUMA

Disambiguation of "Atashpendar, Arash"

copydeleteadd this publication to your clipboardcommunity posthistory of this postURLDOIBibTeXEndNoteAPAChicagoDIN 1505HarvardMSOffice XML From Clustering Supersequences to Entropy Minimizing Subsequences for Single and Double Deletions.

Please choose a person to relate this publication to

Other publications of authors with the same name

Disambiguation

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

From Clustering Supersequences to Entropy Minimizing Subsequences for Single and Double Deletions.