Search results

From MaRDI portal
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • height-limited alphabetic binary trees 1996-11-25 Paper Constructing Huffman Trees in Parallel 1996-02-25 Paper Parallel construction of binary trees with near...
    10 bytes (16 words) - 19:45, 9 December 2023
  • height-limited alphabetic binary trees 1996-11-25 Paper https://portal.mardi4nfdi.de/entity/Q4875166 1996-06-16 Paper Constructing Huffman Trees in Parallel...
    10 bytes (17 words) - 00:49, 10 December 2023
  • societies 2015-01-22 Paper Upper and Lower Bounds on Constructing Alphabetic Binary Trees 1996-04-23 Paper https://portal.mardi4nfdi.de/entity/Q3140420 1994-11-29...
    10 bytes (17 words) - 23:03, 12 December 2023
  • de/entity/Q4352831 1997-12-17 Paper Upper and Lower Bounds on Constructing Alphabetic Binary Trees 1996-04-23 Paper https://portal.mardi4nfdi.de/entity/Q3140420 1994-11-29...
    10 bytes (13 words) - 02:12, 7 October 2023
  • Publication Date of Publication Type Optimum alphabetic binary trees 2024-07-05 Paper On the rate of convergence of bootstrapped means...
    10 bytes (16 words) - 10:30, 24 September 2023
  • by Rectangles 1981-01-01 Paper Set Orderings Requiring Costliest Alphabetic Binary Trees 1981-01-01 Paper Product partial orders with the Sperner property...
    10 bytes (16 words) - 04:40, 9 December 2023
  • query problems 1981-01-01 Paper Set Orderings Requiring Costliest Alphabetic Binary Trees 1981-01-01 Paper On cross-bandwidth 1981-01-01 Paper https://portal...
    10 bytes (17 words) - 02:41, 9 December 2023
  • https://portal.mardi4nfdi.de/entity/Q3691769 1985-01-01 Paper Optimal alphabetic binary tree for a nonregular cost function 1984-01-01 Paper Arc-Pancyclic Property...
    10 bytes (14 words) - 13:44, 8 December 2023
  • Decision Trees 2010-12-09 Paper On the Complexity of Searching in Trees: Average-Case Minimization 2010-09-07 Paper On the Huffman and Alphabetic Tree Problem...
    10 bytes (13 words) - 15:31, 6 October 2023
  • Publication Date of Publication Type Bounds and algorithms for alphabetic codes and binary search trees 2025-01-23 Paper Efficient and reliable post-quantum authentication...
    10 bytes (17 words) - 17:22, 11 December 2023
  • distributions 2009-12-18 Paper Minimax Trees in Linear Time with Applications 2009-12-11 Paper Restructuring binary search trees revisited 2009-12-04 Paper Worst-Case...
    10 bytes (13 words) - 09:41, 6 October 2023
  • Publication Date of Publication Type Bounds and algorithms for alphabetic codes and binary search trees 2025-01-23 Paper Private computations on set intersection...
    10 bytes (16 words) - 17:57, 9 December 2023
  • Parikh Matrices of Binary Words Obtained by an Extension of a Restricted Shuffle Operator 2018-05-17 Paper Language generating alphabetic flat splicing P...
    10 bytes (15 words) - 03:02, 7 October 2023
  • intersection graphs of orthodox paths in trees 2020-05-29 Paper Approximating connected safe sets in weighted trees 2020-05-29 Paper Equating \(\kappa\) maximum...
    10 bytes (15 words) - 19:52, 8 December 2023
  • DISTANT HORIZONS OF A TERRAIN 2006-03-13 Paper Restructuring ordered binary trees 2004-10-01 Paper KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS 2004-09-29...
    10 bytes (16 words) - 08:28, 9 December 2023
  • Paper Fast approximation of search trees on trees with centroid trees 2024-11-14 Paper Dynamic binary search trees: improved lower bounds for the greedy-future...
    10 bytes (13 words) - 20:08, 9 December 2023
  • 2022-08-19 Paper On a sublinear time parallel construction of optimal binary search trees 2022-08-18 Paper Noisy polynomial interpolation modulo prime powers...
    10 bytes (15 words) - 11:40, 28 January 2024
  • formulation for dynamic cohesive fracture 2020-04-16 Paper Optimal alphabetic trees for binary search 2016-06-09 Paper...
    10 bytes (14 words) - 20:44, 24 September 2023
  • 2022-08-18 Paper On a sublinear time parallel construction of optimal binary search trees 2022-08-18 Paper Efficient sublinear time parallel algorithms for...
    10 bytes (15 words) - 17:22, 9 December 2023
  • based on generating trees for enumerating pattern-avoiding inversion sequences 2023-08-10 Paper Random Walk Labelings of Perfect Trees and Other Graphs 2023-08-01...
    10 bytes (15 words) - 16:44, 8 December 2023
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)