| 2004 | ||
|---|---|---|
| j38 | Masafumi Yamashita, Ichiro Suzuki, Tiko Kameda: Searching a polygonal region by a group of stationary k-searchers. Inf. Process. Lett. 92(1): 1-8 (2004) | |
| 2002 | ||
| j37 | Kazuhisa Makino, Masafumi Yamashita, Tiko Kameda: Max- and Min-Neighborhood Monopolies. Algorithmica 34(3): 240-260 (2002) | |
| 2001 | ||
| j36 | Ichiro Suzuki, Yuichi Tazoe, Masafumi Yamashita, Tiko Kameda: Searching a Polygonal Region from the Boundary. Int. J. Comput. Geometry Appl. 11(5): 529-553 (2001) | |
| j35 | Kazuhisa Makino, Tiko Kameda: Transformations on Regular Nondominated Coteries and Their Applications. SIAM J. Discrete Math. 14(3): 381-407 (2001) | |
| 2000 | ||
| j34 | Satoshi Fujita, Masafumi Yamashita, Tiko Kameda: A Study on r-Configurations - A Resource Assignment Problem on Graphs. SIAM J. Discrete Math. 13(2): 227-254 (2000) | |
| c23 | Kazuhisa Makino, Tiko Kameda: Efficient generation of all regular non-dominated coteries. PODC 2000: 279-288 | |
| c22 | Tiko Kameda, Feng Xiao, Malika Mahoui-Guerni: Average probe complexity of non-dominated coteries (brief announcement). PODC 2000: 340 | |
| c21 | Kazuhisa Makino, Masafumi Yamashita, Tiko Kameda: Max- and Min-Neighborhood Monopolies. SWAT 2000: 513-526 | |
| 1998 | ||
| j33 | Xiaotie Deng, Tiko Kameda, Christos H. Papadimitriou: How to Learn an Unknown Environment I: The Rectilinear Case. J. ACM 45(2): 215-245 (1998) | |
| 1997 | ||
| c20 | ||
| c19 | Toshihide Ibaraki, Tiko Kameda: Multi-frame Isochronous Service for ATM Networks: Stop-and-Go Revisited. ICCCN 1997: 4-10 | |
| 1996 | ||
| j32 | Masafumi Yamashita, Tiko Kameda: Computing Functions on Asynchronous Anonymous Networks. Mathematical Systems Theory 29(4): 331-356 (1996) | |
| c18 | ||
| 1995 | ||
| j31 | Amotz Bar-Noy, Xiaotie Deng, Juan A. Garay, Tiko Kameda: Optimal Amortized Distributed Consensus. Inf. Comput. 120(1): 93-100 (1995) | |
| c17 | Satoshi Fujita, Tiko Kameda, Masafumi Yamashita: A Resource Assignment Problem on Graphs. ISAAC 1995: 418-427 | |
| 1994 | ||
| j30 | Slawomir Pilarski, André Ivanov, Tiko Kameda: On minimizing aliasing in scan-based compaction. J. Electronic Testing 5(1): 83-90 (1994) | |
| c16 | Vincent T. Y. Ng, Tiko Kameda: The R-Link Tree: A Recoverable Index Structure for Spatial Data. DEXA 1994: 163-172 | |
| 1993 | ||
| j29 | Slawomir Pilarski, Tiko Kameda: Simple Bounds on the Convergence Rate of an Ergodic Markov Chain. Inf. Process. Lett. 45(2): 81-87 (1993) | |
| j28 | Dominique de Werra, Pavol Hell, Tiko Kameda, Naoki Katoh, Ph. Solot, Masafumi Yamashita: Graph endpoint coloring and distributed processing. Networks 23(2): 93-98 (1993) | |
| j27 | Tiko Kameda, Slawomir Pilarski, André Ivanov: Notes on Multiple Input Signature Analysis. IEEE Trans. Computers 42(2): 228-234 (1993) | |
| j26 | Slawomir Pilarski, Tiko Kameda, André Ivanov: Sequential faults and aliasing. IEEE Trans. on CAD of Integrated Circuits and Systems 12(7): 1068-1074 (1993) | |
| j25 | Toshihide Ibaraki, Tiko Kameda: A Theory of Coteries: Mutual Exclusion in Distributed Systems. IEEE Trans. Parallel Distrib. Syst. 4(7): 779-794 (1993) | |
| c15 | ||
| 1992 | ||
| j24 | Naoki Katoh, Toshihide Ibaraki, Tiko Kameda: A Multiversion Cautious Scheduler with Dynamic Serialization Constraints for Database Concurrency Control. Discrete Applied Mathematics 40(4): 379-395 (1992) | |
| j23 | Eduard Moser, Tiko Kameda: Bounds on the number of hidden units of boltzmann machines. Neural Networks 5(6): 911-921 (1992) | |
| j22 | Slawomir Pilarski, Andrzej Krasniewski, Tiko Kameda: Estimating testing effectiveness of the circular self-test path technique. IEEE Trans. on CAD of Integrated Circuits and Systems 11(10): 1301-1316 (1992) | |
| j21 | Slawomir Pilarski, Tiko Kameda: Checkpointing for Distributed Databases: Starting from the Basics. IEEE Trans. Parallel Distrib. Syst. 3(5): 602-610 (1992) | |
| c14 | Toshihide Ibaraki, Hiroshi Nagamochi, Tiko Kameda: Optimal Coteries for Rings and Related Networks. ICDCS 1992: 650-656 | |
| 1991 | ||
| c13 | Xiaotie Deng, Tiko Kameda, Christos H. Papadimitriou: How to Learn an Unknown Environment (Extended Abstract). FOCS 1991: 298-303 | |
| c12 | ||
| c11 | Amotz Bar-Noy, Xiaotie Deng, Juan A. Garay, Tiko Kameda: Optimal Amortized Distributed Consensus (Extended Abstract). WDAG 1991: 95-107 | |
| 1990 | ||
| j20 | Toshihide Ibaraki, Tiko Kameda, Naoki Katoh: Multiversion Cautious Schedulers for Database Concurrency Control. IEEE Trans. Software Eng. 16(3): 302-315 (1990) | |
| c10 | Slawomir Pilarski, Tiko Kameda: A Novel Checkpointing Scheme for Distributed Database Systems. PODS 1990: 368-378 | |
| 1989 | ||
| c9 | Ada Wai-Chee Fu, Tiko Kameda: Concurrency Control of Nested Transactions Accessing B-Trees. PODS 1989: 270-285 | |
| c8 | Masafumi Yamashita, Tiko Kameda: Electing a Leader when Processor Identity Numbers are not Distinct (Extended Abstract). WDAG 1989: 303-314 | |
| 1988 | ||
| j19 | Toshihide Ibaraki, Tiko Kameda, Naoki Katoh: Cautious Transaction Schedulers for Database Concurrency Control. IEEE Trans. Software Eng. 14(7): 997-1009 (1988) | |
| c7 | ||
| 1987 | ||
| j18 | Naoki Katoh, Tiko Kameda, Toshihide Ibaraki: A Cautious Scheduler for Multistep Transactions. Algorithmica 2: 1-26 (1987) | |
| j17 | Hussein M. Abdel-Wahab, Tiko Kameda: File space utilization in database conversion. Computers & OR 14(2): 107-115 (1987) | |
| j16 | Toshihide Ibaraki, Tiko Kameda, Toshimi Minoura: Serializability with Constraints. ACM Trans. Database Syst. 12(3): 429-452 (1987) | |
| 1986 | ||
| j15 | David Wai-Lok Cheung, Tiko Kameda: Site Optimal termination Protocols for a Distributed Database under Network Partitioning. Operating Systems Review 20(3): 17-27 (1986) | |
| 1985 | ||
| j14 | Naoki Katoh, Toshihide Ibaraki, Tiko Kameda: Cautious Transaction Schedulers with Admission Control. ACM Trans. Database Syst. 10(2): 205-229 (1985) | |
| c6 | David Wai-Lok Cheung, Tiko Kameda: Site Optimal Termination Protocols for a Distributed Database under Network Partitioning. PODC 1985: 111-121 | |
| 1984 | ||
| j13 | Shojiro Muro, Tiko Kameda, Toshimi Minoura: Multi-version Concurrency Control Scheme for a Database System. J. Comput. Syst. Sci. 29(2): 207-224 (1984) | |
| j12 | Toshihide Ibaraki, Tiko Kameda: On the Optimal Nesting Order for Computing N-Relational Joins. ACM Trans. Database Syst. 9(3): 482-502 (1984) | |
| e1 | Tiko Kameda, Jayadev Misra, Joseph G. Peters, Nicola Santoro (Eds.): Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, Vancouver, B. C., Canada, August 27-29, 1984. ACM 1984, isbn 0-89791-143-1 | |
| 1983 | ||
| j11 | Toshihide Ibaraki, Hussein M. Abdel-Wahab, Tiko Kameda: Design of Minimum-Cost Deadlock-Free Systems. J. ACM 30(4): 736-751 (1983) | |
| c5 | Toshihide Ibaraki, Tiko Kameda, Toshimi Minoura: Disjoint-Interval Topological Sort: A Useful Concept in Serializability Theory (Extended Abstract). VLDB 1983: 89-91 | |
| 1981 | ||
| j10 | Tok Wang Ling, Frank Wm. Tompa, Tiko Kameda: An Improved Third Normal Form for Relational Databases. ACM Trans. Database Syst. 6(2): 329-346 (1981) | |
| 1980 | ||
| j9 | ||
| 1977 | ||
| j8 | Tiko Kameda, E. Sadeh: Bounds on the Number of Fuzzy Functions. Information and Control 35(2): 139-145 (1977) | |
| c4 | Tiko Kameda, Hussein M. Abdel-Wahab: Optimal Code Generation for Machines with Different Types of Instructions. IFIP Congress 1977: 129-132 | |
| c3 | Tiko Kameda: A polynomial-time test for the deadlock-freedom of computer systems. Theoretical Computer Science 1977: 282-291 | |
| 1975 | ||
| j7 | Tiko Kameda, S. Toida, F. J. Allan: A Diagnosing Algorithm for Networks. Information and Control 29(2): 141-148 (1975) | |
| j6 | Tiko Kameda: On the Vector Representation of the Reachability in Planar Directed Graphs. Inf. Process. Lett. 3(3): 75-77 (1975) | |
| j5 | F. J. Allan, Tiko Kameda, S. Toida: An Approach to the Diagnosability Analysis of a System. IEEE Trans. Computers 24(10): 1040-1042 (1975) | |
| 1973 | ||
| c2 | Tiko Kameda, S. Toida: Efficient Algorithms for Determining an Extremal Tree of a Graph (Extended Abstract). SWAT (FOCS) 1973: 12-15 | |
| 1972 | ||
| j4 | ||
| 1970 | ||
| j3 | Tiko Kameda, Roland Vollmar: Note on Tape Reversal Complexity of Languages. Information and Control 17(2): 203-215 (1970) | |
| c1 | Tiko Kameda: On the Computational Power of Some Machines with Pushdown-Like Storage. SWAT (FOCS) 1970: 72 | |
| 1968 | ||
| j2 | Tiko Kameda: Generalized Transition Matrix of a Sequential Machine and Its Applications. Information and Control 12(3): 259-275 (1968) | |
| j1 | Tiko Kameda: Erratum: ``Generalized Transition Matrix of a Sequential Machine and Its Applications''. Information and Control 13(4): 401 (1968) | |
Colors in the list of coauthors
Last update Mon May 20 18:55:15 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page