| 2000 | PODC | Average probe complexity of non-dominated coteries (brief announcement). | Tiko Kameda, Feng Xiao, Malika Mahoui-Guerni |
| 2000 | PODC | Efficient generation of all regular non-dominated coteries. | Kazuhisa Makino, Tiko Kameda |
| 1997 | COMPSAC | Concurrent access to point data. | Vincent Ng, Tiko Kameda |
| 1997 | ICCCN | Multi-frame Isochronous Service for ATM Networks: Stop-and-Go Revisited. | Toshihide Ibaraki, Tiko Kameda |
| 1995 | ISAAC | A Resource Assignment Problem on Graphs. | Satoshi Fujita, Tiko Kameda, Masafumi Yamashita |
| 1994 | DEXA | The R-Link Tree: A Recoverable Index Structure for Spatial Data. | Vincent Ng, Tiko Kameda |
| 1992 | ICDCS | Optimal Coteries for Rings and Related Networks. | Toshihide Ibaraki, Hiroshi Nagamochi, Tiko Kameda |
| 1991 | FOCS | How to Learn an Unknown Environment (Extended Abstract) | Xiaotie Deng, Tiko Kameda, Christos H. Papadimitriou |
| 1990 | PODS | A Novel Checkpointing Scheme for Distributed Database Systems. | Slawomir Pilarski, Tiko Kameda |
| 1989 | PODS | Concurrency Control of Nested Transactions Accessing B-Trees. | Ada Wai-Chee Fu, Tiko Kameda |
| 1988 | PODC | Computing on an Anonymous Network. | Masafumi Yamashita, Tiko Kameda |
| 1985 | PODC | Site Optimal Termination Protocols for a Distributed Database under Network Partitioning. | David Wai-Lok Cheung, Tiko Kameda |
| 1983 | VLDB | Disjoint-Interval Topological Sort: A Useful Concept in Serializability Theory (Extended Abstract). | Toshihide Ibaraki, Tiko Kameda, Toshimi Minoura |
| 1973 | FOCS | Efficient Algorithms for Determining an Extremal Tree of a Graph (Extended Abstract) | Tiko Kameda, Shunichi Toida |
| 1970 | FOCS | On the Computational Power of Some Machines with Pushdown-Like Storage | Tiko Kameda |