The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Tiko Kameda: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Toshihide Ibaraki, Tiko Kameda
    On the Optimal Nesting Order for Computing N-Relational Joins. [Citation Graph (29, 15)][DBLP]
    ACM Trans. Database Syst., 1984, v:9, n:3, pp:482-502 [Journal]
  2. Tok Wang Ling, Frank Wm. Tompa, Tiko Kameda
    An Improved Third Normal Form for Relational Databases. [Citation Graph (11, 16)][DBLP]
    ACM Trans. Database Syst., 1981, v:6, n:2, pp:329-346 [Journal]
  3. Shojiro Muro, Tiko Kameda, Toshimi Minoura
    Multi-version Concurrency Control Scheme for a Database System. [Citation Graph (8, 0)][DBLP]
    J. Comput. Syst. Sci., 1984, v:29, n:2, pp:207-224 [Journal]
  4. Ada Wai-Chee Fu, Tiko Kameda
    Concurrency Control of Nested Transactions Accessing B-Trees. [Citation Graph (3, 12)][DBLP]
    PODS, 1989, pp:270-285 [Conf]
  5. Vincent Ng, Tiko Kameda
    Concurrent Access to R-Trees. [Citation Graph (3, 0)][DBLP]
    SSD, 1993, pp:142-161 [Conf]
  6. Naoki Katoh, Toshihide Ibaraki, Tiko Kameda
    Cautious Transaction Schedulers with Admission Control. [Citation Graph (3, 12)][DBLP]
    ACM Trans. Database Syst., 1985, v:10, n:2, pp:205-229 [Journal]
  7. David Wai-Lok Cheung, Tiko Kameda
    Site Optimal Termination Protocols for a Distributed Database under Network Partitioning. [Citation Graph (2, 0)][DBLP]
    PODC, 1985, pp:111-121 [Conf]
  8. Toshihide Ibaraki, Tiko Kameda, Toshimi Minoura
    Disjoint-Interval Topological Sort: A Useful Concept in Serializability Theory (Extended Abstract). [Citation Graph (2, 9)][DBLP]
    VLDB, 1983, pp:89-91 [Conf]
  9. Naoki Katoh, Tiko Kameda, Toshihide Ibaraki
    A Cautious Scheduler for Multistep Transactions. [Citation Graph (2, 0)][DBLP]
    Algorithmica, 1987, v:2, n:, pp:1-26 [Journal]
  10. Toshihide Ibaraki, Tiko Kameda, Toshimi Minoura
    Serializability with Constraints. [Citation Graph (2, 15)][DBLP]
    ACM Trans. Database Syst., 1987, v:12, n:3, pp:429-452 [Journal]
  11. Vincent Ng, Tiko Kameda
    The R-Link Tree: A Recoverable Index Structure for Spatial Data. [Citation Graph (1, 0)][DBLP]
    DEXA, 1994, pp:163-172 [Conf]
  12. Slawomir Pilarski, Tiko Kameda
    A Novel Checkpointing Scheme for Distributed Database Systems. [Citation Graph (1, 11)][DBLP]
    PODS, 1990, pp:368-378 [Conf]
  13. Toshihide Ibaraki, Tiko Kameda, Naoki Katoh
    Cautious Transaction Schedulers for Database Concurrency Control. [Citation Graph (1, 0)][DBLP]
    IEEE Trans. Software Eng., 1988, v:14, n:7, pp:997-1009 [Journal]
  14. Vincent Ng, Tiko Kameda
    Quad-B Tree for Point Data. [Citation Graph (0, 0)][DBLP]
    CODAS, 1996, pp:554-560 [Conf]
  15. Vincent Ng, Tiko Kameda
    Concurrent access to point data. [Citation Graph (0, 0)][DBLP]
    COMPSAC, 1997, pp:368-0 [Conf]
  16. Xiaotie Deng, Tiko Kameda, Christos H. Papadimitriou
    How to Learn an Unknown Environment (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:298-303 [Conf]
  17. Tiko Kameda
    On the Computational Power of Some Machines with Pushdown-Like Storage [Citation Graph (0, 0)][DBLP]
    FOCS, 1970, pp:72- [Conf]
  18. Tiko Kameda, S. Toida
    Efficient Algorithms for Determining an Extremal Tree of a Graph (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1973, pp:12-15 [Conf]
  19. Toshihide Ibaraki, Tiko Kameda
    Multi-frame Isochronous Service for ATM Networks: Stop-and-Go Revisited. [Citation Graph (0, 0)][DBLP]
    ICCCN, 1997, pp:4-10 [Conf]
  20. Toshihide Ibaraki, Hiroshi Nagamochi, Tiko Kameda
    Optimal Coteries for Rings and Related Networks. [Citation Graph (0, 0)][DBLP]
    ICDCS, 1992, pp:650-656 [Conf]
  21. Tiko Kameda, Hussein M. Abdel-Wahab
    Optimal Code Generation for Machines with Different Types of Instructions. [Citation Graph (0, 0)][DBLP]
    IFIP Congress, 1977, pp:129-132 [Conf]
  22. Satoshi Fujita, Tiko Kameda, Masafumi Yamashita
    A Resource Assignment Problem on Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1995, pp:418-427 [Conf]
  23. Kazuhisa Makino, Tiko Kameda
    Efficient generation of all regular non-dominated coteries. [Citation Graph (0, 0)][DBLP]
    PODC, 2000, pp:279-288 [Conf]
  24. Masafumi Yamashita, Tiko Kameda
    Computing on an Anonymous Network. [Citation Graph (0, 0)][DBLP]
    PODC, 1988, pp:117-130 [Conf]
  25. Kazuhisa Makino, Masafumi Yamashita, Tiko Kameda
    Max- and Min-Neighborhood Monopolies. [Citation Graph (0, 0)][DBLP]
    SWAT, 2000, pp:513-526 [Conf]
  26. Tiko Kameda
    A polynomial-time test for the deadlock-freedom of computer systems. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1977, pp:282-291 [Conf]
  27. Amotz Bar-Noy, Xiaotie Deng, Juan A. Garay, Tiko Kameda
    Optimal Amortized Distributed Consensus (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WDAG, 1991, pp:95-107 [Conf]
  28. Masafumi Yamashita, Tiko Kameda
    Electing a Leader when Processor Identity Numbers are not Distinct (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WDAG, 1989, pp:303-314 [Conf]
  29. Kazuhisa Makino, Masafumi Yamashita, Tiko Kameda
    Max- and Min-Neighborhood Monopolies. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:34, n:3, pp:240-260 [Journal]
  30. Hussein M. Abdel-Wahab, Tiko Kameda
    File space utilization in database conversion. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1987, v:14, n:2, pp:107-115 [Journal]
  31. Naoki Katoh, Toshihide Ibaraki, Tiko Kameda
    A Multiversion Cautious Scheduler with Dynamic Serialization Constraints for Database Concurrency Control. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1992, v:40, n:4, pp:379-395 [Journal]
  32. Amotz Bar-Noy, Xiaotie Deng, Juan A. Garay, Tiko Kameda
    Optimal Amortized Distributed Consensus [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:120, n:1, pp:93-100 [Journal]
  33. Tiko Kameda
    Generalized Transition Matrix of a Sequential Machine and Its Applications [Citation Graph (0, 0)][DBLP]
    Information and Control, 1968, v:12, n:3, pp:259-275 [Journal]
  34. Tiko Kameda
    Erratum: ``Generalized Transition Matrix of a Sequential Machine and Its Applications'' [Citation Graph (0, 0)][DBLP]
    Information and Control, 1968, v:13, n:4, pp:401- [Journal]
  35. Tiko Kameda, S. Toida, F. J. Allan
    A Diagnosing Algorithm for Networks [Citation Graph (0, 0)][DBLP]
    Information and Control, 1975, v:29, n:2, pp:141-148 [Journal]
  36. Tiko Kameda, E. Sadeh
    Bounds on the Number of Fuzzy Functions [Citation Graph (0, 0)][DBLP]
    Information and Control, 1977, v:35, n:2, pp:139-145 [Journal]
  37. Tiko Kameda, Roland Vollmar
    Note on Tape Reversal Complexity of Languages [Citation Graph (0, 0)][DBLP]
    Information and Control, 1970, v:17, n:2, pp:203-215 [Journal]
  38. Ichiro Suzuki, Yuichi Tazoe, Masafumi Yamashita, Tiko Kameda
    Searching a Polygonal Region from the Boundary. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2001, v:11, n:5, pp:529-553 [Journal]
  39. Tiko Kameda
    On the Vector Representation of the Reachability in Planar Directed Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1975, v:3, n:3, pp:75-77 [Journal]
  40. Slawomir Pilarski, Tiko Kameda
    Simple Bounds on the Convergence Rate of an Ergodic Markov Chain. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:45, n:2, pp:81-87 [Journal]
  41. Masafumi Yamashita, Ichiro Suzuki, Tiko Kameda
    Searching a polygonal region by a group of stationary k-searchers. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:92, n:1, pp:1-8 [Journal]
  42. Xiaotie Deng, Tiko Kameda, Christos H. Papadimitriou
    How to Learn an Unknown Environment I: The Rectilinear Case. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1998, v:45, n:2, pp:215-245 [Journal]
  43. Toshihide Ibaraki, Hussein M. Abdel-Wahab, Tiko Kameda
    Design of Minimum-Cost Deadlock-Free Systems [Citation Graph (0, 0)][DBLP]
    J. ACM, 1983, v:30, n:4, pp:736-751 [Journal]
  44. Tiko Kameda
    Testing Deadlock-Freedom of Computer Systems. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1980, v:27, n:2, pp:270-280 [Journal]
  45. Tiko Kameda
    Pushdown Automata with Counters. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1972, v:6, n:2, pp:138-150 [Journal]
  46. Masafumi Yamashita, Tiko Kameda
    Computing Functions on Asynchronous Anonymous Networks. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1996, v:29, n:4, pp:331-356 [Journal]
  47. Eduard Moser, Tiko Kameda
    Bounds on the number of hidden units of boltzmann machines. [Citation Graph (0, 0)][DBLP]
    Neural Networks, 1992, v:5, n:6, pp:911-921 [Journal]
  48. Satoshi Fujita, Masafumi Yamashita, Tiko Kameda
    A Study on r-Configurations - A Resource Assignment Problem on Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2000, v:13, n:2, pp:227-254 [Journal]
  49. Kazuhisa Makino, Tiko Kameda
    Transformations on Regular Nondominated Coteries and Their Applications. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2001, v:14, n:3, pp:381-407 [Journal]
  50. David Wai-Lok Cheung, Tiko Kameda
    Site Optimal termination Protocols for a Distributed Database under Network Partitioning. [Citation Graph (0, 0)][DBLP]
    Operating Systems Review, 1986, v:20, n:3, pp:17-27 [Journal]
  51. F. J. Allan, Tiko Kameda, S. Toida
    An Approach to the Diagnosability Analysis of a System. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1975, v:24, n:10, pp:1040-1042 [Journal]
  52. Tiko Kameda, Slawomir Pilarski, André Ivanov
    Notes on Multiple Input Signature Analysis. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1993, v:42, n:2, pp:228-234 [Journal]
  53. Slawomir Pilarski, Tiko Kameda, André Ivanov
    Sequential faults and aliasing. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1993, v:12, n:7, pp:1068-1074 [Journal]
  54. Slawomir Pilarski, Andrzej Krasniewski, Tiko Kameda
    Estimating testing effectiveness of the circular self-test path technique. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1992, v:11, n:10, pp:1301-1316 [Journal]
  55. Toshihide Ibaraki, Tiko Kameda
    A Theory of Coteries: Mutual Exclusion in Distributed Systems. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1993, v:4, n:7, pp:779-794 [Journal]
  56. Slawomir Pilarski, Tiko Kameda
    Checkpointing for Distributed Databases: Starting from the Basics. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1992, v:3, n:5, pp:602-610 [Journal]
  57. Toshihide Ibaraki, Tiko Kameda, Naoki Katoh
    Multiversion Cautious Schedulers for Database Concurrency Control. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Software Eng., 1990, v:16, n:3, pp:302-315 [Journal]

  58. Average probe complexity of non-dominated coteries (brief announcement). [Citation Graph (, )][DBLP]


  59. Boolean theory of coteries. [Citation Graph (, )][DBLP]


Search in 0.009secs, Finished in 0.011secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002