J. M. Robson

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