書誌情報	ファイル
表紙・目次    (2001-05)   数理解析研究所講究録, 1205
An Extended Depth-first Search : How to Decrease Backtracking (New Developments of Theory of Computation and Algorithms)   Kiniwa, Jun (2001-05)   数理解析研究所講究録, 1205: 1-6
A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraphs (New Developments of Theory of Computation and Algorithms)   Zhao, Liang; Nagamochi, Hiroshi; Ibaraki, Toshihide (2001-05)   数理解析研究所講究録, 1205: 7-12
Necessary and Sufficient Numbers of Cards for Sharing Secret Keys on Hierarchical Groups (New Developments of Theory of Computation and Algorithms)   Mizuki, Takaaki; Nishizeki, Takao (2001-05)   数理解析研究所講究録, 1205: 13-18
On the Power of Cooperating Systems of One-way Hybrid Finite Automata (New Developments of Theory of Computation and Algorithms)   Wang, Yue; Inoue, Katsushi; Ito, Akira; Okazaki, Tokio (2001-05)   数理解析研究所講究録, 1205: 19-24
定数幅量子ブランチングプログラムの計算能力 (計算理論とアルゴリズムの新展開)   中西, 正樹; 浜口, 清治; 柏原, 敏伸 (2001-05)   数理解析研究所講究録, 1205: 25-30
Number conservingなセル空間での自己増殖 (計算理論とアルゴリズムの新展開)   藤田, 研二; 森田, 憲一; 岩本, 宙造; 今井, 克暢 (2001-05)   数理解析研究所講究録, 1205: 31-36
A parallel algorithm for finding all hinge vertices of a trapezoid graph (New Developments of Theory of Computation and Algorithms)   Honma, Hirotoshi; Masuyama, Shigeru (2001-05)   数理解析研究所講究録, 1205: 37-42
Application of Attribute edNCE Graph Grammars to Syntactic Editing of Tabular Forms (New Developments of Theory of Computation and Algorithms)   Tomiyama, Kiyonobu; Arita, Tomokazu; Tsuchida, Kensei; Yaku, Takeo (2001-05)   数理解析研究所講究録, 1205: 43-46
ジャンケンの計算量 (計算理論とアルゴリズムの新展開)   伊藤, 暁; 井上, 克司; 王, 躍; 岡崎, 世雄 (2001-05)   数理解析研究所講究録, 1205: 47-52
量子公開鍵暗号とその改良 (計算理論とアルゴリズムの新展開)   Tanaka, Keisuke; Okamoto, Tatsuaki (2001-05)   数理解析研究所講究録, 1205: 53-58
Lockout Avoidance Algorithms without Using Time-Stamps for the $k$-Exclusion Problem (New Developments of Theory of Computation and Algorithms)   Omori, Michiko; Obokata, Kumiko; Igarashi, Yoshihide (2001-05)   数理解析研究所講究録, 1205: 59-64
Pre-checkingを用いた効率的2階述語マッチングアルゴリズム (計算理論とアルゴリズムの新展開)   久保, 憲吾; 山田, 敬三; 平田, 耕一; 原尾, 政輝 (2001-05)   数理解析研究所講究録, 1205: 65-70
Discovery of Maximally Frequent Tag Tree Patterns in Semistructured Data (New Developments of Theory of Computation and Algorithms)   Miyahara, Tetsuhiro; Shoudai, Takayoshi; Uchida, Tomoyuki (2001-05)   数理解析研究所講究録, 1205: 71-76
Simulation of One-Dimensional Cellular Automata by Uniquely Parallel Parsable Grammars (New Developments of Theory of Computation and Algorithms)   Lee, Jia; Imai, Katsunobu; Morita, Kenichi (2001-05)   数理解析研究所講究録, 1205: 77-82
Tree-Shellable論理関数の判定の複雑さ (計算理論とアルゴリズムの新展開)   門野, 伸史; 武永, 康彦 (2001-05)   数理解析研究所講究録, 1205: 83-88
A polynomial time approximation scheme for the minimum maximal matching problem in planar graphs (New Developments of Theory of Computation and Algorithms)   Nagamochi, Hiroshi; Nishida, Yukihiro; Ibaraki, Toshihide (2001-05)   数理解析研究所講究録, 1205: 89-94
An Improved Randomized Algorithm for 3-SAT (New Developments of Theory of Computation and Algorithms)   Schuler, Rainer; Schoning, Uwe; Watanabe, Oasamu (2001-05)   数理解析研究所講究録, 1205: 95-100
一意解析可能アレイ文法による単連結図形及び単純閉曲線の生成 (計算理論とアルゴリズムの新展開)   斉, 金山; Shauri, Ruhizan Liza Ahmad; 森田, 憲一 (2001-05)   数理解析研究所講究録, 1205: 101-106
A Universal Self-Stabilizing Mutual Exclusion Algorithm (New Developments of Theory of Computation and Algorithms)   Kakugawa, Hirotsugu; Yamashita, Masafumi (2001-05)   数理解析研究所講究録, 1205: 107-112