Greedily Finding a Dense Subgraph
- Yuichi Asahiro
- Kazuo Iwama
- et al.
- 2000
- Journal of Algorithms
Publications
12 results for Hisao Tamaki
Latent semantic indexing: A probabilistic analysis
- Christos H. Papadimitriou
- Prabhakar Raghavan
- et al.
- 2000
- Journal of Computer and System Sciences
Distribution of distances and triangles in a point set and algorithms for computing the largest common point sets
- T. Akutsu
- H. Tamaki
- et al.
- 1998
- Discrete and Computational Geometry
Noise-Tolerant Distribution-Free Learning of General Geometric Concepts
- Nader H. Bshouty
- Sally A. Goldman
- et al.
- 1998
- Journal of the ACM
Efficient Self-embedding Of Butterfly Networks With Random Faults
- Hisao Tamaki
- 1998
- SIAM Journal on Computing
How to cut pseudoparabolas into segments
- Hisao Tamaki
- Takeshi Tokuyama
- 1998
- Discrete and Computational Geometry
Noise-tolerant distribution-free learning of general geometric concepts
- Nader H. Bshouty
- Sally A. Goldman
- et al.
- 1996
- STOC 1996
Construction of the mesh and the torus tolerating a large number of faults
- Hisao Tamaki
- 1996
- Journal of Computer and System Sciences
Motion planning on a graph (extended abstract)
- Christos H. Papadimitriou
- Prabhakar Raghavan
- et al.
- 1994
- FOCS 1994
Construction of the mesh and the torus tolerating a large number of faults
- Hisao Tamaki
- 1994
- SPAA 1994