default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAmirbehshad Shahrasbi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2021
[b1]Amirbehshad Shahrasbi:
Coding for Synchronization Errors. Carnegie Mellon University, USA, 2021
Journal Articles
- 2021
- [j4]Bernhard Haeupler, Amirbehshad Shahrasbi:
Synchronization Strings: Codes for Insertions and Deletions Approaching the Singleton Bound. J. ACM 68(5): 36:1-36:39 (2021) - [j3]Bernhard Haeupler, Amirbehshad Shahrasbi
:
Synchronization Strings and Codes for Insertions and Deletions - A Survey. IEEE Trans. Inf. Theory 67(6): 3190-3206 (2021) - [j2]Venkatesan Guruswami, Bernhard Haeupler, Amirbehshad Shahrasbi:
Optimally Resilient Codes for List-Decoding From Insertions and Deletions. IEEE Trans. Inf. Theory 67(12): 7837-7856 (2021) - 2015
- [j1]Mehrdad Tahmasbi, Amirbehshad Shahrasbi, Amin Gohari:
Critical Graphs in Index Coding. IEEE J. Sel. Areas Commun. 33(2): 225-235 (2015)
Conference and Workshop Papers
- 2022
- [c10]Chi-Ning Chou, Alexander Golovnev, Amirbehshad Shahrasbi, Madhu Sudan, Santhoshini Velusamy:
Sketching Approximability of (Weak) Monarchy Predicates. APPROX/RANDOM 2022: 35:1-35:17 - [c9]Bernhard Haeupler, Amirbehshad Shahrasbi:
Rate-Distance Trade-offs for List-Decodable Insertion-Deletion Codes. ITW 2022: 470-475 - 2020
- [c8]Venkatesan Guruswami, Bernhard Haeupler, Amirbehshad Shahrasbi:
Optimally resilient codes for list-decoding from insertions and deletions. STOC 2020: 524-537 - 2019
- [c7]Kuan Cheng, Bernhard Haeupler, Xin Li, Amirbehshad Shahrasbi, Ke Wu:
Synchronization Strings: Highly Efficient Deterministic Constructions over Small Alphabets. SODA 2019: 2185-2204 - [c6]Bernhard Haeupler, Aviad Rubinstein, Amirbehshad Shahrasbi:
Near-linear time insertion-deletion codes and (1+ε)-approximating edit distance via indexing. STOC 2019: 697-708 - 2018
- [c5]Bernhard Haeupler, Amirbehshad Shahrasbi, Ellen Vitercik:
Synchronization Strings: Channel Simulations and Interactive Coding for Insertions and Deletions. ICALP 2018: 75:1-75:14 - [c4]Bernhard Haeupler, Amirbehshad Shahrasbi, Madhu Sudan:
Synchronization Strings: List Decoding for Insertions and Deletions. ICALP 2018: 76:1-76:14 - [c3]Bernhard Haeupler, Amirbehshad Shahrasbi:
Synchronization strings: explicit constructions, local decoding, and applications. STOC 2018: 841-854 - 2017
- [c2]Bernhard Haeupler, Amirbehshad Shahrasbi:
Synchronization strings: codes for insertions and deletions approaching the Singleton bound. STOC 2017: 33-46 - 2014
- [c1]Mehrdad Tahmasbi, Amirbehshad Shahrasbi, Amin Gohari:
Critical graphs in index coding. ISIT 2014: 281-285
Informal and Other Publications
- 2022
- [i13]Chi-Ning Chou, Alexander Golovnev, Amirbehshad Shahrasbi, Madhu Sudan, Santhoshini Velusamy:
Sketching Approximability of (Weak) Monarchy Predicates. CoRR abs/2205.02345 (2022) - [i12]Chi-Ning Chou, Alexander Golovnev, Amirbehshad Shahrasbi, Madhu Sudan, Santhoshini Velusamy:
Sketching Approximability of (Weak) Monarchy Predicates. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [i11]Bernhard Haeupler, Amirbehshad Shahrasbi:
Synchronization Strings and Codes for Insertions and Deletions - a Survey. CoRR abs/2101.00711 (2021) - 2020
- [i10]Bernhard Haeupler, Amirbehshad Shahrasbi:
Rate-Distance Tradeoffs for List-Decodable Insertion-Deletion Codes. CoRR abs/2009.13307 (2020) - 2019
- [i9]Venkatesan Guruswami, Bernhard Haeupler, Amirbehshad Shahrasbi:
Optimally Resilient Codes for List-Decoding from Insertions and Deletions. CoRR abs/1909.10683 (2019) - [i8]Venkatesan Guruswami, Bernhard Haeupler, Amirbehshad Shahrasbi:
Optimally Resilient Codes for List-Decoding from Insertions and Deletions. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [i7]Bernhard Haeupler, Amirbehshad Shahrasbi, Madhu Sudan:
Synchronization Strings: List Decoding for Insertions and Deletions. CoRR abs/1802.08663 (2018) - [i6]Kuan Cheng, Bernhard Haeupler, Xin Li, Amirbehshad Shahrasbi, Ke Wu:
Synchronization Strings: Efficient and Fast Deterministic Constructions over Small Alphabets. CoRR abs/1803.03530 (2018) - [i5]Bernhard Haeupler, Aviad Rubinstein, Amirbehshad Shahrasbi:
Near-Linear Time Insertion-Deletion Codes and (1+ε)-Approximating Edit Distance via Indexing. CoRR abs/1810.11863 (2018) - 2017
- [i4]Bernhard Haeupler, Amirbehshad Shahrasbi:
Synchronization Strings: Codes for Insertions and Deletions Approaching the Singleton Bound. CoRR abs/1704.00807 (2017) - [i3]Bernhard Haeupler, Amirbehshad Shahrasbi, Ellen Vitercik:
Synchronization Strings: Channel Simulations and Interactive Coding for Insertions and Deletions. CoRR abs/1707.04233 (2017) - [i2]Bernhard Haeupler, Amirbehshad Shahrasbi:
Synchronization Strings: Explicit Constructions, Local Decoding, and Applications. CoRR abs/1710.09795 (2017) - 2013
- [i1]Mehrdad Tahmasbi, Amirbehshad Shahrasbi, Amin Gohari:
Critical Graphs in Index Coding. CoRR abs/1312.0132 (2013)
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-04-24 23:08 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:
