| |
| 2002 | ||
|---|---|---|
| 25 | EE | J. M. Robson: Constant bounds on the moments of the height of binary search trees. Theor. Comput. Sci. 276(1-2): 435-444 (2002) |
| 2001 | ||
| 24 | EE | Cristopher Moore, J. M. Robson: Hard Tiling Problems with Simple Tiles. Discrete & Computational Geometry 26(4): 573-590 (2001) |
| 1995 | ||
| 23 | Luc Devroye, J. M. Robson: On the Generation of Random Binary Search Trees. SIAM J. Comput. 24(6): 1141-1156 (1995) | |
| 1993 | ||
| 22 | Philippe Flajolet, Gaston H. Gonnet, Claude Puech, J. M. Robson: Analytic Variations on Quadtrees. Algorithmica 10(6): 473-500 (1993) | |
| 1992 | ||
| 21 | J. M. Robson: Deterministic Simulation of a Single Tape Turing Machine by a Random Access Machine in Sub-linear Time Inf. Comput. 99(1): 109-121 (1992) | |
| 20 | J. M. Robson: More Languages of Generalised Star Height 1. Theor. Comput. Sci. 106(2): 327-335 (1992) | |
| 1991 | ||
| 19 | Philippe Flajolet, Gaston H. Gonnet, Claude Puech, J. M. Robson: The Analysis of Multidimensional Searching in Quad-Trees. SODA 1991: 100-109 | |
| 18 | J. M. Robson: An O (T log T) Reduction from RAM Computations to Satisfiability. Theor. Comput. Sci. 82(1): 141-149 (1991) | |
| 1990 | ||
| 17 | Etienne Grandjean, J. M. Robson: RAM with Compact Memory: A Realistic and Robust Model of Computation. CSL 1990: 195-233 | |
| 16 | J. M. Robson: Random Access Machines with Multi-Dimensional Memories. Inf. Process. Lett. 34(5): 265-266 (1990) | |
| 15 | J. M. Robson: Strong Time Bounds: Non-Computable Bounds and a Hierarchy Theorem. Theor. Comput. Sci. 73(3): 313-317 (1990) | |
| 1989 | ||
| 14 | J. M. Robson: Separating Strings with Small Automata. Inf. Process. Lett. 30(4): 209-214 (1989) | |
| 1986 | ||
| 13 | J. M. Robson: Algorithms for Maximum Independent Sets. J. Algorithms 7(3): 425-440 (1986) | |
| 1985 | ||
| 12 | J. M. Robson: Alternation with Restrictions on Looping Information and Control 67(1-3): 2-11 (1985) | |
| 1984 | ||
| 11 | J. M. Robson: Combinatorial Games with Exponential Space Complete Decision Problems. MFCS 1984: 498-506 | |
| 10 | J. M. Robson: Fast Probabilistic RAM Simulation of Single Tape Turing Machine Computations Information and Control 63(1/2): 67-87 (1984) | |
| 9 | J. M. Robson: N by N Checkers is Exptime Complete. SIAM J. Comput. 13(2): 252-267 (1984) | |
| 1983 | ||
| 8 | J. M. Robson: The Complexity of Go. IFIP Congress 1983: 413-417 | |
| 1980 | ||
| 7 | J. M. Robson: Storage Allocation is NP-Hard. Inf. Process. Lett. 11(3): 119-125 (1980) | |
| 1979 | ||
| 6 | J. M. Robson: The Height of Binary Search Trees. Australian Computer Journal 11(4): 151-153 (1979) | |
| 5 | J. M. Robson: The Emptiness of Complement Problem for Semi Extended Regular Expressions Requires cn Space. Inf. Process. Lett. 9(5): 220-222 (1979) | |
| 1977 | ||
| 4 | J. M. Robson: A Bounded Storage Algorithm for Copying Cyclic Structures. Commun. ACM 20(6): 431-433 (1977) | |
| 3 | J. M. Robson: Worst Case Fragmentation of First Fit and Best Fit Storage Allocation Strategies. Comput. J. 20(3): 242-244 (1977) | |
| 1975 | ||
| 2 | J. M. Robson: A Simple Solution to the Interleaved Memory Bandwidth Problem. Inf. Process. Lett. 3(4): 125-126 (1975) | |
| 1973 | ||
| 1 | J. M. Robson: An Improved Algorithm for Traversing Binary Trees Without Auxiliary Stack. Inf. Process. Lett. 2(1): 12-14 (1973) | |
| 1 | Luc Devroye | [23] |
| 2 | Philippe Flajolet | [19] [22] |
| 3 | Gaston H. Gonnet | [19] [22] |
| 4 | Etienne Grandjean | [17] |
| 5 | Cristopher Moore | [24] |
| 6 | Claude Puech | [19] [22] |