The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

J. M. Robson: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.006secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002