2008 |
91 | EE | Xi Zhuge,
Koji Nakano:
An Error Diffusion Based Algorithm for Hiding an Image in Distinct Two Images.
CSSE (3) 2008: 684-687 |
90 | EE | Koji Nakano,
Yasuaki Ito:
Processor, Assembler, and Compiler Design Education Using an FPGA.
ICPADS 2008: 723-728 |
89 | EE | Yasuaki Ito,
Koji Nakano:
Component labeling for k-concave binary images using an FPGA.
IPDPS 2008: 1-8 |
88 | EE | Yasuaki Ito,
Koji Nakano:
Optimized Component Labeling Algorithm for Using in Medium Sized FPGAs.
PDCAT 2008: 171-176 |
87 | EE | Kensuke Kawakami,
Koji Shigemoto,
Koji Nakano:
Redundant Radix-2r Number System for Accelerating Arithmetic Operations on the FPGAs.
PDCAT 2008: 370-377 |
86 | EE | Jacir Luiz Bordim,
Koji Nakano:
Preface.
Int. J. Found. Comput. Sci. 19(6): 1277-1278 (2008) |
85 | EE | Yasuaki Ito,
Koji Nakano:
A New FM Screening Method to Generate Cluster-Dot Binary Images Using the Local Exhaustive Search with FPGA Acceleration.
Int. J. Found. Comput. Sci. 19(6): 1373-1386 (2008) |
2007 |
84 | EE | Yasuaki Ito,
Koji Nakano:
Cluster-dot Screening by Local Exhaustive Search with Hardware Accelaration.
IPDPS 2007: 1-8 |
83 | EE | Koji Nakano:
Randomized Initialization on the 1-Dimensional Reconfigurable Mesh.
PDCAT 2007: 293-300 |
82 | EE | Akihiro Fujiwara,
Koji Nakano,
Hong Chen:
Special Section on Parallel/Distributed Processing and Systems.
IEICE Transactions 90-D(1): 1 (2007) |
81 | EE | Jacir Luiz Bordim,
Koji Nakano:
Preface.
Int. J. Found. Comput. Sci. 18(3): 433-434 (2007) |
80 | EE | Yasuaki Ito,
Koji Nakano,
Youhei Yamagishi:
Efficient Hardware Algorithms for n Choose k Counters Using the Bitonic Merger.
Int. J. Found. Comput. Sci. 18(3): 517-528 (2007) |
2006 |
79 | EE | Yasuaki Ito,
Koji Nakano,
Youhei Yamagishi:
Efficient hardware algorithms for n choose k counters.
IPDPS 2006 |
78 | EE | Jacir Luiz Bordim,
T. Hunziker,
Koji Nakano:
Limiting the Effects of Deafness and Hidden Terminal Problems in Directional Communications.
ISPA 2006: 195-206 |
77 | EE | Jacir Luiz Bordim,
Yasuaki Ito,
Koji Nakano:
Randomized Leader Election Protocols in Noisy Radio Networks with a Single Transceiver.
ISPA 2006: 246-256 |
76 | EE | Koji Nakano:
An Energy Efficient Ranking Protocol for Radio Networks.
IEICE Transactions 89-A(5): 1346-1354 (2006) |
75 | EE | Jacir Luiz Bordim,
Yasuaki Ito,
Koji Nakano:
An Energy Efficient Leader Election Protocol for Radio Network with a Single Transceiver.
IEICE Transactions 89-A(5): 1355-1361 (2006) |
74 | EE | Koji Nakano,
Jacir Luiz Bordim,
Peter Davis:
Special Section on Challenges in Ad-hoc and Multi-hop Wireless Communications.
IEICE Transactions 89-D(5): 1613 (2006) |
73 | EE | Koji Nakano,
Jacir Luiz Bordim:
Preface.
Int. J. Found. Comput. Sci. 17(2): 249-250 (2006) |
2005 |
72 | EE | Jacir Luiz Bordim,
T. Hunziker,
Koji Nakano:
Adaptive Carrier Sensing and Packet Sending - An Alternative to Boost the Performance in Directional Communications.
PDCAT 2005: 274-279 |
71 | EE | Koji Nakano,
Youhei Yamagishi:
Hardware n Choose k Counters with Applications to the Partial Exhaustive Search.
IEICE Transactions 88-D(7): 1350-1359 (2005) |
70 | EE | Jacir Luiz Bordim,
Koji Nakano,
Arnold L. Rosenberg:
Foreword.
Int. J. Found. Comput. Sci. 16(1): 1-2 (2005) |
69 | EE | Yasuaki Ito,
Koji Nakano:
FM Screening By The Local Exhaustive Search, With Hardware Acceleration.
Int. J. Found. Comput. Sci. 16(1): 89-104 (2005) |
68 | EE | Jacir Luiz Bordim,
Koji Nakano,
Arnold L. Rosenberg:
Foreword.
Int. J. Found. Comput. Sci. 16(2): 143-144 (2005) |
2004 |
67 | EE | Yasuaki Ito,
Koji Nakano:
FM Screening by the Local Exhaustive Search, with Hardware Acceleration.
IPDPS 2004 |
66 | EE | Koji Nakano:
Time And Energy Optimal List Ranking Algorithms On The K-Channel Broadcast Communication Model With No Collision Detection.
Int. J. Found. Comput. Sci. 15(1): 73-88 (2004) |
65 | EE | Jacir Luiz Bordim,
Oscar H. Ibarra,
Yasuaki Ito,
Koji Nakano:
Instance-Specific Solutions For Accelerating The Cky Parsing Of Large Context-Free Grammars.
Int. J. Found. Comput. Sci. 15(2): 403-415 (2004) |
64 | EE | Koji Nakano,
Jie Wu:
Preface.
Int. J. Found. Comput. Sci. 15(3): 459 (2004) |
2003 |
63 | | Jacir Luiz Bordim,
Yasuaki Ito,
Koji Nakano:
Instance-Specific Solutions to Accelerate the CKY Parsing.
Engineering of Reconfigurable Systems and Algorithms 2003: 72-80 |
62 | EE | Rong Lin,
Koji Nakano,
Stephan Olariu,
Albert Y. Zomaya:
An Efficient Parallel Prefix Sums Architecture with Domino Logic.
IEEE Trans. Parallel Distrib. Syst. 14(9): 922-931 (2003) |
61 | EE | Koji Nakano:
Linear Layout of Generalized Hypercubes.
Int. J. Found. Comput. Sci. 14(1): 137-156 (2003) |
60 | EE | Jacir Luiz Bordim,
Koji Nakano,
Hong Shen:
Sorting on Single-Channel Wireless Sensor Networks.
Int. J. Found. Comput. Sci. 14(3): 391-403 (2003) |
59 | | Mark Daley,
Oscar H. Ibarra,
Lila Kari,
Ian McQuillan,
Koji Nakano:
The ld and dlad Bio-Operations on Formal Languages.
Journal of Automata, Languages and Combinatorics 8(3): 477-498 (2003) |
58 | | Koji Nakano,
Stephan Olariu,
Albert Y. Zomaya:
A time-optimal solution for the path cover problem on cographs.
Theor. Comput. Sci. 290(3): 1541-1556 (2003) |
2002 |
57 | EE | Koji Nakano:
Time and Energy Optimal List Ranking Algorithms on the k -Channel Broadcast Communication Model.
COCOON 2002: 269-278 |
56 | EE | Jacir Luiz Bordim,
Yasuaki Ito,
Koji Nakano:
Accelerating the CKY Parsing Using FPGAs.
HiPC 2002: 41-51 |
55 | EE | Koji Nakano:
An Optimal Randomized Ranking Algorithm on the k-channel Broadcast Communication Model.
ICPP 2002: 493-500 |
54 | EE | Jacir Luiz Bordim,
JiangTao Cui,
Naohiro Ishii,
Koji Nakano:
Doubly-Logarithmic Energy-Efficient Initialization Protocols for Single-Hop Radio Networks.
IPDPS 2002 |
53 | EE | Oscar H. Ibarra,
Stephan Olariu,
Koji Nakano,
Jie Wu:
Workshop Introduction.
IPDPS 2002 |
52 | EE | Jacir Luiz Bordim,
Koji Nakano,
Hong Shen:
Sorting on Single-Channel Wireless Sensor Networks.
ISPAN 2002: 153-158 |
51 | EE | Koji Nakano,
Stephan Olariu:
A Survey on Leader Election Protocols for Radio Networks.
ISPAN 2002: 71- |
50 | EE | Koji Nakano,
Stephan Olariu,
Albert Y. Zomaya:
Energy-Efficient Routing in the Broadcast Communication Model.
IEEE Trans. Parallel Distrib. Syst. 13(12): 1201-1210 (2002) |
49 | EE | Koji Nakano,
Stephan Olariu:
Uniform Leader Election Protocols for Radio Networks.
IEEE Trans. Parallel Distrib. Syst. 13(5): 516-526 (2002) |
48 | EE | Stephan Olariu,
Koji Nakano:
Guest Editors' Introduction to Special Section on Mobile Computing and Wireless Networks.
IEEE Trans. Parallel Distrib. Syst. 13(9): 865 (2002) |
47 | EE | Jacir Luiz Bordim,
Frank Hsu,
Koji Nakano:
Identifying Faulty Nodes in Wireless Sensor Networks.
Journal of Interconnection Networks 3(3-4): 197-211 (2002) |
2001 |
46 | EE | Koji Nakano,
Stephan Olariu:
Uniform Leader Election Protocols in Radio Networks.
ICPP 2001: 240-250 |
45 | EE | Raghuvel S. Bhuvaneswaran,
Jacir Luiz Bordim,
JiangTao Cui,
Naohiro Ishii,
Koji Nakano:
An Energy-Efficient Initialization Protocol for Wireless Sensor Networks.
ICPP Workshops 2001: 423-428 |
44 | | Raghuvel S. Bhuvaneswaran,
Jacir Luiz Bordim,
JiangTao Cui,
Koji Nakano:
Fundamental Protocols on Wireless Sensor Networks.
IPDPS 2001: 137 |
43 | EE | Koji Nakano,
Stephan Olariu,
Albert Y. Zomaya:
Energy-Efficient Permutation Routing in Radio Networks.
IEEE Trans. Parallel Distrib. Syst. 12(6): 544-557 (2001) |
42 | EE | Venkatavasu Bokka,
Koji Nakano,
Stephan Olariu,
James L. Schwing,
Larry Wilson:
Optimal Algorithms for the Multiple Query Problem on Reconfigurable Meshes, with Applications.
IEEE Trans. Parallel Distrib. Syst. 12(9): 875-887 (2001) |
2000 |
41 | EE | Koji Nakano,
Stephan Olariu:
Energy-efficient randomized routing in radio networks.
DIAL-M 2000: 35-44 |
40 | EE | Koji Nakano,
Stephan Olariu,
Albert Y. Zomaya:
Energy-Efficient Deterministic Routing Protocols in Radio Networks.
ICPP 2000: 181-188 |
39 | EE | Koji Nakano,
Stephan Olariu:
Energy-Efficient Initialization Protocols for Radio Networks with No Collision Detection.
ICPP 2000: 263-270 |
38 | EE | Oscar H. Ibarra,
Koji Nakano,
Stephan Olariu:
Workshop on Advances in Parallel and Distributed Computational Models.
IPDPS Workshops 2000: 101 |
37 | EE | JiangTao Cui,
Jacir Luiz Bordim,
Koji Nakano,
Tatsuya Hayashi,
Naohiro Ishii:
Multithreaded Parallel Computer Model with Performance Evaluation.
IPDPS Workshops 2000: 155-160 |
36 | EE | Koji Nakano,
Stephan Olariu:
Randomized Leader Election Protocols in Radio Networks with No Collision Detection.
ISAAC 2000: 362-373 |
35 | | Koji Nakano,
Stephan Olariu:
A randomized leader election protocol for ad-hoc networks.
SIROCCO 2000: 253-267 |
34 | EE | Koji Nakano,
Stephan Olariu:
Randomized Initialization Protocols for Ad Hoc Networks.
IEEE Trans. Parallel Distrib. Syst. 11(7): 749-759 (2000) |
33 | EE | Rong Lin,
Koji Nakano,
Stephan Olariu,
Maria Cristina Pinotti,
James L. Schwing,
Albert Y. Zomaya:
Scalable Hardware-Algorithms for Binary Prefix Sums.
IEEE Trans. Parallel Distrib. Syst. 11(8): 838-850 (2000) |
32 | EE | Koji Nakano,
Stephan Olariu:
Energy-Efficient Initialization Protocols for Single-Hop Radio Networks with No Collision Detection.
IEEE Trans. Parallel Distrib. Syst. 11(8): 851-863 (2000) |
1999 |
31 | EE | Koji Nakano,
Stephan Olariu,
Albert Y. Zomaya:
A Time-Optimal Solution for the Path Cover Problem on Cographs.
IPPS/SPDP 1999: 26-30 |
30 | EE | Rong Lin,
Koji Nakano,
Stephan Olariu,
Albert Y. Zomaya:
An Efficient VLSI Architecture Parallel Prefix Counting With Domino Logic.
IPPS/SPDP 1999: 273- |
29 | EE | Tatsuya Hayashi,
Koji Nakano,
Stephan Olariu:
Randomized Initialization Protocols for Packet Radio Networks.
IPPS/SPDP 1999: 544- |
28 | | Rong Lin,
Koji Nakano,
Stephan Olariu,
Maria Cristina Pinotti,
James L. Schwing,
Albert Y. Zomaya:
Scalable Hardware-Algorithms for Binary Prefix Sums.
IPPS/SPDP Workshops 1999: 634-642 |
27 | EE | Jacir Luiz Bordim,
JiangTao Cui,
Tatsuya Hayashi,
Koji Nakano,
Stephan Olariu:
Energy-Efficient Initialization Protocols for Ad-hoc Radio Networks.
ISAAC 1999: 215-224 |
26 | EE | Jacir Luiz Bordim,
Tomoo Watanabe,
Koji Nakano,
Tatsuya Hayashi:
A Tool for Algorithm Visualization on the Reconfigurable Mesh.
ISPAN 1999: 406-413 |
25 | EE | Koji Nakano,
Stephan Olariu,
James L. Schwing:
Broadcast-Efficient Protocols for Mobile Radio Networks.
IEEE Trans. Parallel Distrib. Syst. 10(12): 1276-1289 (1999) |
24 | | Koji Nakano,
Stephan Olariu:
Guest Editors' Introduction.
Int. J. Found. Comput. Sci. 10(2): 123-126 (1999) |
1998 |
23 | EE | Koji Nakano,
Stephan Olariu,
James L. Schwing:
Broadcast-Efficient Algorithms on the Coarse-Grain Broadcast Communication Model with Few Channels.
IPPS/SPDP 1998: 31-35 |
22 | EE | Rong Lin,
Koji Nakano,
Stephan Olariu,
Maria Cristina Pinotti,
James L. Schwing,
Albert Y. Zomaya:
A Scalable VLSI Architecture for Binary Prefix Sums.
IPPS/SPDP 1998: 333-337 |
21 | EE | Tatsuya Hayashi,
Koji Nakano,
Stephan Olariu:
An O((log log n)2) Time Convex Hull Algorithm on Reconfigurable Meshes.
IPPS/SPDP 1998: 439-446 |
20 | EE | Koji Nakano,
Stephan Olariu:
Randomized O (log log n)-Round Leader Election Protocols in Packet Radio Networks.
ISAAC 1998: 209-218 |
19 | EE | Tatsuya Hayashi,
Koji Nakano,
Stephan Olariu:
Optimal Parallel Algorithms for Finding Proximate Points, with Applications.
IEEE Trans. Parallel Distrib. Syst. 9(12): 1153-1166 (1998) |
18 | EE | Tatsuya Hayashi,
Koji Nakano,
Stephan Olariu:
An O((log log n)2) Time Algorithm to Compute the Convex Hull of Sorted Points on Reconfigurable Meshes.
IEEE Trans. Parallel Distrib. Syst. 9(12): 1167-1179 (1998) |
17 | EE | Tatsuya Hayashi,
Koji Nakano,
Stephan Olariu:
Work-Time Optimal k-Merge Algorithms on the PRAM.
IEEE Trans. Parallel Distrib. Syst. 9(3): 275-282 (1998) |
16 | EE | Koji Nakano,
Stephan Olariu:
An Efficient Algorithm for Row Minima Computations on Basic Reconfigurable Meshes.
IEEE Trans. Parallel Distrib. Syst. 9(6): 561-569 (1998) |
15 | EE | Koji Nakano,
Koichi Wada:
Integer Summing Algorithms on Reconfigurable Meshes.
Theor. Comput. Sci. 197(1-2): 57-77 (1998) |
14 | EE | Tatsuya Hayashi,
Koji Nakano,
Stephan Olariu:
Efficient List Ranking on the Reconfigurable Mesh with Applications.
Theory Comput. Syst. 31(5): 593-611 (1998) |
1997 |
13 | EE | Tatsuya Hayashi,
Koji Nakano,
Stephan Olariu:
Work-Time Optimal K-Merge Algorithms on the PRAM.
IPPS 1997: 298- |
12 | | Tatsuya Hayashi,
Koji Nakano,
Stephan Olariu:
Weighted and Unweighted Selection Algorithms for k Sorted Sequences.
ISAAC 1997: 52-61 |
11 | | Tatsuya Hayashi,
Koji Nakano,
Stephan Olariu:
Optimal Parallel Algorithms for Finding Proximate Points, with Applications (Extended Abstract).
WADS 1997: 224-233 |
10 | EE | Koji Nakano,
Stephan Olariu:
An Optimal Algorithm for the Angle-Restricted All Nearest Neighbor Problem on the Reconfigurable Mesh, with Applications.
IEEE Trans. Parallel Distrib. Syst. 8(9): 983-990 (1997) |
9 | | Atsuko Yamaguchi,
Koji Nakano,
Satoru Miyano:
An Approximation Algorithm for the Minimum Common Supertree Problem.
Nord. J. Comput. 4(2): 303-316 (1997) |
1996 |
8 | | Koji Nakano,
Stephan Olariu:
An Efficient Algorithm for Row Minima Computations in Monotone Matrices.
ICPP, Vol. 2 1996: 54-61 |
7 | EE | Koji Nakano,
Stephan Olariu:
An Optimal Algorithm for the Angle-Restricted All Nearest Neighbor Problem on the Reconfigurable.
IPPS 1996: 687-691 |
6 | | Tatsuya Hayashi,
Koji Nakano,
Stephan Olariu:
Efficient List Ranking on the Reconfigurable Mesh, with Applications.
ISAAC 1996: 326-335 |
5 | EE | Koji Nakano:
Computation of the Convex Hull for Sorted Points on a Reconfigurable Mesh.
Parallel Algorithms Appl. 8(3-4): 243-250 (1996) |
1995 |
4 | | Koji Nakano:
Optimal Initializing Algorithms for a Reconfigurable Mesh.
J. Parallel Distrib. Comput. 24(2): 218-223 (1995) |
3 | | Koji Nakano:
A Bibliography of Published Papers on Dynamically Reconfigurable Architectures.
Parallel Processing Letters 5: 111-124 (1995) |
2 | | Koji Nakano:
Prefix-Sums Algorithms on Reconfigurable Meshes.
Parallel Processing Letters 5: 23-35 (1995) |
1993 |
1 | | Koji Nakano:
Linear Layouts of Generalized Hypercubes.
WG 1993: 364-375 |