Hisao Tamaki - Citazioni di Google Scholar

Citata da

	Tutte	Dal 2015
Citazioni	4543	927
Indice H	27	14
i10-index	48	15

220

110

165

198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202016 16 22 24 49 58 66 46 91 92 119 90 87 101 103 106 136 136 138 127 173 172 163 196 193 168 182 168 180 157 160 158 208 155 160 193 50

Coautori

Takeshi TokuyamaTohoku UniversityEmail verificata su dais.is.tohoku.ac.jp
Taisuke SatoAIST/NIIEmail verificata su aist.go.jp
Tetsuo AsanoProfessor of School of Information Science, JAISTEmail verificata su jaist.ac.jp
Christos H PAPADIMITRIOUColumbia UniversityEmail verificata su columbia.edu
Santosh S. VempalaGeorgia TechEmail verificata su gatech.edu
Kurt MehlhornProfessor of Computer Science, Max Planck Institute for Informatics, Saarland Informatics CampusEmail verificata su mpi-inf.mpg.de
Guido SchäferCWIEmail verificata su cwi.nl
Hannah BastProfessor of Computer Science, University of FreiburgEmail verificata su informatik.uni-freiburg.de
Pankaj K. AgarwalDuke UniversityEmail verificata su cs.duke.edu
Tatsuya AkutsuProfessor, Bioinformatics Center, Institute for Chemical Research, Kyoto UniversityEmail verificata su kuicr.kyoto-u.ac.jp
Jack SnoeyinkComputer Science, UNC Chapel HillEmail verificata su cs.unc.edu
Madhu SudanGordon McKay Professor of Computer Science, Harvard UniversityEmail verificata su cs.harvard.edu
Amotz Bar-NoyProfessor of Computer Science, City University of New York (CUNY)Email verificata su sci.brooklyn.cuny.edu
Leonidas GuibasProfessor of Computer Science, Stanford UniversityEmail verificata su cs.stanford.edu
Mark de BergProfessor of Computer Science, TU EindhovenEmail verificata su win.tue.nl
Hirotaka OnoNagoya University, JapanEmail verificata su i.nagoya-u.ac.jp
Ryuhei UeharaJapan Advanced Institute of Science and TechnologyEmail verificata su jaist.ac.jp
Subhash SuriProfessor of Computer Science, University of California, Santa BarbaraEmail verificata su cs.ucsb.edu
Sally GoldmanResearch Scientist, Google Inc.Email verificata su google.com
H. David MathiasDept of Computer Science, University of Wisconsin - La CrosseEmail verificata su uwlax.edu

Hisao Tamaki

Professor of Computer Science, Meiji University

Email verificata su cs.meiji.ac.jp

Theory of computing algorithms


Titolo Ordina per citazioni Ordina per anno Ordina per titolo	Citata da Citata da	Anno
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	1278	2000
Unfold/fold transformation of logic programs H Tamaki Proc. of 2nd ILPC, 127-138, 1984	652	1984
OLD resolution with tabulation H Tamaki, T Sato International Conference on Logic Programming, 84-98, 1986	599	1986
Greedily finding a dense subgraph Y Asahiro, K Iwama, H Tamaki, T Tokuyama Journal of Algorithms 34 (2), 203-221, 2000	189	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	117	1995
Transformational logic program synthesis. T Sato, H Tamaki Unknown Host Publication Title, 195-201, 1984	96	1984
Enumeration of success patterns in logic programs T Sato, H Tamaki Theoretical Computer Science 34 (1-2), 227-240, 1984	95	1984
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	90	1998
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	78	1994
How to cut pseudoparabolas into segments H Tamaki, T Tokuyama Discrete & Computational Geometry 19 (2), 265-290, 1998	75	1998
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	71	1993
Algorithms for the Maxium Subarray Problem Based on Matrix Multiplication. H Tamaki, T Tokuyama SODA 1998, 446-452, 1998	70	1998
Optimal branch-decomposition of planar graphs in O(n³) Time QP Gu, H Tamaki ACM Transactions on Algorithms (TALG) 4 (3), 1-13, 2008	69	2008
Greedily finding a dense subgraph Y Asahiro, K Iwama, H Tamaki, T Tokuyama Scandinavian Workshop on Algorithm Theory, 136-148, 1996	53	1996
Improved bounds on the planar branchwidth with respect to the largest grid minor size QP Gu, H Tamaki Algorithmica 64 (3), 416-453, 2012	52	2012
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	52	1997
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	47	1997
Optimal Branch-Decomposition of Planar Graphs in O(n ³) Time QP Gu, H Tamaki International Colloquium on Automata, Languages, and Programming, 373-384, 2005	45	2005
A generalized correctness proof of the unfold/fold logic program transformation H Tamaki, T Satō Department of Information Science, Ibaraki University, 1986	45	1986
First order compiler: A deterministic logic program synthesis algorithm T Sato, H Tamaki J. Symb. Comput. 8 (6), 605-627, 1989	41	1989

Il sistema al momento non può eseguire l'operazione. Riprova più tardi.

Articoli 1–20

Citazioni per anno

Citazioni duplicate

Citazioni unite

Aggiungi coautoriCoautori

Carica PDF

Segui questo autore

Citata da

Coautori