default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFarzad Farnoud
Farzad Farnoud Hassanzadeh
Person information
- affiliation: University of Virginia, VA, USA
- affiliation (former): California Institute of Technology, Department of Electrical Engineering, Pasadena, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j25]Shuche Wang
, Yuanyuan Tang, Jin Sima, Ryan Gabrys, Farzad Farnoud:
Non-Binary Codes for Correcting a Burst of at Most t Deletions. IEEE Trans. Inf. Theory 70(2): 964-979 (2024)- [c54]Qiwei Di, Tao Jin, Yue Wu, Heyang Zhao, Farzad Farnoud, Quanquan Gu:
Variance-aware Regret Bounds for Stochastic Contextual Dueling Bandits. ICLR 2024 - [c53]Yue Wu, Tao Jin, Qiwei Di, Hao Lou, Farzad Farnoud, Quanquan Gu:
Borda Regret Minimization for Generalized Linear Dueling Bandits. ICML 2024 - [c52]L. Yuting, Yuanyuan Tang, Hao Lou, Ryan Gabrys, Farzad Farnoud:
Asymptotically Optimal Codes Correcting One Substring Edit. ISIT 2024: 470-475 - 2023
- [j24]Yuanyuan Tang, Shuche Wang, Hao Lou, Ryan Gabrys, Farzad Farnoud:
Low-Redundancy Codes for Correcting Multiple Short-Duplication and Edit Errors. IEEE Trans. Inf. Theory 69(5): 2940-2954 (2023) - [c51]Sarvin Motamen, Hao Lou, Farzad Farnoud:
A Statistical Analysis of Duplication Errors in the Nanopore Sequencing Channel. ACSSC 2023: 970-974 - [c50]Kallie Whritenour, Mete Civelek, Farzad Farnoud:
Constrained Code for Data Storage in DNA via Nanopore Sequencing. ACSSC 2023: 975-981 - [c49]Yuting Li, Farzad Farnoud:
Linial's Algorithm and Systematic Deletion-Correcting Codes. ISIT 2023: 2703-2707 - [c48]Yuanyuan Tang, Sarvin Motamen, Hao Lou, Kallie Whritenour, Shuche Wang, Ryan Gabrys, Farzad Farnoud:
Correcting a substring edit error of bounded length. ISIT 2023: 2720-2725 - [i27]Yue Wu, Tao Jin, Hao Lou, Farzad Farnoud, Quanquan Gu:
Borda Regret Minimization for Generalized Linear Dueling Bandits. CoRR abs/2303.08816 (2023) - [i26]Qiwei Di, Tao Jin, Yue Wu, Heyang Zhao, Farzad Farnoud, Quanquan Gu:
Variance-Aware Regret Bounds for Stochastic Contextual Dueling Bandits. CoRR abs/2310.00968 (2023) - 2022
- [j23]Yuanyuan Tang, Farzad Farnoud:
Error-Correcting Codes for Short Tandem Duplication and Edit Errors. IEEE Trans. Inf. Theory 68(2): 871-880 (2022) - [j22]Hao Lou, Farzad Farnoud:
Data Deduplication With Random Substitutions. IEEE Trans. Inf. Theory 68(10): 6941-6963 (2022) - [c47]Yue Wu, Tao Jin, Hao Lou, Pan Xu, Farzad Farnoud, Quanquan Gu:
Adaptive Sampling for Heterogeneous Rank Aggregation from Noisy Pairwise Comparisons. AISTATS 2022: 11014-11036 - [c46]Shuche Wang, Yuanyuan Tang, Ryan Gabrys, Farzad Farnoud:
Permutation Codes for Correcting a Burst of at Most $t$ Deletions. Allerton 2022: 1-6 - [c45]Hao Lou, Farzad Farnoud:
Universal Compression of Large Alphabets with Constrained Compressors. ISIT 2022: 67-72 - [c44]Yuanyuan Tang, Shuche Wang, Ryan Gabrys, Farzad Farnoud:
Correcting multiple short duplication and substitution errors. ISIT 2022: 1797-1802 - [c43]Hao Lou, Tao Jin, Yue Wu, Pan Xu, Quanquan Gu, Farzad Farnoud:
Active Ranking without Strong Stochastic Transitivity. NeurIPS 2022 - [i25]Yuanyuan Tang, Shuche Wang, Hao Lou, Ryan Gabrys, Farzad Farnoud:
Low-redundancy codes for correcting multiple short-duplication and edit errors. CoRR abs/2208.02330 (2022) - [i24]Shuche Wang, Yuanyuan Tang, Jin Sima, Ryan Gabrys, Farzad Farnoud:
Non-binary Codes for Correcting a Burst of at Most t Deletions. CoRR abs/2210.11818 (2022) - 2021
- [j21]Yuanyuan Tang, Farzad Farnoud:
Error-Correcting Codes for Noisy Duplication Channels. IEEE Trans. Inf. Theory 67(6): 3452-3463 (2021) - [c42]Yuanyuan Tang, Hao Lou, Farzad Farnoud:
Error-correcting codes for short tandem duplications and at most $p$ substitutions. ISIT 2021: 1835-1840 - [c41]Shuche Wang, Jin Sima, Farzad Farnoud:
Non-binary Codes for Correcting a Burst of at Most 2 Deletions. ISIT 2021: 2804-2809 - [c40]Hao Lou, Farzad Farnoud Hassanzadeh:
Asymptotic Analysis of Data Deduplication with a Constant Number of Substitutions. ISIT 2021: 3296-3301 - [c39]Yuanyuan Tang, Farzad Farnoud:
Correcting deletion errors in DNA data storage with enzymatic synthesis. ITW 2021: 1-6 - [i23]Hao Lou, Farzad Farnoud:
Data Deduplication with Random Substitutions. CoRR abs/2107.00490 (2021) - [i22]Yue Wu, Tao Jin, Hao Lou, Pan Xu, Farzad Farnoud, Quanquan Gu:
Adaptive Sampling for Heterogeneous Rank Aggregation from Noisy Pairwise Comparisons. CoRR abs/2110.04136 (2021) - 2020
- [j20]Hao Lou, Moshe Schwartz, Jehoshua Bruck, Farzad Farnoud:
Evolution of $k$ -Mer Frequencies and Entropy in Duplication and Substitution Mutation Systems. IEEE Trans. Inf. Theory 66(5): 3171-3186 (2020) - [j19]Yuanyuan Tang, Yonatan Yehezkeally, Moshe Schwartz, Farzad Farnoud:
Single-Error Detection and Correction for Duplication and Substitution Channels. IEEE Trans. Inf. Theory 66(11): 6908-6919 (2020) - [c38]Tao Jin, Pan Xu, Quanquan Gu, Farzad Farnoud:
Rank Aggregation via Heterogeneous Thurstone Preference Models. AAAI 2020: 4353-4360 - [c37]Yiming Wang, Hao Lou, Pankaj Kumar, Anindya Dutta, Farzad Farnoud:
Efficient Search of Circular Repeats and MicroDNA Reintegration in DNA Sequences. BIBE 2020: 89-96 - [c36]Siddharth Jain, Farzad Farnoud, Moshe Schwartz, Jehoshua Bruck:
Coding for Optimized Writing Rate in DNA Storage. ISIT 2020: 711-716 - [c35]Yuanyuan Tang, Farzad Farnoud:
Error-correcting Codes for Short Tandem Duplication and Substitution Errors. ISIT 2020: 734-739 - [c34]Hao Lou, Farzad Farnoud:
Data Deduplication with Random Substitutions. ISIT 2020: 2377-2382 - [i21]Siddharth Jain, Farzad Farnoud, Moshe Schwartz, Jehoshua Bruck:
Coding for Optimized Writing Rate in DNA Storage. CoRR abs/2005.03248 (2020) - [i20]Yuanyuan Tang, Farzad Farnoud:
Error-correcting Codes for Noisy Duplication Channels. CoRR abs/2008.08174 (2020) - [i19]Yuanyuan Tang, Farzad Farnoud:
Error-correcting Codes for Short Tandem Duplication and Substitution Errors. CoRR abs/2011.05896 (2020)
2010 – 2019
- 2019
- [j18]Farzad Farnoud, Moshe Schwartz, Jehoshua Bruck:
Estimation of duplication history under a stochastic model for tandem repeats. BMC Bioinform. 20(1): 64 (2019) - [j17]Ryan Gabrys, Farzad Farnoud:
Reconciling Similar Sets of Data. IEEE Trans. Commun. 67(8): 5217-5229 (2019) - [j16]Ohad Elishco, Farzad Farnoud Hassanzadeh, Moshe Schwartz, Jehoshua Bruck:
The Entropy Rate of Some Pólya String Models. IEEE Trans. Inf. Theory 65(12): 8180-8193 (2019) - [c33]Hao Lou, Farzad Farnoud Hassanzadeh:
Finite-Time Behavior of k-mer Frequencies and Waiting Times in Noisy-Duplication Systems. ACSSC 2019: 1379-1383 - [c32]Yuanyuan Tang, Farzad Farnoud Hassanzadeh:
Error-correcting Codes for Noisy Duplication Channels. Allerton 2019: 140-146 - [c31]Mohammad Khairul Bashar, Richard Hrdy, Antik Mallick, Farzad Farnoud Hassanzadeh, Nikhil Shukla:
Solving the Maximum Independent Set Problem using Coupled Relaxation Oscillators. DRC 2019: 187-188 - [c30]Yuanyuan Tang, Yonatan Yehezkeally, Moshe Schwartz, Farzad Farnoud Hassanzadeh:
Single-Error Detection and Correction for Duplication and Substitution Channels. ISIT 2019: 300-304 - [i18]Yuanyuan Tang, Yonatan Yehezkeally, Moshe Schwartz, Farzad Farnoud:
Single-Error Detection and Correction for Duplication and Substitution Channels. CoRR abs/1911.05413 (2019) - [i17]Tao Jin, Pan Xu, Quanquan Gu, Farzad Farnoud:
Rank Aggregation via Heterogeneous Thurstone Preference Models. CoRR abs/1912.01211 (2019) - 2018
- [c29]Hao Lou, Moshe Schwartz, Farzad Farnoud Hassanzadeh:
Evolution of N-Gram Frequencies Under Duplication and Substitution Mutations. ISIT 2018: 2246-2250 - [i16]Ohad Elishco, Farzad Farnoud, Moshe Schwartz, Jehoshua Bruck:
The Capacity of Some Pólya String Models. CoRR abs/1808.06062 (2018) - [i15]Ryan Gabrys, Farzad Farnoud:
Reconciling Similar Sets of Data. CoRR abs/1809.04702 (2018) - [i14]Hao Lou, Farzad Farnoud, Moshe Schwartz, Jehoshua Bruck:
Evolution of k-mer Frequencies and Entropy in Duplication and Substitution Mutation Systems. CoRR abs/1812.02250 (2018) - 2017
- [j15]Farzad Farnoud Hassanzadeh, Olgica Milenkovic, Gregory J. Puleo, Lili Su:
Computing similarity distances between rankings. Discret. Appl. Math. 232: 157-175 (2017) - [j14]Siddharth Jain, Farzad Farnoud Hassanzadeh, Moshe Schwartz, Jehoshua Bruck:
Duplication-Correcting Codes for Data Storage in the DNA of Living Organisms. IEEE Trans. Inf. Theory 63(8): 4996-5010 (2017) - [j13]Siddharth Jain, Farzad Farnoud Hassanzadeh, Jehoshua Bruck:
Capacity and Expressiveness of Genomic Tandem Duplication. IEEE Trans. Inf. Theory 63(10): 6129-6138 (2017) - [j12]Noga Alon, Jehoshua Bruck, Farzad Farnoud Hassanzadeh, Siddharth Jain:
Duplication Distance to the Root for Binary Sequences. IEEE Trans. Inf. Theory 63(12): 7793-7803 (2017) - [c28]Ryan Gabrys, Farzad Farnoud Hassanzadeh:
Reconciling similar sets. Allerton 2017: 1139-1144 - [c27]Siddharth Jain, Farzad Farnoud Hassanzadeh, Moshe Schwartz, Jehoshua Bruck:
Noise and uncertainty in string-duplication systems. ISIT 2017: 3120-3124 - 2016
- [j11]Minji Kim, Xiejia Zhang, Jonathan G. Ligo, Farzad Farnoud, Venugopal V. Veeravalli, Olgica Milenkovic:
MetaCRAM: an integrated pipeline for metagenomic taxonomy identification and compression. BMC Bioinform. 17: 94 (2016) - [j10]Farzad Farnoud, Eitan Yaakobi, Jehoshua Bruck:
Approximate sorting of data streams with limited storage. J. Comb. Optim. 32(4): 1133-1164 (2016) - [j9]Ryan Gabrys, Eitan Yaakobi, Farzad Farnoud, Frederic Sala, Jehoshua Bruck, Lara Dolecek:
Codes Correcting Erasures and Deletions for Rank Modulation. IEEE Trans. Inf. Theory 62(1): 136-150 (2016) - [j8]Farzad Farnoud Hassanzadeh, Moshe Schwartz, Jehoshua Bruck:
Bounds for Permutation Rate-Distortion. IEEE Trans. Inf. Theory 62(2): 703-712 (2016) - [j7]Farzad Farnoud Hassanzadeh, Moshe Schwartz, Jehoshua Bruck:
The Capacity of String-Duplication Systems. IEEE Trans. Inf. Theory 62(2): 811-824 (2016) - [c26]Noga Alon, Jehoshua Bruck, Farzad Farnoud, Siddharth Jain:
On the duplication distance of binary strings. ISIT 2016: 260-264 - [c25]Ohad Elishco, Farzad Farnoud, Moshe Schwartz, Jehoshua Bruck:
The capacity of some Pólya string models. ISIT 2016: 270-274 - [c24]Siddharth Jain, Farzad Farnoud, Moshe Schwartz, Jehoshua Bruck:
Duplication-correcting codes for data storage in the DNA of living organisms. ISIT 2016: 1028-1032 - [i13]Siddharth Jain, Farzad Farnoud, Moshe Schwartz, Jehoshua Bruck:
Duplication-Correcting Codes for Data Storage in the DNA of Living Organisms. CoRR abs/1606.00397 (2016) - [i12]Noga Alon, Jehoshua Bruck, Farzad Farnoud, Siddharth Jain:
Duplication Distance to the Root for Binary Sequences. CoRR abs/1611.05537 (2016) - 2015
- [j6]Minji Kim, Farzad Farnoud, Olgica Milenkovic:
HyDRA: gene prioritization via hybrid distance-score rank aggregation. Bioinform. 31(7): 1034-1043 (2015) - [c23]Farzad Farnoud, Moshe Schwartz, Jehoshua Bruck:
A stochastic model for genomic interspersed duplication. ISIT 2015: 904-908 - [c22]Siddharth Jain, Farzad Farnoud, Jehoshua Bruck:
Capacity and expressiveness of genomic tandem duplication. ISIT 2015: 1946-1950 - [c21]Ryan Gabrys, Farzad Farnoud:
Reconciling similar sets of data. ISIT 2015: 2837-2841 - [i11]Siddharth Jain, Farzad Farnoud, Jehoshua Bruck:
Capacity and Expressiveness of Genomic Tandem Duplication. CoRR abs/1509.06029 (2015) - 2014
- [j5]Farzad Farnoud Hassanzadeh, Olgica Milenkovic:
Multipermutation Codes in the Ulam Metric for Nonvolatile Memories. IEEE J. Sel. Areas Commun. 32(5): 919-932 (2014) - [j4]Farzad Farnoud Hassanzadeh, Olgica Milenkovic:
An Axiomatic Approach to Constructing Distances for Rank Comparison and Aggregation. IEEE Trans. Inf. Theory 60(10): 6417-6439 (2014) - [c20]Farzad Farnoud Hassanzadeh, Eitan Yaakobi, Jehoshua Bruck:
Approximate Sorting of Data Streams with Limited Storage. COCOON 2014: 465-476 - [c19]Farzad Farnoud, Moshe Schwartz, Jehoshua Bruck:
Bounds for permutation rate-distortion. ISIT 2014: 6-10 - [c18]Farzad Farnoud, Moshe Schwartz, Jehoshua Bruck:
The capacity of string-duplication systems. ISIT 2014: 1301-1305 - [c17]Lili Su, Farzad Farnoud, Olgica Milenkovic:
Similarity distances between permutations. ISIT 2014: 2267-2271 - [c16]Farzad Farnoud, Olgica Milenkovic:
Multipermutation codes in the Ulam metric. ISIT 2014: 2754-2758 - [c15]Ryan Gabrys, Eitan Yaakobi, Farzad Farnoud, Jehoshua Bruck:
Codes correcting erasures and deletions for rank modulation. ISIT 2014: 2759-2763 - [c14]Ryan Gabrys, Eitan Yaakobi, Farzad Farnoud, Frederic Sala, Jehoshua Bruck, Lara Dolecek:
Single-deletion-correcting codes over permutations. ISIT 2014: 2764-2768 - [i10]Farzad Farnoud, Moshe Schwartz, Jehoshua Bruck:
Rate-Distortion for Ranking with Incomplete Information. CoRR abs/1401.3093 (2014) - [i9]Farzad Farnoud, Moshe Schwartz, Jehoshua Bruck:
The Capacity of String-Replication Systems. CoRR abs/1401.4634 (2014) - 2013
- [j3]Farzad Farnoud, Vitaly Skachek, Olgica Milenkovic:
Error-Correction in Flash Memories via Codes in the Ulam Metric. IEEE Trans. Inf. Theory 59(5): 3003-3020 (2013) - [c13]Behrouz Touri, Farzad Farnoud, Angelia Nedic, Olgica Milenkovic:
A general framework for distributed vote aggregation. ACC 2013: 3827-3832 - [c12]Minji Kim, Fardad Raisali, Farzad Farnoud, Olgica Milenkovic:
Gene prioritization via weighted Kendall rank aggregation. CAMSAP 2013: 184-187 - [c11]Minji Kim, Jonathan G. Ligo, Amin Emad, Farzad Farnoud, Olgica Milenkovic, Venugopal V. Veeravalli:
MetaPar: Metagenomic sequence assembly via iterative reclassification. GlobalSIP 2013: 43-46 - [c10]Farzad Farnoud Hassanzadeh, Eitan Yaakobi, Behrouz Touri, Olgica Milenkovic, Jehoshua Bruck:
Building consensus via iterative voting. ISIT 2013: 1082-1086 - [c9]Fardad Raisali, Farzad Farnoud Hassanzadeh, Olgica Milenkovic:
Weighted rank aggregation via relaxed integer programming. ISIT 2013: 2765-2769 - [c8]Farzad Farnoud Hassanzadeh, Olgica Milenkovic:
Aggregating rankings with positional constraints. ITW 2013: 1-5 - [i8]Lili Su, Farzad Farnoud, Olgica Milenkovic:
Computing Similarity Distances Between Rankings. CoRR abs/1307.4339 (2013) - [i7]Farzad Farnoud, Olgica Milenkovic:
Multipermutation Codes in the Ulam Metric for Nonvolatile Memories. CoRR abs/1312.2163 (2013) - 2012
- [j2]Farzad Farnoud, Olgica Milenkovic:
Sorting of Permutations by Cost-Constrained Transpositions. IEEE Trans. Inf. Theory 58(1): 3-23 (2012) - [c7]Farzad Farnoud, Narayana P. Santhanam, Olgica Milenkovic:
Alternating Markov chains for distribution estimation in the presence of errors. ISIT 2012: 2017-2021 - [c6]Farzad Farnoud, Vitaly Skachek, Olgica Milenkovic:
Rank modulation for translocation error correction. ISIT 2012: 2988-2992 - [i6]Farzad Farnoud, Narayana P. Santhanam, Olgica Milenkovic:
Alternating Markov Chains for Distribution Estimation in the Presence of Errors. CoRR abs/1202.0925 (2012) - [i5]Farzad Farnoud, Vitaly Skachek, Olgica Milenkovic:
Rank Modulation for Translocation Error Correction. CoRR abs/1202.0932 (2012) - [i4]Farzad Farnoud, Behrouz Touri, Olgica Milenkovic:
Nonuniform Vote Aggregation Algorithms. CoRR abs/1206.5343 (2012) - [i3]Farzad Farnoud, Olgica Milenkovic, Behrouz Touri:
A Novel Distance-Based Approach to Constrained Rank Aggregation. CoRR abs/1212.1471 (2012) - [i2]Behrouz Touri, Farzad Farnoud, Angelia Nedic, Olgica Milenkovic:
A General Framework for Distributed Vote Aggregation. CoRR abs/1212.2607 (2012) - 2011
- [c5]Farzad Farnoud, Olgica Milenkovic:
Decomposing permutations via cost-constrained transpositions. ISIT 2011: 2095-2099 - 2010
- [j1]S. M. Sadegh Tabatabaei Yazdi, Serap A. Savari, Gerhard Kramer, Kelli Carlson, Farzad Farnoud:
On the multimessage capacity region for undirected ring networks. IEEE Trans. Inf. Theory 56(4): 1930-1947 (2010) - [c4]Farzad Farnoud, Chien-Yu Chen, Olgica Milenkovic, Navin Kashyap:
A graphical model for computing the minimum cost transposition distance. ITW 2010: 1-5 - [i1]Farzad Farnoud, Olgica Milenkovic:
Sorting of Permutations by Cost-Constrained Transpositions. CoRR abs/1007.4236 (2010)
2000 – 2009
- 2009
- [c3]Farzad Farnoud, Shahrokh Valaee:
Reliable Broadcast of Safety Messages in Vehicular Ad Hoc Networks. INFOCOM 2009: 226-234 - [c2]Farzad Farnoud, Olgica Milenkovic, Narayana P. Santhanam:
Small-sample distribution estimation over sticky channels. ISIT 2009: 1125-1129 - 2007
- [c1]S. M. Sadegh Tabatabaei Yazdi, Serap A. Savari, Farzad Farnoud, Gerhard Kramer:
A Multimessage Capacity Region for Undirected Ring Networks. ISIT 2007: 1091-1095
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-12 22:56 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:
