John Michael Robson

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