Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Nakano, Koji"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An efficient parallel sorting compatible with the standard qsort
Duhu Man
,
Yasuaki Ito
,
Koji Nakano
International Journal of Foundations of Computer Science
22
(5), 2011, pp. 1057-1071
Low-latency connected component labeling using an FPGA
Yasuaki Ito
,
Koji Nakano
International Journal of Foundations of Computer Science
21
(3), 2010, pp. 405-425
A new FM screening method to generate cluster-dot binary images using the local exhaustive search with FPGA acceleration
Yasuaki Ito
,
Koji Nakano
International Journal of Foundations of Computer Science
19
(6), 2008, pp. 1373-1386
Efficient hardware algorithms for
n
choose
k
counters using the bitonic merger
Yasuaki Ito
,
Koji Nakano
,
Youhei Yamagishi
International Journal of Foundations of Computer Science
18
(3), 2007, pp. 517-528
FM
screening by the local exhaustive search, with hardware acceleration
Yasuaki Ito
,
Koji Nakano
International Journal of Foundations of Computer Science
16
(1), 2005, pp. 89-104
Instance-specific solutions for accelerating the CKY parsing of large context-free grammars
Jacir L. Bordim
,
Oscar H. Ibarra
,
Yasuaki Ito
,
Koji Nakano
International Journal of Foundations of Computer Science
15
(2), 2004, pp. 403-415
Time and energy optimal list ranking algorithms on the
k
-channel broadcast communication model with no collision detection
Koji Nakano
International Journal of Foundations of Computer Science
15
(1), 2004, pp. 73-88
Sorting on single-channel wireless sensor networks
Jacir Luiz Bordim
,
Koji Nakano
,
Hong Shen
International Journal of Foundations of Computer Science
14
(3), 2003, pp. 391-403
An efficient parallel prefix sums architecture with domino logic
Rong Lin
,
Koji Nakano
,
Stephan Olariu
,
Albert Y. Zomaya
IEEE Transactions on Parallel and Distributed Systems
14
(9), 2003, pp. 922-931
A time-optimal solution for the path cover problem on cographs
Koji Nakano
,
Stepahn Olariu
,
Albert Y. Zomaya
Theoretical Computer Science
290
(3), 2003, pp. 1541-1556
Linear layout of generalized hypercubes
Koji Nakano
International Journal of Foundations of Computer Science
14
(1), 2003, pp. 137-156
Energy-efficient routing in the broadcast communication model
Koji Nakano
,
Stephan Olariu
,
Albert Y. Zomaya
IEEE Transactions on Parallel and Distributed Systems
13
(12), 2002, pp. 1201-1210
Uniform leader election protocols for radio networks
Koji Nakano
,
Stephan Olariu
IEEE Transactions on Parallel and Distributed Systems
13
(5), 2002, pp. 516-526
Time and energy optimal list ranking algorithms on the
k
-channel broadcast communication model
Koji Nakano
Lecture Notes in Computer Science
2387
, 2002, pp. 269-278
Optimal algorithms for the multiple query problem on reconfigurable meshes, with applications
Venkatavasu Bokka
,
Koji Nakano
,
Stephen Olariu
,
James L. Schwing
,
Larry Wilson
IEEE Transactions on Parallel and Distributed Systems
12
(9), 2001, pp. 875-887
Energy-efficient permutation routing in radio networks
Koji Nakano
,
Stephan Olariu
,
Albert Y. Zomaya
IEEE Transactions on Parallel and Distributed Systems
12
(6), 2001, pp. 544-557
Randomized leader election protocols in radio networks with no collision detection
Koji Nakano
,
Stephan Olariu
Lecture Notes in Computer Science
1969
, 2000, pp. 362-373
Randomized initialization protocols for ad hoc networks
Koji Nakano
,
Stephan Olariu
IEEE Transactions on Parallel and Distributed Systems
11
(7), 2000, pp. 749-759
Energy-efficient initialization protocols for single-hop radio networks with no collision detection
Koji Nakano
,
Stephan Olariu
IEEE Transactions on Parallel and Distributed Systems
11
(8), 2000, pp. 851-863
Randomized initialization protocols for packet radio networks
Tatsuya Hayashi
,
Koji Nakano
,
Stephan Olariu
Proceedings of the 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing, IPPS/SPDP'99 (San Juan, Puerto Rico, April 12-16, 1999)
, 1999, pp. 544-548
An efficient VLSI architecture parallel prefix counting with domino logic
Rong Lin
,
Koji Nakano
,
Stephan Olariu
,
Albert Y. Zomaya
Proceedings of the 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing, IPPS/SPDP'99 (San Juan, Puerto Rico, April 12-16, 1999)
, 1999, pp. 273-277
An
O((\log\log n)^2)
time convex hull algorithm on reconfigurable meshes
Tatsuya Hayashi
,
Koji Nakano
,
Stephan Olariu
Proceedings of the Merged 12th International Parallel Processing Symposium and 9th Symposium on Parallel and Distributed Processing, IPPS/SPDP'98 (Orlando, Florida, March 30 - April 3, 1998)
, 1998, pp. 439-446
Optimal parallel algorithms for finding proximate points, with applications
Tatsuya Hayashi
,
Koji Nakano
,
Stephan Olariu
IEEE Transactions on Parallel and Distributed Systems
9
(12), 1998, pp. 1153-1166
An
O((\log\log n)^2)
time algorithm to compute the convex hull of sorted points on reconfigurable meshes
Tatsuya Hayashi
,
Koji Nakano
,
Stephan Olariu
IEEE Transactions on Parallel and Distributed Systems
9
(12), 1998, pp. 1167-1179
Broadcast-efficient algorithms on the coarse-grain broadcast communication model with few channels
Koji Nakano
,
Stephan Olariu
,
James L. Schwing
Proceedings of the Merged 12th International Parallel Processing Symposium and 9th Symposium on Parallel and Distributed Processing, IPPS/SPDP'98 (Orlando, Florida, March 30 - April 3, 1998)
, 1998, pp. 31-35
Seiten 1
2
>