Farzad Farnoud

Orcid: 0000-0002-8684-4487

Affiliations:
  • University of Virginia, VA, USA
  • California Institute of Technology, Department of Electrical Engineering, Pasadena, CA, USA (former)


According to our database1, Farzad Farnoud authored at least 74 papers between 2007 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Non-Binary Codes for Correcting a Burst of at Most t Deletions.
IEEE Trans. Inf. Theory, February, 2024

2023
Low-Redundancy Codes for Correcting Multiple Short-Duplication and Edit Errors.
IEEE Trans. Inf. Theory, May, 2023

Variance-Aware Regret Bounds for Stochastic Contextual Dueling Bandits.
CoRR, 2023

Borda Regret Minimization for Generalized Linear Dueling Bandits.
CoRR, 2023

Correcting a substring edit error of bounded length.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Linial's Algorithm and Systematic Deletion-Correcting Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Constrained Code for Data Storage in DNA via Nanopore Sequencing.
Proceedings of the 57th Asilomar Conference on Signals, Systems, and Computers, ACSSC 2023, Pacific Grove, CA, USA, October 29, 2023

A Statistical Analysis of Duplication Errors in the Nanopore Sequencing Channel.
Proceedings of the 57th Asilomar Conference on Signals, Systems, and Computers, ACSSC 2023, Pacific Grove, CA, USA, October 29, 2023

2022
Error-Correcting Codes for Short Tandem Duplication and Edit Errors.
IEEE Trans. Inf. Theory, 2022

Data Deduplication With Random Substitutions.
IEEE Trans. Inf. Theory, 2022

Active Ranking without Strong Stochastic Transitivity.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Correcting multiple short duplication and substitution errors.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Universal Compression of Large Alphabets with Constrained Compressors.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Permutation Codes for Correcting a Burst of at Most $t$ Deletions.
Proceedings of the 58th Annual Allerton Conference on Communication, 2022

Adaptive Sampling for Heterogeneous Rank Aggregation from Noisy Pairwise Comparisons.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021
Error-Correcting Codes for Noisy Duplication Channels.
IEEE Trans. Inf. Theory, 2021

Correcting deletion errors in DNA data storage with enzymatic synthesis.
Proceedings of the IEEE Information Theory Workshop, 2021

Non-binary Codes for Correcting a Burst of at Most 2 Deletions.
Proceedings of the IEEE International Symposium on Information Theory, 2021

Error-correcting codes for short tandem duplications and at most $p$ substitutions.
Proceedings of the IEEE International Symposium on Information Theory, 2021

Asymptotic Analysis of Data Deduplication with a Constant Number of Substitutions.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2020
Single-Error Detection and Correction for Duplication and Substitution Channels.
IEEE Trans. Inf. Theory, 2020

Evolution of $k$ -Mer Frequencies and Entropy in Duplication and Substitution Mutation Systems.
IEEE Trans. Inf. Theory, 2020

Error-correcting Codes for Short Tandem Duplication and Substitution Errors.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Coding for Optimized Writing Rate in DNA Storage.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Efficient Search of Circular Repeats and MicroDNA Reintegration in DNA Sequences.
Proceedings of the 20th IEEE International Conference on Bioinformatics and Bioengineering, 2020

Rank Aggregation via Heterogeneous Thurstone Preference Models.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Estimation of duplication history under a stochastic model for tandem repeats.
BMC Bioinform., December, 2019

The Entropy Rate of Some Pólya String Models.
IEEE Trans. Inf. Theory, 2019

Reconciling Similar Sets of Data.
IEEE Trans. Commun., 2019

Solving the Maximum Independent Set Problem using Coupled Relaxation Oscillators.
Proceedings of the Device Research Conference, 2019

Finite-Time Behavior of k-mer Frequencies and Waiting Times in Noisy-Duplication Systems.
Proceedings of the 53rd Asilomar Conference on Signals, Systems, and Computers, 2019

2018
Evolution of N-Gram Frequencies Under Duplication and Substitution Mutations.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
Duplication-Correcting Codes for Data Storage in the DNA of Living Organisms.
IEEE Trans. Inf. Theory, 2017

Capacity and Expressiveness of Genomic Tandem Duplication.
IEEE Trans. Inf. Theory, 2017

Duplication Distance to the Root for Binary Sequences.
IEEE Trans. Inf. Theory, 2017

Computing similarity distances between rankings.
Discret. Appl. Math., 2017

Noise and uncertainty in string-duplication systems.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Reconciling similar sets.
Proceedings of the 55th Annual Allerton Conference on Communication, 2017

2016
The Capacity of String-Duplication Systems.
IEEE Trans. Inf. Theory, 2016

Bounds for Permutation Rate-Distortion.
IEEE Trans. Inf. Theory, 2016

Codes Correcting Erasures and Deletions for Rank Modulation.
IEEE Trans. Inf. Theory, 2016

Approximate sorting of data streams with limited storage.
J. Comb. Optim., 2016

MetaCRAM: an integrated pipeline for metagenomic taxonomy identification and compression.
BMC Bioinform., 2016

The capacity of some Pólya string models.
Proceedings of the IEEE International Symposium on Information Theory, 2016

On the duplication distance of binary strings.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
HyDRA: gene prioritization via hybrid distance-score rank aggregation.
Bioinform., 2015

A stochastic model for genomic interspersed duplication.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
An Axiomatic Approach to Constructing Distances for Rank Comparison and Aggregation.
IEEE Trans. Inf. Theory, 2014

Multipermutation Codes in the Ulam Metric for Nonvolatile Memories.
IEEE J. Sel. Areas Commun., 2014

The Capacity of String-Replication Systems.
CoRR, 2014

Rate-Distortion for Ranking with Incomplete Information.
CoRR, 2014

Similarity distances between permutations.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Single-deletion-correcting codes over permutations.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Codes correcting erasures and deletions for rank modulation.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Multipermutation codes in the Ulam metric.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013
Error-Correction in Flash Memories via Codes in the Ulam Metric.
IEEE Trans. Inf. Theory, 2013

Computing Similarity Distances Between Rankings.
CoRR, 2013

Aggregating rankings with positional constraints.
Proceedings of the 2013 IEEE Information Theory Workshop, 2013

Weighted rank aggregation via relaxed integer programming.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Building consensus via iterative voting.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

MetaPar: Metagenomic sequence assembly via iterative reclassification.
Proceedings of the IEEE Global Conference on Signal and Information Processing, 2013

Gene prioritization via weighted Kendall rank aggregation.
Proceedings of the 5th IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, 2013

A general framework for distributed vote aggregation.
Proceedings of the American Control Conference, 2013

2012
Sorting of Permutations by Cost-Constrained Transpositions.
IEEE Trans. Inf. Theory, 2012

A Novel Distance-Based Approach to Constrained Rank Aggregation
CoRR, 2012

Nonuniform Vote Aggregation Algorithms
CoRR, 2012

Rank modulation for translocation error correction.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Alternating Markov chains for distribution estimation in the presence of errors.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
Decomposing permutations via cost-constrained transpositions.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010
On the multimessage capacity region for undirected ring networks.
IEEE Trans. Inf. Theory, 2010

A graphical model for computing the minimum cost transposition distance.
Proceedings of the 2010 IEEE Information Theory Workshop, 2010

2009
Small-sample distribution estimation over sticky channels.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Reliable Broadcast of Safety Messages in Vehicular Ad Hoc Networks.
Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

2007
A Multimessage Capacity Region for Undirected Ring Networks.
Proceedings of the IEEE International Symposium on Information Theory, 2007


  Loading...