default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIlan Shomorony
Person information
SPARQL queries 
🛈 Please note that only 69% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j21]Sajjad Nassirpour
, Ilan Shomorony, Alireza Vahid:
DNA Merge-Sort: A Family of Nested Varshamov-Tenengolts Reassembly Codes for Out-of-Order Media. IEEE Trans. Commun. 72(3): 1303-1317 (2024)- [j20]Nir Weinberger, Ilan Shomorony:
Fundamental Limits of Reference-Based Sequence Reordering. IEEE Trans. Inf. Theory 70(7): 4634-4654 (2024) - [j19]Kayvon Mazooji, Ilan Shomorony:
Substring Density Estimation From Traces. IEEE Trans. Inf. Theory 70(8): 5782-5798 (2024) - [j18]Grant Greenberg, Ilan Shomorony:
The Metagenomic Binning Problem: Clustering Markov Sequences. IEEE Trans. Mol. Biol. Multi Scale Commun. 10(1): 32-42 (2024) - [j17]Aditya Narayan Ravi, Alireza Vahid, Ilan Shomorony:
An Information Theory for Out-of-Order Media With Applications in DNA Data Storage. IEEE Trans. Mol. Biol. Multi Scale Commun. 10(2): 334-348 (2024) - [c44]Kayvon Mazooji, Ilan Shomorony:
An Instance-Based Approach to the Trace Reconstruction Problem. CISS 2024: 1-6 - [c43]Mo Tiwari, Ryan Kang, Jaeyong Lee, Donghyun Lee, Christopher Piech, Sebastian Thrun, Ilan Shomorony, Martin Jinye Zhang:
Faster Maximum Inner Product Search in High Dimensions. ICML 2024 - [c42]Yuval Gerzon, Ilan Shomorony, Nir Weinberger:
Capacity of Frequency-based Channels: Encoding Information in Molecular Concentrations. ISIT 2024: 681-686 - [i39]Kayvon Mazooji, Ilan Shomorony:
An Instance-Based Approach to the Trace Reconstruction Problem. CoRR abs/2401.14277 (2024) - [i38]Yuval Gerzon, Ilan Shomorony, Nir Weinberger:
Capacity of Frequency-based Channels: Encoding Information in Molecular Concentrations. CoRR abs/2405.07785 (2024) - [i37]Aditya Narayan Ravi, Alireza Vahid, Ilan Shomorony:
Recovering a Message from an Incomplete Set of Noisy Fragments. CoRR abs/2407.05544 (2024) - [i36]Manav Vora, Ilan Shomorony, Melkior Ornik:
Capacity-Aware Planning and Scheduling in Budget-Constrained Monotonic MDPs: A Meta-RL Approach. CoRR abs/2410.21249 (2024) - [i35]Yun-Han Li, Jin Sima, Ilan Shomorony, Olgica Milenkovic:
Reducing Data Fragmentation in Data Deduplication Systems via Partial Repetition and Coding. CoRR abs/2411.01407 (2024) - 2023
- [j16]Grant Greenberg, Aditya Narayan Ravi, Ilan Shomorony:
LexicHash: sequence similarity estimation via lexicographic comparison of hashes. Bioinform. 39(10) (2023) - [c41]Seiyun Shin, Han Zhao, Ilan Shomorony:
Adaptive Power Method: Eigenvector Estimation from Sampled Data. ALT 2023: 1387-1410 - [c40]Kel Levick, Ilan Shomorony:
Fundamental Limits of Multiple Sequence Reconstruction from Substrings. ISIT 2023: 791-796 - [c39]Kayvon Mazooji, Ilan Shomorony:
Substring Density Estimation from Traces. ISIT 2023: 803-808 - [c38]Jin Sima, Yun-Han Li, Ilan Shomorony, Olgica Milenkovic:
On Constant-Weight Binary B2-Sequences. ISIT 2023: 886-891 - [c37]Nir Weinberger, Ilan Shomorony:
Fundamental Limits of Reference-Based Sequence Reordering. ISIT 2023: 1062-1067 - [c36]Yun-Han Li, Ryan Gabrys, Jin Sima, Ilan Shomorony, Olgica Milenkovic:
Finding a Burst of Positives via Nonadaptive Semiquantitative Group Testing. ISIT 2023: 1848-1853 - [c35]Seiyun Shin, Ilan Shomorony, Han Zhao:
Efficient Learning of Linear Graph Neural Networks via Node Subsampling. NeurIPS 2023 - [c34]Mo Tiwari, Ryan Kang, Donghyun Lee, Sebastian Thrun, Ilan Shomorony, Martin J. Zhang:
BanditPAM++: Faster k-medoids Clustering. NeurIPS 2023 - [i34]Jin Sima, Yun-Han Li, Ilan Shomorony, Olgica Milenkovic:
On Constant-Weight Binary B2-Sequences. CoRR abs/2303.12990 (2023) - [i33]Yun-Han Li, Ryan Gabrys, Jin Sima, Ilan Shomorony, Olgica Milenkovic:
Finding a Burst of Positives via Nonadaptive Semiquantitative Group Testing. CoRR abs/2304.01365 (2023) - [i32]Kel Levick, Ilan Shomorony:
Fundamental Limits of Multiple Sequence Reconstruction from Substrings. CoRR abs/2305.05820 (2023) - [i31]Nir Weinberger, Ilan Shomorony:
Fundamental Limits of Reference-Based Sequence Reordering. CoRR abs/2307.10080 (2023) - [i30]Aditya Narayan Ravi, Ilan Shomorony:
Utilizing Free Clients in Federated Learning for Focused Model Enhancement. CoRR abs/2310.04515 (2023) - [i29]Mo Tiwari, Ryan Kang, Donghyun Lee, Sebastian Thrun, Chris Piech, Ilan Shomorony, Martin Jinye Zhang:
BanditPAM++: Faster k-medoids Clustering. CoRR abs/2310.18844 (2023) - 2022
- [j15]Ilan Shomorony, Reinhard Heckel:
Information-Theoretic Foundations of DNA Data Storage. Found. Trends Commun. Inf. Theory 19(1): 1-106 (2022) - [j14]Aditya Narayan Ravi, Alireza Vahid, Ilan Shomorony:
Coded Shotgun Sequencing. IEEE J. Sel. Areas Inf. Theory 3(1): 147-159 (2022) - [c33]Kel Levick, Reinhard Heckel, Ilan Shomorony:
Achieving the Capacity of a DNA Storage Channel with Linear Coding Schemes. CISS 2022: 218-223 - [c32]Aditya Narayan Ravi, Alireza Vahid, Ilan Shomorony:
Capacity of the Shotgun Sequencing Channel. ISIT 2022: 210-215 - [c31]Kayvon Mazooji, Sreeram Kannan, William Stafford Noble, Ilan Shomorony:
Fundamental Limits of Multi-Sample Flow Graph Decomposition. ISIT 2022: 2403-2408 - [c30]Tianyu Liu, Grant Greenberg, Ilan Shomorony:
CVQVAE: A representation learning based method for multi-omics single cell data integration. MLCB 2022: 1-15 - [c29]Mo Tiwari, Ryan Kang, Jaeyong Lee, Chris Piech, Ilan Shomorony, Sebastian Thrun, Martin J. Zhang:
MABSplit: Faster Forest Training Using Multi-Armed Bandits. NeurIPS 2022 - [c28]Masoumeh Abolfathi, Ilan Shomorony, Alireza Vahid, Jafar Haadi Jafarian:
A Game-Theoretically Optimal Defense Paradigm against Traffic Analysis Attacks using Multipath Routing and Deception. SACMAT 2022: 67-78 - [i28]Sajjad Nassirpour, Ilan Shomorony, Alireza Vahid:
Reassembly Codes for the Chop-and-Shuffle Channel. CoRR abs/2201.03590 (2022) - [i27]Kayvon Mazooji, Ilan Shomorony:
Substring Density Estimation from Traces. CoRR abs/2210.10917 (2022) - [i26]Ilan Shomorony, Reinhard Heckel:
Information-Theoretic Foundations of DNA Data Storage. CoRR abs/2211.05552 (2022) - [i25]Mo Tiwari, Ryan Kang, Je-Yong Lee, Sebastian Thrun, Chris Piech, Ilan Shomorony, Martin Jinye Zhang:
MABSplit: Faster Forest Training Using Multi-Armed Bandits. CoRR abs/2212.07473 (2022) - [i24]Mo Tiwari, Ryan Kang, Je-Yong Lee, Luke Lee, Chris Piech, Sebastian Thrun, Ilan Shomorony, Martin Jinye Zhang:
Faster Maximum Inner Product Search in High Dimensions. CoRR abs/2212.07551 (2022) - 2021
- [j13]Ali Yekkehkhany, Ebrahim Arian, Rakesh Nagi, Ilan Shomorony:
A cost-based analysis for risk-averse explore-then-commit finite-time bandits. IISE Trans. 53(10): 1094-1108 (2021) - [j12]Ilan Shomorony, Reinhard Heckel:
DNA-Based Storage: Models and Fundamental Limits. IEEE Trans. Inf. Theory 67(6): 3675-3689 (2021) - [j11]Ilan Shomorony, Alireza Vahid:
Torn-Paper Coding. IEEE Trans. Inf. Theory 67(12): 7904-7913 (2021) - [c27]Aditya Narayan Ravi, Alireza Vahid, Ilan Shomorony:
Capacity of the Torn Paper Channel with Lost Pieces. ISIT 2021: 1937-1942 - [c26]Ilan Shomorony, Govinda M. Kamath:
Sketching and Sequence Alignment: A Rate-Distortion Perspective. ISIT 2021: 3308-3313 - [i23]Kayvon Mazooji, Roy Dong, Ilan Shomorony:
Private DNA Sequencing: Hiding Information in Discrete Noise. CoRR abs/2101.12124 (2021) - [i22]Ilan Shomorony, Govinda M. Kamath:
Sketching and Sequence Alignment: A Rate-Distortion Perspective. CoRR abs/2107.04202 (2021) - [i21]Aditya Narayan Ravi, Alireza Vahid, Ilan Shomorony:
Coded Shotgun Sequencing. CoRR abs/2110.02868 (2021) - [i20]Kel Levick, Reinhard Heckel, Ilan Shomorony:
Achieving the Capacity of a DNA Storage Channel with Linear Coding Schemes. CoRR abs/2112.01630 (2021) - 2020
- [j10]Tavor Z. Baharav, Govinda M. Kamath, David N. C. Tse, Ilan Shomorony:
Spectral Jaccard Similarity: A New Approach to Estimating Pairwise Sequence Alignments. Patterns 1(6): 100081 (2020) - [c25]Ilan Shomorony, Alireza Vahid:
Communicating over the Torn-Paper Channel. GLOBECOM 2020: 1-6 - [c24]Seiyun Shin, Reinhard Heckel, Ilan Shomorony:
Capacity of the Erasure Shuffling Channel. ICASSP 2020: 8841-8845 - [c23]Kayvon Mazooji, Roy Dong, Ilan Shomorony:
Private DNA Sequencing: Hiding Information in Discrete Noise. ITW 2020: 1-5 - [c22]Govinda M. Kamath, Tavor Z. Baharav, Ilan Shomorony:
Adaptive Learning of Rank-One Models for Efficient Pairwise Sequence Alignment. NeurIPS 2020 - [c21]Mo Tiwari, Martin Jinye Zhang, James Mayclin, Sebastian Thrun, Chris Piech, Ilan Shomorony:
BanditPAM: Almost Linear Time k-Medoids Clustering via Multi-Armed Bandits. NeurIPS 2020 - [c20]Tavor Z. Baharav, Govinda M. Kamath, David N. C. Tse, Ilan Shomorony:
Spectral Jaccard Similarity: A New Approach to Estimating Pairwise Sequence Alignments. RECOMB 2020: 223-225 - [i19]Ilan Shomorony, Reinhard Heckel:
DNA-Based Storage: Models and Fundamental Limits. CoRR abs/2001.06311 (2020) - [i18]Ilan Shomorony, Alireza Vahid:
Communicating over the Torn-Paper Channel. CoRR abs/2005.12895 (2020) - [i17]Mo Tiwari, Martin Jinye Zhang, James Mayclin, Sebastian Thrun, Chris Piech, Ilan Shomorony:
Bandit-PAM: Almost Linear Time k-Medoids Clustering via Multi-Armed Bandits. CoRR abs/2006.06856 (2020) - [i16]Govinda M. Kamath, Tavor Z. Baharav, Ilan Shomorony:
Adaptive Learning of Rank-One Models for Efficient Pairwise Sequence Alignment. CoRR abs/2011.04832 (2020)
2010 – 2019
- 2019
- [c19]Ilan Shomorony, Reinhard Heckel:
Capacity Results for the Noisy Shuffling Channel. ISIT 2019: 762-766 - [c18]Grant Greenberg, Ilan Shomorony:
The Metagenomic Binning Problem: Clustering Markov Sequences. ITW 2019: 1-5 - [i15]Ilan Shomorony, Reinhard Heckel:
Capacity Results for the Noisy Shuffling Channel. CoRR abs/1902.10832 (2019) - [i14]Grant Greenberg, Ilan Shomorony:
The Metagenomic Binning Problem: Clustering Markov Sequences. CoRR abs/1912.05741 (2019) - 2017
- [c17]Reinhard Heckel, Ilan Shomorony, Kannan Ramchandran, David N. C. Tse:
Fundamental limits of DNA storage systems. ISIT 2017: 3130-3134 - [i13]Reinhard Heckel, Ilan Shomorony, Kannan Ramchandran, David N. C. Tse:
Fundamental Limits of DNA Storage Systems. CoRR abs/1705.04732 (2017) - 2016
- [j9]Ilan Shomorony, Samuel H. Kim, Thomas A. Courtade, David N. C. Tse:
Information-optimal genome assembly via sparse read-overlap graphs. Bioinform. 32(17): 494-502 (2016) - [j8]Ilan Shomorony, Thomas A. Courtade, David Tse:
Fundamental Limits of Genome Assembly Under an Adversarial Erasure Model. IEEE Trans. Mol. Biol. Multi Scale Commun. 2(2): 199-208 (2016) - [c16]Joseph Hui, Ilan Shomorony, Kannan Ramchandran, Thomas A. Courtade:
Overlap-based genome assembly from variable-length reads. ISIT 2016: 1018-1022 - [c15]Ilan Shomorony, Govinda M. Kamath, Fei Xia, Thomas A. Courtade, David N. C. Tse:
Partial DNA assembly: A rate-distortion perspective. ISIT 2016: 1799-1803 - [i12]Ilan Shomorony, Govinda M. Kamath, Fei Xia, Thomas A. Courtade, David N. C. Tse:
Partial DNA Assembly: A Rate-Distortion Perspective. CoRR abs/1605.01941 (2016) - 2015
- [j7]Himanshu Asnani, Ilan Shomorony, Amir Salman Avestimehr, Tsachy Weissman:
Network Compression: Worst Case Analysis. IEEE Trans. Inf. Theory 61(7): 3980-3995 (2015) - [c14]Alireza Vahid, Ilan Shomorony, A. Robert Calderbank:
Informational bottlenecks in two-unicast wireless networks with delayed CSIT. Allerton 2015: 1256-1263 - [c13]Ilan Shomorony, Thomas A. Courtade, David N. C. Tse:
Do read errors matter for genome assembly? ISIT 2015: 919-923 - [i11]Ilan Shomorony, Thomas A. Courtade, David Tse:
Do Read Errors Matter for Genome Assembly? CoRR abs/1501.06194 (2015) - [i10]Alireza Vahid, Ilan Shomorony, A. Robert Calderbank:
Informational Bottlenecks in Two-Unicast Wireless Networks with Delayed CSIT. CoRR abs/1508.04359 (2015) - 2014
- [j6]Ilan Shomorony, Salman Avestimehr:
Multihop Wireless Networks: A Unified Approach to Relaying and Interference Management. Found. Trends Netw. 8(3): 149-280 (2014) - [j5]Ilan Shomorony, Raúl H. Etkin, Farzad Parvaresh, Amir Salman Avestimehr:
Diamond Networks With Bursty Traffic: Bounds on the Minimum Energy-Per-Bit. IEEE Trans. Inf. Theory 60(1): 461-493 (2014) - [j4]Ilan Shomorony, Amir Salman Avestimehr:
Degrees of Freedom of Two-Hop Wireless Networks: Everyone Gets the Entire Cake. IEEE Trans. Inf. Theory 60(5): 2417-2431 (2014) - [j3]Raúl H. Etkin, Farzad Parvaresh, Ilan Shomorony, Amir Salman Avestimehr:
Computing Half-Duplex Schedules in Gaussian Relay Networks via Min-Cut Approximations. IEEE Trans. Inf. Theory 60(11): 7204-7220 (2014) - [c12]Ilan Shomorony, Amir Salman Avestimehr:
Sampling large data on graphs. GlobalSIP 2014: 933-936 - [c11]Ilan Shomorony, Amir Salman Avestimehr:
A generalized cut-set bound for deterministic multi-flow networks and its applications. ISIT 2014: 271-275 - [i9]Ilan Shomorony, Amir Salman Avestimehr:
A Generalized Cut-Set Bound for Deterministic Multi-Flow Networks and its Applications. CoRR abs/1404.4995 (2014) - [i8]Ilan Shomorony, Amir Salman Avestimehr:
Sampling Large Data on Graphs. CoRR abs/1411.3017 (2014) - 2013
- [j2]Ilan Shomorony, Amir Salman Avestimehr:
Two-Unicast Wireless Networks: Characterizing the Degrees of Freedom. IEEE Trans. Inf. Theory 59(1): 353-383 (2013) - [j1]Ilan Shomorony, Amir Salman Avestimehr:
Worst-Case Additive Noise in Wireless Networks. IEEE Trans. Inf. Theory 59(6): 3833-3847 (2013) - [c10]Himanshu Asnani, Ilan Shomorony, Amir Salman Avestimehr, Tsachy Weissman:
Network compression: Worst-case analysis. ISIT 2013: 196-200 - [c9]Raúl H. Etkin, Farzad Parvaresh, Ilan Shomorony, Amir Salman Avestimehr:
On efficient min-cut approximations in half-duplex relay networks. ISIT 2013: 1949-1953 - [c8]Himanshu Asnani, Ilan Shomorony, Amir Salman Avestimehr, Tsachy Weissman:
Operational extremality of Gaussianity in network compression, communication, and coding. ITW 2013: 1 - [c7]Farzad Parvaresh, Raúl H. Etkin, Ilan Shomorony, Amir Salman Avestimehr:
On computing half-duplex relaying capacity in networks with orthogonal channels. IWCIT 2013: 1-6 - [i7]Himanshu Asnani, Ilan Shomorony, Amir Salman Avestimehr, Tsachy Weissman:
Network Compression: Worst-Case Analysis. CoRR abs/1304.1828 (2013) - [i6]Raúl H. Etkin, Farzad Parvaresh, Ilan Shomorony, Amir Salman Avestimehr:
On Min-Cut Algorithms for Half-Duplex Relay Networks. CoRR abs/1305.2548 (2013) - 2012
- [c6]Ilan Shomorony, Amir Salman Avestimehr:
Degrees of freedom of two-hop wireless networks: "Everyone gets the entire cake". Allerton Conference 2012: 1935-1942 - [c5]Ilan Shomorony, Amir Salman Avestimehr:
Is Gaussian noise the worst-case additive noise in wireless networks? ISIT 2012: 214-218 - [c4]Ilan Shomorony, Raúl H. Etkin, Farzad Parvaresh, Amir Salman Avestimehr:
Bounds on the minimum energy-per-bit for bursty traffic in diamond networks. ISIT 2012: 801-805 - [c3]Ilan Shomorony, Amir Salman Avestimehr:
On the role of deterministic models in K × K × K wireless networks. ITW 2012: 60-64 - [c2]Ilan Shomorony, Amir Salman Avestimehr, Himanshu Asnani, Tsachy Weissman:
Worst-case source for distributed compression with quadratic distortion. ITW 2012: 187-191 - [i5]Ilan Shomorony, Amir Salman Avestimehr:
Worst-Case Additive Noise in Wireless Networks. CoRR abs/1202.2687 (2012) - [i4]Ilan Shomorony, Raúl H. Etkin, Farzad Parvaresh, Amir Salman Avestimehr:
Diamond Networks with Bursty Traffic: Bounds on the Minimum Energy-Per-Bit. CoRR abs/1205.6186 (2012) - [i3]Ilan Shomorony, Amir Salman Avestimehr, Himanshu Asnani, Tsachy Weissman:
Worst-Case Source for Distributed Compression with Quadratic Distortion. CoRR abs/1208.1784 (2012) - [i2]Ilan Shomorony, Amir Salman Avestimehr:
Degrees of Freedom of Two-Hop Wireless Networks: "Everyone Gets the Entire Cake''. CoRR abs/1210.2143 (2012) - 2011
- [c1]Ilan Shomorony, Amir Salman Avestimehr:
Sum degrees-of-freedom of two-unicast wireless networks. ISIT 2011: 214-218 - [i1]Ilan Shomorony, Amir Salman Avestimehr:
Two-Unicast Wireless Networks: Characterizing the Sum Degrees of Freedom. CoRR abs/1102.2498 (2011)
Coauthor Index
Amir Salman Avestimehr
aka: Salman Avestimehr
aka: Salman Avestimehr
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-12-11 21:39 CET 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:
