default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn Michael Robson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[i10]Arnaud Casteigts, Yves Métivier, John Michael Robson:
Revisiting the Role of Coverings in Anonymous Networks: Spanning Tree Construction and Topology Recognition. CoRR abs/2101.01409 (2021)- 2020
- [j43]Arnaud Casteigts, Swan Dubois, Franck Petit, John Michael Robson:
Robustness: A new form of heredity motivated by dynamic networks. Theor. Comput. Sci. 806: 429-445 (2020)
2010 – 2019
- 2019
- [j42]Arnaud Casteigts
, Yves Métivier, J. M. Robson, Akka Zemmari:
Deterministic Leader Election Takes Θ(D+log n) Bit Rounds. Algorithmica 81(5): 1901-1920 (2019) - [j41]Arnaud Casteigts, Yves Métivier, John Michael Robson, Akka Zemmari:
Design patterns in beeping algorithms: Examples, emulation, and analysis. Inf. Comput. 264: 32-51 (2019) - [j40]Arnaud Casteigts, Yves Métivier, J. M. Robson, Akka Zemmari:
Counting in one-hop beeping networks. Theor. Comput. Sci. 780: 20-28 (2019) - [i9]Arnaud Casteigts, Swan Dubois, Franck Petit, John Michael Robson:
Robustness: a New Form of Heredity Motivated by Dynamic Networks. CoRR abs/1905.04106 (2019) - 2017
- [i8]Arnaud Casteigts, Swan Dubois, Franck Petit, John Michael Robson:
Robustness in Highly Dynamic Networks. CoRR abs/1703.03190 (2017) - 2016
- [j39]Yves Métivier, John Michael Robson, Akka Zemmari:
A distributed enumeration algorithm and applications to all pairs shortest paths, diameter... Inf. Comput. 247: 141-151 (2016) - [j38]Yves Métivier, J. M. Robson, Akka Zemmari:
Randomised distributed MIS and colouring algorithms for rings with oriented edges in O(√(log n)) bit rounds. Inf. Comput. 251: 208-214 (2016) - [c16]Arnaud Casteigts, Yves Métivier, John Michael Robson, Akka Zemmari:
Design Patterns in Beeping Algorithms. OPODIS 2016: 15:1-15:16 - [c15]Arnaud Casteigts, Yves Métivier, John Michael Robson, Akka Zemmari:
Deterministic Leader Election in O(D+\log n) Time with Messages of Size O(1). DISC 2016: 16-28 - [i7]Arnaud Casteigts, Yves Métivier, John Michael Robson, Akka Zemmari:
Deterministic Leader Election in O(D+ log n) Time with Messages of Size O(1). CoRR abs/1605.01903 (2016) - [i6]Arnaud Casteigts, Yves Métivier, John Michael Robson, Akka Zemmari:
Counting in One-Hop Beeping Networks. CoRR abs/1605.09516 (2016) - [i5]Arnaud Casteigts, Yves Métivier, John Michael Robson, Akka Zemmari:
Design Patterns in Beeping Algorithms. CoRR abs/1607.02951 (2016) - 2015
- [j37]Yves Métivier, John Michael Robson, Akka Zemmari:
Analysis of fully distributed splitting and naming probabilistic procedures and applications. Theor. Comput. Sci. 584: 115-130 (2015) - [i4]Yves Métivier, John Michael Robson, Akka Zemmari:
On Distributed Computing with Beeps. CoRR abs/1507.02721 (2015) - [i3]Yves Métivier, John Michael Robson, Akka Zemmari:
A Distributed Enumeration Algorithm and Applications to All Pairs Shortest Paths, Diameter. CoRR abs/1507.03376 (2015) - 2014
- [c14]Allyx Fontaine, Yves Métivier, John Michael Robson, Akka Zemmari:
On Lower Bounds for the Time and the Bit Complexity of Some Probabilistic Distributed Graph Algorithms - (Extended Abstract). SOFSEM 2014: 235-245 - 2013
- [j36]Allyx Fontaine, Yves Métivier, John Michael Robson, Akka Zemmari:
Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings. Inf. Comput. 233: 32-40 (2013) - [j35]Yves Métivier, J. M. Robson, Nasser Saheb-Djahromi, Akka Zemmari:
On the time and the bit complexity of distributed randomised anonymous ring colouring. Theor. Comput. Sci. 502: 64-75 (2013) - [c13]Yves Métivier, John Michael Robson, Akka Zemmari:
Analysis of Fully Distributed Splitting and Naming Probabilistic Procedures and Applications - (Extended Abstract). SIROCCO 2013: 153-164 - 2012
- [j34]Robert Cori, Claire Mathieu, John Michael Robson:
On the Number of Indecomposable Permutations with a Given Number of Cycles. Electron. J. Comb. 19(1): 49 (2012) - 2011
- [j33]Yves Métivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari:
An optimal bit complexity randomized distributed MIS algorithm. Distributed Comput. 23(5-6): 331-340 (2011) - 2010
- [j32]Abdelaaziz El Hibaoui, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari:
Uniform election in trees and polyominoids. Discret. Appl. Math. 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 - [i2]John Michael Robson:
Spanning Trees of Bounded Degree Graphs. CoRR abs/0902.2166 (2009) - 2008
- [i1]John Michael Robson:
Spanning Trees of Bounded Degree Graphs. Moderately Exponential Time Algorithms 2008 - 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. Discret. Comput. Geom. 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 O. Shallit:
Separating Words with Small Grammars. J. Autom. Lang. Comb. 4(2): 101-110 (1999) - [c8]Volker Diekert, John Michael Robson:
Quadratic Word Equations. Jewels are Forever 1999: 314-326 - [c7]John Michael Robson, Volker Diekert:
On Quadratic Word Equations. STACS 1999: 217-226 - 1998
- [c6]Holger Petersen, John Michael Robson:
Efficient Simulations by Queue Machines. ICALP 1998: 884-895 - 1997
- [j26]Carl Pomerance, John Michael Robson, Jeffrey O. Shallit:
Automaticity II: Descriptional Complexity in the Unary Case. Theor. Comput. Sci. 180(1-2): 181-201 (1997) - [c5]John Michael Robson:
On the Concentration of the Height of Binary Search Trees. ICALP 1997: 441-448 - 1996
- [j25]John Michael Robson:
Separating Words with Machines and Groups. RAIRO Theor. Informatics Appl. 30(1): 81-86 (1996) - [j24]Afonso Ferreira, John Michael Robson:
Fast and Scalable Parallel Algorithms for Knapsack-like Problems. J. Parallel Distributed 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 Process. Lett. 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]J. M. Robson:
Separating Strings with Small Automata. Inf. Process. Lett. 30(4): 209-214 (1989) - 1986
- [j14]J. M. Robson:
Algorithms for Maximum Independent Sets. J. Algorithms 7(3): 425-440 (1986) - 1985
- [j13]J. M. Robson:
Alternation with Restrictions on Looping. Inf. Control. 67(1-3): 2-11 (1985) - 1984
- [j12]J. M. Robson:
Fast Probabilistic RAM Simulation of Single Tape Turing Machine Computations. Inf. Control. 63(1/2): 67-87 (1984) - [j11]J. M. Robson:
N by N Checkers is Exptime Complete. SIAM J. Comput. 13(2): 252-267 (1984) - [c2]J. M. Robson:
Combinatorial Games with Exponential Space Complete Decision Problems. MFCS 1984: 498-506 - 1983
- [c1]J. M. Robson:
The Complexity of Go. IFIP Congress 1983: 413-417 - 1980
- [j10]J. M. Robson:
Storage Allocation is NP-Hard. Inf. Process. Lett. 11(3): 119-125 (1980)
1970 – 1979
- 1979
- [j9]J. M. Robson:
The Height of Binary Search Trees. Aust. Comput. J. 11(4): 151-153 (1979) - [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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
