John Michael Robson

Publication Activity (10 Years)

Years Active: 1969-2021
Publications (10 Years): 14

Top Topics

Fully Distributed

Scales Linearly

Dynamic Networks

Top Venues

Theor. Comput. Sci.

Electron. J. Comb.

Publications

Arnaud Casteigts, Yves Métivier, John Michael Robson
Revisiting the Role of Coverings in Anonymous Networks: Spanning Tree Construction and Topology Recognition. CoRR (2021)
Arnaud Casteigts, Swan Dubois, Franck Petit, John Michael Robson
Robustness: A new form of heredity motivated by dynamic networks. Theor. Comput. Sci. 806 (2020)
Arnaud Casteigts, Swan Dubois, Franck Petit, John Michael Robson
Robustness: a New Form of Heredity Motivated by Dynamic Networks. CoRR (2019)
Arnaud Casteigts, Yves Métivier, John Michael Robson, Akka Zemmari
Design patterns in beeping algorithms: Examples, emulation, and analysis. Inf. Comput. 264 (2019)
Arnaud Casteigts, Swan Dubois, Franck Petit, John Michael Robson
Robustness in Highly Dynamic Networks. CoRR (2017)
Arnaud Casteigts, Yves Métivier, John Michael Robson, Akka Zemmari
Design Patterns in Beeping Algorithms. OPODIS (2016)
Arnaud Casteigts, Yves Métivier, John Michael Robson, Akka Zemmari
Design Patterns in Beeping Algorithms. CoRR (2016)
Arnaud Casteigts, Yves Métivier, John Michael Robson, Akka Zemmari
Deterministic Leader Election in O(D+\log n) Time with Messages of Size O(1). DISC (2016)
Yves Métivier, John Michael Robson, Akka Zemmari
A distributed enumeration algorithm and applications to all pairs shortest paths, diameter... Inf. Comput. 247 (2016)
Arnaud Casteigts, Yves Métivier, John Michael Robson, Akka Zemmari
Deterministic Leader Election in O(D+ log n) Time with Messages of Size O(1). CoRR (2016)
Arnaud Casteigts, Yves Métivier, John Michael Robson, Akka Zemmari
Counting in One-Hop Beeping Networks. CoRR (2016)
Yves Métivier, John Michael Robson, Akka Zemmari
On Distributed Computing with Beeps. CoRR (2015)
Yves Métivier, John Michael Robson, Akka Zemmari
Analysis of fully distributed splitting and naming probabilistic procedures and applications. Theor. Comput. Sci. 584 (2015)
Yves Métivier, John Michael Robson, Akka Zemmari
A Distributed Enumeration Algorithm and Applications to All Pairs Shortest Paths, Diameter. CoRR (2015)
Allyx Fontaine, Yves Métivier, John Michael Robson, Akka Zemmari
On Lower Bounds for the Time and the Bit Complexity of Some Probabilistic Distributed Graph Algorithms - (Extended Abstract). SOFSEM (2014)
Allyx Fontaine, Yves Métivier, John Michael Robson, Akka Zemmari
Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings. Inf. Comput. 233 (2013)
Yves Métivier, John Michael Robson, Akka Zemmari
Analysis of Fully Distributed Splitting and Naming Probabilistic Procedures and Applications - (Extended Abstract). SIROCCO (2013)
Robert Cori, Claire Mathieu, John Michael Robson
On the Number of Indecomposable Permutations with a Given Number of Cycles. Electron. J. Comb. 19 (1) (2012)
Yves Métivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari
An optimal bit complexity randomized distributed MIS algorithm. Distributed Comput. 23 (5-6) (2011)
Abdelaaziz El Hibaoui, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari
Uniform election in trees and polyominoids. Discret. Appl. Math. 158 (9) (2010)
Yves Métivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari
About randomised distributed graph colouring and graph partition algorithms. Inf. Comput. 208 (11) (2010)
Yves Métivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari
Brief Annoucement: Analysis of an Optimal Bit Complexity Randomised Distributed Vertex Colouring Algorithm. OPODIS (2009)
John Michael Robson
Spanning Trees of Bounded Degree Graphs CoRR (2009)
Yves Métivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari
An Optimal Bit Complexity Randomized Distributed MIS Algorithm (Extended Abstract). SIROCCO (2009)
John Michael Robson
Spanning Trees of Bounded Degree Graphs. Moderately Exponential Time Algorithms (2008)
Holger Petersen, John Michael Robson
Efficient Simulations by Queue Machines. SIAM J. Comput. 35 (5) (2006)
Bogdan S. Chlebus, Leszek Gasieniec, Anna Östlin, John Michael Robson
Deterministic Radio Broadcasting. ICALP (2000)
Lali Barrière, Pierre Fraigniaud, Cyril Gavoille, Bernard Mans, John Michael Robson
On Recognizing Cayley Graphs. ESA (2000)
James D. Currie, Holger Petersen, John Michael Robson, Jeffrey O. Shallit
Separating Words with Small Grammars. J. Autom. Lang. Comb. 4 (2) (1999)
John Michael Robson, Volker Diekert
On Quadratic Word Equations. STACS (1999)
Volker Diekert, John Michael Robson
Quadratic Word Equations. Jewels are Forever (1999)
Holger Petersen, John Michael Robson
Efficient Simulations by Queue Machines. ICALP (1998)
Carl Pomerance, John Michael Robson, Jeffrey O. Shallit
Automaticity II: Descriptional Complexity in the Unary Case. Theor. Comput. Sci. 180 (1-2) (1997)
John Michael Robson
On the Concentration of the Height of Binary Search Trees. ICALP (1997)
Afonso Ferreira, John Michael Robson
Fast and Scalable Parallel Algorithms for Knapsack-like Problems. J. Parallel Distributed Comput. 39 (1) (1996)
John Michael Robson
Separating Words with Machines and Groups. RAIRO Theor. Informatics Appl. 30 (1) (1996)
Michel Gastaldo, Michel Morvan, John Michael Robson
Transitive Closure in Parallel on a Linear Network of Processors. Parallel Process. Lett. 2 (1992)
John Michael Robson
Bounds for Some Functions Concerning Dynamic Storage Allocation. J. ACM 21 (3) (1974)
John Michael Robson
An Estimate of the Store Size Necessary for Dynamic Storage Allocation. J. ACM 18 (2) (1971)
John Michael Robson
Algorithm 362: generation of random permutations [G6]. Commun. ACM 12 (11) (1969)