default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTiko Kameda
Person information
- affiliation: Simon Fraser University, Burnaby, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2004
[j42]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
- [j41]Kazuhisa Makino, Masafumi Yamashita, Tiko Kameda:
Max- and Min-Neighborhood Monopolies. Algorithmica 34(3): 240-260 (2002) - 2001
- [j40]Ichiro Suzuki, Yuichi Tazoe, Masafumi Yamashita, Tiko Kameda:
Searching a Polygonal Region from the Boundary. Int. J. Comput. Geom. Appl. 11(5): 529-553 (2001) - [j39]Kazuhisa Makino, Tiko Kameda:
Transformations on Regular Nondominated Coteries and Their Applications. SIAM J. Discret. Math. 14(3): 381-407 (2001) - 2000
- [j38]Satoshi Fujita, Masafumi Yamashita, Tiko Kameda:
A Study on r-Configurations - A Resource Assignment Problem on Graphs. SIAM J. Discret. 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
1990 – 1999
- 1998
- [j37]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]Vincent Ng, Tiko Kameda:
Concurrent access to point data. COMPSAC 1997: 368-373 - [c19]Toshihide Ibaraki, Tiko Kameda:
Multi-frame Isochronous Service for ATM Networks: Stop-and-Go Revisited. ICCCN 1997: 4-10 - 1996
- [j36]Masafumi Yamashita, Tiko Kameda:
Computing Functions on Asynchronous Anonymous Networks. Math. Syst. Theory 29(4): 331-356 (1996) - [c18]Vincent T. Y. Ng, Tiko Kameda:
Quad-B Tree for Point Data. CODAS 1996: 554-560 - 1995
- [j35]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
- [j34]Slawomir Pilarski, André Ivanov, Tiko Kameda:
On minimizing aliasing in scan-based compaction. J. Electron. Test. 5(1): 83-90 (1994) - [c16]Vincent Ng, Tiko Kameda:
The R-Link Tree: A Recoverable Index Structure for Spatial Data. DEXA 1994: 163-172 - 1993
- [j33]Slawomir Pilarski, Tiko Kameda:
Simple Bounds on the Convergence Rate of an Ergodic Markov Chain. Inf. Process. Lett. 45(2): 81-87 (1993) - [j32]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) - [j31]Tiko Kameda, Slawomir Pilarski, André Ivanov:
Notes on Multiple Input Signature Analysis. IEEE Trans. Computers 42(2): 228-234 (1993) - [j30]Slawomir Pilarski, Tiko Kameda, André Ivanov:
Sequential faults and aliasing. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 12(7): 1068-1074 (1993) - [j29]Toshihide Ibaraki, Tiko Kameda:
A Theory of Coteries: Mutual Exclusion in Distributed Systems. IEEE Trans. Parallel Distributed Syst. 4(7): 779-794 (1993) - [c15]Vincent Ng, Tiko Kameda:
Concurrent Access to R-Trees. SSD 1993: 142-161 - 1992
- [j28]Naoki Katoh, Toshihide Ibaraki, Tiko Kameda:
A Multiversion Cautious Scheduler with Dynamic Serialization Constraints for Database Concurrency Control. Discret. Appl. Math. 40(4): 379-395 (1992) - [j27]Eduard Moser, Tiko Kameda:
Bounds on the number of hidden units of boltzmann machines. Neural Networks 5(6): 911-921 (1992) - [j26]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): 1301-1316 (1992) - [j25]Slawomir Pilarski, Tiko Kameda:
Checkpointing for Distributed Databases: Starting from the Basics. IEEE Trans. Parallel Distributed 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]Toshihide Ibaraki, Tiko Kameda:
Boolean theory of coteries. SPDP 1991: 150-157 - [c11]Amotz Bar-Noy, Xiaotie Deng, Juan A. Garay, Tiko Kameda:
Optimal Amortized Distributed Consensus (Extended Abstract). WDAG 1991: 95-107 - 1990
- [j24]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
1980 – 1989
- 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
- [j23]Toshihide Ibaraki, Tiko Kameda, Naoki Katoh:
Cautious Transaction Schedulers for Database Concurrency Control. IEEE Trans. Software Eng. 14(7): 997-1009 (1988) - [c7]Masafumi Yamashita, Tiko Kameda:
Computing on an Anonymous Network. PODC 1988: 117-130 - 1987
- [j22]Naoki Katoh, Tiko Kameda, Toshihide Ibaraki:
A Cautious Scheduler for Multistep Transactions. Algorithmica 2: 1-26 (1987) - [j21]Hussein M. Abdel-Wahab, Tiko Kameda:
File space utilization in database conversion. Comput. Oper. Res. 14(2): 107-115 (1987) - [j20]Toshihide Ibaraki, Tiko Kameda, Toshimi Minoura:
Serializability with Constraints. ACM Trans. Database Syst. 12(3): 429-452 (1987) - 1986
- [j19]David Wai-Lok Cheung, Tiko Kameda:
Site Optimal termination Protocols for a Distributed Database under Network Partitioning. ACM SIGOPS Oper. Syst. Rev. 20(3): 17-27 (1986) - 1985
- [j18]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
- [j17]Shojiro Muro, Tiko Kameda, Toshimi Minoura:
Multi-version Concurrency Control Scheme for a Database System. J. Comput. Syst. Sci. 29(2): 207-224 (1984) - [j16]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:
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 [contents] - 1983
- [j15]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
- [j14]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
- [j13]Hussein M. Abdel-Wahab, Tiko Kameda:
On strictly optimal schedules for the cumulative cost-optimal scheduling problem. Computing 24(1): 61-86 (1980) - [j12]Tiko Kameda:
Testing Deadlock-Freedom of Computer Systems. J. ACM 27(2): 270-280 (1980)
1970 – 1979
- 1978
- [j11]Hussein M. Abdel-Wahab, Tiko Kameda:
Scheduling to Minimize Maximum Cumulative Cost Subject to Series-Parallel Precedence Constraints. Oper. Res. 26(1): 141-158 (1978) - 1977
- [j10]Tiko Kameda, Eitan Sadeh:
Bounds on the Number of Fuzzy Functions. Inf. 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 - 1976
- [j9]Tiko Kameda:
On maximally distant spanning trees of a graph. Computing 17(2): 115-119 (1976) - 1975
- [j8]Tiko Kameda, Shunichi Toida, F. J. Allan:
A Diagnosing Algorithm for Networks. Inf. Control. 29(2): 141-148 (1975) - [j7]Tiko Kameda:
On the Vector Representation of the Reachability in Planar Directed Graphs. Inf. Process. Lett. 3(3): 75-77 (1975) - [j6]F. J. Allan, Tiko Kameda, Shunichi Toida:
An Approach to the Diagnosability Analysis of a System. IEEE Trans. Computers 24(10): 1040-1042 (1975) - 1974
- [j5]Tiko Kameda, J. Ian Munro:
A O(|V|*|E|) algorithm for maximum matching of graphs. Computing 12(1): 91-98 (1974) - 1973
- [b1]Tiko Kameda, Klaus Weihrauch:
Einführung in die Codierungstheorie I. Skripten zur Informatik 7, BI-Wissenschaftsverlag 1973, ISBN 978-3-411-00783-7, pp. 1-215 - [c2]Tiko Kameda, Shunichi Toida:
Efficient Algorithms for Determining an Extremal Tree of a Graph (Extended Abstract). SWAT 1973: 12-15 - 1972
- [j4]Tiko Kameda:
Pushdown Automata with Counters. J. Comput. Syst. Sci. 6(2): 138-150 (1972) - 1970
- [j3]Tiko Kameda, Roland Vollmar:
Note on Tape Reversal Complexity of Languages. Inf. Control. 17(2): 203-215 (1970) - [c1]Tiko Kameda:
On the Computational Power of Some Machines with Pushdown-Like Storage. SWAT 1970: 72
1960 – 1969
- 1968
- [j2]Tiko Kameda:
Generalized Transition Matrix of a Sequential Machine and Its Applications. Inf. Control. 12(3): 259-275 (1968) - [j1]Tiko Kameda:
Erratum: "Generalized Transition Matrix of a Sequential Machine and Its Applications". Inf. Control. 13(4): 401 (1968)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
