Algorithm 362: generation of random permutations [G6]. - John Michael Robson (Commun. ACM, 1969)

An Estimate of the Store Size Necessary for Dynamic Storage Allocation. - John Michael Robson (J. ACM, 1971)

An Improved Algorithm for Traversing Binary Trees Without Auxiliary Stack. - J. M. Robson (Inf. Process. Lett., 1973)

Bounds for Some Functions Concerning Dynamic Storage Allocation. - John Michael Robson (J. ACM, 1974)

A Simple Solution to the Interleaved Memory Bandwidth Problem. - J. M. Robson (Inf. Process. Lett., 1975)

A Bounded Storage Algorithm for Copying Cyclic Structures. - J. M. Robson (Commun. ACM, 1977)

Worst Case Fragmentation of First Fit and Best Fit Storage Allocation Strategies. - J. M. Robson (Comput. J., 1977)

The Height of Binary Search Trees. - J. M. Robson (Aust. Comput. J., 1979)

The Emptiness of Complement Problem for Semi Extended Regular Expressions Requires cn Space. - J. M. Robson (Inf. Process. Lett., 1979)

Storage Allocation is NP-Hard. - J. M. Robson (Inf. Process. Lett., 1980)

The Complexity of Go. - J. M. Robson (IFIP Congress, 1983)

Combinatorial Games with Exponential Space Complete Decision Problems. - J. M. Robson (MFCS, 1984)

Fast Probabilistic RAM Simulation of Single Tape Turing Machine Computations - J. M. Robson (Inf. Control., 1984)

N by N Checkers is Exptime Complete. - J. M. Robson (SIAM J. Comput., 1984)

Alternation with Restrictions on Looping - J. M. Robson (Inf. Control., 1985)

Algorithms for Maximum Independent Sets. - J. M. Robson (J. Algorithms, 1986)

Separating Strings with Small Automata. - J. M. Robson (Inf. Process. Lett., 1989)

RAM with Compact Memory: A Realistic and Robust Model of Computation. - Etienne Grandjean; J. M. Robson (CSL, 1990)

Random Access Machines with Multi-Dimensional Memories. - J. M. Robson (Inf. Process. Lett., 1990)

Strong Time Bounds: Non-Computable Bounds and a Hierarchy Theorem. - J. M. Robson (Theor. Comput. Sci., 1990)

The Analysis of Multidimensional Searching in Quad-Trees. - Philippe Flajolet; Gaston H. Gonnet; Claude Puech; J. M. Robson (SODA, 1991)

An O (T log T) Reduction from RAM Computations to Satisfiability. - J. M. Robson (Theor. Comput. Sci., 1991)

Transitive Closure in Parallel on a Linear Network of Processors. - Michel Gastaldo; Michel Morvan; John Michael Robson (Parallel Process. Lett., 1992)

More Languages of Generalised Star Height 1. - J. M. Robson (Theor. Comput. Sci., 1992)

Deterministic Simulation of a Single Tape Turing Machine by a Random Access Machine in Sub-linear Time - J. M. Robson (Inf. Comput., 1992)

Analytic Variations on Quadtrees. - Philippe Flajolet; Gaston H. Gonnet; Claude Puech; J. M. Robson (Algorithmica, 1993)

On the Generation of Random Binary Search Trees. - Luc Devroye; J. M. Robson (SIAM J. Comput., 1995)

Separating Words with Machines and Groups. - John Michael Robson (RAIRO Theor. Informatics Appl., 1996)

Fast and Scalable Parallel Algorithms for Knapsack-like Problems. - Afonso Ferreira; John Michael Robson (J. Parallel Distributed Comput., 1996)

On the Concentration of the Height of Binary Search Trees. - John Michael Robson (ICALP, 1997)

Automaticity II: Descriptional Complexity in the Unary Case. - Carl Pomerance; John Michael Robson; Jeffrey O. Shallit (Theor. Comput. Sci., 1997)

On Quadratic Word Equations. - John Michael Robson; Volker Diekert (STACS, 1999)

Separating Words with Small Grammars. - James D. Currie; Holger Petersen 001; John Michael Robson; Jeffrey O. Shallit (J. Autom. Lang. Comb., 1999)

On Recognizing Cayley Graphs. - Lali Barrière; Pierre Fraigniaud; Cyril Gavoille; Bernard Mans; John Michael Robson (ESA, 2000)

Deterministic Radio Broadcasting. - Bogdan S. Chlebus; Leszek Gasieniec; Anna Östlin; John Michael Robson (ICALP, 2000)

Hard Tiling Problems with Simple Tiles. - Cristopher Moore; J. M. Robson (Discret. Comput. Geom., 2001)

