default search action
Mohammed Amin Abdullah 0001
Person information
- affiliation: Huawei, Noah's Ark Lab, London, United Kingdom
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j5]Alexander I. Cowen-Rivers
, Daniel Palenicek, Vincent Moens, Mohammed Amin Abdullah, Aivar Sootla, Jun Wang, Haitham Bou-Ammar:
SAMBA: safe model-based & active reinforcement learning. Mach. Learn. 111(1): 173-203 (2022) - 2020
- [i5]Alexander I. Cowen-Rivers, Daniel Palenicek
SAMBA: Safe Model-Based & Active Reinforcement Learning. CoRR abs/2006.09436 (2020)
2010 – 2019
- 2019
- [i4]Mohammed Amin Abdullah, Hang Ren, Haitham Bou-Ammar, Vladimir Milenkovic, Rui Luo, Mingtian Zhang, Jun Wang:
Wasserstein Robust Reinforcement Learning. CoRR abs/1907.13196 (2019) - 2018
- [j4]Mohammed Amin Abdullah, Nikolaos Fountoulakis
A phase transition in the evolution of bootstrap percolation processes on preferential attachment graphs. Random Struct. Algorithms 52(3): 379-418 (2018) - [c8]Georgios S. Paschos, Mohammed Amin Abdullah, Spyridon Vassilaras:
Network Slicing with Splittable Flows is Hard. PIMRC 2018: 1788-1793 - [i3]Mohammed Amin Abdullah, Aldo Pacchiano, Moez Draief:
A note on reinforcement learning with Wasserstein distance regularisation, with applications to multipolicy learning. CoRR abs/1802.03976 (2018) - 2017
- [j3]Mohammed Amin Abdullah, Nikolaos Fountoulakis
Typical distances in a geometric model for complex networks. Internet Math. 2017 (2017) - [c7]Symeon Chouvardas, Mohammed Amin Abdullah, Lucas Claude, Moez Draief:
Robust online matrix completion on graphs. ICASSP 2017: 4019-4023 - 2016
- [c6]Paolo Medagliani, Jeremie Leguay
Global Optimization for Hash-Based Splitting. GLOBECOM 2016: 1-6 - [i2]Symeon Chouvardas, Mohammed Amin Abdullah, Lucas Claude, Moez Draief:
Robust On-line Matrix Completion on Graphs. CoRR abs/1605.04192 (2016) - 2015
- [j2]Mohammed Amin Abdullah, Moez Draief:
Global majority consensus by local majority polling on graphs of a given degree sequence. Discret. Appl. Math. 180: 1-10 (2015) - [c5]Mohammed Amin Abdullah, Colin Cooper, Moez Draief:
Speeding Up Cover Time of Sparse Graphs Using Local Knowledge. IWOCA 2015: 1-12 - [c4]Mohammed Amin Abdullah, Michel Bode, Nikolaos Fountoulakis
Local Majority Dynamics on Preferential Attachment Graphs. WAW 2015: 95-106 - 2014
- [c3]Mohammed Amin Abdullah, Moez Draief:
Global majority consensus by local majority polling on graphs. NetGCooP 2014: 46-53 - 2012
- [j1]Mohammed Amin Abdullah, Colin Cooper, Alan M. Frieze
Cover time of a random graph with given degree sequence. Discret. Math. 312(21): 3146-3163 (2012) - [i1]Mohammed Amin Abdullah, Moez Draief:
Majority Consensus on Random Graphs of a Given Degree Sequence. CoRR abs/1209.5025 (2012) - 2011
- [c2]Mohammed Amin Abdullah, Colin Cooper, Moez Draief:
Viral Processes by Random Walks on Random Regular Graphs. APPROX-RANDOM 2011: 351-364 - 2010
- [c1]Mohammed Amin Abdullah, Colin Cooper, Tomasz Radzik:
The Cover Time of Cartesian Product Graphs. IWOCA 2010: 377-389
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-25 05:41 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: