J. M. Robson - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 29 from 29

2019

Counting in one-hop beeping networksArnaud Casteigts, Yves Métivier, J. M. Robson, Akka Zemmari. TCS, 780:20-28, 2019. [doi]

Deterministic Leader Election Takes Θ(D+log n) Bit RoundsArnaud Casteigts, Yves Métivier, J. M. Robson, Akka Zemmari. algorithmica, 81(5):1901-1920, 2019. [doi]

2016

Randomised distributed MIS and colouring algorithms for rings with oriented edges in O(√(log n)) bit roundsYves Métivier, J. M. Robson, Akka Zemmari. iandc, 251:208-214, 2016. [doi]

2013

On the time and the bit complexity of distributed randomised anonymous ring colouringYves Métivier, J. M. Robson, Nasser Saheb-Djahromi, Akka Zemmari. TCS, 502:64-75, 2013. [doi]

2002

Constant bounds on the moments of the height of binary search treesJ. M. Robson. TCS, 276(1-2):435-444, 2002. [doi]

2001

Hard Tiling Problems with Simple TilesCristopher Moore, J. M. Robson. dcg, 26(4):573-590, 2001. [doi]

1995

On the Generation of Random Binary Search TreesLuc Devroye, J. M. Robson. SICOMP, 24(6):1141-1156, 1995.

1993

Analytic Variations on QuadtreesPhilippe Flajolet, Gaston H. Gonnet, Claude Puech, J. M. Robson. algorithmica, 10(6):473-500, 1993.

1992

Deterministic Simulation of a Single Tape Turing Machine by a Random Access Machine in Sub-linear TimeJ. M. Robson. iandc, 99(1):109-121, July 1992.

More Languages of Generalised Star Height 1J. M. Robson. TCS, 106(2):327-335, 1992.

1991

The Analysis of Multidimensional Searching in Quad-TreesPhilippe Flajolet, Gaston H. Gonnet, Claude Puech, J. M. Robson. soda 1991: 100-109

An O (T log T) Reduction from RAM Computations to SatisfiabilityJ. M. Robson. TCS, 82(1):141-149, 1991.

1990

RAM with Compact Memory: A Realistic and Robust Model of ComputationEtienne Grandjean, J. M. Robson. csl 1991: 195-233

Strong Time Bounds: Non-Computable Bounds and a Hierarchy TheoremJ. M. Robson. TCS, 73(3):313-317, 1990.

Random Access Machines with Multi-Dimensional MemoriesJ. M. Robson. ipl, 34(5):265-266, 1990.

1989

Separating Strings with Small AutomataJ. M. Robson. ipl, 30(4):209-214, 1989.

1986

Algorithms for Maximum Independent SetsJ. M. Robson. jal, 7(3):425-440, 1986.

1985

Alternation with Restrictions on LoopingJ. M. Robson. iandc, 67(1-3):2-11, October/November/December 1985.

1984

Fast Probabilistic RAM Simulation of Single Tape Turing Machine ComputationsJ. M. Robson. iandc, 63(1/2):67-87, October/November 1984.

Combinatorial Games with Exponential Space Complete Decision ProblemsJ. M. Robson. mfcs 1984: 498-506

N by N Checkers is Exptime CompleteJ. M. Robson. SICOMP, 13(2):252-267, 1984.

1983

The Complexity of GoJ. M. Robson. ifip 1983: 413-417

1980

Storage Allocation is NP-HardJ. M. Robson. ipl, 11(3):119-125, 1980.

1979

The Emptiness of Complement Problem for Semi Extended Regular Expressions Requires c:::n::: SpaceJ. M. Robson. ipl, 9(5):220-222, 1979.

The Height of Binary Search TreesJ. M. Robson. acj, 11(4):151-153, 1979.

1977

A Bounded Storage Algorithm for Copying Cyclic StructuresJ. M. Robson. CACM, 20(6):431-433, 1977.

Worst Case Fragmentation of First Fit and Best Fit Storage Allocation StrategiesJ. M. Robson. cj, 20(3):242-244, 1977.

1975

A Simple Solution to the Interleaved Memory Bandwidth ProblemJ. M. Robson. ipl, 3(4):125-126, 1975.

1973

An Improved Algorithm for Traversing Binary Trees Without Auxiliary StackJ. M. Robson. ipl, 2(1):12-14, 1973.

Sign in or sign up to see more results.

runs on WebDSL