Search the dblp DataBase
Hisao Tamaki :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Hisao Tamaki , Taisuke Sato OLD Resolution with Tabulation. [Citation Graph (9, 0)][DBLP ] ICLP, 1986, pp:84-98 [Conf ] Hisao Tamaki , Taisuke Sato Unfold/Fold Transformation of Logic Programs. [Citation Graph (6, 0)][DBLP ] ICLP, 1984, pp:127-138 [Conf ] Christos H. Papadimitriou , Prabhakar Raghavan , Hisao Tamaki , Santosh Vempala Latent Semantic Indexing: A Probabilistic Analysis. [Citation Graph (3, 4)][DBLP ] PODS, 1998, pp:159-168 [Conf ] Tetsuo Asano , Naoki Katoh , Hisao Tamaki , Takeshi Tokuyama The Structure and Number of Global Roundings of a Graph. [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:130-138 [Conf ] Kazuo Iwama , Eiji Miyano , Satoshi Tajima , Hisao Tamaki Efficient Randomized Routing Algorithms on the Two-Dimensional Mesh of Buses. [Citation Graph (0, 0)][DBLP ] COCOON, 1998, pp:229-240 [Conf ] Tetsuo Asano , Mark de Berg , Otfried Cheong , Leonidas J. Guibas , Jack Snoeyink , Hisao Tamaki Spanning Trees Crossing Few Barriers. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1999, pp:41-48 [Conf ] Tatsuya Akutsu , Hisao Tamaki , Takeshi Tokuyama Distribution of Distances and Triangles in a Point Set and Algorithms for Computing the Largest Common Point Sets. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1997, pp:314-323 [Conf ] Hisao Tamaki , Takeshi Tokuyama How to Cut Pseudo-Parabolas into Segments. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1995, pp:230-237 [Conf ] Hisao Tamaki A Linear Time Heuristic for the Branch-Decomposition of Planar Graphs. [Citation Graph (0, 0)][DBLP ] ESA, 2003, pp:765-775 [Conf ] Taisuke Sato , Hisao Tamaki Transformational Logic Program Synthesis. [Citation Graph (0, 0)][DBLP ] FGCS, 1984, pp:195-201 [Conf ] Christos H. Papadimitriou , Prabhakar Raghavan , Madhu Sudan , Hisao Tamaki Motion Planning on a Graph (Extended Abstract) [Citation Graph (0, 0)][DBLP ] FOCS, 1994, pp:511-520 [Conf ] Hisao Tamaki Efficient Self-Embedding of Butterfly Networks with Random Faults [Citation Graph (0, 0)][DBLP ] FOCS, 1992, pp:533-541 [Conf ] Qian-Ping Gu , Hisao Tamaki Optimal Branch-Decomposition of Planar Graphs in O (n 3 ) Time. [Citation Graph (0, 0)][DBLP ] ICALP, 2005, pp:373-384 [Conf ] Taisuke Sato , Hisao Tamaki Enumeration of Success Patterns in Logic Programs. [Citation Graph (0, 0)][DBLP ] ICALP, 1983, pp:640-652 [Conf ] Hisao Tamaki Stream-Based Compilation of Ground I/O PROLOG into Committed-Choice Languages. [Citation Graph (0, 0)][DBLP ] ICLP, 1987, pp:376-393 [Conf ] Hisao Tamaki A Distributed Unification Scheme for Systolic Logic Programs. [Citation Graph (0, 0)][DBLP ] ICPP, 1985, pp:552-559 [Conf ] Qian-Ping Gu , Hisao Tamaki Routing a Permutation in the Hypercube by Two Sets of Edge-Disjoint Paths. [Citation Graph (0, 0)][DBLP ] IPPS, 1996, pp:561-567 [Conf ] Tetsuo Asano , Naoki Katoh , Hisao Tamaki , Takeshi Tokuyama Convertibility among Grid Filling Curves. [Citation Graph (0, 0)][DBLP ] ISAAC, 1998, pp:307-316 [Conf ] Qian-Ping Gu , Hisao Tamaki Multi-Color Routing in the Undirected Hypercube. [Citation Graph (0, 0)][DBLP ] ISAAC, 1997, pp:72-81 [Conf ] Kazuo Iwano , Prabhakar Raghavan , Hisao Tamaki The Traveling Cameraman Problem, with Applications to Automatic Optical Inspection. [Citation Graph (0, 0)][DBLP ] ISAAC, 1994, pp:29-37 [Conf ] Hisao Tamaki , Takeshi Tokuyama A Characterization of Planar Graphs by Pseudo-Line Arrangements. [Citation Graph (0, 0)][DBLP ] ISAAC, 1997, pp:133-142 [Conf ] Amotz Bar-Noy , Prabhakar Raghavan , Baruch Schieber , Hisao Tamaki Fast Deflection Routing for Packets and Worms (Extended Summary). [Citation Graph (0, 0)][DBLP ] PODC, 1993, pp:75-86 [Conf ] Hisao Tamaki Semantics of a Logic Programming Language with a Reducibility Predicate. [Citation Graph (0, 0)][DBLP ] SLP, 1984, pp:259-264 [Conf ] Naoki Katoh , Hisao Tamaki , Takeshi Tokuyama Parametric Polymatroid Optimization and Its Geometric Applications. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:517-526 [Conf ] Hisao Tamaki , Takeshi Tokuyama Algorithms for the Maxium Subarray Problem Based on Matrix Multiplication. [Citation Graph (0, 0)][DBLP ] SODA, 1998, pp:446-452 [Conf ] Hisao Tamaki Robust Bounded-Degree Networks with Small Diameters. [Citation Graph (0, 0)][DBLP ] SPAA, 1992, pp:247-256 [Conf ] Hisao Tamaki Construction of the Mesh and the Torus Tolerating a Large Number of Faults. [Citation Graph (0, 0)][DBLP ] SPAA, 1994, pp:268-277 [Conf ] Holger Bast , Kurt Mehlhorn , Guido Schäfer , Hisao Tamaki Matching Algorithms Are Fast in Sparse Random Graphs. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:81-92 [Conf ] Pankaj K. Agarwal , Prabhakar Raghavan , Hisao Tamaki Motion planning for a steering-constrained robot through moderate obstacles. [Citation Graph (0, 0)][DBLP ] STOC, 1995, pp:343-352 [Conf ] Tetsuo Asano , Naoki Katoh , Hisao Tamaki , Takeshi Tokuyama Covering Points in the Plane by k -Tours: Towards a Polynomial Time Approximation Scheme for General k . [Citation Graph (0, 0)][DBLP ] STOC, 1997, pp:275-283 [Conf ] Nader H. Bshouty , Sally A. Goldman , H. David Mathias , Subhash Suri , Hisao Tamaki Noise-Tolerant Distribution-Free Learning of General Geometric Concepts. [Citation Graph (0, 0)][DBLP ] STOC, 1996, pp:151-160 [Conf ] Anna R. Karlin , Greg Nelson , Hisao Tamaki On the fault tolerance of the butterfly. [Citation Graph (0, 0)][DBLP ] STOC, 1994, pp:125-133 [Conf ] Yuichi Asahiro , Kazuo Iwama , Hisao Tamaki , Takeshi Tokuyama Greedily Finding a Dense Subgraph. [Citation Graph (0, 0)][DBLP ] SWAT, 1996, pp:136-148 [Conf ] Tetsuo Asano , Naoki Katoh , Hisao Tamaki , Takeshi Tokuyama On Geometric Structure of Global Roundings for Graphs and Range Spaces. [Citation Graph (0, 0)][DBLP ] SWAT, 2004, pp:455-467 [Conf ] Qian-Ping Gu , Hisao Tamaki Multicolor routing in the undirected hypercube. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2000, v:100, n:3, pp:169-181 [Journal ] Alan P. Sprague , Hisao Tamaki Routings for Involutions of a Hypercube. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1994, v:48, n:2, pp:175-186 [Journal ] Tetsuo Asano , Mark de Berg , Otfried Cheong , Leonidas J. Guibas , Jack Snoeyink , Hisao Tamaki Spanning Trees Crossing Few Barriers. [Citation Graph (0, 0)][DBLP ] Discrete & Computational Geometry, 2003, v:30, n:4, pp:591-606 [Journal ] Tatsuya Akutsu , Hisao Tamaki , Takeshi Tokuyama Distribution of Distances and Triangles in a Point Set and Algorithms for Computing the Largest Common Point Sets. [Citation Graph (0, 0)][DBLP ] Discrete & Computational Geometry, 1998, v:20, n:3, pp:307-331 [Journal ] Hisao Tamaki , Takeshi Tokuyama How to Cut Pseudoparabolas into Segments. [Citation Graph (0, 0)][DBLP ] Discrete & Computational Geometry, 1998, v:19, n:2, pp:265-290 [Journal ] Naoki Katoh , Hisao Tamaki , Takeshi Tokuyama Parametric Polymatroid Optimization and Its Geometric Applications. [Citation Graph (0, 0)][DBLP ] Int. J. Comput. Geometry Appl., 2002, v:12, n:5, pp:429-0 [Journal ] Nader H. Bshouty , Sally A. Goldman , H. David Mathias , Subhash Suri , Hisao Tamaki Noise-Tolerant Distribution-Free Learning of General Geometric Concepts. [Citation Graph (0, 0)][DBLP ] J. ACM, 1998, v:45, n:5, pp:863-890 [Journal ] Yuichi Asahiro , Kazuo Iwama , Hisao Tamaki , Takeshi Tokuyama Greedily Finding a Dense Subgraph. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 2000, v:34, n:2, pp:203-221 [Journal ] Christos H. Papadimitriou , Prabhakar Raghavan , Hisao Tamaki , Santosh Vempala Latent Semantic Indexing: A Probabilistic Analysis. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 2000, v:61, n:2, pp:217-235 [Journal ] Hisao Tamaki Construction of the Mesh and the Torus Tolerating a Large Number of Faults. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1996, v:53, n:3, pp:371-379 [Journal ] Qian-Ping Gu , Hisao Tamaki Routing a Permutation in the Hypercube by Two Sets of Edge Disjoint Paths. [Citation Graph (0, 0)][DBLP ] J. Parallel Distrib. Comput., 1997, v:44, n:2, pp:147-152 [Journal ] Taisuke Sato , Hisao Tamaki First Order Compiler: A Deterministic Logic Program Synthesis Algorithm. [Citation Graph (0, 0)][DBLP ] J. Symb. Comput., 1989, v:8, n:6, pp:605-627 [Journal ] Holger Bast , Kurt Mehlhorn , Guido Schäfer , Hisao Tamaki Matching Algorithms Are Fast in Sparse Random Graphs. [Citation Graph (0, 0)][DBLP ] Theory Comput. Syst., 2006, v:39, n:1, pp:3-14 [Journal ] Taisuke Sato , Hisao Tamaki Existential Continuation. [Citation Graph (0, 0)][DBLP ] New Generation Comput., 1989, v:6, n:4, pp:421-438 [Journal ] Hisao Tamaki , Taisuke Sato Program Transformation Through Meta-shifting. [Citation Graph (0, 0)][DBLP ] New Generation Comput., 1983, v:1, n:1, pp:93-98 [Journal ] Martin Dietzfelbinger , Hisao Tamaki On the probability of rendezvous in graphs. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 2005, v:26, n:3, pp:266-288 [Journal ] Hisao Tamaki Efficient Self-Embedding of Butterfly Networks with Random Faults. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1998, v:27, n:3, pp:614-636 [Journal ] Tetsuo Asano , Naoki Katoh , Hisao Tamaki , Takeshi Tokuyama The structure and number of global roundings of a graph. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2004, v:325, n:3, pp:425-437 [Journal ] Kazuo Iwama , Eiji Miyano , Satoshi Tajima , Hisao Tamaki Efficient randomized routing algorithms on the two-dimensional mesh of buses. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2001, v:261, n:2, pp:227-239 [Journal ] Taisuke Sato , Hisao Tamaki Enumeration of Success Patterns in Logic Programs. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1984, v:34, n:, pp:227-240 [Journal ] Tetsuo Asano , Naoki Katoh , Hisao Tamaki , Takeshi Tokuyama Voronoi Diagram with Respect to Criteria on Vision Information. [Citation Graph (0, 0)][DBLP ] ISVD, 2007, pp:25-32 [Conf ] Empirical Study on Branchwidth and Branch Decomposition of Planar Graphs. [Citation Graph (, )][DBLP ] Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in O (n 1 + epsilon ) Time. [Citation Graph (, )][DBLP ] Route-Enabling Graph Orientation Problems. [Citation Graph (, )][DBLP ] Angular Voronoi Diagram with Applications. [Citation Graph (, )][DBLP ] Search in 0.050secs, Finished in 0.055secs