default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMohammadReza Ebrahimi 0002
Person information
- affiliation: Qualcomm AI Research, Toronto, ON, Canada
- affiliation: University of Toronto, Toronto, ON, Canada
Other persons with the same name
- Mohammadreza Ebrahimi (aka: MohammadReza Ebrahimi) — disambiguation page
- Reza Ebrahimi 0001
![[0000-0003-1367-3338]](https://devdomain4test.ir/img/orcid-mark.12x12.png "0000-0003-1367-3338")
(aka: Mohammadreza Ebrahimi 0001) — University of South Florida, School of Information Systems and Management, Tampa, FL, USA (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2025
[c4]Ashish J. Khisti, MohammadReza Ebrahimi, Hassan Dbouk, Arash Behboodi, Roland Memisevic, Christos Louizos:
Multi-Draft Speculative Sampling: Canonical Decomposition and Theoretical Limits. ICLR 2025- [i6]MohammadReza Ebrahimi, Roland Memisevic:
Revisiting Bi-Linear State Transitions in Recurrent Neural Networks. CoRR abs/2505.21749 (2025) - 2024
- [i5]MohammadReza Ebrahimi, Sunny Panchal, Roland Memisevic:
Your Context Is Not an Array: Unveiling Random Access Limitations in Transformers. CoRR abs/2408.05506 (2024) - [i4]Ashish Khisti, MohammadReza Ebrahimi, Hassan Dbouk, Arash Behboodi, Roland Memisevic, Christos Louizos:
Multi-Draft Speculative Sampling: Canonical Architectures and Theoretical Limits. CoRR abs/2410.18234 (2024) - 2023
- [c3]MohammadReza Ebrahimi, Navona Calarco, Colin Hawco, Aristotle N. Voineskos, Ashish Khisti:
Time-Resolved FMRI Shared Response Model Using Gaussian Process Factor Analysis. ICASSP 2023: 1-5 - [c2]Muralee Nikhil Krishnan, MohammadReza Ebrahimi, Ashish J. Khisti:
Sequential Gradient Coding For Straggler Mitigation. ICLR 2023 - 2022
- [i3]M. Nikhil Krishnan, MohammadReza Ebrahimi, Ashish Khisti:
Sequential Gradient Coding For Straggler Mitigation. CoRR abs/2211.13802 (2022) - 2020
- [j1]MohammadReza Ebrahimi, Farshad Lahouti, Victoria Kostina:
Two-Layer Coded Channel Access With Collision Resolution: Design and Analysis. IEEE Trans. Wirel. Commun. 19(12): 7986-7997 (2020) - [i2]MohammadReza Ebrahimi, Navona Calarco, Kieran Campbell, Colin Hawco, Aristotle N. Voineskos, Ashish Khisti:
Time-Resolved fMRI Shared Response Model using Gaussian Process Factor Analysis. CoRR abs/2006.05572 (2020)
2010 – 2019
- 2019
- [i1]MohammadReza Ebrahimi, Farshad Lahouti, Victoria Kostina:
Two-layer Coded Channel Access with Collision Resolution: Design and Analysis. CoRR abs/1909.00065 (2019) - 2017
- [c1]MohammadReza Ebrahimi, Farshad Lahouti, Victoria Kostina:
Coded random access design for constrained outage. ISIT 2017: 2732-2736
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 2026-06-20 00:14 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
