Search results
From MaRDI portal
- Embedding large complete binary trees in hypercubes with load balancing 1996-11-25 Paper An optimal emulator and VLSI layout for complete binary trees 1996-09-25...10 bytes (17 words) - 12:43, 13 December 2023
- 1993-03-28 Paper Load balanced tree embeddings 1993-01-16 Paper Optimal three-dimensional layouts of complete binary trees 1987-01-01 Paper...10 bytes (19 words) - 10:32, 13 December 2023
- solve linear recurrences on hypercubes 1994-05-03 Paper Embedding complete binary trees into hypercubes 1992-06-26 Paper https://portal.mardi4nfdi.de/entity/Q3821547...10 bytes (18 words) - 13:08, 13 December 2023
- embeddings of complete binary trees in the mesh interconnection networks 2003-06-09 Paper On the fault-tolerant embedding of complete binary trees in the pancake...10 bytes (18 words) - 12:13, 24 September 2023
- 2001-01-24 Paper Optimal dimension-exchange token distribution on complete binary trees 2000-08-23 Paper Dimension-exchange token distribution on the mesh...10 bytes (18 words) - 08:28, 9 December 2023
- embeddings of complete binary trees in the mesh interconnection networks 2003-06-09 Paper On the fault-tolerant embedding of complete binary trees in the pancake...10 bytes (18 words) - 10:13, 6 October 2023
- Publication Date of Publication Type Complete binary trees in folded and enhanced cubes 2004-08-04 Paper...10 bytes (18 words) - 01:16, 28 December 2023
- Date of Publication Type An optimal emulator and VLSI layout for complete binary trees 1996-09-25 Paper...10 bytes (16 words) - 22:23, 24 September 2023
- Publication Date of Publication Type Optimal distortion embedding of complete binary trees into lines 2012-07-20 Paper...10 bytes (16 words) - 08:51, 6 October 2023
- of Publication Type The best choice problem for posets; colored complete binary trees 2016-02-23 Paper The best choice problem for a union of two linear...10 bytes (16 words) - 12:54, 7 October 2023
- environment 1986-01-01 Paper On the maximum edge length in VLSI layouts of complete binary trees 1986-01-01 Paper Systolic Sorting on a Mesh-Connected Network 1985-01-01...10 bytes (16 words) - 01:05, 13 December 2023
- de/entity/Q3143774 2012-12-04 Paper Dense edge-disjoint embedding of complete binary trees in the hypercube 1993-06-29 Paper...10 bytes (16 words) - 10:52, 6 October 2023
- 2004-08-11 Paper Optimal dimension-exchange token distribution on complete binary trees 2000-08-23 Paper Counting protocols for reliable end-to-end transmission...10 bytes (18 words) - 11:53, 24 September 2023
- 2004-10-06 Paper Optimal dimension-exchange token distribution on complete binary trees 2000-08-23 Paper Dimension-exchange token distribution on the mesh...10 bytes (16 words) - 10:09, 24 September 2023
- embedding of complete binary trees in the hypercube 1993-06-29 Paper Superperfect pairs of trees in graphs 1993-06-29 Paper Perfect pairs of trees associated...10 bytes (18 words) - 10:34, 9 December 2023
- mardi4nfdi.de/entity/Q4256198 1999-07-05 Paper Optimal embedding of complete binary trees into lines and grids 1998-08-20 Paper A simulated annealing approach...10 bytes (16 words) - 11:10, 24 September 2023
- 2003-08-13 Paper Low‐cost minimum‐time line‐broadcasting schemes in complete binary trees 2002-07-01 Paper https://portal.mardi4nfdi.de/entity/Q4886093 1996-11-10...10 bytes (16 words) - 20:44, 26 December 2023
- 2011-10-27 Paper Minimum height path partitioning of trees 2011-07-25 Paper Drawing complete binary trees inside rectilinear polygons 2011-01-20 Paper An Exact...10 bytes (16 words) - 14:41, 10 December 2023
- embedding of trees with partial embeddings 2012-03-12 Paper Minimum height path partitioning of trees 2011-07-25 Paper Drawing complete binary trees inside rectilinear...10 bytes (17 words) - 21:44, 9 December 2023
- https://portal.mardi4nfdi.de/entity/Q3996559 1993-01-23 Paper Embedding complete binary trees into hypercubes 1992-06-26 Paper The effect of statically and dynamically...10 bytes (18 words) - 17:50, 11 December 2023
