Information and Systems-Theoretical Foundations of Computing(Date:2000/11/27)

Presentation
表紙

,  

[Date]2000/11/27
[Paper #]
目次

,  

[Date]2000/11/27
[Paper #]
Automaton Models equivalent to Linear Indexed Grammars

Ikuo KAWAHARADA,  Takumi KASAI,  

[Date]2000/11/27
[Paper #]COMP2000-57
Equivalence test of bounded width OBDD

Masakazu Ichimura,  Yasuhiko Takenaga,  

[Date]2000/11/27
[Paper #]COMP2000-58
Optimal Winner Determination Algorithms for E-procurement Auction

Hisashi Kashima,  Yasumasa Kajinaga,  

[Date]2000/11/27
[Paper #]COMP2000-59
Randomized Leader Election Protocols in Radio Networks with No Collision Detection

Koji Nakano,  Stephan Olariu,  

[Date]2000/11/27
[Paper #]COMP2000-60
Counting Graph Isomorphisms among Chordal Graphs with restricted clique number.

Takayuki NAGOYA,  

[Date]2000/11/27
[Paper #]COMP2000-61
On the Length of the Monopolist Game

Kazuyuki Amano,  Paul Vitanyi,  Osamu Watanabe,  

[Date]2000/11/27
[Paper #]COMP2000-62
Uniform Treatment of Pseudorandomness within Public-Key Encryption Schemes

Takeshi Koshiba,  

[Date]2000/11/27
[Paper #]COMP2000-63
[OTHERS]

,  

[Date]2000/11/27
[Paper #]