| 2009 |
|---|
| 37 | EE | Hiroshi Umeo,
Takashi Yanagihara:
A Small Five-State Non-Optimum-Time Solution to the Firing Squad Synchronization Problem - A Geometrical Approach.
Fundam. Inform. 91(1): 161-178 (2009) |
| 2008 |
|---|
| 36 | | Hiroshi Umeo,
Shin Morishita,
Katsuhiro Nishinari,
Toshihiko Komatsuzaki,
Stefania Bandini:
Cellular Automata, 8th International Conference on Cellular Aotomata for Reseach and Industry, ACRI 2008, Yokohama, Japan, September 23-26, 2008. Proceedings
Springer 2008 |
| 35 | EE | Hiroshi Umeo,
Jean-Baptiste Yunès,
Naoki Kamikawa:
About 4-States Solutions to the Firing Squad Synchronization Problem.
ACRI 2008: 108-113 |
| 34 | EE | Maurice Margenstern,
Benoît Martin,
Hiroshi Umeo,
Shogo Yamano,
Kazuhiro Nishioka:
A Proposal for a Japanese Keyboard on Cellular Phones.
ACRI 2008: 299-306 |
| 33 | EE | Susumu Adachi,
Ferdinand Peper,
Jia Lee,
Hiroshi Umeo:
Occurrence of Gliders in an Infinite Class of Life-Like Cellular Automata.
ACRI 2008: 32-41 |
| 32 | EE | Teijiro Isokawa,
Ferdinand Peper,
Masahiko Mitsui,
Jian-Qin Liu,
Kenichi Morita,
Hiroshi Umeo,
Naotake Kamiura,
Nobuyuki Matsui:
Computing by Swarm Networks.
ACRI 2008: 50-59 |
| 31 | | Naoki Kamikawa,
Hiroshi Umeo:
A Note on Sequence Generation Power of Communication-Restricted Cellular Automata with Small Number of States.
PDPTA 2008: 764-770 |
| 30 | EE | Hiroshi Umeo,
Hiroki Uchino:
A New Time-Optimum Synchronization Algorithm for Rectangle Arrays.
Fundam. Inform. 87(2): 155-164 (2008) |
| 2007 |
|---|
| 29 | EE | Hiroshi Umeo,
Takuya Yamawaki,
Naoki Shimizu,
Hiroki Uchino:
Modeling and Simulation of Global Synchronization Processes for Large-Scale-of Two-Dimensional Cellular Arrays.
Asia International Conference on Modelling and Simulation 2007: 139-144 |
| 28 | EE | Hiroshi Umeo,
Hiroki Uchino:
A New Time-Optimum Synchronization Algorithm for Two-Dimensional Cellular Arrays.
EUROCAST 2007: 604-611 |
| 27 | | Hiroshi Umeo:
Time-Optimum Synchronization Algorithms for Two-Dimensional Cellular Arrays - A Survey.
IICAI 2007: 1423-1439 |
| 26 | EE | Hiroshi Umeo,
Takashi Yanagihara:
A Smallest Five-State Solution to the Firing Squad Synchronization Problem.
MCU 2007: 291-302 |
| 2006 |
|---|
| 25 | EE | Hiroshi Umeo,
Masashi Maeda,
Kazuaki Hongyo:
A Design of Symmetrical Six-State 3n-Step Firing Squad Synchronization Algorithms and Their Implementations.
ACRI 2006: 157-168 |
| 24 | EE | Hiroshi Umeo,
Takashi Yanagihara,
Masaru Kanazawa:
State-Efficient Firing Squad Synchronization Protocols for Communication-Restricted Cellular Automata.
ACRI 2006: 169-181 |
| 23 | EE | Hiroshi Umeo,
Masashi Maeda,
Masaya Hisaoka,
Masato Teraoka:
A State-Efficient Mapping Scheme for Designing Two-Dimensional Firing Squad Synchronization Algorithms.
Fundam. Inform. 74(4): 603-623 (2006) |
| 2005 |
|---|
| 22 | EE | Hiroshi Umeo,
Masaya Hisaoka,
Shunsuke Akiguchi:
A Twelve-State Optimum-Time Synchronization Algorithm for Two-Dimensional Rectangular Cellular Arrays.
UC 2005: 214-223 |
| 2004 |
|---|
| 21 | EE | Hiroshi Umeo,
Masaya Hisaoka,
Takashi Sogabe:
A Comparative Study of Optimum-Time Synchronization Algorithms for One-Dimensional Cellular Automata - A Survey.
ACRI 2004: 50-60 |
| 20 | EE | Hiroshi Umeo,
Masaya Hisaoka,
Masato Teraoka,
Masashi Maeda:
Several New Generalized Linear- and Optimum-Time Synchronization Algorithms for Two-Dimensional Rectangular Arrays.
MCU 2004: 223-232 |
| 2003 |
|---|
| 19 | EE | Hiroshi Umeo,
Masaya Hisaoka,
Takashi Sogabe:
A Comparative Investigation into Optimum-Time Synchronization Protocols for a Large Scale of One-Dimensional Cellular Automata.
ISPA 2003: 165-178 |
| 18 | EE | Hiroshi Umeo,
Koshi Michisaka,
Naoki Kamikawa:
A Synchronization Problem on 1-Bit Communication Cellular Automata.
International Conference on Computational Science 2003: 492-500 |
| 17 | EE | Martin Kutrib,
Maurice Margenstern,
Hiroshi Umeo:
Foreword.
Fundam. Inform. 58(2003): (2003) |
| 16 | EE | Hiroshi Umeo,
Naoki Kamikawa:
Real-Time Generation of Primes by a 1-Bit-Communication Cellular Automaton.
Fundam. Inform. 58(2003): 421-435 (2003) |
| 2002 |
|---|
| 15 | EE | Hiroshi Umeo,
Masashi Maeda,
Norio Fujiwara:
An Efficient Mapping Scheme for Embedding Any One-Dimensional Firing Squad Synchronization Algorithm onto Two-Dimensional Arrays.
ACRI 2002: 69-81 |
| 14 | EE | Hiroshi Umeo,
Naoki Kamikawa:
An Infinite Prime Sequence Can Be Generated in Real-Time by a 1-Bit Inter-cell Communication Cellular Automaton.
Developments in Language Theory 2002: 339-348 |
| 13 | EE | Hiroshi Umeo,
Masaya Hisaoka,
Koshi Michisaka,
Koji Nishioka,
Masashi Maeda:
Some New Generalized Synchronization Algorithms and Their Implementations for Large Scale Cellular Automata.
UMC 2002: 276-286 |
| 12 | EE | Hiroshi Umeo,
Naoki Kamikawa:
A Design of Real-Time Non-Regular Sequence Generation Algorithms and Their Implementations on Cellular Automata with 1-Bit Inter-Cell Communications.
Fundam. Inform. 52(1-3): 257-275 (2002) |
| 11 | EE | Hiroshi Umeo,
Giancarlo Mauri:
A duality theorem for two connectivity-preserving parallel shrinking transformations.
Future Generation Comp. Syst. 18(7): 931-937 (2002) |
| 2001 |
|---|
| 10 | | Hiroshi Umeo:
Linear-time recognition of connectivity of binary images on 1-bit inter-cell communication cellular automaton.
Parallel Computing 27(5): 587-599 (2001) |
| 2000 |
|---|
| 9 | | Hiroshi Umeo,
Giancarlo Mauri:
A Duality in Two Connectivity-Preserving Parallel Shrinking Algorithms for Binary Images.
ACRI 2000: 144-151 |
| 8 | | Hiroshi Umeo,
Takashi Sogabe,
Yukihiro Nomura:
Correction, Optimization and Verification of Transition Rule Set for Waksman's Firing Squad Synchronization Algorithm.
ACRI 2000: 152-160 |
| 1998 |
|---|
| 7 | | Hiroshi Umeo:
A deisgn of cellular algorithms for 1-bit inter-call communications and related cellular algorithms.
MCU (1) 1998: 211-227 |
| 1993 |
|---|
| 6 | | Hiroshi Umeo:
A Fault-Tolerant Scheme for Optimum-Time Firing Squad Synchronization.
PARCO 1993: 223-230 |
| 1989 |
|---|
| 5 | | Hiroshi Umeo:
A design of time-optimum and register-number-minimum systolic convolvers.
Parallel Computing 12(3): 285-299 (1989) |
| 1987 |
|---|
| 4 | | Tetsuo Asano,
Hiroshi Umeo:
Systolic Algorithms for Computing the Visibility Polygon and Triangulation of A Polygonal Region.
Parallel Algorithms and Architectures 1987: 77-85 |
| 3 | EE | Hiroshi Umeo,
Isao Nakatsuka:
A design of pipeline-interval-optimum systolic stack.
Parallel Computing 4(2): 215-219 (1987) |
| 1986 |
|---|
| 2 | EE | Hiroshi Umeo,
Isao Nakatsuka:
A pipeline-interval-optimum systolic queue.
Discrete Mathematics 62(3): 319-323 (1986) |
| 1982 |
|---|
| 1 | | Hiroshi Umeo,
Kenichi Morita,
Kazuhiro Sugata:
Deterministic One-Way Simulation of Two-Way Real-Time Cellular Automata and Its Related Problems.
Inf. Process. Lett. 14(4): 158-161 (1982) |
