default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSaeid Sahraei
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j4]Saeid Sahraei
, Amir Salman Avestimehr, Ramy E. Ali:
Info-Commit: Information-Theoretic Polynomial Commitment. IEEE Trans. Inf. Forensics Secur. 17: 1698-1708 (2022)- 2021
- [j3]Saeid Sahraei, Mohammad Ali Maddah-Ali, Amir Salman Avestimehr:
Interactive Verifiable Polynomial Evaluation. IEEE J. Sel. Areas Inf. Theory 2(1): 317-325 (2021) - 2020
- [c10]Mingchao Yu, Saeid Sahraei, Songze Li, Salman Avestimehr, Sreeram Kannan, Pramod Viswanath:
Coded Merkle Tree: Solving Data Availability Attacks in Blockchains. Financial Cryptography 2020: 114-134 - [c9]Saeid Sahraei, Mohammad Ali Maddah-Ali, Salman Avestimehr:
Interactive Verifiable Polynomial Evaluation. ISIT 2020: 2843-2848 - [i16]Saeid Sahraei, Salman Avestimehr:
InfoCommit: Information-Theoretic Polynomial Commitment and Verification. CoRR abs/2002.00559 (2020) - [i15]Saeid Sahraei, Salman Avestimehr:
InfoCommit: Information-Theoretic Polynomial Commitment and Verification. IACR Cryptol. ePrint Arch. 2020: 118 (2020)
2010 – 2019
- 2019
- [j2]Saeid Sahraei, Pierre Quinton, Michael Gastpar:
The Optimal Memory-Rate Trade-Off for the Non-Uniform Centralized Caching Problem With Two Files Under Uncoded Placement. IEEE Trans. Inf. Theory 65(12): 7756-7770 (2019) - [c8]Saeid Sahraei, Amir Salman Avestimehr:
INTERPOL: Information Theoretically Verifiable Polynomial Evaluation. ISIT 2019: 1112-1116 - [c7]Songze Li, Saeid Sahraei, Mingchao Yu, Salman Avestimehr, Sreeram Kannan, Pramod Viswanath:
Coded State Machine - Scaling State Machine Execution under Byzantine Faults. PODC 2019: 150-152 - [i14]Saeid Sahraei, Amir Salman Avestimehr:
INTERPOL: Information Theoretically Verifiable Polynomial Evaluation. CoRR abs/1901.03379 (2019) - [i13]Songze Li, Saeid Sahraei, Mingchao Yu, Salman Avestimehr, Sreeram Kannan, Pramod Viswanath:
Coded State Machine - Scaling State Machine Execution under Byzantine Faults. CoRR abs/1906.10817 (2019) - [i12]Saeid Sahraei, Mohammad Ali Maddah-Ali, Salman Avestimehr:
Interactive Verifiable Polynomial Evaluation. CoRR abs/1907.04302 (2019) - [i11]Mingchao Yu, Saeid Sahraei, Songze Li, Salman Avestimehr, Sreeram Kannan, Pramod Viswanath:
Coded Merkle Tree: Solving Data Availability Attacks in Blockchains. CoRR abs/1910.01247 (2019) - [i10]Mingchao Yu, Saeid Sahraei, Songze Li, Salman Avestimehr, Sreeram Kannan, Pramod Viswanath:
Coded Merkle Tree: Solving Data Availability Attacks in Blockchains. IACR Cryptol. ePrint Arch. 2019: 1139 (2019) - 2018
- [b1]Saeid Sahraei:
Caching and Distributed Storage - Models, Limits and Designs. EPFL, Switzerland, 2018 - [c6]Saeid Sahraei, Michael Gastpar:
Increasing Availability in Distributed Storage Systems via Clustering. ISIT 2018: 1705-1709 - [i9]Pierre Quinton, Saeid Sahraei, Michael Gastpar:
A Novel Centralized Strategy for Coded Caching with Non-uniform Demands. CoRR abs/1801.10563 (2018) - [i8]Saeid Sahraei, Pierre Quinton, Michael Gastpar:
The Optimal Memory-Rate Trade-off for the Non-uniform Centralized Caching Problem with Two Files under Uncoded Placement. CoRR abs/1808.07964 (2018) - 2017
- [j1]Saeid Sahraei, Michael Gastpar:
Polynomially Solvable Instances of the Shortest and Closest Vector Problems With Applications to Compute-and-Forward. IEEE Trans. Inf. Theory 63(12): 7780-7792 (2017) - [c5]Saeid Sahraei, Michael Gastpar:
GDSP: A graphical perspective on the distributed storage systems. ISIT 2017: 2218-2222 - [i7]Saeid Sahraei, Michael Gastpar:
GDSP: A Graphical Perspective on the Distributed Storage Systems. CoRR abs/1702.04525 (2017) - [i6]Saeid Sahraei, Michael Gastpar:
Increasing Availability in Distributed Storage Systems via Clustering. CoRR abs/1710.02653 (2017) - 2016
- [c4]Saeid Sahraei, Michael Gastpar:
Multi-library coded caching. Allerton 2016: 1012-1017 - [c3]Saeid Sahraei, Michael Gastpar:
K users caching two files: An improved achievable rate. CISS 2016: 620-624 - [i5]Saeid Sahraei, Michael Gastpar:
Multi-Library Coded Caching. CoRR abs/1601.06016 (2016) - 2015
- [i4]Saeid Sahraei, Michael Gastpar:
Polynomially Solvable Instances of the Shortest and Closest Vector Problems with Applications to Compute-and-Forward. CoRR abs/1512.06667 (2015) - [i3]Saeid Sahraei, Michael Gastpar:
$K$ Users Caching Two Files: An Improved Achievable Rate. CoRR abs/1512.06682 (2015) - 2014
- [c2]Saeid Sahraei, Michael Gastpar:
Compute-and-Forward: Finding the best equation. Allerton 2014: 227-233 - [i2]Saeid Sahraei, Michael C. Gastpar:
New Shortest Lattice Vector Problems of Polynomial Complexity. CoRR abs/1404.0564 (2014) - [i1]Saeid Sahraei, Michael Gastpar:
Compute-and-Forward: Finding the Best Equation. CoRR abs/1410.3656 (2014) - 2010
- [c1]Saeid Sahraei, Farid Ashtiani:
Effect of Power Randomization on Saturation Throughput of IEEE 802.11 WLAN. ICC 2010: 1-5
Coauthor Index
aka: Salman Avestimehr
aka: Michael C. Gastpar
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-01 20:43 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:
