Tiko Kameda

Publication Activity (10 Years)

Years Active: 1968-2004
Publications (10 Years): 0

Publications

Masafumi Yamashita, Ichiro Suzuki, Tiko Kameda
-searchers. Inf. Process. Lett. 92 (1) (2004)
Kazuhisa Makino, Masafumi Yamashita, Tiko Kameda
Max- and Min-Neighborhood Monopolies. Algorithmica 34 (3) (2002)
Ichiro Suzuki, Yuichi Tazoe, Masafumi Yamashita, Tiko Kameda
Searching a Polygonal Region from the Boundary. Int. J. Comput. Geom. Appl. 11 (5) (2001)
Kazuhisa Makino, Tiko Kameda
Transformations on Regular Nondominated Coteries and Their Applications. SIAM J. Discret. Math. 14 (3) (2001)
Tiko Kameda, Feng Xiao, Malika Mahoui-Guerni
Average probe complexity of non-dominated coteries (brief announcement). PODC (2000)
Satoshi Fujita, Masafumi Yamashita, Tiko Kameda
-Configurations - A Resource Assignment Problem on Graphs. SIAM J. Discret. Math. 13 (2) (2000)
Kazuhisa Makino, Tiko Kameda
Efficient generation of all regular non-dominated coteries. PODC (2000)
Kazuhisa Makino, Masafumi Yamashita, Tiko Kameda
Max- and Min-Neighborhood Monopolies. SWAT (2000)
Xiaotie Deng, Tiko Kameda, Christos H. Papadimitriou
How to Learn an Unknown Environment I: The Rectilinear Case. J. ACM 45 (2) (1998)
Toshihide Ibaraki, Tiko Kameda
Multi-frame Isochronous Service for ATM Networks: Stop-and-Go Revisited. ICCCN (1997)
Vincent T. Y. Ng, Tiko Kameda
Concurrent access to point data. COMPSAC (1997)
Vincent T. Y. Ng, Tiko Kameda
Quad-B Tree for Point Data. CODAS (1996)
Masafumi Yamashita, Tiko Kameda
Computing Functions on Asynchronous Anonymous Networks. Math. Syst. Theory 29 (4) (1996)
Satoshi Fujita, Tiko Kameda, Masafumi Yamashita
A Resource Assignment Problem on Graphs. ISAAC (1995)
Amotz Bar-Noy, Xiaotie Deng, Juan A. Garay, Tiko Kameda
Optimal Amortized Distributed Consensus Inf. Comput. 120 (1) (1995)
Slawomir Pilarski, André Ivanov, Tiko Kameda
On minimizing aliasing in scan-based compaction. J. Electron. Test. 5 (1) (1994)
Vincent T. Y. Ng, Tiko Kameda
The R-Link Tree: A Recoverable Index Structure for Spatial Data. DEXA (1994)
Toshihide Ibaraki, Tiko Kameda
A Theory of Coteries: Mutual Exclusion in Distributed Systems. IEEE Trans. Parallel Distributed Syst. 4 (7) (1993)
Dominique de Werra, Pavol Hell, Tiko Kameda, Naoki Katoh, Ph. Solot, Masafumi Yamashita
Graph endpoint coloring and distributed processing. Networks 23 (2) (1993)
Vincent T. Y. Ng, Tiko Kameda
Concurrent Access to R-Trees. SSD (1993)
Tiko Kameda, Slawomir Pilarski, André Ivanov
Notes on Multiple Input Signature Analysis. IEEE Trans. Computers 42 (2) (1993)
Slawomir Pilarski, Tiko Kameda
Simple Bounds on the Convergence Rate of an Ergodic Markov Chain. Inf. Process. Lett. 45 (2) (1993)
Slawomir Pilarski, Tiko Kameda, André Ivanov
Sequential faults and aliasing. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 12 (7) (1993)
Toshihide Ibaraki, Hiroshi Nagamochi, Tiko Kameda
Optimal Coteries for Rings and Related Networks. ICDCS (1992)
Slawomir Pilarski, Tiko Kameda
Checkpointing for Distributed Databases: Starting from the Basics. IEEE Trans. Parallel Distributed Syst. 3 (5) (1992)
Slawomir Pilarski, Andrzej Krasniewski, Tiko Kameda
Estimating testing effectiveness of the circular self-test path technique. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 11 (10) (1992)
Eduard Moser, Tiko Kameda
Bounds on the number of hidden units of boltzmann machines. Neural Networks 5 (6) (1992)
Naoki Katoh, Toshihide Ibaraki, Tiko Kameda
A Multiversion Cautious Scheduler with Dynamic Serialization Constraints for Database Concurrency Control. Discret. Appl. Math. 40 (4) (1992)
Toshihide Ibaraki, Tiko Kameda
Boolean theory of coteries. SPDP (1991)
Amotz Bar-Noy, Xiaotie Deng, Juan A. Garay, Tiko Kameda
Optimal Amortized Distributed Consensus (Extended Abstract). WDAG (1991)
Xiaotie Deng, Tiko Kameda, Christos H. Papadimitriou
How to Learn an Unknown Environment (Extended Abstract) FOCS (1991)
Slawomir Pilarski, Tiko Kameda
A Novel Checkpointing Scheme for Distributed Database Systems. PODS (1990)
Toshihide Ibaraki, Tiko Kameda, Naoki Katoh
Multiversion Cautious Schedulers for Database Concurrency Control. IEEE Trans. Software Eng. 16 (3) (1990)
Ada Wai-Chee Fu, Tiko Kameda
Concurrency Control of Nested Transactions Accessing B-Trees. PODS (1989)
Masafumi Yamashita, Tiko Kameda
Electing a Leader when Processor Identity Numbers are not Distinct (Extended Abstract). WDAG (1989)
Masafumi Yamashita, Tiko Kameda
Computing on an Anonymous Network. PODC (1988)
Toshihide Ibaraki, Tiko Kameda, Naoki Katoh
Cautious Transaction Schedulers for Database Concurrency Control. IEEE Trans. Software Eng. 14 (7) (1988)
Naoki Katoh, Tiko Kameda, Toshihide Ibaraki
A Cautious Scheduler for Multistep Transactions. Algorithmica 2 (1987)
Toshihide Ibaraki, Tiko Kameda, Toshimi Minoura
Serializability with Constraints. ACM Trans. Database Syst. 12 (3) (1987)
Hussein M. Abdel-Wahab, Tiko Kameda
File space utilization in database conversion. Comput. Oper. Res. 14 (2) (1987)
David Wai-Lok Cheung, Tiko Kameda
Site Optimal termination Protocols for a Distributed Database under Network Partitioning. ACM SIGOPS Oper. Syst. Rev. 20 (3) (1986)
David Wai-Lok Cheung, Tiko Kameda
Site Optimal Termination Protocols for a Distributed Database under Network Partitioning. PODC (1985)
Naoki Katoh, Toshihide Ibaraki, Tiko Kameda
Cautious Transaction Schedulers with Admission Control. ACM Trans. Database Syst. 10 (2) (1985)
Toshihide Ibaraki, Tiko Kameda
On the Optimal Nesting Order for Computing N-Relational Joins. ACM Trans. Database Syst. 9 (3) (1984)
Shojiro Muro, Tiko Kameda, Toshimi Minoura
Multi-version Concurrency Control Scheme for a Database System. J. Comput. Syst. Sci. 29 (2) (1984)
Toshihide Ibaraki, Hussein M. Abdel-Wahab, Tiko Kameda
Design of Minimum-Cost Deadlock-Free Systems J. ACM 30 (4) (1983)
Toshihide Ibaraki, Tiko Kameda, Toshimi Minoura
Disjoint-Interval Topological Sort: A Useful Concept in Serializability Theory (Extended Abstract). VLDB (1983)
Tok Wang Ling, Frank Wm. Tompa, Tiko Kameda
An Improved Third Normal Form for Relational Databases. ACM Trans. Database Syst. 6 (2) (1981)
Hussein M. Abdel-Wahab, Tiko Kameda
On strictly optimal schedules for the cumulative cost-optimal scheduling problem. Computing 24 (1) (1980)
Tiko Kameda
Testing Deadlock-Freedom of Computer Systems. J. ACM 27 (2) (1980)
Hussein M. Abdel-Wahab, Tiko Kameda
Scheduling to Minimize Maximum Cumulative Cost Subject to Series-Parallel Precedence Constraints. Oper. Res. 26 (1) (1978)
Tiko Kameda, Eitan Sadeh
Bounds on the Number of Fuzzy Functions Inf. Control. 35 (2) (1977)
Tiko Kameda
A polynomial-time test for the deadlock-freedom of computer systems. Theoretical Computer Science (1977)
Tiko Kameda, Hussein M. Abdel-Wahab
Optimal Code Generation for Machines with Different Types of Instructions. IFIP Congress (1977)
Tiko Kameda
On maximally distant spanning trees of a graph. Computing 17 (2) (1976)
Tiko Kameda, Shunichi Toida, F. J. Allan
A Diagnosing Algorithm for Networks Inf. Control. 29 (2) (1975)
F. J. Allan, Tiko Kameda, Shunichi Toida
An Approach to the Diagnosability Analysis of a System. IEEE Trans. Computers 24 (10) (1975)
Tiko Kameda
On the Vector Representation of the Reachability in Planar Directed Graphs. Inf. Process. Lett. 3 (3) (1975)
Tiko Kameda, J. Ian Munro
A O(|V|*|E|) algorithm for maximum matching of graphs. Computing 12 (1) (1974)
Tiko Kameda, Shunichi Toida
Efficient Algorithms for Determining an Extremal Tree of a Graph (Extended Abstract) SWAT (1973)
Tiko Kameda
Pushdown Automata with Counters. J. Comput. Syst. Sci. 6 (2) (1972)
Tiko Kameda, Roland Vollmar
Note on Tape Reversal Complexity of Languages Inf. Control. 17 (2) (1970)
Tiko Kameda
On the Computational Power of Some Machines with Pushdown-Like Storage SWAT (1970)
Tiko Kameda
Erratum: "Generalized Transition Matrix of a Sequential Machine and Its Applications" Inf. Control. 13 (4) (1968)
Tiko Kameda
Generalized Transition Matrix of a Sequential Machine and Its Applications Inf. Control. 12 (3) (1968)