The following pages link to Hiroshi Umeo (Q475399):
Displayed 50 items.
- (Q197538) (redirect page) (← links)
- The firing squad synchronization problem on CA with multiple updating cycles (Q475400) (← links)
- A design of time-optimum and register-number-minimum systolic convolvers (Q582105) (← links)
- A class of time-optimum FSSP algorithms for multi-dimensional cellular arrays (Q907212) (← links)
- Deterministic one-way simulation of two-way real-time cellular automata and its related problems (Q1166274) (← links)
- The smallest FSSP partial solutions for one-dimensional ring cellular automata: symmetric and asymmetric synchronizers (Q1623158) (← links)
- Smaller-state implementations of 2D FSSP algorithms. Recent developments (Q1675799) (← links)
- A new class of the smallest FSSP partial solutions for 1D rings of length \(n=2^k-1\) (Q2041690) (← links)
- A new reconstruction and the first implementation of Goto's FSSP algorithm (Q2422859) (← links)
- (Q2706066) (← links)
- Synchronizing square arrays in optimum-time (Q2869786) (← links)
- Time-Optimum Smaller-State Synchronizers for Cellular Automata (Q2944884) (← links)
- Problem Solving on One-Bit-Communication Cellular Automata (Q3055549) (← links)
- A New Optimum-Time Firing Squad Synchronization Algorithm for Two-Dimensional Rectangle Arrays: One-Sided Recursive Halving Based (Q3091468) (← links)
- (Q3111786) (← links)
- (Q3416102) (← links)
- A Design of Symmetrical Six-State 3n-Step Firing Squad Synchronization Algorithms and Their Implementations (Q3539988) (← links)
- State-Efficient Firing Squad Synchronization Protocols for Communication-Restricted Cellular Automata (Q3539991) (← links)
- Occurrence of Gliders in an Infinite Class of Life-Like Cellular Automata (Q3541739) (← links)
- Computing by Swarm Networks (Q3541742) (← links)
- About 4-States Solutions to the Firing Squad Synchronization Problem (Q3541749) (← links)
- (Q3592209) (← links)
- (Q3603568) (← links)
- (Q3605708) (← links)
- A Smallest Five-State Solution to the Firing Squad Synchronization Problem (Q3608491) (← links)
- A Small Five-State Non-Optimum-Time Solution to the Firing Squad Synchronization Problem (Q3632013) (← links)
- (Q3711754) (← links)
- (Q3721819) (← links)
- (Q4412127) (← links)
- (Q4434779) (← links)
- (Q4437107) (← links)
- (Q4439130) (← links)
- (Q4451916) (← links)
- Recent Developments in Constructing Square Synchronizers (Q4649804) (← links)
- (Q4666756) (← links)
- A duality theorem for two connectivity-preserving parallel shrinking transformations (Q4788332) (← links)
- (Q4799375) (← links)
- An Investigation into Transition Rule Sets for Optimum-time Firing Squad Synchronization Algorithms on One-dimensional Cellular Automata (Q4800323) (← links)
- (Q4825684) (← links)
- (Q4912168) (← links)
- A Seven-State Time-Optimum Square Synchronizer (Q4931212) (← links)
- Real-Time Prime Generators Implemented on Small-State Cellular Automata (Q4983004) (← links)
- (Q4986313) (← links)
- Firing Squad Synchronization Problem in Cellular Automata (Q5072515) (← links)
- FSSP Algorithms for 2D Rectangular Arrays. Recent Developments (Q5112162) (← links)
- How to Synchronize Cellular Automata – Recent Developments – (Q5114233) (← links)
- (Q5396378) (← links)
- A Comparative Study of Optimum-Time Synchronization Algorithms for One-Dimensional Cellular Automata – A Survey – (Q5464136) (← links)
- Unconventional Computation (Q5479216) (← links)
- Machines, Computations, and Universality (Q5710881) (← links)