J. M. Robson

Publication Activity (10 Years)

Years Active: 1973-2019
Publications (10 Years): 3

Top Topics

Distributed Database Systems

Stochastic Methods

Top Venues

Theor. Comput. Sci.

Publications

Arnaud Casteigts, Yves Métivier, J. M. Robson, Akka Zemmari
Deterministic Leader Election Takes Θ(D+log n) Bit Rounds. Algorithmica 81 (5) (2019)
Arnaud Casteigts, Yves Métivier, J. M. Robson, Akka Zemmari
Counting in one-hop beeping networks. Theor. Comput. Sci. 780 (2019)
Yves Métivier, J. M. Robson, Akka Zemmari
Randomised distributed MIS and colouring algorithms for rings with oriented edges in O(√(log n)) bit rounds. Inf. Comput. 251 (2016)
Yves Métivier, J. M. Robson, Nasser Saheb-Djahromi, Akka Zemmari
On the time and the bit complexity of distributed randomised anonymous ring colouring. Theor. Comput. Sci. 502 (2013)
J. M. Robson
Constant bounds on the moments of the height of binary search trees. Theor. Comput. Sci. 276 (1-2) (2002)
Cristopher Moore, J. M. Robson
Hard Tiling Problems with Simple Tiles. Discret. Comput. Geom. 26 (4) (2001)
Luc Devroye, J. M. Robson
On the Generation of Random Binary Search Trees. SIAM J. Comput. 24 (6) (1995)
Philippe Flajolet, Gaston H. Gonnet, Claude Puech, J. M. Robson
Analytic Variations on Quadtrees. Algorithmica 10 (6) (1993)
J. M. Robson
More Languages of Generalised Star Height 1. Theor. Comput. Sci. 106 (2) (1992)
J. M. Robson
Deterministic Simulation of a Single Tape Turing Machine by a Random Access Machine in Sub-linear Time Inf. Comput. 99 (1) (1992)
J. M. Robson
An O (T log T) Reduction from RAM Computations to Satisfiability. Theor. Comput. Sci. 82 (1) (1991)
Philippe Flajolet, Gaston H. Gonnet, Claude Puech, J. M. Robson
The Analysis of Multidimensional Searching in Quad-Trees. SODA (1991)
J. M. Robson
Random Access Machines with Multi-Dimensional Memories. Inf. Process. Lett. 34 (5) (1990)
J. M. Robson
Strong Time Bounds: Non-Computable Bounds and a Hierarchy Theorem. Theor. Comput. Sci. 73 (3) (1990)
Etienne Grandjean, J. M. Robson
RAM with Compact Memory: A Realistic and Robust Model of Computation. CSL (1990)
J. M. Robson
Separating Strings with Small Automata. Inf. Process. Lett. 30 (4) (1989)
J. M. Robson
Algorithms for Maximum Independent Sets. J. Algorithms 7 (3) (1986)
J. M. Robson
Alternation with Restrictions on Looping Inf. Control. 67 (1-3) (1985)
J. M. Robson
Combinatorial Games with Exponential Space Complete Decision Problems. MFCS (1984)
J. M. Robson
N by N Checkers is Exptime Complete. SIAM J. Comput. 13 (2) (1984)
J. M. Robson
Fast Probabilistic RAM Simulation of Single Tape Turing Machine Computations Inf. Control. 63 (1/2) (1984)
J. M. Robson
The Complexity of Go. IFIP Congress (1983)
J. M. Robson
Storage Allocation is NP-Hard. Inf. Process. Lett. 11 (3) (1980)
J. M. Robson
Space. Inf. Process. Lett. 9 (5) (1979)
J. M. Robson
The Height of Binary Search Trees. Aust. Comput. J. 11 (4) (1979)
J. M. Robson
Worst Case Fragmentation of First Fit and Best Fit Storage Allocation Strategies. Comput. J. 20 (3) (1977)
J. M. Robson
A Bounded Storage Algorithm for Copying Cyclic Structures. Commun. ACM 20 (6) (1977)
J. M. Robson
A Simple Solution to the Interleaved Memory Bandwidth Problem. Inf. Process. Lett. 3 (4) (1975)
J. M. Robson
An Improved Algorithm for Traversing Binary Trees Without Auxiliary Stack. Inf. Process. Lett. 2 (1) (1973)