The following pages link to John Michael Robson (Q426817):
Displayed 50 items.
- A distributed enumeration algorithm and applications to all pairs shortest paths, diameter\dots (Q259059) (← links)
- Randomised distributed MIS and colouring algorithms for rings with oriented edges in \(O(\sqrt{\log n})\) bit rounds (Q342718) (← links)
- On the time and the bit complexity of distributed randomised anonymous ring colouring (Q391396) (← links)
- Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings (Q391647) (← links)
- On the number of indecomposable permutations with a given number of cycles (Q426818) (← links)
- An optimal bit complexity randomized distributed MIS algorithm (Q658666) (← links)
- Fast and scalable parallel algorithms for knapsack-like problems. (Q676636) (← links)
- Uniform election in trees and polyominoids (Q708324) (← links)
- About randomised distributed graph colouring and graph partition algorithms (Q710742) (← links)
- On O(Tlog T) reduction from RAM computations to satisfiability (Q758197) (← links)
- Strong time bounds: Non-computable bounds and a hierarchy theorem (Q909465) (← links)
- Random access machines with multi-dimensional memories (Q915444) (← links)
- Separating strings with small automata (Q1116698) (← links)
- The emptiness of complement problem for semi extended regular expressions requires \(c^n\) space (Q1134514) (← links)
- Storage allocation is NP-hard (Q1147512) (← links)
- Deterministic simulation of a single tape turing machine by a random access machine in sub-linear time (Q1193594) (← links)
- More languages of generalised star height 1 (Q1202929) (← links)
- A simple solution to the interleaved memory bandwidth problem (Q1215406) (← links)
- Analytic variations on quadtrees (Q1310465) (← links)
- Automaticity. II: Descriptional complexity in the unary case (Q1390867) (← links)
- Constant bounds on the moments of the height of binary search trees (Q1605322) (← links)
- Design patterns in beeping algorithms: examples, emulation, and analysis (Q1633808) (← links)
- Deterministic leader election in \(O(D+\log n)\) time with messages of size \(O(1)\) (Q1660914) (← links)
- Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds (Q1741851) (← links)
- (Q2285144) (redirect page) (← links)
- Robustness: a new form of heredity motivated by dynamic networks (Q2285145) (← links)
- Analysis of fully distributed splitting and naming probabilistic procedures and applications (Q2345463) (← links)
- Counting in one-hop beeping networks (Q2420611) (← links)
- Cantorian tableaux and permanents (Q2565961) (← links)
- (Q2753924) (← links)
- (Q2754190) (← links)
- Analysis of Fully Distributed Splitting and Naming Probabilistic Procedures and Applications (Q2868641) (← links)
- On Lower Bounds for the Time and the Bit Complexity of Some Probabilistic Distributed Graph Algorithms (Q2938103) (← links)
- (Q3077352) (← links)
- (Q3138944) (← links)
- Design Patterns in Beeping Algorithms. (Q3174939) (← links)
- <i>N</i> by <i>N</i> Checkers is Exptime Complete (Q3316590) (← links)
- An Optimal Bit Complexity Randomized Distributed MIS Algorithm (Extended Abstract) (Q3408183) (← links)
- Fast probabilistic RAM simulation of single tape turing machine computations (Q3719833) (← links)
- (Q3721817) (← links)
- Alternation with restrictions on looping (Q3751006) (← links)
- Algorithms for maximum independent sets (Q3777476) (← links)
- A bounded storage algorithm for copying cyclic structures (Q4131007) (← links)
- (Q4251053) (← links)
- Strategy and Complexity of The Game of Squares (Q4265945) (← links)
- (Q4281688) (← links)
- On the concentration of the height of binary search trees (Q4571975) (← links)
- Bounds for Some Functions Concerning Dynamic Storage Allocation (Q4772703) (← links)
- On the Generation of Random Binary Search Trees (Q4862789) (← links)
- Separating words with machines and groups (Q4889817) (← links)