 | 2009 |
|---|
| 11 |       | Shuji Isobe,
Eisuke Koizumi,
Yuji Nishigaki,
Hiroki Shizuya:
On the Complexity of Computing Discrete Logarithms over Algebraic Tori.
CANS 2009: 433-442 |
| 10 | | 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) |
| 2008 |
|---|
| 9 | | Shingo Hasegawa,
Hiroyuki Hatanaka,
Shuji Isobe,
Eisuke Koizumi,
Hiroki Shizuya:
Making Cryptographic Primitives Harder.
IEICE Transactions 91-A(1): 330-337 (2008) |
| 8 | | 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 |
|---|
| 7 | | Shuji Isobe,
Xiao Zhou,
Takao Nishizeki:
Total Colorings Of Degenerate Graphs.
Combinatorica 27(2): 167-182 (2007) |
| 6 | | 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 |
|---|
| 5 | | 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) |
| 2001 |
|---|
| 4 | | Shuji Isobe,
Xiao Zhou,
Takao Nishizeki:
Total Colorings of Degenerated Graphs.
ICALP 2001: 506-517 |
| 1999 |
|---|
| 3 | | Shuji Isobe,
Xiao Zhou,
Takao Nishizeki:
A Linear Algorithm for Finding Total Colorings of Partial k-Trees.
ISAAC 1999: 347-356 |
| 2 |  | 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) |
| 1998 |
|---|
| 1 | | Shuji Isobe,
Xiao Zhou,
Takao Nishizeki:
A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Trees.
WG 1998: 100-113 |
