Skip to search formSkip to main contentSkip to account menu
You are currently offline. Some features of the site may not work correctly.

H tree

Known as: H-Fractal, H-tree, Mandelbrot tree 
In fractal geometry, the H tree is a fractal tree structure constructed from perpendicular line segments, each smaller by a factor of the square root… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
An H-fractal used for a multiband antenna is presented. The H-fractal planar antenna has been fabricated on an FR4 substrate with… Expand
  • figure 1
  • figure 2
  • table I
  • figure 3
  • figure 4
2013
2013
The H-tree interconnect network is frequently used for the clock signal sharing in the microelectronic systems. Due to the… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table II
2012
2012
We use separation logic to specify and verify a Java program that implements snapshotable search trees, fully formalizing the… Expand
  • figure 2
Highly Cited
2008
Highly Cited
2008
The electromagnetic response of H-fractal structures, consisting of self-similar metallic lines or slits in metallic films… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2008
Highly Cited
2008
Three-dimensional (3D) integration is an important technology that addresses fundamental limitations of on-chip interconnects… Expand
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
2004
2004
Exponentially tapered interconnect can reduce the dynamic power dissipation of clock distribution networks. A criterion for… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
2004
2004
We report experimental and theoretical studies of Fraunhofer diffraction pattern of a 15-level H-fractal grating. The diffraction… Expand
  • figure 2
  • figure 1
  • figure 3
Highly Cited
2001
Highly Cited
2001
This paper describes the design of PICO, a C++ framework for implementing general parallel branch-and-bound algorithms. The PICO… Expand
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 8
1997
1997
Abstract. With respect to the specific requirements of advanced OODB applications, index data structures for type hierarchies in… Expand
  • figure 2
  • figure 1
  • figure 4
  • figure 3
  • figure 5
Highly Cited
1987
Highly Cited
1987
The pyramid computer was initially proposed for performing high-speed low-level image processing. However, its regular geometry… Expand
  • figure 1
  • figure 4
  • figure 5
  • figure 6
  • figure 7