玉木 久夫
我は草なり伸んとす
伸られるとき伸んとす
伸られぬ日は伸ぬなり
伸られる日は伸るなり
(高見 順:娘よりの聞書きにつき誤引用の可能性あり)

略歴

1975年 東京大学理学部物理学科卒.
1977年 同大学院修了.
1977年〜1988年 茨城大学工学部情報工学科助手.
1988年〜1990年 同講師.
1990年 トロント大学計算機科学科博士課程入学.
1993年 同終了.
1993年〜1994年 IBM T.J. Watson 研究所ポストドクトラル研究員.
1994年〜1997年 IBM東京基礎研究所勤務.
1997年4月 明治大学理工学部情報科学科教授, 現在に至る.
PhD in Computer Science.
情報処理学会, ACM, IEEE Computer Society各会員.


研究分野

計算とアルゴリズムの理論


受賞

1995 International Conference on Logic Programming Best Paper Retrospective Award.
1995年度 情報処理学会山下記念賞(アルゴリズム研究会).
1997 International Symposium on Algorithms and Computation Best Paper Award.
1999年度 情報処理学会Best Author賞.


論文(国際会議)

T. Asano, M. de Berg, O. Cheong, L.J. Guibas, J. Snoeyink, H. Tamaki, Spanning Trees Crossing Few Barriers.
The 15th Annual ACM Symposium on Computational Geometry, June 1999.

N.Kato, H.Tamaki, T.Tokuyama, Parametric Polymatroid Optimization and Its Geometric Applications.
The 10th Annual ACM-SIAM Symposium on Discrete Algorithms, 1999.

T.Asano, N.Katoh, H.Tamaki and T.Tokuyama, Convertibility among grid filling curves.
Proceedings of the International Symposium on Algorithms and Computation, 307-316, December 1998.

K.Iwama, E.Miyano, S.Tajima, H. Tamaki, Efficient randomized routing algorithms on the 2-dimensional mesh of buses.
4th Annual International Computing and Combinatorics Conference (COCOON'98), 229-240,August, 1998.

C.Papadimitriou, P.Raghavan, H.Tamaki, and S.Vempala, Latent semantic indexing: a probalistic analysis.
Proceedings of the ACM Symposium on Principles of Database Systems(PODS), June1998.

H. Tamaki and T. Tokuyama, A Characterizatio of Planar Graphs by Pseudo-Line Arrengements.
Proceedings of the 8th International Symposium on Algorithms and Computation, 133-142, December 1997.

Q.P. Gu and H. Tamaki, Multi-Color Routing in the Undirected Hypercube.
Proceedings of the 8th International Symposium on Algorithms and Computation, 72-81, December 1997.

T. Akutsu, H. Tamaki and T. Tokuyama, Distribution of Distances and Triangles in a Point Set and Algorithms for Computing the Largest Common Point Set.
Proc. 13th ACM Symposium on Computational Geometry, June 1997.

T. Asano, N. Katoh, H. Tamaki and T. Tokuyama, Covering points in the plane by $k$-tours: towards a polynomial time approximation scheme for general $k$.
Proc. 28th ACM Symposium on Theory of Computing, May 1997.

Y. Asahiro, K. Iwama, H. Tamaki and T. Tokuyama, Greedily finding a dense subgraph.
Proc. 5th Scandinavian Workshop on Algorithm Theory, July 1996.

N. H. Bshouty, S.A.Goldman, H.D. Mathias, S. Suri, and H. Tamaki, Noise-Tolerant Distribution-Free Learning of General Geometric Concepts.
Proc. 27th ACM Symposium on Theory of Computing, May 1996.

Q.P. Gu and H. Tamaki, Routing a Permutation in the Hypercube by Two Sets of Edge-Disjoint Paths.
Proc. 10th IEEEInternational Parallel Processing Symposium, April 1996.

P.K. Agarwal, P. Raghavan and H. Tamaki, Motion Planning for a Steering-Constrained Robot through Moderate Obstacles.
Proc. 27th ACM Symposium on Theory of Computing, May 1995.

H. Tamaki and T.Tokuyama, How to Cut Pseudo-Parabolas into Segments.
Proc. 11th ACM Symposium on Computational Geometry, May 1995.

C.H. Papadimitriou, P. Raghavan, M. Sudan and H. Tamaki, Motion Planning on a Graph.
Proc. 35th IEEE Symposium on Foundation of Computer Science, October 1994.

K. Iwano, P. Raghavan and H. Tamaki, Traveling Cameraman Problem.
Proc. 5th International Symposium on Algorithms and Computation, August 1994.

H. Tamaki, Construction of the Mesh and the Torus Tolerating a Large Number of Faults.
Proc. 6th ACM Symposium on Parallel Algorithms and Architectures, June 1994.

A.R. Karlin, G.Nelson and H. Tamaki, On the Fault-Tolerance of the Butterfly.
Proc. 26th ACM Symposium on Theory of Computting, May 1994.

A. Bar-Noy, P. Raghavan, B. Schieber and H. Tamaki, Fast Deflection Routing for Packets and Worms.
12th ACM Symposium on Principles of Distributed Computation, August 1993.

H. Tamaki, Efficient Self-Embedding of Butterfly Networks with Random Faults.
Proc. 33rd IEEE Symposium on Fourndation of Computer Science, October 1992.

H. Tamaki, Robust Bounded-degree Networks with Small Diameters}.
Proc. 4th ACM Symposium on Parallel Algorithms and Architectures, June 1992.

