Generalized Transition Matrix of a Sequential Machine and Its Applications - Tiko Kameda (Inf. Control., 1968)

Erratum: "Generalized Transition Matrix of a Sequential Machine and Its Applications" - Tiko Kameda (Inf. Control., 1968)

On the Computational Power of Some Machines with Pushdown-Like Storage - Tiko Kameda (SWAT, 1970)

Note on Tape Reversal Complexity of Languages - Tiko Kameda; Roland Vollmar (Inf. Control., 1970)

Pushdown Automata with Counters. - Tiko Kameda (J. Comput. Syst. Sci., 1972)

Einführung in die Codierungstheorie I. - Tiko Kameda; Klaus Weihrauch (BI-Wissenschaftsverlag, 1973)

Efficient Algorithms for Determining an Extremal Tree of a Graph (Extended Abstract) - Tiko Kameda; Shunichi Toida (SWAT, 1973)

A O(|V|*|E|) algorithm for maximum matching of graphs. - Tiko Kameda; J. Ian Munro (Computing, 1974)

On the Vector Representation of the Reachability in Planar Directed Graphs. - Tiko Kameda (Inf. Process. Lett., 1975)

An Approach to the Diagnosability Analysis of a System. - F. J. Allan; Tiko Kameda; Shunichi Toida (IEEE Trans. Computers, 1975)

A Diagnosing Algorithm for Networks - Tiko Kameda; Shunichi Toida; F. J. Allan (Inf. Control., 1975)

On maximally distant spanning trees of a graph. - Tiko Kameda (Computing, 1976)

Optimal Code Generation for Machines with Different Types of Instructions. - Tiko Kameda; Hussein M. Abdel-Wahab (IFIP Congress, 1977)

A polynomial-time test for the deadlock-freedom of computer systems. - Tiko Kameda (Theoretical Computer Science, 1977)

Bounds on the Number of Fuzzy Functions - Tiko Kameda; Eitan Sadeh (Inf. Control., 1977)

Scheduling to Minimize Maximum Cumulative Cost Subject to Series-Parallel Precedence Constraints. - Hussein M. Abdel-Wahab; Tiko Kameda (Oper. Res., 1978)

On strictly optimal schedules for the cumulative cost-optimal scheduling problem. - Hussein M. Abdel-Wahab; Tiko Kameda (Computing, 1980)

Testing Deadlock-Freedom of Computer Systems. - Tiko Kameda (J. ACM, 1980)

An Improved Third Normal Form for Relational Databases. - Tok Wang Ling; Frank Wm. Tompa; Tiko Kameda (ACM Trans. Database Syst., 1981)

Disjoint-Interval Topological Sort: A Useful Concept in Serializability Theory (Extended Abstract). - Toshihide Ibaraki; Tiko Kameda; Toshimi Minoura (VLDB, 1983)

Design of Minimum-Cost Deadlock-Free Systems - Toshihide Ibaraki; Hussein M. Abdel-Wahab; Tiko Kameda (J. ACM, 1983)

Multi-version Concurrency Control Scheme for a Database System. - Shojiro Muro; Tiko Kameda; Toshimi Minoura (J. Comput. Syst. Sci., 1984)

On the Optimal Nesting Order for Computing N-Relational Joins. - Toshihide Ibaraki; Tiko Kameda (ACM Trans. Database Syst., 1984)

Cautious Transaction Schedulers with Admission Control. - Naoki Katoh; Toshihide Ibaraki; Tiko Kameda (ACM Trans. Database Syst., 1985)

Site Optimal termination Protocols for a Distributed Database under Network Partitioning. - David Wai-Lok Cheung; Tiko Kameda (ACM SIGOPS Oper. Syst. Rev., 1986)

A Cautious Scheduler for Multistep Transactions. - Naoki Katoh; Tiko Kameda; Toshihide Ibaraki (Algorithmica, 1987)

File space utilization in database conversion. - Hussein M. Abdel-Wahab; Tiko Kameda (Comput. Oper. Res., 1987)

Serializability with Constraints. - Toshihide Ibaraki; Tiko Kameda; Toshimi Minoura (ACM Trans. Database Syst., 1987)

Computing on an Anonymous Network. - Masafumi Yamashita; Tiko Kameda (PODC, 1988)

Cautious Transaction Schedulers for Database Concurrency Control. - Toshihide Ibaraki; Tiko Kameda; Naoki Katoh (IEEE Trans. Software Eng., 1988)

Concurrency Control of Nested Transactions Accessing B-Trees. - Ada Wai-Chee Fu; Tiko Kameda (PODS, 1989)

Electing a Leader when Processor Identity Numbers are not Distinct (Extended Abstract). - Masafumi Yamashita; Tiko Kameda (WDAG, 1989)

A Novel Checkpointing Scheme for Distributed Database Systems. - Slawomir Pilarski; Tiko Kameda (PODS, 1990)

