Tiko Kameda - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 64 from 64

2004

Searching a polygonal region by a group of stationary ::::k::::-searchersMasafumi Yamashita, Ichiro Suzuki, Tiko Kameda. ipl, 92(1):1-8, 2004. [doi]

2002

Max- and Min-Neighborhood MonopoliesKazuhisa Makino, Masafumi Yamashita, Tiko Kameda. algorithmica, 34(3):240-260, 2002. [doi]

2001

Transformations on Regular Nondominated Coteries and Their ApplicationsKazuhisa Makino, Tiko Kameda. siamdm, 14(3):381-407, 2001. [doi]

Searching a Polygonal Region from the BoundaryIchiro Suzuki, Yuichi Tazoe, Masafumi Yamashita, Tiko Kameda. ijcga, 11(5):529-553, 2001.

2000

1998

How to Learn an Unknown Environment I: The Rectilinear CaseXiaotie Deng, Tiko Kameda, Christos H. Papadimitriou. JACM, 45(2):215-245, 1998. [doi]

1997

Multi-frame Isochronous Service for ATM Networks: Stop-and-Go RevisitedToshihide Ibaraki, Tiko Kameda. icccn 1997: 4-10 [doi]

Concurrent access to point dataVincent Ng, Tiko Kameda. compsac 1997: 368 [doi]

1996

Quad-B Tree for Point DataVincent Ng, Tiko Kameda. codas 1996: 554-560

Computing Functions on Asynchronous Anonymous NetworksMasafumi Yamashita, Tiko Kameda. mst, 29(4):331-356, 1996.

1995

Optimal Amortized Distributed ConsensusAmotz Bar-Noy, Xiaotie Deng, Juan A. Garay, Tiko Kameda. iandc, 120(1):93-100, July 1995.

A Resource Assignment Problem on GraphsSatoshi Fujita, Tiko Kameda, Masafumi Yamashita. isaac 1995: 418-427

1994

The R-Link Tree: A Recoverable Index Structure for Spatial DataVincent Ng, Tiko Kameda. DEXA 1994: 163-172

On minimizing aliasing in scan-based compactionSlawomir Pilarski, André Ivanov, Tiko Kameda. et, 5(1):83-90, 1994. [doi]

1993

Graph endpoint coloring and distributed processingDominique de Werra, Pavol Hell, Tiko Kameda, Naoki Katoh, Ph. Solot, Masafumi Yamashita. networks, 23(2):93-98, 1993. [doi]

A Theory of Coteries: Mutual Exclusion in Distributed SystemsToshihide Ibaraki, Tiko Kameda. tpds, 4(7):779-794, 1993. [doi]

Notes on Multiple Input Signature AnalysisTiko Kameda, Slawomir Pilarski, André Ivanov. TC, 42(2):228-234, 1993.

Concurrent Access to R-TreesVincent Ng, Tiko Kameda. ssd 1993: 142-161 [doi]

Simple Bounds on the Convergence Rate of an Ergodic Markov ChainSlawomir Pilarski, Tiko Kameda. ipl, 45(2):81-87, 1993.

Sequential faults and aliasingSlawomir Pilarski, Tiko Kameda, André Ivanov. tcad, 12(7):1068-1074, 1993. [doi]

1992

1991

Optimal Amortized Distributed Consensus (Extended Abstract)Amotz Bar-Noy, Xiaotie Deng, Juan A. Garay, Tiko Kameda. wdag 1992: 95-107

How to Learn an Unknown Environment (Extended Abstract)Xiaotie Deng, Tiko Kameda, Christos H. Papadimitriou. focs 1991: 298-303

Boolean theory of coteriesToshihide Ibaraki, Tiko Kameda. spdp 1991: 150-157 [doi]

1990

Multiversion Cautious Schedulers for Database Concurrency ControlToshihide Ibaraki, Tiko Kameda, Naoki Katoh. TSE, 16(3):302-315, 1990. [doi]

A Novel Checkpointing Scheme for Distributed Database SystemsSlawomir Pilarski, Tiko Kameda. PODS 1990: 368-378 [doi]

1989

Concurrency Control of Nested Transactions Accessing B-TreesAda Wai-Chee Fu, Tiko Kameda. PODS 1989: 270-285 [doi]

Electing a Leader when Processor Identity Numbers are not Distinct (Extended Abstract)Masafumi Yamashita, Tiko Kameda. wdag 1989: 303-314

1988

