2007 | ||
---|---|---|
54 | EE | Mariko Fujikake Funada, Miki Shibukawa, Tadashi Funada, Satoki P. Ninomija, Yoshihide Igarashi: Comparison Between Event Related Potentials Obtained by Syllable Recall Tasks and by Associative Recall Tasks. HCI (6) 2007: 838-847 |
2005 | ||
53 | Mariko Fujikake Funada, Yoshihide Igarashi, Testuo Funada, Satoki P. Ninomija: An estimation of homonyms using event related potentials caused by visualizing them in mind. SIP 2005: 347-351 | |
2004 | ||
52 | EE | Masataka Takamura, Tom Altman, Yoshihide Igarashi: Speedup of Vidyasankar's algorithm for the group. Inf. Process. Lett. 91(2): 85-91 (2004) |
2003 | ||
51 | EE | Masataka Takamura, Yoshihide Igarashi: Group Mutual Exclusion Algorithms Based on Ticket Orders. COCOON 2003: 232-241 |
50 | EE | Tom Altman, Yoshihide Igarashi, Michiko Omori: A Turn Function Scheme Realized in the Asynchronous Single-Writer/Multi-reader Shared Memory Model. ISAAC 2003: 454-463 |
49 | Ka Wong Chong, Yijie Han, Yoshihide Igarashi, Tak Wah Lam: Improving the efficiency of parallel minimum spanning tree algorithms. Discrete Applied Mathematics 126(1): 33-54 (2003) | |
2002 | ||
48 | EE | Masataka Takamura, Yoshihide Igarashi: Simple Mutual Exclusion Algorithms Based on Bounded Tickets on the Asynchronous Shared Memory Model. COCOON 2002: 259-268 |
47 | EE | Tom Altman, Yoshihide Igarashi, Kazuhiro Motegi: Fast and Dependable Communication in Hyper-rings. COCOON 2002: 350-359 |
2001 | ||
46 | EE | Kumiko Obokata, Michiko Omori, Kazuhiro Motegi, Yoshihide Igarashi: A Lockout Avoidance Algorithm without Using Time-Stamps for the k-Exclusion Problem. COCOON 2001: 571-575 |
2000 | ||
45 | EE | Reina Yoshikawa, Shimin Guo, Kazuhiro Motegi, Yoshihide Igarashi: Secret Key Exchange Using Random Deals of Cards on Hierarchical Structures. ISAAC 2000: 290-301 |
1999 | ||
44 | EE | Ka Wong Chong, Yijie Han, Yoshihide Igarashi, Tak Wah Lam: Improving Parallel Computation with Fast Integer Sorting. COCOON 1999: 452-461 |
43 | EE | Yoshihide Igarashi, Yasuaki Nishitani: Speedup of Lockout-Free Mutual Exclusion Algorithms. ISPAN 1999: 172-177 |
42 | EE | Yijie Han, Yoshihide Igarashi: Parallel PROFIT/COST Algorithms Through Fast Derandomization. Acta Inf. 36(3): 215-232 (1999) |
41 | EE | Yukihiro Iwasaki, Yuka Kajiwara, Koji Obokata, Yoshihide Igarashi: Independent Spanning Trees of Chordal Rings. Inf. Process. Lett. 69(3): 155-160 (1999) |
40 | Yoshihide Igarashi, Yasuaki Nishitani: Speedup of the n-Process Mutual Exclusion Algorithm. Parallel Processing Letters 9(4): 475-485 (1999) | |
1998 | ||
39 | EE | Feng Bao, Yoshihide Igarashi, Sabine R. Öhring: Reliable broadcasting in product networks. Discrete Applied Mathematics 83(1-3): 3-20 (1998) |
1997 | ||
38 | Yukihiro Iwasaki, Yuka Kajiwara, Koji Obokata, Yoshihide Igarashi: Independent Spanning Trees of Chordal Rings. COCOON 1997: 431-440 | |
37 | EE | Feng Bao, Yutaka Funyu, Yukihiro Hamada, Yoshihide Igarashi: Reliable broadcasting and secure distributing in channel networks. ISPAN 1997: 472-478 |
36 | Feng Bao, Robert H. Deng, Xiang Gao, Yoshihide Igarashi: Modified Finite Automata Public Key Cryptosystem. ISW 1997: 82-95 | |
35 | EE | Feng Bao, Aohan Mei, Yoshihide Igarashi: Average Competitive Ratios of On-Line Spanning Trees. Inf. Process. Lett. 62(4): 213-216 (1997) |
1996 | ||
34 | Tetsuo Asano, Yoshihide Igarashi, Hiroshi Nagamochi, Satoru Miyano, Subhash Suri: Algorithms and Computation, 7th International Symposium, ISAAC '96, Osaka, Japan, December 16-18, 1996, Proceedings Springer 1996 | |
33 | Yukihiro Hamada, Aohan Mei, Feng Bao, Yoshihide Igarashi: Broadcasting in Star Graphs with Byzantine Failures. ASIAN 1996: 162-171 | |
32 | Feng Bao, Yoshihide Igarashi: Reliable Broadcasting in Product Networks with Byzantine Faults. FTCS 1996: 262-271 | |
31 | Aohan Mei, Yoshihide Igarashi, Naoki Shimizu: Efficient Broadcasting on Faulty Star Networks. FTRTFT 1996: 298-305 | |
30 | Yukihiro Hamada, Feng Bao, Aohan Mei, Yoshihide Igarashi: Fault-tolerant File Transmission by Information Dispersal Algorithm in Rotator Graphs. ICDCS 1996: 19-25 | |
29 | Aohan Mei, Feng Bao, Yukihiro Hamada, Yoshihide Igarashi: Optimal Time Broadcasting in Faulty Star Networks. WDAG 1996: 175-190 | |
28 | Koji Obokata, Yukihiro Iwasaki, Feng Bao, Yoshihide Igarashi: Independent Spanning Trees of Product Graphs. WG 1996: 338-351 | |
27 | EE | Koji Obokata, Yasuaki Nishitani, Yoshihide Igarashi: A Probably Optimal Embedding of Hyper-Rings in Hypercubes. Inf. Process. Lett. 58(3): 117-122 (1996) |
1995 | ||
26 | Feng Bao, Yoshihide Igarashi: Break Finite Automata Public Key Cryptosystem. ICALP 1995: 147-158 | |
25 | Yukihiro Hamada, Aohan Mei, Yasuaki Nishitani, Yoshihide Igarashi: Embeddings of Hyper-Rings in Hypercubes. ISAAC 1995: 312-321 | |
24 | Feng Bao, Yoshihide Igarashi, Keiko Katano: Broadcasting in Hypercubes with Randomly Distributed Byzantine Faults. WDAG 1995: 215-229 | |
23 | Tom Altman, Yoshihide Igarashi, Koji Obokata: Hyper-Ring Connection Machines. Parallel Computing 21(8): 1327-1338 (1995) | |
1994 | ||
22 | Aohan Mei, Yoshihide Igarashi: Efficient Strategies for Robot Navigation in Unknown Environment. ICALP 1994: 630-641 | |
21 | Feng Bao, Yoshihide Igarashi: A Randomized Algorithm to Finite Automata Public Key Cryptosystem. ISAAC 1994: 678-686 | |
20 | Yoshihide Igarashi, Shingo Osawa, Walter Unger: Automorphisms of Broadcasting Schemes with Respect to Start Rounds. Inf. Process. Lett. 51(1): 35-41 (1994) | |
19 | Aohan Mei, Yoshihide Igarashi: An Efficient Strategy for Robot Navigation in Unknown Environment. Inf. Process. Lett. 52(1): 51-56 (1994) | |
18 | Yijie Han, Yoshihide Igarashi, Kumiko Kanai, Kinya Miura: Broadcasting in Faulty Binary Jumping Networks. J. Parallel Distrib. Comput. 23(3): 462-467 (1994) | |
1993 | ||
17 | Yijie Han, Yoshihide Igarashi: Efficient Parallel Shortest Path Algorithms for Banded Matrices. ICPP 1993: 223-226 | |
1992 | ||
16 | Yijie Han, Yoshihide Igarashi, Kumiko Kanai, Kinya Miura: Fault-Tolerant Broadcasting in Binary Jumping Networks. ISAAC 1992: 145-154 | |
15 | EE | Yijie Han, Yoshihide Igarashi, Miroslaw Truszczynski: Indexing functions and time lower bounds for sorting on a mesh-connected computer. Discrete Applied Mathematics 36(2): 141-152 (1992) |
14 | EE | Yoshihide Igarashi, Shingo Osawa, Yukio Shibata: Some language families generated by one-letter languages. Inf. Sci. 62(3): 271-276 (1992) |
1990 | ||
13 | Yijie Han, Yoshihide Igarashi: Derandomization by Exploiting Redundancy and Mutual Independence. SIGAL International Symposium on Algorithms 1990: 328-337 | |
12 | Yijie Han, Yoshihide Igarashi: Time Lower Bounds for Sorting on Multi-Dimensional Mesh-Connected Processor Arrays. Inf. Process. Lett. 33(5): 233-238 (1990) | |
1989 | ||
11 | Yijie Han, Yoshihide Igarashi: Time Lower Bounds for Parallel Sorting on a Mesh-Conected Processor Array. Acta Inf. 26(7): 643-655 (1989) | |
1988 | ||
10 | Yijie Han, Yoshihide Igarashi: Time Lower Bounds for Parallel Sorting on a Mesh-Connected Processor Array. AWOC 1988: 434-443 | |
1987 | ||
9 | Kazuhiro Sado, Yoshihide Igarashi: A Function for Evaluating the Computing Time of a Bubbling System. Theor. Comput. Sci. 54: 315-324 (1987) | |
1986 | ||
8 | Kazuhiro Sado, Yoshihide Igarashi: Some Parallel Sorts on a Mesh-Connected Processor Array and Their Time Efficiency. J. Parallel Distrib. Comput. 3(3): 398-410 (1986) | |
1985 | ||
7 | Yoshihide Igarashi: A Pumping Lemma for Real-Time Deterministic Context-Free Languages. Theor. Comput. Sci. 36: 89-97 (1985) | |
1978 | ||
6 | Yoshihide Igarashi: Tape Bounds for Some Subclasses of Deterministic Context-Free Languages Information and Control 37(3): 321-333 (1978) | |
1977 | ||
5 | Yoshihide Igarashi: General Properties of Derivational Complexity Acta Inf. 8: 267-283 (1977) | |
4 | Yoshihide Igarashi: The Tape Complexity of Some Classes of Szilard Languages. SIAM J. Comput. 6(3): 460-466 (1977) | |
1975 | ||
3 | Yoshihide Igarashi, Namio Honda: Erratum: On the Extension of Gladkij's Theorem and the Hierarchies of Languages. J. Comput. Syst. Sci. 11(3): 397 (1975) | |
1974 | ||
2 | Yoshihide Igarashi, Namio Honda: Deterministic Multitape Automata Computations. J. Comput. Syst. Sci. 8(2): 167-189 (1974) | |
1973 | ||
1 | Yoshihide Igarashi, Namio Honda: On the Extension of Gladkij's Theorem and the Hierarchies of Languages. J. Comput. Syst. Sci. 7(2): 199-217 (1973) |