Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
John Michael Robson
J. M. Robson
2010 – today
- 2012
[j34]Robert Cori, Claire Mathieu, John Michael Robson: On the Number of Indecomposable Permutations with a Given Number of Cycles. Electr. J. Comb. 19(1): P49 (2012)- 2011
- [j33]Yves Métivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari: An optimal bit complexity randomized distributed MIS algorithm. Distributed Computing 23(5-6): 331-340 (2011)
- 2010
- [j32]A. El Hibaoui, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari: Uniform election in trees and polyominoids. Discrete Applied Mathematics 158(9): 981-987 (2010)
- [j31]Yves Métivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari: About randomised distributed graph colouring and graph partition algorithms. Inf. Comput. 208(11): 1296-1304 (2010)
2000 – 2009
- 2009
- [c12]Yves Métivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari: Brief Annoucement: Analysis of an Optimal Bit Complexity Randomised Distributed Vertex Colouring Algorithm. OPODIS 2009: 359-364
- [c11]Yves Métivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari: An Optimal Bit Complexity Randomized Distributed MIS Algorithm (Extended Abstract). SIROCCO 2009: 323-337
- [i1]
- 2006
- [j30]Holger Petersen, John Michael Robson: Efficient Simulations by Queue Machines. SIAM J. Comput. 35(5): 1059-1069 (2006)
- 2002
- [j29]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
- [j28]Cristopher Moore, J. M. Robson: Hard Tiling Problems with Simple Tiles. Discrete & Computational Geometry 26(4): 573-590 (2001)
- 2000
- [c10]Lali Barrière, Pierre Fraigniaud, Cyril Gavoille, Bernard Mans, John Michael Robson: On Recognizing Cayley Graphs. ESA 2000: 76-87
- [c9]Bogdan S. Chlebus, Leszek Gasieniec, Anna Östlin, John Michael Robson: Deterministic Radio Broadcasting. ICALP 2000: 717-728
1990 – 1999
- 1999
- [j27]James D. Currie, Holger Petersen, John Michael Robson, Jeffrey Shallit: Separating Words with Small Grammars. Journal of Automata, Languages and Combinatorics 4(2): 101-110 (1999)
- [c8]
- [c7]
- 1998
- [c6]
- 1997
- [j26]Carl Pomerance, John Michael Robson, Jeffrey Shallit: Automaticity II: Descriptional Complexity in the Unary Case. Theor. Comput. Sci. 180(1-2): 181-201 (1997)
- [c5]
- 1996
- [j25]
- [j24]Afonso Ferreira, John Michael Robson: Fast and Scalable Parallel Algorithms for Knapsack-like Problems. J. Parallel Distrib. Comput. 39(1): 1-13 (1996)
- 1995
- [j23]Luc Devroye, J. M. Robson: On the Generation of Random Binary Search Trees. SIAM J. Comput. 24(6): 1141-1156 (1995)
- 1993
- [j22]Philippe Flajolet, Gaston H. Gonnet, Claude Puech, J. M. Robson: Analytic Variations on Quadtrees. Algorithmica 10(6): 473-500 (1993)
- 1992
- [j21]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)
- [j20]Michel Gastaldo, Michel Morvan, John Michael Robson: Transitive Closure in Parallel on a Linear Network of Processors. Parallel Processing Letters 2: 195-203 (1992)
- [j19]J. M. Robson: More Languages of Generalised Star Height 1. Theor. Comput. Sci. 106(2): 327-335 (1992)
- 1991
- [j18]J. M. Robson: An O (T log T) Reduction from RAM Computations to Satisfiability. Theor. Comput. Sci. 82(1): 141-149 (1991)
- [c4]Philippe Flajolet, Gaston H. Gonnet, Claude Puech, J. M. Robson: The Analysis of Multidimensional Searching in Quad-Trees. SODA 1991: 100-109
- 1990
- [j17]J. M. Robson: Random Access Machines with Multi-Dimensional Memories. Inf. Process. Lett. 34(5): 265-266 (1990)
- [j16]J. M. Robson: Strong Time Bounds: Non-Computable Bounds and a Hierarchy Theorem. Theor. Comput. Sci. 73(3): 313-317 (1990)
- [c3]Etienne Grandjean, J. M. Robson: RAM with Compact Memory: A Realistic and Robust Model of Computation. CSL 1990: 195-233
1980 – 1989
- 1989
- [j15]
- 1986
- [j14]
- 1985
- [j13]J. M. Robson: Alternation with Restrictions on Looping. Information and Control 67(1-3): 2-11 (1985)
- 1984
- [j12]J. M. Robson: Fast Probabilistic RAM Simulation of Single Tape Turing Machine Computations. Information and Control 63(1/2): 67-87 (1984)
- [j11]
- [c2]J. M. Robson: Combinatorial Games with Exponential Space Complete Decision Problems. MFCS 1984: 498-506
- 1983
- [c1]
- 1980
- [j10]
1970 – 1979
- 1979
- [j9]
- [j8]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
- [j7]J. M. Robson: A Bounded Storage Algorithm for Copying Cyclic Structures. Commun. ACM 20(6): 431-433 (1977)
- [j6]J. M. Robson: Worst Case Fragmentation of First Fit and Best Fit Storage Allocation Strategies. Comput. J. 20(3): 242-244 (1977)
- 1975
- [j5]J. M. Robson: A Simple Solution to the Interleaved Memory Bandwidth Problem. Inf. Process. Lett. 3(4): 125-126 (1975)
- 1974
- [j4]John Michael Robson: Bounds for Some Functions Concerning Dynamic Storage Allocation. J. ACM 21(3): 491-499 (1974)
- 1973
- [j3]J. M. Robson: An Improved Algorithm for Traversing Binary Trees Without Auxiliary Stack. Inf. Process. Lett. 2(1): 12-14 (1973)
- 1971
- [j2]John Michael Robson: An Estimate of the Store Size Necessary for Dynamic Storage Allocation. J. ACM 18(2): 416-423 (1971)
1960 – 1969
- 1969
- [j1]John Michael Robson: Algorithm 362: generation of random permutations [G6]. Commun. ACM 12(11): 634-635 (1969)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-13 23:32 CEST by the dblp team