Information and Systems-Theoretical Foundations of Computing(Date:2004/05/13)

Presentation
表紙

,  

[Date]2004/5/13
[Paper #]
目次

,  

[Date]2004/5/13
[Paper #]
Improved Algorithms for Constructing Compressed Suffix Arrays

Wing-Kai RON,  Kunihiko SADAKANE,  Wing-Kin SUNG,  

[Date]2004/5/13
[Paper #]COMP2004-9
Analysis for LRU caching with invalidation and timeout

Ryo HIRADE,  Toshiyuki HAMA,  

[Date]2004/5/13
[Paper #]COMP2004-10
An Approximate Analysis of Markov Processes and Its Application to Analysis of Randomized Algorithms

Osamu WATANABE,  Johannes SQHNEIDER,  

[Date]2004/5/13
[Paper #]COMP2004-11
Three-way two-dimensional deterministic finite automata with rotated inputs

Hisao HIRAKAWA,  Katsushi INOUE,  Akira ITO,  

[Date]2004/5/13
[Paper #]COMP2004-12
Three-way two-dimensional alternating finite automata with rotated inputs

Hisao HIRAKAWA,  Katsushi INOUE,  Akira ITO,  

[Date]2004/5/13
[Paper #]COMP2004-13
Sublogarithmically space-bounded one-pebble alternating Turing machines with only universal states

Atsuyuki INOUE,  Akira ITO,  Katsushi INOUE,  

[Date]2004/5/13
[Paper #]COMP2004-14
One Edge Addition to a Complete Binary Tree Maximizing Total Shortening Path Length

Kiyoshi SAWADA,  

[Date]2004/5/13
[Paper #]COMP2004-15
Longest Paths in Small Graph Classes

Ryuhei UEHARA,  Yushi UNO,  

[Date]2004/5/13
[Paper #]COMP2004-16
Non-LP orientations, non-line shellings, and non-representable oriented matroids

Komei FUKUDA,  Sonoko MORIYAMA,  Yoshio OKAMOTO,  

[Date]2004/5/13
[Paper #]COMP2004-17
複写される方へ

,  

[Date]2004/5/13
[Paper #]
奥付

,  

[Date]2004/5/13
[Paper #]