Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarHiroshi Umeo
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – today
- 2018
[j31]Hiroshi Umeo, Mitsuki Hirota, Youhei Nozaki, Keisuke Imai, Takashi Sogabe:
A new reconstruction and the first implementation of Goto's FSSP algorithm. Applied Mathematics and Computation 318: 92-108 (2018)- [j30]Teijiro Isokawa, Katsunobu Imai, Nobuyuki Matsui, Ferdinand Peper, Hiroshi Umeo:
Preface. J. Cellular Automata 13(3): 181-182 (2018) - [j29]Hiroshi Umeo, Keisuke Imai, Akihiro Sousa:
A design of generalized minimum-state-change FSSP algorithms and their implementations. Natural Computing 17(3): 441-453 (2018) - [c55]Hiroshi Umeo, Naoki Kamikawa, Masashi Maeda, Gen Fujita:
Implementations of FSSP Algorithms on Fault-Tolerant Cellular Arrays. ACRI 2018: 274-285 - [c54]Naoki Kamikawa, Hiroshi Umeo:
A Smaller-State Implementation of Real-Time Sequence Generator for {n^3 | n= 1, 2, 3, ...}. CANDAR Workshops 2018: 20-26 - [c53]Hiroshi Umeo, Naoki Kamikawa, Gen Fujita:
The Smallest FSSP Partial Solutions for One-Dimensional Ring Cellular Automata: Symmetric and Asymmetric Synchronizers. ICTAC 2018: 455-471 - [p1]Hiroshi Umeo:
FSSP Algorithms for 2D Rectangular Arrays. Recent Developments. Reversibility and Universality 2018: 5-36 - 2017
- [c52]Hiroshi Umeo, Keisuke Kubo, Akira Nomura:
Smaller-State Implementations of 2D FSSP Algorithms - Recent Developments. ICTAC 2017: 136-152 - [c51]Hiroshi Umeo, Naoki Kamikawa:
A New Class of the Smallest Four-State Partial FSSP Solutions for One-Dimensional Ring Cellular Automata. PaCT 2017: 232-245 - 2016
- [c50]Hiroshi Umeo, Keisuke Imai:
A Class of Minimum-Time Minimum-State-Change Generalized FSSP Algorithms. ACRI 2016: 144-154 - [c49]Susumu Adachi, Jia Lee, Ferdinand Peper, Hiroshi Umeo:
Universal 2-State 24-Neighborhood Asynchronous Cellular Automaton with Inner-Independent Open Rule. CANDAR 2016: 202-208 - [c48]Luca Manzoni, Antonio E. Porreca, Hiroshi Umeo:
The Firing Squad Synchronization Problem on Higher-Dimensional CA with Multiple Updating Cycles. CANDAR 2016: 258-261 - 2015
- [c47]
- [c46]Hiroshi Umeo, Masashi Maeda, Akihiro Sousa, Kiyohisa Taguchi:
A Class of Non-optimum-time 3n-Step FSSP Algorithms - A Survey. PaCT 2015: 231-245 - [c45]Hiroshi Umeo, Keisuke Imai, Akihiro Sousa:
A Generalized Minimum-Time Minimum-State-Change FSSP Algorithm. TPNC 2015: 161-173 - [e5]Teijiro Isokawa, Katsunobu Imai, Nobuyuki Matsui, Ferdinand Peper, Hiroshi Umeo:
Cellular Automata and Discrete Complex Systems - 20th International Workshop, AUTOMATA 2014, Himeji, Japan, July 7-9, 2014, Revised Selected Papers. Lecture Notes in Computer Science 8996, Springer 2015, ISBN 978-3-319-18811-9 [contents] - 2014
- [j28]Luca Manzoni, Hiroshi Umeo:
The firing squad synchronization problem on CA with multiple updating cycles. Theor. Comput. Sci. 559: 108-117 (2014) - [c44]Hiroshi Umeo:
Time-Optimum Smaller-State Synchronizers for Cellular Automata. Computing with New Resources 2014: 129-145 - 2013
- [j27]Hiroshi Umeo, Hiroki Uchino, Akira Nomura:
An Optimum-Time Square Synchronization Algorithm: One-Sided Recursive-Halving Marking Based. J. Cellular Automata 8(1-2): 39-51 (2013) - [c43]Hiroshi Umeo:
On Generalized FSSP Algorithms for Two-Dimensional Cellular Automata. CANDAR 2013: 533-539 - [c42]Hiroshi Umeo, Keisuke Kubo, Yusuke Takahashi:
An Isotropic Optimum-Time FSSP Algorithm for Two-Dimensional Cellular Automata. PaCT 2013: 381-393 - 2012
- [j26]Hiroshi Umeo:
Synchronizing square arrays in optimum-time. Int. J. General Systems 41(6): 617-631 (2012) - [j25]Alberto Dennunzio, Enrico Formenti, Ferdinand Peper, Hiroshi Umeo:
Foreword: asynchronous cellular automata and nature-inspired computation. Natural Computing 11(2): 267-268 (2012) - [c41]Hiroshi Umeo, Keisuke Kubo:
Recent Developments in Constructing Square Synchronizers. ACRI 2012: 171-183 - [c40]Hiroshi Umeo:
Realizing Global Synchronizations for Locally-Connected Two-Dimensional Rectangle Cellular Arrays. AINA 2012: 344-351 - [c39]
- [c38]Hiroshi Umeo:
Recent Developments in Firing Squad Synchronization Algorithms: Smaller Solutions. ICNC 2012: 371-378 - [c37]Hiroshi Umeo, Kinuo Nishide, Keisuke Kubo:
A Simple Optimum-Time FSSP Algorithm for Multi-Dimensional Cellular Automata. AUTOMATA & JAC 2012: 151-165 - 2011
- [j24]
- [c36]Hiroshi Umeo:
Recent Developments in Firing Squad Synchronization Algorithms for Two-Dimensional Cellular Automata and Their State-Efficient Implementations. AFL 2011: 368-387 - [c35]Hiroshi Umeo, Kinuo Nishide, Takuya Yamawaki:
A New Optimum-Time Firing Squad Synchronization Algorithm for Two-Dimensional Rectangle Arrays: One-Sided Recursive Halving Based. CiE 2011: 290-299 - [c34]Hiroshi Umeo, Hiroki Uchino, Akira Nomura:
How to synchronize square arrays in optimum-time - A new square synchronization algorithm. HPCS 2011: 801-807 - [c33]Hiroshi Umeo, Takashi Yanagihara:
Smallest Implementations of Optimum-Time Firing Squad Synchronization Algorithms for One-Bit-Communication Cellular Automata. PaCT 2011: 210-223 - 2010
- [c32]
- [c31]Hiroshi Umeo, Takuya Yamawaki, Kinuo Nishide:
A new optimum-time firing squad synchronization algorithm for two-dimensional rectangle arrays freezing-thawing technique based. HPCS 2010: 575-581 - [e4]Stefania Bandini, Sara Manzoni, Hiroshi Umeo, Giuseppe Vizzari:
Cellular Automata - 9th International Conference on Cellular Automata for Research and Industry, ACRI 2010, Ascoli Piceno, Italy, September 21-24, 2010. Proceedings. Lecture Notes in Computer Science 6350, Springer 2010, ISBN 978-3-642-15978-7 [contents] - [e3]Ferdinand Peper, Hiroshi Umeo, Nobuyuki Matsui, Teijiro Isokawa:
Natural Computing - 4th International Workshop on Natural Computing, IWNC 2009, Himeji, Japan, September 2009, Proceedings. Proceedings in Information and Communications Technology 2, Springer 2010, ISBN 978-4-431-53867-7 [contents]
2000 – 2009
- 2009
- [j23]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) - [j22]Hiroshi Umeo:
Firing Squad Synchronization Algorithms for Two-Dimensional Cellular Automata. J. Cellular Automata 4(1): 1-20 (2009) - [j21]Yasuhiro Suzuki, Masami Hagiya, Hiroshi Umeo, Andrew Adamatzky:
The 2nd International Workshop on Natural Computing. New Generation Comput. 27(2): 83-84 (2009) - [j20]Hiroshi Umeo, Naoki Kamikawa, Jean-Baptiste Yunès:
A Family of Smallest Symmetrical Four-State Firing Squad Synchronization Protocols for Ring Arrays. Parallel Processing Letters 19(2): 299-313 (2009) - [c30]Hiroshi Umeo, Kaori Ishida, Koutarou Tachibana, Naoki Kamikawa:
A Transition Rule Set for the First 2-D Optimum-Time Synchronization Algorithm. IWNC 2009: 333-341 - [c29]Hiroshi Umeo, Jean-Baptiste Yunès, Takuya Yamawaki:
A Two-Dimensional Optimum-Time Firing Squad Synchronization Algorithm and Its Implementation. IWNC 2009: 342-351 - [e2]Yasuhiro Suzuki, Masami Hagiya, Hiroshi Umeo, Andrew Adamatzky:
Natural Computing - 2nd International Workshop on Natural Computing, Nagoya, Japan, December 2007, Proceedings. Proceedings in Information and Communications Technology 1, Springer 2009, ISBN 978-4-431-88980-9 [contents] - [r1]Hiroshi Umeo:
Firing Squad Synchronization Problem in Cellular Automata. Encyclopedia of Complexity and Systems Science 2009: 3537-3574 - 2008
- [j19]Hiroshi Umeo, Hiroki Uchino:
A New Time-Optimum Synchronization Algorithm for Rectangle Arrays. Fundam. Inform. 87(2): 155-164 (2008) - [c28]Susumu Adachi, Ferdinand Peper, Jia Lee, Hiroshi Umeo:
Occurrence of Gliders in an Infinite Class of Life-Like Cellular Automata. ACRI 2008: 32-41 - [c27]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 - [c26]Hiroshi Umeo, Jean-Baptiste Yunès, Naoki Kamikawa:
About 4-States Solutions to the Firing Squad Synchronization Problem. ACRI 2008: 108-113 - [c25]Maurice Margenstern, Benoît Martin, Hiroshi Umeo, Shogo Yamano, Kazuhiro Nishioka:
A Proposal for a Japanese Keyboard on Cellular Phones. ACRI 2008: 299-306 - [c24]Hiroshi Umeo, Naoki Kamikawa, Jean-Baptiste Yunès:
A family of smallest symmetrical four-state firing squad synchronization protocols for one-dimensional ring cellular automata. Automata 2008: 174-186 - [c23]Naoki Kamikawa, Hiroshi Umeo:
A Note on Sequence Generation Power of Communication-Restricted Cellular Automata with Small Number of States. PDPTA 2008: 764-770 - [e1]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. Lecture Notes in Computer Science 5191, Springer 2008, ISBN 978-3-540-79991-7 [contents] - 2007
- [c22]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 - [c21]Hiroshi Umeo, Hiroki Uchino:
A New Time-Optimum Synchronization Algorithm for Two-Dimensional Cellular Arrays. EUROCAST 2007: 604-611 - [c20]Hiroshi Umeo:
Time-Optimum Synchronization Algorithms for Two-Dimensional Cellular Arrays - A Survey. IICAI 2007: 1423-1439 - [c19]
- [c18]Hiroshi Umeo, Takashi Yanagihara:
A Smallest Five-State Solution to the Firing Squad Synchronization Problem. MCU 2007: 291-302 - 2006
- [j18]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) - [c17]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 - [c16]Hiroshi Umeo, Takashi Yanagihara, Masaru Kanazawa:
State-Efficient Firing Squad Synchronization Protocols for Communication-Restricted Cellular Automata. ACRI 2006: 169-181 - 2005
- [j17]Hiroshi Umeo, Masaya Hisaoka, Takashi Sogabe:
A Survey on Optimum-Time Firing Squad Synchronization Algorithms for One-Dimensional Cellular Automata. IJUC 1(4): 403-426 (2005) - [c15]Hiroshi Umeo, Masaya Hisaoka, Shunsuke Akiguchi:
A Twelve-State Optimum-Time Synchronization Algorithm for Two-Dimensional Rectangular Cellular Arrays. UC 2005: 214-223 - 2004
- [j16]Martin Kutrib, Maurice Margenstern, Hiroshi Umeo:
Foreword. IEICE Transactions 87-D(3): 647-649 (2004) - [j15]Hiroshi Umeo:
A Simple Design of Time-Efficient Firing Squad Synchronization Algorithms with Fault-Tolerance. IEICE Transactions 87-D(3): 733-739 (2004) - [c14]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 - [c13]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
- [j14]
- [j13]Hiroshi Umeo, Naoki Kamikawa:
Real-Time Generation of Primes by a 1-Bit-Communication Cellular Automaton. Fundam. Inform. 58(2003): 421-435 (2003) - [c12]Hiroshi Umeo, Koshi Michisaka, Naoki Kamikawa, Yuichi Kinugasa:
Efficient 1-Bit-Communication Cellular Algorithms. HPSC 2003: 509-522 - [c11]Hiroshi Umeo, Koshi Michisaka, Naoki Kamikawa:
A Synchronization Problem on 1-Bit Communication Cellular Automata. International Conference on Computational Science 2003: 492-500 - [c10]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 - 2002
- [j12]Hiroshi Umeo, Giancarlo Mauri:
A duality theorem for two connectivity-preserving parallel shrinking transformations. Future Generation Comp. Syst. 18(7): 931-937 (2002) - [j11]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) - [c9]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 - [c8]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 - [c7]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 - 2001
- [j10]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
- [c6]Hiroshi Umeo, Giancarlo Mauri:
A Duality in Two Connectivity-Preserving Parallel Shrinking Algorithms for Binary Images. ACRI 2000: 144-151 - [c5]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
1990 – 1999
- 1998
- [c4]Hiroshi Umeo:
A deisgn of cellular algorithms for 1-bit inter-call communications and related cellular algorithms. MCU (1) 1998: 211-227 - 1993
- [c3]Hiroshi Umeo:
A Fault-Tolerant Scheme for Optimum-Time Firing Squad Synchronization. PARCO 1993: 223-230 - 1992
- [j9]Hiroshi Umeo, Thomas Worsch, Roland Vollmar:
On the power of global-bus in mesh-connected architectures. Future Generation Comp. Syst. 7(2-3): 161-168 (1992)
1980 – 1989
- 1989
- [j8]Hiroshi Umeo, Tetsuo Asano:
Systolic algorithms for computational geometry problems - A survey. Computing 41(1-2): 19-40 (1989) - [j7]Hiroshi Umeo:
A design of time-optimum and register-number-minimum systolic convolvers. Parallel Computing 12(3): 285-299 (1989) - 1988
- [j6]Tetsuo Asano, Hiroshi Umeo:
Systolic algorithms for computing the visibility polygon and triangulation of a polygonal region. Parallel Computing 6(2): 209-216 (1988) - 1987
- [j5]Hiroshi Umeo, Isao Nakatsuka:
A design of pipeline-interval-optimum systolic stack. Parallel Computing 4(2): 215-219 (1987) - [c2]Hiroshi Umeo:
A design of time-optimum and register-number-minimum systolic convolver. IEEE Symposium on Computer Arithmetic 1987: 5-12 - [c1]Tetsuo Asano, Hiroshi Umeo:
Systolic Algorithms for Computing the Visibility Polygon and Triangulation of A Polygonal Region. Parallel Algorithms and Architectures 1987: 77-85 - 1986
- [j4]Hiroshi Umeo, Isao Nakatsuka:
A pipeline-interval-optimum systolic queue. Discrete Mathematics 62(3): 319-323 (1986) - [j3]Hiroshi Umeo:
A design of real-time systolic convolvers. Systems and Computers in Japan 17(9): 58-66 (1986) - 1985
- [j2]Hiroshi Umeo:
A class of SIMD machines simulated by systolic arrays. J. Parallel Distrib. Comput. 2(4): 391-403 (1985) - 1982
- [j1]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)
Coauthor Index
maintained by 
, founded at 
, founded at 
last updated on 2019-02-13 21:04 CET by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
