The following pages link to Farzad Farnoud (Hassanzadeh) (Q2410234):
Displaying 21 items.
- (Q346496) (redirect page) (← links)
- Approximate sorting of data streams with limited storage (Q346499) (← links)
- Computing similarity distances between rankings (Q2410235) (← links)
- Approximate Sorting of Data Streams with Limited Storage (Q2920482) (← links)
- Bounds for Permutation Rate-Distortion (Q2976994) (← links)
- The Capacity of String-Duplication Systems (Q2977005) (← links)
- Codes Correcting Erasures and Deletions for Rank Modulation (Q2977041) (← links)
- An Axiomatic Approach to Constructing Distances for Rank Comparison and Aggregation (Q2986110) (← links)
- Error-Correction in Flash Memories via Codes in the Ulam Metric (Q2989267) (← links)
- Capacity and Expressiveness of Genomic Tandem Duplication (Q4566475) (← links)
- Duplication Distance to the Root for Binary Sequences (Q4566608) (← links)
- Error-Correcting Codes for Noisy Duplication Channels (Q5001730) (← links)
- Error-Correcting Codes for Short Tandem Duplication and Edit Errors (Q5030329) (← links)
- Evolution of $k$ -Mer Frequencies and Entropy in Duplication and Substitution Mutation Systems (Q5123919) (← links)
- Single-Error Detection and Correction for Duplication and Substitution Channels (Q5138866) (← links)
- Sorting of Permutations by Cost-Constrained Transpositions (Q5272144) (← links)
- On the Multimessage Capacity Region for Undirected Ring Networks (Q5281547) (← links)
- Duplication-Correcting Codes for Data Storage in the DNA of Living Organisms (Q5369849) (← links)
- Data Deduplication With Random Substitutions (Q6195720) (← links)
- Low-Redundancy Codes for Correcting Multiple Short-Duplication and Edit Errors (Q6197476) (← links)
- Non-binary codes for correcting a burst of at most \(t\) deletions (Q6576015) (← links)
