Information and Systems-Theoretical Foundations of Computing(Date:2013/08/27)

Presentation
表紙

,  

[Date]2013/8/27
[Paper #]
目次

,  

[Date]2013/8/27
[Paper #]
An O(n log n) Algorithm for the Minimax Regret Sink Location Problem in Dynamic Path Networks with the Uniform Capacity

Yuya HIGASHIKAWA,  Mordecai J. GOLIN,  Naoki KATOH,  

[Date]2013/8/27
[Paper #]COMP2013-25
A New UCB-based Algorithm for the Matching-Selection Multi-armed Bandit Problem

Ryo WATANABE,  Atsuyoshi NAKAMURA,  Mineichi KUDO,  

[Date]2013/8/27
[Paper #]COMP2013-26
Oracle Pushdown Automata, Nondeterministic Reducibilities, and the Hierarchy over the Family of Context-Free Languages : (Preliminary Version)

Tomoyuki YAMAKAMI,  

[Date]2013/8/27
[Paper #]COMP2013-27
A Pseudo-Polynomial Algorithm for Mean Payoff Stochastic Games with Perfect Information and a Few Random Positions

Endre BOROS,  Khaled ELBASSIONI,  Vladimir GURVICH,  Kazuhisa MAKINO,  

[Date]2013/8/27
[Paper #]COMP2013-28
Hardness of Classically Simulating Quantum Circuits with Unbounded Toffoli and Fan-Out Gates

Yasuhiro Takahashi,  Takeshi Yamazaki,  Kazuyuki Tanaka,  

[Date]2013/8/27
[Paper #]COMP2013-29
Approximation Algorithms for Bandwidth Consective Multicolorings

Yuji Obata,  Takao Nishizeki,  

[Date]2013/8/27
[Paper #]COMP2013-30
Finding Maximum Regular Induced Subgraphs with Prescribed Degree

Yuihi ASAHIRO,  Takehiro ITO,  Hiroshi ETO,  Eiji MIYANO,  

[Date]2013/8/27
[Paper #]COMP2013-31
複写される方へ

,  

[Date]2013/8/27
[Paper #]
Notice for Photocopying

,  

[Date]2013/8/27
[Paper #]
奥付

,  

[Date]2013/8/27
[Paper #]
裏表紙

,  

[Date]2013/8/27
[Paper #]