E-LIB Suche - Ergebnisse für: Robson, John Michael

1

Efficient Simulations by Queue Machines:

Petersen, Holger ; Robson, John Michael
SIAM Journal on Computing. 35 (2006) 5 - p. 1059-1069 , 2006

Link: https://doi.org/10.1137/..

2

Strategy and Complexity of The Game of Squares:

Breuer, Florian ; Robson, John Michael
Bulletin of the London Mathematical Society. 30 (1998) 3 - p. 274-282 , 1998

Link: https://doi.org/10.1112/..

3

Fast and Scalable Parallel Algorithms for Knapsack-like Pro..:

Ferreira, Afonso ; Robson, John Michael
Journal of Parallel and Distributed Computing. 39 (1996) 1 - p. 1-13 , 1996

Link: https://doi.org/10.1006/..

4

On the Generation of Random Binary Search Trees:

Devroye, Luc ; Robson, John Michael
SIAM Journal on Computing. 24 (1995) 6 - p. 1141-1156 , 1995

Link: https://doi.org/10.1137/..

5

A Symposium on Carbenoxolone Sodium

at the Royal Society of Medicine, London November 20th 1967

Robson, John Michael , 1968

Copies: Zentrale:E02 a kli 305.2 ik/30

6

A symposium on embryopathic activity of drugs:

Robson, John Michael ; Sullivan, F. M. ; Smith, R. L. , 1965

Copies: Zentrale:Magazin aa 1634

7

Automaticity II: Descriptional complexity in the unary case:

Pomerance, Carl ; Michael Robson, John ; Shallit, Jeffrey
Theoretical Computer Science. 180 (1997) 1-2 - p. 181-201 , 1997

Link: https://doi.org/10.1016/..

8

Revisiting the Role of Coverings in Anonymous Networks: Spa..:

Casteigts, Arnaud ; Métivier, Yves ; Robson, John Michael
http://arxiv.org/abs/2101.01409. , 2021

Link: http://arxiv.org/abs/210..

9

Deterministic Leader Election Takes Θ(D + log n) Bit Rounds:

Casteigts, Arnaud ; Métivier, Yves ; Robson, John Michael.
info:eu-repo/semantics/altIdentifier/doi/10.1007/s00453-018-0517-3. , 2019

Link: https://hal.archives-ouv..

10

Counting in one-hop beeping networks:

Casteigts, Arnaud ; Métivier, Yves ; Robson, John Michael.
info:eu-repo/semantics/altIdentifier/doi/10.1016/j.tcs.2019.02.009. , 2019

Link: https://hal.science/hal-..

11

Design Patterns in Beeping Algorithms: Examples, Emulation,..:

Casteigts, Arnaud ; Métivier, Yves ; Robson, John Michael.
info:eu-repo/semantics/altIdentifier/doi/10.1016/j.ic.2018.10.001. , 2019

Link: https://hal.archives-ouv..

12

Counting in one-hop beeping networks:

Casteigts, Arnaud ; Métivier, Yves ; Robson, John Michael.
info:eu-repo/semantics/altIdentifier/doi/10.1016/j.tcs.2019.02.009. , 2019

Link: https://hal.archives-ouv..

13

Robustness in Highly Dynamic Networks:

Casteigts, Arnaud ; Dubois, Swan ; Petit, Franck.
http://arxiv.org/abs/1703.03190. , 2017

Link: http://arxiv.org/abs/170..

14

Design Patterns in Beeping Algorithms:

Casteigts, Arnaud ; Robson, John Michael ; Zemmari, Akka
doi:10.4230/LIPIcs.OPODIS.2016.15. , 2017

Link: https://doi.org/10.4230/..

15

Design Patterns in Beeping Algorithms (extended abstract):

Casteigts, Arnaud ; Métivier, Yves ; Robson, John Michael.
hal-01472903. , 2016

Link: https://hal.archives-ouv..