default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAli Pourmiri
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Reza Shafiloo, Marjan Kaedi
, Ali Pourmiri:
Considering user dynamic preferences for mitigating negative effects of long-tail in recommender systems. Inf. Sci. 669: 120558 (2024)- [j10]Reza Shafiloo, Marjan Kaedi, Ali Pourmiri:
Predicting user demographics based on interest analysis in movie dataset. Multim. Tools Appl. 83(27): 69973-69987 (2024) - [c10]Haris Aziz, Jiarui Gan, Grzegorz Lisowski, Ali Pourmiri:
The Team Order Problem: Maximizing the Probability of Matching Being Large Enough. SAGT 2024: 35-52 - 2023
- [j9]Catherine S. Greenhill, Bernard Mans, Ali Pourmiri:
Balanced allocation on hypergraphs. J. Comput. Syst. Sci. 138: 103459 (2023) - 2022
- [i12]Haris Aziz, Arindam Pal, Ali Pourmiri, Fahimeh Ramezani, Brendan Sims:
Task Allocation using a Team of Robots. CoRR abs/2207.09650 (2022) - 2021
- [c9]Bernard Mans, Ali Pourmiri:
Asynchronous Rumor Spreading in Dynamic Graphs. OPODIS 2021: 31:1-31:20 - [i11]Reza Shafiloo, Marjan Kaedi, Ali Pourmiri:
Predicting user demographics based on interest analysis. CoRR abs/2108.01014 (2021) - [i10]Reza Shafiloo, Marjan Kaedi, Ali Pourmiri:
Considering user dynamic preferences for mitigating negative effects of long tail in recommender systems. CoRR abs/2112.02406 (2021) - 2020
- [j8]Mahdi Jafari Siavoshani, Farzad Parvaresh, Ali Pourmiri, Seyed Pooya Shariatpanahi:
Coded Load Balancing in Cache Networks. IEEE Trans. Parallel Distributed Syst. 31(2): 347-358 (2020) - [c8]Catherine S. Greenhill, Bernard Mans, Ali Pourmiri:
Balanced Allocation on Dynamic Hypergraphs. APPROX-RANDOM 2020: 11:1-11:22 - [c7]Ali Pourmiri, Bernard Mans:
Tight Analysis of Asynchronous Rumor Spreading in Dynamic Networks. PODC 2020: 263-272 - [i9]Ali Pourmiri, Bernard Mans:
Tight Analysis of Asynchronous Rumor Spreading in Dynamic Networks. CoRR abs/2005.07859 (2020) - [i8]Catherine S. Greenhill, Bernard Mans, Ali Pourmiri:
Balanced Allocation on Dynamic Hypergraphs. CoRR abs/2006.07588 (2020)
2010 – 2019
- 2019
- [j7]Ali Pourmiri:
Balanced allocation on graphs: A random walk approach. Random Struct. Algorithms 55(4): 980-1009 (2019) - [c6]Ali Pourmiri, Fahimeh Ramezani:
Ultra-Fast Asynchronous Randomized Rumor Spreading (Brief Announcement). SPAA 2019: 81-83 - 2018
- [j6]Mahdi Jafari Siavoshani, Ali Pourmiri, Seyed Pooya Shariatpanahi:
Storage, Communication, and Load Balancing Trade-off in Distributed Cache Networks. IEEE Trans. Parallel Distributed Syst. 29(4): 943-957 (2018) - 2017
- [c5]Ali Pourmiri, Mahdi Jafari Siavoshani, Seyed Pooya Shariatpanahi:
Proximity-Aware Balanced Allocations in Cache Networks. IPDPS 2017: 1068-1077 - [c4]Mahdi Jafari Siavoshani, Seyed Pooya Shariatpanahi, Hamid Ghasemi, Ali Pourmiri:
On communication cost vs. load balancing in Content Delivery Networks. ISCC 2017: 651-656 - [i7]Mahdi Jafari Siavoshani, Ali Pourmiri, Seyed Pooya Shariatpanahi:
Storage, Communication, and Load Balancing Trade-off in Distributed Cache Networks. CoRR abs/1706.10209 (2017) - [i6]Mahdi Jafari Siavoshani, Farzad Parvaresh, Ali Pourmiri, Seyed Pooya Shariatpanahi:
Coded Load Balancing in Cache Networks. CoRR abs/1707.09757 (2017) - 2016
- [j5]Abbas Mehrabian, Ali Pourmiri:
Randomized rumor spreading in poorly connected small-world networks. Random Struct. Algorithms 49(1): 185-208 (2016) - [c3]Ali Pourmiri:
Balanced Allocation on Graphs: A Random Walk Approach. COCOON 2016: 330-341 - [i5]Mahdi Jafari Siavoshani, Seyed Pooya Shariatpanahi, Hamid Ghasemi, Ali Pourmiri:
On Communication Cost vs. Load Balancing in Content Delivery Networks. CoRR abs/1610.04513 (2016) - [i4]Ali Pourmiri, Mahdi Jafari Siavoshani, Seyed Pooya Shariatpanahi:
Proximity-Aware Balanced Allocations in Cache Networks. CoRR abs/1610.05961 (2016) - 2015
- [b1]Ali Pourmiri:
Random walk-based algorithms on networks. Saarland University, 2015 - [j4]Konstantinos Panagiotou, Ali Pourmiri, Thomas Sauerwald:
Faster Rumor Spreading With Multiple Calls. Electron. J. Comb. 22(1): 1 (2015) - 2014
- [j3]Ali Pourmiri, Thomas Sauerwald:
Cutoff phenomenon for random walks on Kneser graphs. Discret. Appl. Math. 176: 100-106 (2014) - [c2]Abbas Mehrabian, Ali Pourmiri:
Randomized Rumor Spreading in Poorly Connected Small-World Networks. DISC 2014: 346-360 - [i3]Ali Pourmiri, Thomas Sauerwald:
Cutoff Phenomenon for Random Walks on Kneser Graphs. CoRR abs/1404.4598 (2014) - [i2]Ali Pourmiri:
Balanced Allocation on Graphs: A Random Walk Approach. CoRR abs/1407.2575 (2014) - [i1]Abbas Mehrabian, Ali Pourmiri:
Randomized Rumor Spreading in Poorly Connected Small-World Networks. CoRR abs/1410.8175 (2014) - 2013
- [c1]Konstantinos Panagiotou, Ali Pourmiri, Thomas Sauerwald:
Faster Rumor Spreading with Multiple Calls. ISAAC 2013: 446-456
2000 – 2009
- 2008
- [j2]Behnaz Omoomi, Ali Pourmiri:
On the Local Colorings of Graphs. Ars Comb. 86 (2008) - [j1]Behnaz Omoomi, Ali Pourmiri:
Local coloring of Kneser graphs. Discret. Math. 308(24): 5922-5927 (2008)
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-09-18 00:12 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:
