H树 (Chinese Wikipedia)

Analysis of information sources in references of the Wikipedia article "H树" in Chinese language version.

refsWebsite

Global rank Chinese rank

6doi.org

2^nd place

23^rd place

3web.archive.org

1^st place

2wolfram.com

513^th place

358^th place

1ams.org

451^st place

935^th place

1uci.edu

3,063^rd place

5,629^th place

1caltech.edu

887^th place

966^th place

ams.org

Kaloshin & Saprykina (2012). Kaloshin, Vadim; Saprykina, Maria, An example of a nearly integrable Hamiltonian system with a trajectory dense in a set of maximal Hausdorff dimension, Communications in Mathematical Physics, 2012, 315 (3): 643–697, MR 2981810, doi:10.1007/s00220-012-1532-x .

caltech.edu

authors.library.caltech.edu

Browning (1980). See especially Figure 1.1.5, page 15. Browning, Sally A., The Tree Machine: A Highly Concurrent Computing Environment, Ph.D. thesis, California Institute of Technology, 1980 [2014-12-28], （原始内容存档于2012-07-16） .

doi.org

Kaloshin & Saprykina (2012). Kaloshin, Vadim; Saprykina, Maria, An example of a nearly integrable Hamiltonian system with a trajectory dense in a set of maximal Hausdorff dimension, Communications in Mathematical Physics, 2012, 315 (3): 643–697, MR 2981810, doi:10.1007/s00220-012-1532-x .
Leiserson (1980). Leiserson, Charles E., Area-efficient graph layouts, 21st Annual Symposium on Foundations of Computer Science (FOCS 1980): 270–281, 1980, doi:10.1109/SFCS.1980.13 .
Nguyen & Huang (2002). Nguyen, Quang Vinh; Huang, Mao Lin, A space-optimized tree visualization, IEEE Symposium on Information Visualization: 85–92, 2002, doi:10.1109/INFVIS.2002.1173152 .
Bern & Eppstein (1993). Bern, Marshall; Eppstein, David, Worst-case bounds for subadditive geometric graphs, Proc. 9th Annual Symposium on Computational Geometry (PDF), Association for Computing Machinery: 183–188, 1993 [2014-12-28], doi:10.1145/160985.161018, （原始内容存档 (PDF)于2015-07-03） .
Ullman (1984); Burkis (1991). Ullman, Jeffrey D., Computational Aspects of VSLI, Computer Science Press, 1984 . Burkis, J., Clock tree synthesis for high performance ASICs, IEEE International Conference on ASIC: 9.8.1–9.8.4, 1991, doi:10.1109/ASIC.1991.242921 .
Hou 等人 (2008); Wen 等人 (2002). Hou, Bo; Xie, Hang; Wen, Weijia; Sheng, Ping, Three-dimensional metallic fractals and their photonic crystal characteristics, Physical Review B, 2008, 77: 125113, doi:10.1103/PhysRevB.77.125113 . Wen, Weijia; Zhou, Lei; Li, Jensen; Ge, Weikun; Chan, C. T.; Sheng, Ping, Subwavelength photonic band gaps from planar fractals 89, Physical Review Letters: 223901, 2002, doi:10.1103/PhysRevLett.89.223901 .

uci.edu

ics.uci.edu

Bern & Eppstein (1993). Bern, Marshall; Eppstein, David, Worst-case bounds for subadditive geometric graphs, Proc. 9th Annual Symposium on Computational Geometry (PDF), Association for Computing Machinery: 183–188, 1993 [2014-12-28], doi:10.1145/160985.161018, （原始内容存档 (PDF)于2015-07-03） .

web.archive.org

H-Fractal （页面存档备份，存于互联网档案馆）, Sándor Kabai, The Wolfram Demonstrations Project.
Bern & Eppstein (1993). Bern, Marshall; Eppstein, David, Worst-case bounds for subadditive geometric graphs, Proc. 9th Annual Symposium on Computational Geometry (PDF), Association for Computing Machinery: 183–188, 1993 [2014-12-28], doi:10.1145/160985.161018, （原始内容存档 (PDF)于2015-07-03） .
Browning (1980). See especially Figure 1.1.5, page 15. Browning, Sally A., The Tree Machine: A Highly Concurrent Computing Environment, Ph.D. thesis, California Institute of Technology, 1980 [2014-12-28], （原始内容存档于2012-07-16） .

wolfram.com

demonstrations.wolfram.com

H-Fractal （页面存档备份，存于互联网档案馆）, Sándor Kabai, The Wolfram Demonstrations Project.

mathworld.wolfram.com

Weisstein, Eric W. (编). Mandelbrot Tree. at MathWorld--A Wolfram Web Resource. Wolfram Research, Inc. （英语）.