default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMehrdad Moharrami
Person information
- affiliation: Sharif University of Technology, Electrical Engineering Department, Tehran, Iran
- affiliation: University of Michigan, MI, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Nouman Khan
, Mehrdad Moharrami, Vijay G. Subramanian:
Rarest-First With Probabilistic-Mode-Suppression (RFwPMS). IEEE Trans. Inf. Theory 70(4): 2936-2966 (2024)- [j3]Chenlan Wang, Mehrdad Moharrami, Kun Jin, David Kempe, P. Jeffrey Brantingham, Mingyan Liu:
Structural Stability of a Family of Spatial Group Formation Games. IEEE Trans. Netw. Sci. Eng. 11(4): 3305-3316 (2024) - [i9]Chenlan Wang, Mehrdad Moharrami, Mingyan Liu:
A Stackelberg Game Model of Flocking. CoRR abs/2407.19678 (2024) - 2023
- [c7]Yashaswini Murthy, Mehrdad Moharrami, R. Srikant:
Modified Policy Iteration for Exponential Cost Risk Sensitive MDPs. L4DC 2023: 395-406 - [c6]Yashaswini Murthy, Mehrdad Moharrami, R. Srikant:
Performance Bounds for Policy-Based Average Reward Reinforcement Learning Algorithms. NeurIPS 2023 - [i8]Yashaswini Murthy, Mehrdad Moharrami, R. Srikant:
Performance Bounds for Policy-Based Average Reward Reinforcement Learning Algorithms. CoRR abs/2302.01450 (2023) - [i7]Yashaswini Murthy, Mehrdad Moharrami, R. Srikant:
Modified Policy Iteration for Exponential Cost Risk Sensitive MDPs. CoRR abs/2302.03811 (2023) - [i6]Nouman Khan, Kangle Mu, Mehrdad Moharrami, Vijay G. Subramanian:
Backward and Forward Inference in Interacting Independent-Cascade Processes: A Scalable and Convergent Message-Passing Approach. CoRR abs/2310.19138 (2023) - 2022
- [i5]Saghar Adler, Mehrdad Moharrami, Vijay G. Subramanian:
Learning a Discrete Set of Optimal Allocation Rules in Queueing Systems with Unknown Service Rates. CoRR abs/2202.02419 (2022) - [i4]Mehrdad Moharrami, Yashaswini Murthy, Arghyadip Roy, Rayadurgam Srikant:
A Policy Gradient Algorithm for the Risk-Sensitive Exponential Cost MDP. CoRR abs/2202.04157 (2022) - [i3]Nouman Khan, Mehrdad Moharrami, Vijay G. Subramanian:
Rarest-First with Probabilistic-Mode-Suppression. CoRR abs/2211.00213 (2022) - 2021
- [c5]Chenlan Wang, Mehrdad Moharrami, Kun Jin, David Kempe, P. Jeffrey Brantingham, Mingyan Liu:
Structural Stability of a Family of Group Formation Games. CDC 2021: 3080-3085 - [i2]Chenlan Wang, Mehrdad Moharrami, Kun Jin, David Kempe, P. Jeffrey Brantingham, Mingyan Liu:
Structural Stability of a Family of Group Formation Games. CoRR abs/2109.12729 (2021) - 2020
- [c4]Nouman Khan, Mehrdad Moharrami, Vijay G. Subramanian:
Stable and Efficient Piece-Selection in Multiple Swarm BitTorrent-like Peer-to-Peer Networks. INFOCOM 2020: 1153-1162
2010 – 2019
- 2019
- [i1]Mehrdad Moharrami, Cristopher Moore, Jiaming Xu:
The Planted Matching Problem: Phase Transitions and Exact Results. CoRR abs/1912.08880 (2019) - 2018
- [c3]Mehrdad Moharrami, Vijay G. Subramanian, Mingyan Liu, R. Sundaresan:
Local Weak Convergence Based Analysis of a New Graph Model. Allerton 2018: 502-503 - 2017
- [j2]Mehrdad Moharrami, Ahmad Fallahpour, Hamzeh Beyranvand, Jawad A. Salehi:
Resource Allocation and Multicast Routing in Elastic Optical Networks. IEEE Trans. Commun. 65(5): 2101-2113 (2017) - 2016
- [c2]Mehrdad Moharrami, Hamzeh Beyranvand, Ahmad Fallahpour, Jawad A. Salehi:
Spectrum-usage-aware resource allocation and multicast routing in elastic optical networks. IST 2016: 45-50 - [c1]Mehrdad Moharrami, Vijay G. Subramanian, Mingyan Liu, Marc Lelarge:
Impact of Community Structure on Cascades. EC 2016: 635-636 - 2014
- [j1]Shayan Dashmiz, Mohammad Reza Takapoui, Sajjad Moazeni, Mehrdad Moharrami, Melika Abolhasani, Farrokh Marvasti:
Generalisation of code division multiple access systems and derivation of new bounds for the sum capacity. IET Commun. 8(2): 153-162 (2014)
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-10-07 21:22 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:
