- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j9 |      | Ji-Won Huh, Shuji Isobe, Eisuke Koizumi, Hiroki Shizuya: On the Length-Decreasing Self-Reducibility and the Many-One-Like Reducibilities for Partial Multivalued Functions. IEICE Transactions 96-D(3): 465-471 (2013) |
| 2009 | ||
| j8 | | Shingo Hasegawa, Shuji Isobe, Hiroki Shizuya, Katsuhiro Tashiro: On the pseudo-freeness and the CDH assumption. Int. J. Inf. Sec. 8(5): 347-355 (2009) |
| c4 | | Shuji Isobe, Eisuke Koizumi, Yuji Nishigaki, Hiroki Shizuya: On the Complexity of Computing Discrete Logarithms over Algebraic Tori. CANS 2009: 433-442 |
| 2008 | ||
| j7 | | Shingo Hasegawa, Hiroyuki Hatanaka, Shuji Isobe, Eisuke Koizumi, Hiroki Shizuya: Making Cryptographic Primitives Harder. IEICE Transactions 91-A(1): 330-337 (2008) |
| j6 | | Shingo Hasegawa, Shuji Isobe, Hiroki Shizuya: NPMV-Complete Functions That Compute Discrete Logarithms and Integer Factorization. IEICE Transactions 91-A(1): 342-344 (2008) |
| 2007 | ||
| j5 | | Shuji Isobe, Xiao Zhou, Takao Nishizeki: Total Colorings Of Degenerate Graphs. Combinatorica 27(2): 167-182 (2007) |
| j4 | | Shuji Isobe, Wataru Kumagai, Masahiro Mambo, Hiroki Shizuya: Toward Separating Integer Factoring from Discrete Logarithm mod p. IEICE Transactions 90-A(1): 48-53 (2007) |
| 2005 | ||
| j3 | | Shuji Isobe, Tetsuo Kuriyama, Masahiro Mambo, Hiroki Shizuya: On the Polynomial Time Computability of Abstract Ray-Tracing Problems. IEICE Transactions 88-A(5): 1209-1213 (2005) |
| 2004 | ||
| j2 | | Shuji Isobe, Xiao Zhou, Takao Nishizeki: Cost Total Colorings of Trees. IEICE Transactions 87-D(2): 337-342 (2004) |
| 2001 | ||
| c3 | | |
| 1999 | ||
| j1 | | Shuji Isobe, Xiao Zhou, Takao Nishizeki: A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Trees. Int. J. Found. Comput. Sci. 10(2): 171-194 (1999) |
| c2 | | Shuji Isobe, Xiao Zhou, Takao Nishizeki: A Linear Algorithm for Finding Total Colorings of Partial k-Trees. ISAAC 1999: 347-356 |
| 1998 | ||
| c1 | | Shuji Isobe, Xiao Zhou, Takao Nishizeki: A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Trees. WG 1998: 100-113 |
| 1 | Shingo Hasegawa | |
| 2 | Hiroyuki Hatanaka | |
| 3 | Ji-Won Huh | |
| 4 | Eisuke Koizumi | |
| 5 | Wataru Kumagai | |
| 6 | Tetsuo Kuriyama | |
| 7 | Masahiro Mambo | |
| 8 | Yuji Nishigaki | |
| 9 | Takao Nishizeki | |
| 10 | Hiroki Shizuya | |
| 11 | Katsuhiro Tashiro | |
| 12 | Xiao Zhou |
Data released under the ODC-BY 1.0 license — See also our legal information page