H. Tamaki, Stream-based compilation of ground I/O Prolog into committed choice languages.
Proc. 4th International Conference on Logic Programming, May 1987.

H. Tamaki and T.Sato, OLD resolution with tabulation.
Proc. 3rd International Conference on Logic Programming, 1986.

H. Tamaki, A distributed unification scheme for systolic logic programs.
Proc. 1985 International Conference on Parallel Processing, 1985.

T. Sato and H. Tamaki, Transformational logic program synthesis.
Proc. International Conference on Fifth Generation Computer Systems 1984.

H. Tamaki and T. Sato, Unfold/fold transformation of Logic Programs.
Proc. 2nd International Logic Programming Conference, 1984.

H. Tamaki, Semantics of a logic programming language with a reducibility predicate.
Proc. International Symposium on Logic Programming, 1984.

論文(論文誌)

T.Akutsu, H.Tamaki and T.Tokuyama, Distribution of distances and triangles in a point set and algorithms for computing the largest common point sets.
Discrete & Computational Geometry, Vol. 20, 307-331, 1998.

H.Tamaki and T.Tokuyama, How to Cut Pseudoparabolas into Segments.
Discrete & Computational Geometry, Vol 19, 265-290, 1998.

H.Tamaki, Efficient self-embedding of butterfly networks with random faults.
SIAM Journal on Computing, 27-3, 614-636, June 1998.

Q.P. Gu and H. Tamaki, Routing a Permutation in the Hypercube by Two Sets of Edge-Disjoint Paths.
Journal of Distributed and Parallel Computing (short note), Journal of Parallel and Distributed Computing, 44, 147-152, 1997.

H. Tamaki, Construction of the Mesh and the Torus Tolerating a Large Number of Faults.
Journal of Computer and System Sciences, 53-3, 1996.

A. Sprague and H. Tamaki, Routings of Involutions for a Hypercube.
Discrete Applied Mathematics, vol 48, 1994.

T. Sato and H. Tamaki, First Order Compiler.
Journal of Symbolic Computation, Vol.8, 1989.

T. Sato and H. Tamaki, Existential Continuation.
New Generation Computing, Vol.6, No.2, 1989.

T. Sato and H. Tamaki, A framework for deductive logic program synthesis.
The Transactions of the IECE of Japan, Vol. E 67, No. 10,1984.

T. Sato and H. Tamaki, Enumeration of success patterns in logic programs.
Theoretical Computer Science, Vol.34, No.1-2, 1984.

H. Tamaki and T.Sato, Program Transformation through Meta-shifting.
New Generation Computing, Vol.1, No.1, 1983.

Copyright by Hisao Tamaki.
All Rights Reserved.
tamaki@cs.meiji.ac.jp