Constant bounds on the moments of the height of binary search trees. - J. M. Robson (Theor. Comput. Sci., 2002)

Efficient Simulations by Queue Machines. - Holger Petersen 001; John Michael Robson (SIAM J. Comput., 2006)

Spanning Trees of Bounded Degree Graphs. - John Michael Robson (Moderately Exponential Time Algorithms, 2008)

Brief Annoucement: Analysis of an Optimal Bit Complexity Randomised Distributed Vertex Colouring Algorithm. - Yves Métivier; John Michael Robson; Nasser Saheb-Djahromi; Akka Zemmari (OPODIS, 2009)

An Optimal Bit Complexity Randomized Distributed MIS Algorithm (Extended Abstract). - Yves Métivier; John Michael Robson; Nasser Saheb-Djahromi; Akka Zemmari (SIROCCO, 2009)

Uniform election in trees and polyominoids. - Abdelaaziz El Hibaoui; John Michael Robson; Nasser Saheb-Djahromi; Akka Zemmari (Discret. Appl. Math., 2010)

About randomised distributed graph colouring and graph partition algorithms. - Yves Métivier; John Michael Robson; Nasser Saheb-Djahromi; Akka Zemmari (Inf. Comput., 2010)

An optimal bit complexity randomized distributed MIS algorithm. - Yves Métivier; John Michael Robson; Nasser Saheb-Djahromi; Akka Zemmari (Distributed Comput., 2011)

On the Number of Indecomposable Permutations with a Given Number of Cycles. - Robert Cori; Claire Mathieu; John Michael Robson (Electron. J. Comb., 2012)

Analysis of Fully Distributed Splitting and Naming Probabilistic Procedures and Applications - (Extended Abstract). - Yves Métivier; John Michael Robson; Akka Zemmari (SIROCCO, 2013)

Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings. - Allyx Fontaine; Yves Métivier; John Michael Robson; Akka Zemmari (Inf. Comput., 2013)

On the time and the bit complexity of distributed randomised anonymous ring colouring. - Yves Métivier; J. M. Robson; Nasser Saheb-Djahromi; Akka Zemmari (Theor. Comput. Sci., 2013)

On Lower Bounds for the Time and the Bit Complexity of Some Probabilistic Distributed Graph Algorithms - (Extended Abstract). - Allyx Fontaine; Yves Métivier; John Michael Robson; Akka Zemmari (SOFSEM, 2014)

On Distributed Computing with Beeps. - Yves Métivier; John Michael Robson; Akka Zemmari (CoRR, 2015)

Analysis of fully distributed splitting and naming probabilistic procedures and applications. - Yves Métivier; John Michael Robson; Akka Zemmari (Theor. Comput. Sci., 2015)

Design Patterns in Beeping Algorithms. - Arnaud Casteigts; Yves Métivier; John Michael Robson; Akka Zemmari (OPODIS, 2016)

Deterministic Leader Election in O(D+ log n) Time with Messages of Size O(1). - Arnaud Casteigts; Yves Métivier; John Michael Robson; Akka Zemmari (DISC, 2016)

A distributed enumeration algorithm and applications to all pairs shortest paths, diameter... - Yves Métivier; John Michael Robson; Akka Zemmari (Inf. Comput., 2016)

Randomised distributed MIS and colouring algorithms for rings with oriented edges in O(√(log n)) bit rounds. - Yves Métivier; J. M. Robson; Akka Zemmari (Inf. Comput., 2016)

Robustness in Highly Dynamic Networks. - Arnaud Casteigts; Swan Dubois; Franck Petit; John Michael Robson (CoRR, 2017)

Deterministic Leader Election Takes Θ(D+log n) Bit Rounds. - Arnaud Casteigts; Yves Métivier; J. M. Robson; Akka Zemmari (Algorithmica, 2019)

Design patterns in beeping algorithms: Examples, emulation, and analysis. - Arnaud Casteigts; Yves Métivier; John Michael Robson; Akka Zemmari (Inf. Comput., 2019)

Counting in one-hop beeping networks. - Arnaud Casteigts; Yves Métivier; J. M. Robson; Akka Zemmari (Theor. Comput. Sci., 2019)

Robustness: A new form of heredity motivated by dynamic networks. - Arnaud Casteigts; Swan Dubois; Franck Petit; John Michael Robson (Theor. Comput. Sci., 2020)

Revisiting the Role of Coverings in Anonymous Networks: Spanning Tree Construction and Topology Recognition. - Arnaud Casteigts; Yves Métivier; John Michael Robson (CoRR, 2021)