| Wasserstein robust reinforcement learning MA Abdullah, H Ren, HB Ammar, V Milenkovic, R Luo, M Zhang, J Wang arXiv preprint arXiv:1907.13196, 2019 | 99 | 2019 |
| Global majority consensus by local majority polling on graphs of a given degree sequence MA Abdullah, M Draief Discrete Applied Mathematics 180, 1-10, 2015 | 67 | 2015 |
| Samba: Safe model-based & active reinforcement learning AI Cowen-Rivers, D Palenicek, V Moens, MA Abdullah, A Sootla, J Wang, ... Machine Learning 111 (1), 173-203, 2022 | 47 | 2022 |
| Typical distances in a geometric model for complex networks MA Abdullah, M Bode, N Fountoulakis arXiv preprint arXiv:1506.07811, 2015 | 47 | 2015 |
| Cover time of a random graph with given degree sequence M Abdullah, C Cooper, A Frieze Discrete Mathematics 312 (21), 3146-3163, 2012 | 29 | 2012 |
| A phase transition in the evolution of bootstrap percolation processes on preferential attachment graphs M Amin Abdullah, N Fountoulakis Random Structures & Algorithms 52 (3), 379-418, 2018 | 25 | 2018 |
| Network slicing with splittable flows is hard GS Paschos, MA Abdullah, S Vassilaras 2018 IEEE 29th Annual International Symposium on Personal, Indoor and Mobile …, 2018 | 24 | 2018 |
| Robust online matrix completion on graphs S Chouvardas, MA Abdullah, L Claude, M Draief 2017 IEEE International Conference on Acoustics, Speech and Signal …, 2017 | 16 | 2017 |
| The cover time of random walks on graphs M Abdullah arXiv preprint arXiv:1202.5569, 2012 | 14 | 2012 |
| Global optimization for hash-based splitting P Medagliani, J Leguay, M Abdullah, M Leconte, S Paris 2016 IEEE Global Communications Conference (GLOBECOM), 1-6, 2016 | 11 | 2016 |
| Speeding up cover time of sparse graphs using local knowledge MA Abdullah, C Cooper, M Draief International Workshop on Combinatorial Algorithms, 1-12, 2015 | 10 | 2015 |
| Local majority dynamics on preferential attachment graphs MA Abdullah, M Bode, N Fountoulakis Algorithms and Models for the Web Graph: 12th International Workshop, WAW …, 2015 | 10 | 2015 |
| Viral processes by random walks on random regular graphs M Abdullah, C Cooper, M Draief Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2011 | 10 | 2011 |
| The cover time of Cartesian product graphs M Abdullah, C Cooper, T Radzik Combinatorial Algorithms: 21st International Workshop, IWOCA 2010, London …, 2011 | 5 | 2011 |
| Reinforcement learning with wasserstein distance regularisation, with applications to multipolicy learning MA Abdullah, A Pacchiano, M Draief arXiv preprint arXiv:1802.03976, 2018 | 2 | 2018 |
| Global majority consensus by local majority polling on graphs M Abdullah, M Draief 2014 7th International Conference on NETwork Games, COntrol and OPtimization …, 2014 | 2 | 2014 |
| Consensus on the Initial Global Majority by Local Majority Polling for a Class of Sparse Graphs MA Abdullah, M Draief arXiv preprint arXiv:1209.5025, 2012 | 2 | 2012 |
| Cover time of a random graph with given degree sequence M Abdullah, C Cooper, A Frieze Discrete Mathematics & Theoretical Computer Science, 2010 | 2 | 2010 |
| Bootstrap percolation processes on preferential attachment graphs: from sparse contagion to pandemics MA Abdullah, N Fountoulakis preprint available at http://arxiv. org/abs/1404.4070, 2014 | 1 | 2014 |
| Computer-implemented circuit schematic design TA Basilio Gentile, Robert Kirberich, Péter Udvardi, Gary Chambers, Mohammed ... US Patent US12050847B2, 2024 | | 2024 |
