MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for authors named "Hisao Tamaki" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 9 documents found, showing 1 through 9.
ATOM RSS
  • unknown title  
  • by Prabhakar Raghavan, Hisao Tamaki
  • … Prabhakar Raghavan y Madhu Sudan y Hisao Tamaki z Abstract We are given a connected, undirected graph…
  • Add To MetaCart
  • Matching algorithms are fast in sparse random graphs  
  • by Holger Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki — 2006 — Proc. of the 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS), LNCS 2996
  • … Schäfer 1 , and Hisao Tamaki 2⋆⋆ 1 Max-Planck-Institut für Informatik, Saarbrücken, Germany, {bast…
  • Cited by 4 (0 self) – Add To MetaCart
  • On the Fault Tolerance of the Butterfly  
  • by Anna R. Karlin, Greg Nelson, Hisao Tamaki — 1994 — In Proc. of the 26th ACM Symp. on Theory of Computing (STOC
  • …On the Fault Tolerance of the Butterfly Anna R. Karlin Greg Nelson y Hisao Tamaki z Abstract…
  • Cited by 11 (0 self) – Add To MetaCart
  • Motion Planning on a Graph  
  • by Christos H. Papadimitriou, Prabhakar Raghavan, Madhu Sudan, Hisao Tamaki — 1994
  • … Prabhakar Raghavan y Madhu Sudan y Hisao Tamaki z Abstract We are given a connected, undirected graph…
  • Cited by 8 (0 self) – Add To MetaCart
  • Latent Semantic Indexing: A Probabilistic Analysis  
  • by Christos Papadimitriou Computer, Christos H. Papadimitriou, Prabhakar Raghavan, Hisao Tamaki, Santosh Vempala — 1998
  • …@(email omitted); Hisao Tamaki Computer Science Department, Meiji University tamaki@(email omitted); Santosh Vempala…
  • Add To MetaCart
  • Motion Planning on a Graph  
  • by Christos Papadimitriou Prabhakar, Christos H. Papadimitriou, Prabhakar Raghavan, Hisao Tamaki
  • … Prabhakar Raghavan y Madhu Sudan y Hisao Tamaki z Abstract We are given a connected, undirected graph…
  • Add To MetaCart
  • Spanning Trees Crossing Few Barriers  
  • by Tetsuo Asano, Mark de Berg, Otfried Cheong, Mark Berg Cheong, Leonidas J. Guibas, Jack Snoeyink, Hisao Tamaki — 2002 — in: Proc. 15th ACM Symp. Comput. Geom
  • …. Guibas 3 Jack Snoeyink 4 Hisao Tamaki 5 Abstract We consider the problem of finding low-cost spanning…
  • Cited by 2 (0 self) – Add To MetaCart
Help! Showing 1 through 9.
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB