Hisao Tamaki
Hisao Tamaki
Professor of Computer Science, Meiji University
Verified email at cs.meiji.ac.jp
Title
Cited by
Cited by
Year
Latent semantic indexing: A probabilistic analysis
CH Papadimitriou, P Raghavan, H Tamaki, S Vempala
Journal of Computer and System Sciences 61 (2), 217-235, 2000
14432000
Unfold/fold transformation of logic programs
H Tamaki
Proc. of 2nd ILPC, 127-138, 1984
6711984
OLD resolution with tabulation
H Tamaki, T Sato
International Conference on Logic Programming, 84-98, 1986
6121986
Greedily finding a dense subgraph
Y Asahiro, K Iwama, H Tamaki, T Tokuyama
Journal of Algorithms 34 (2), 203-221, 2000
269*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
1221995
Optimal branch-decomposition of planar graphs in O(n3) Time
QP Gu, H Tamaki
ACM Transactions on Algorithms (TALG) 4 (3), 1-13, 2008
1092008
Distribution of distances and triangles in a point set and algorithms for computing the largest common point sets
T Akutsu, H Tamaki, T Tokuyama
Discrete & Computational Geometry 20 (3), 307-331, 1998
961998
Enumeration of success patterns in logic programs
T Sato, H Tamaki
Theoretical Computer Science 34 (1-2), 227-240, 1984
951984
Transformational logic program synthesis.
T Sato, H Tamaki
Unknown Host Publication Title, 195-201, 1984
941984
Algorithms for the maximum subarray problem based on matrix multiplication
H Tamaki, T Tokuyama
Interdisciplinary Information Sciences 6 (2), 99-104, 2000
782000
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
781994
How to cut pseudoparabolas into segments
H Tamaki, T Tokuyama
Discrete & Computational Geometry 19 (2), 265-290, 1998
761998
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
681993
Improved bounds on the planar branchwidth with respect to the largest grid minor size
QP Gu, H Tamaki
Algorithmica 64 (3), 416-453, 2012
612012
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
581997
Positive-instance driven dynamic programming for treewidth
H Tamaki
Journal of Combinatorial Optimization 37 (4), 1283-1311, 2019
562019
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
551997
A generalized correctness proof of the unfold/fold logic program transformation
H Tamaki, T Satō
Department of Information Science, Ibaraki University, 1986
451986
Matching algorithms are fast in sparse random graphs
H Bast, K Mehlhorn, G Schafer, H Tamaki
Theory of Computing Systems 39 (1), 3-14, 2006
422006
First order compiler: A deterministic logic program synthesis algorithm
T Sato, H Tamaki
J. Symb. Comput. 8 (6), 605-627, 1989
421989
The system can't perform the operation now. Try again later.
Articles 1–20