Multiversion Cautious Schedulers for Database Concurrency Control. - Toshihide Ibaraki; Tiko Kameda; Naoki Katoh (IEEE Trans. Software Eng., 1990)

How to Learn an Unknown Environment (Extended Abstract) - Xiaotie Deng; Tiko Kameda; Christos H. Papadimitriou (FOCS, 1991)

Boolean theory of coteries. - Toshihide Ibaraki; Tiko Kameda (SPDP, 1991)

Optimal Amortized Distributed Consensus (Extended Abstract). - Amotz Bar-Noy; Xiaotie Deng; Juan A. Garay; Tiko Kameda (WDAG, 1991)

Optimal Coteries for Rings and Related Networks. - Toshihide Ibaraki; Hiroshi Nagamochi; Tiko Kameda (ICDCS, 1992)

A Multiversion Cautious Scheduler with Dynamic Serialization Constraints for Database Concurrency Control. - Naoki Katoh; Toshihide Ibaraki; Tiko Kameda (Discret. Appl. Math., 1992)

Bounds on the number of hidden units of boltzmann machines. - Eduard Moser; Tiko Kameda (Neural Networks, 1992)

Estimating testing effectiveness of the circular self-test path technique. - Slawomir Pilarski; Andrzej Krasniewski; Tiko Kameda (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1992)

Checkpointing for Distributed Databases: Starting from the Basics. - Slawomir Pilarski; Tiko Kameda (IEEE Trans. Parallel Distributed Syst., 1992)

Concurrent Access to R-Trees. - Vincent Ng 002; Tiko Kameda (SSD, 1993)

Simple Bounds on the Convergence Rate of an Ergodic Markov Chain. - Slawomir Pilarski; Tiko Kameda (Inf. Process. Lett., 1993)

Graph endpoint coloring and distributed processing. - Dominique de Werra; Pavol Hell; Tiko Kameda; Naoki Katoh; Ph. Solot; Masafumi Yamashita (Networks, 1993)

Notes on Multiple Input Signature Analysis. - Tiko Kameda; Slawomir Pilarski; André Ivanov (IEEE Trans. Computers, 1993)

Sequential faults and aliasing. - Slawomir Pilarski; Tiko Kameda; André Ivanov (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1993)

A Theory of Coteries: Mutual Exclusion in Distributed Systems. - Toshihide Ibaraki; Tiko Kameda (IEEE Trans. Parallel Distributed Syst., 1993)

The R-Link Tree: A Recoverable Index Structure for Spatial Data. - Vincent Ng 002; Tiko Kameda (DEXA, 1994)

On minimizing aliasing in scan-based compaction. - Slawomir Pilarski; André Ivanov; Tiko Kameda (J. Electron. Test., 1994)

A Resource Assignment Problem on Graphs. - Satoshi Fujita; Tiko Kameda; Masafumi Yamashita (ISAAC, 1995)

Optimal Amortized Distributed Consensus - Amotz Bar-Noy; Xiaotie Deng; Juan A. Garay; Tiko Kameda (Inf. Comput., 1995)

Quad-B Tree for Point Data. - Vincent T. Y. Ng; Tiko Kameda (CODAS, 1996)

Computing Functions on Asynchronous Anonymous Networks. - Masafumi Yamashita; Tiko Kameda (Math. Syst. Theory, 1996)

Concurrent access to point data. - Vincent Ng 002; Tiko Kameda (COMPSAC, 1997)

Multi-frame Isochronous Service for ATM Networks: Stop-and-Go Revisited. - Toshihide Ibaraki; Tiko Kameda (ICCCN, 1997)

How to Learn an Unknown Environment I: The Rectilinear Case. - Xiaotie Deng; Tiko Kameda; Christos H. Papadimitriou (J. ACM, 1998)

Average probe complexity of non-dominated coteries (brief announcement). - Tiko Kameda; Feng Xiao; Malika Mahoui-Guerni (PODC, 2000)

Efficient generation of all regular non-dominated coteries. - Kazuhisa Makino; Tiko Kameda (PODC, 2000)

A Study on r-Configurations - A Resource Assignment Problem on Graphs. - Satoshi Fujita; Masafumi Yamashita; Tiko Kameda (SIAM J. Discret. Math., 2000)

Searching a Polygonal Region from the Boundary. - Ichiro Suzuki; Yuichi Tazoe; Masafumi Yamashita; Tiko Kameda (Int. J. Comput. Geom. Appl., 2001)

Transformations on Regular Nondominated Coteries and Their Applications. - Kazuhisa Makino; Tiko Kameda (SIAM J. Discret. Math., 2001)

Max- and Min-Neighborhood Monopolies. - Kazuhisa Makino; Masafumi Yamashita; Tiko Kameda (Algorithmica, 2002)

Searching a polygonal region by a group of stationary k-searchers. - Masafumi Yamashita; Ichiro Suzuki; Tiko Kameda (Inf. Process. Lett., 2004)