Cautious Transaction Schedulers for Database Concurrency ControlToshihide Ibaraki, Tiko Kameda, Naoki Katoh. TSE, 14(7):997-1009, 1988. [doi]

Computing on an Anonymous NetworkMasafumi Yamashita, Tiko Kameda. podc 1988: 117-130 [doi]

1987

File space utilization in database conversionHussein M. Abdel-Wahab, Tiko Kameda. cor, 14(2):107-115, 1987. [doi]

Serializability with ConstraintsToshihide Ibaraki, Tiko Kameda, Toshimi Minoura. TODS, 12(3):429-452, 1987. [doi]

A Cautious Scheduler for Multistep TransactionsNaoki Katoh, Tiko Kameda, Toshihide Ibaraki. algorithmica, 2:1-26, 1987.

1986

Site Optimal termination Protocols for a Distributed Database under Network PartitioningDavid Wai-Lok Cheung, Tiko Kameda. sigops, 20(3):17-27, 1986.

1985

Site Optimal Termination Protocols for a Distributed Database under Network PartitioningDavid Wai-Lok Cheung, Tiko Kameda. podc 1985: 111-121

Cautious Transaction Schedulers with Admission ControlNaoki Katoh, Toshihide Ibaraki, Tiko Kameda. TODS, 10(2):205-229, 1985. [doi]

1984

On the Optimal Nesting Order for Computing N-Relational JoinsToshihide Ibaraki, Tiko Kameda. TODS, 9(3):482-502, 1984. [doi]

Multi-version Concurrency Control Scheme for a Database SystemShojiro Muro, Tiko Kameda, Toshimi Minoura. jcss, 29(2):207-224, 1984.

1983

Design of Minimum-Cost Deadlock-Free SystemsToshihide Ibaraki, Hussein M. Abdel-Wahab, Tiko Kameda. JACM, 30(4):736-751, October 1983. [doi]

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

1981

An Improved Third Normal Form for Relational DatabasesTok Wang Ling, Frank Wm. Tompa, Tiko Kameda. TODS, 6(2):329-346, 1981. [doi]

1980

On strictly optimal schedules for the cumulative cost-optimal scheduling problemHussein M. Abdel-Wahab, Tiko Kameda. computing, 24(1):61-86, 1980. [doi]

Testing Deadlock-Freedom of Computer SystemsTiko Kameda. JACM, 27(2):270-280, 1980. [doi]

1978

Scheduling to Minimize Maximum Cumulative Cost Subject to Series-Parallel Precedence ConstraintsHussein M. Abdel-Wahab, Tiko Kameda. ior, 26(1):141-158, 1978. [doi]

1977

Optimal Code Generation for Machines with Different Types of InstructionsTiko Kameda, Hussein M. Abdel-Wahab. ifip 1977: 129-132

Bounds on the Number of Fuzzy FunctionsTiko Kameda, E. Sadeh. iandc, 35(2):139-145, October 1977.

A polynomial-time test for the deadlock-freedom of computer systemsTiko Kameda. tcs 1977: 282-291

1975

An Approach to the Diagnosability Analysis of a SystemF. J. Allan, Tiko Kameda, S. Toida. TC, 24(10):1040-1042, 1975.

On the Vector Representation of the Reachability in Planar Directed GraphsTiko Kameda. ipl, 3(3):75-77, 1975.

A Diagnosing Algorithm for NetworksTiko Kameda, S. Toida, F. J. Allan. iandc, 29(2):141-148, October 1975.

1973

Efficient Algorithms for Determining an Extremal Tree of a Graph (Extended Abstract)Tiko Kameda, S. Toida. focs 1973: 12-15

Einführung in die Codierungstheorie ITiko Kameda, Klaus Weihrauch. Volume 7 of Skripten zur Informatik, BI-Wissenschaftsverlag, 1973.

1972

Pushdown Automata with CountersTiko Kameda. jcss, 6(2):138-150, 1972.

1970

On the Computational Power of Some Machines with Pushdown-Like StorageTiko Kameda. focs 1970: 72

Note on Tape Reversal Complexity of LanguagesTiko Kameda, Roland Vollmar. iandc, 17(2):203-215, September 1970.

1968

Generalized Transition Matrix of a Sequential Machine and Its ApplicationsTiko Kameda. iandc, 12(3):259-275, March 1968.

Erratum: Generalized Transition Matrix of a Sequential Machine and Its Applications Tiko Kameda. iandc, 13(4):401, October 1968.

Sign in or sign up to see more results.

runs on WebDSL