Mohammed Amin Abdullah

Affiliations:
  • Huawei, Noah's Ark Lab, London, United Kingdom


According to our database1, Mohammed Amin Abdullah authored at least 17 papers between 2010 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
SAMBA: safe model-based & active reinforcement learning.
Mach. Learn., 2022

2019
Wasserstein Robust Reinforcement Learning.
CoRR, 2019

2018
A phase transition in the evolution of bootstrap percolation processes on preferential attachment graphs.
Random Struct. Algorithms, 2018

A note on reinforcement learning with Wasserstein distance regularisation, with applications to multipolicy learning.
CoRR, 2018

Network Slicing with Splittable Flows is Hard.
Proceedings of the 29th IEEE Annual International Symposium on Personal, 2018

2017
Typical distances in a geometric model for complex networks.
Internet Math., 2017

Robust online matrix completion on graphs.
Proceedings of the 2017 IEEE International Conference on Acoustics, 2017

2016
Robust On-line Matrix Completion on Graphs.
CoRR, 2016

Global Optimization for Hash-Based Splitting.
Proceedings of the 2016 IEEE Global Communications Conference, 2016

2015
Global majority consensus by local majority polling on graphs of a given degree sequence.
Discret. Appl. Math., 2015

Local Majority Dynamics on Preferential Attachment Graphs.
Proceedings of the Algorithms and Models for the Web Graph - 12th International Workshop, 2015

Speeding Up Cover Time of Sparse Graphs Using Local Knowledge.
Proceedings of the Combinatorial Algorithms - 26th International Workshop, 2015

2014
Global majority consensus by local majority polling on graphs.
Proceedings of the 7th International Conference on NETwork Games, COntrol and OPtimization, 2014

2012
Cover time of a random graph with given degree sequence.
Discret. Math., 2012

Majority Consensus on Random Graphs of a Given Degree Sequence
CoRR, 2012

2011
Viral Processes by Random Walks on Random Regular Graphs.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011

2010
The Cover Time of Cartesian Product Graphs.
Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010


  Loading...