Follow
Hisao Tamaki
Hisao Tamaki
Visiting Researcher, Meiji University
Verified email at meiji.ac.jp
Title
Cited by
Cited by
Year
Latent semantic indexing: A probabilistic analysis
CH Papadimitriou, H Tamaki, P Raghavan, S Vempala
Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on …, 1998
15881998
Unfold/fold transformation of logic programs
H Tamaki
Proceedings of the Second International Conference on Logic Programming, 127-138, 1984
7031984
OLD resolution with tabulation
H Tamaki, T Sato
Third International Conference on Logic Programming: Imperial College of …, 1986
6351986
Greedily finding a dense subgraph
Y Asahiro, K Iwama, H Tamaki, T Tokuyama
Journal of Algorithms 34 (2), 203-221, 2000
311*2000
Motion planning for a steering-constrained robot through moderate obstacles
PK Agarwal, P Raghavan, H Tamaki
Proceedings of the twenty-seventh annual ACM symposium on Theory of …, 1995
1231995
Optimal branch-decomposition of planar graphs in O(n3) Time
QP Gu, H Tamaki
ACM Transactions on Algorithms (TALG) 4 (3), 1-13, 2008
1152008
Enumeration of success patterns in logic programs
T Sato, H Tamaki
Theoretical Computer Science 34 (1-2), 227-240, 1984
1051984
Distribution of distances and triangles in a point set and algorithms for computing the largest common point sets
T Akutsu, H Tamaki, T Tokuyama
Proceedings of the thirteenth annual symposium on Computational geometry …, 1997
1001997
Transformational logic program synthesis.
T Sato, H Tamaki
Unknown Host Publication Title, 195-201, 1984
941984
Motion planning on a graph
CH Papadimitriou, P Raghavan, M Sudan, H Tamaki
Proceedings 35th Annual Symposium on Foundations of Computer Science, 511-520, 1994
881994
Positive-instance driven dynamic programming for treewidth
H Tamaki
Journal of Combinatorial Optimization 37 (4), 1283-1311, 2019
792019
How to cut pseudo-parabolas into segments
H Tamaki, T Tokuyama
Proceedings of the eleventh annual symposium on Computational geometry, 230-237, 1995
791995
Covering points in the plane by k-tours: towards a polynomial time approximation scheme for general k
T Asano, N Katoh, H Tamaki, T Tokuyama
Proceedings of the twenty-ninth annual ACM symposium on Theory of computing …, 1997
781997
Algorithms for the maximum subarray problem based on matrix multiplication
H Tamaki, T Tokuyama
Interdisciplinary Information Sciences 6 (2), 99-104, 2000
752000
Fast deflection routing for packets and worms
A Bar-Noy, P Raghavan, B Schieber, H Tamaki
Proceedings of the twelfth annual ACM symposium on Principles of distributed …, 1993
731993
Improved bounds on the planar branchwidth with respect to the largest grid minor size
QP Gu, H Tamaki
Algorithmica 64 (3), 416-453, 2012
722012
A generalized correctness proof of the unfold/fold logic program transformation
H Tamaki, T Satō
Department of Information Science, Ibaraki University, 1986
481986
Matching algorithms are fast in sparse random graphs
H Bast, K Mehlhorn, G Schafer, H Tamaki
Theory of Computing Systems 39, 3-14, 2006
472006
Routing a permutation in the hypercube by two sets of edge disjoint paths
QP Gu, H Tamaki
Journal of parallel and distributed computing 44 (2), 147-152, 1997
461997
First order compiler: A deterministic logic program synthesis algorithm
T Sato, H Tamaki
J. Symb. Comput. 8 (6), 605-627, 1989
411989
The system can't perform the operation now. Try again later.
Articles 1–20