Search results

From MaRDI portal
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • integer programming: an improved recursive algorithm 2014-07-14 Paper A tree traversal algorithm for decision problems in knot theory and 3-manifold topology...
    10 bytes (17 words) - 07:35, 13 December 2023
  • Publication Date of Publication Type Morris' tree traversal algorithm reconsidered 1988-01-01 Paper A correctness proof of an indenting program 1983-01-01...
    10 bytes (16 words) - 10:42, 13 December 2023
  • preconditions for progress 1992-09-26 Paper Inversion of a recursive tree traversal 1992-06-28 Paper Distributed sorting 1990-01-01 Paper An algorithm for...
    10 bytes (24 words) - 21:40, 12 December 2023
  • Publication Date of Publication Type Fast Robust BSP Tree Traversal Algorithm for Ray Tracing 1999-11-03 Paper...
    10 bytes (16 words) - 20:31, 26 December 2023
  • Publication Date of Publication Type Fast Robust BSP Tree Traversal Algorithm for Ray Tracing 1999-11-03 Paper...
    10 bytes (16 words) - 20:31, 26 December 2023
  • https://portal.mardi4nfdi.de/entity/Q4808785 2004-08-12 Paper Object-oriented tree traversal with JJForester. 2003-05-14 Paper...
    10 bytes (16 words) - 12:33, 24 September 2023
  • Publication Date of Publication Type Morris' tree traversal algorithm reconsidered 1988-01-01 Paper...
    10 bytes (16 words) - 10:06, 24 September 2023
  • existence of Hamiltonian cycles in a class of random graphs 1983-01-01 Paper Tree Traversal Related Algorithms for Generating Integer Partitions 1983-01-01 Paper...
    10 bytes (18 words) - 17:56, 9 December 2023
  • Publication Date of Publication Type Efficient tree traversal to reduce code growth in tree-based genetic programming 2009-03-31 Paper Artificial Evolution...
    10 bytes (16 words) - 18:04, 21 September 2023
  • https://portal.mardi4nfdi.de/entity/Q4446595 2004-02-02 Paper Fast Robust BSP Tree Traversal Algorithm for Ray Tracing 1999-11-03 Paper...
    10 bytes (17 words) - 20:31, 26 December 2023
  • hierarchical visibility algorithms 2003-01-09 Paper Fast Robust BSP Tree Traversal Algorithm for Ray Tracing 1999-11-03 Paper...
    10 bytes (17 words) - 20:31, 26 December 2023
  • Publication Type N-trees as nestings: Complexity, similarity, and consensus 1986-01-01 Paper Another representation of binary tree traversal 1973-01-01 Paper...
    10 bytes (20 words) - 10:22, 24 September 2023
  • Publication Date of Publication Type Picture Segmentation by a Tree Traversal Algorithm 1976-01-01 Paper A syntactic algorithm for peak detection in waveforms...
    10 bytes (18 words) - 02:11, 28 December 2023
  • multipole method based on barycentric Lagrange interpolation and dual tree traversal 2023-06-13 Paper Treecode-accelerated Green iteration for Kohn-Sham...
    10 bytes (16 words) - 22:33, 24 September 2023
  • multipole method based on barycentric Lagrange interpolation and dual tree traversal 2023-06-13 Paper Computing electrostatic binding energy with the TABI...
    10 bytes (16 words) - 00:27, 25 September 2023
  • Publication Type Automated Verification of the Deutsch-Schorr-Waite Tree-Traversal Algorithm 2009-03-12 Paper Refinement-Based Verification for Possibly-Cyclic...
    10 bytes (16 words) - 08:13, 7 October 2023
  • ordered minimal perfect hash functions 1996-02-26 Paper A bounded-space tree traversal algorithm 1993-11-15 Paper...
    10 bytes (18 words) - 18:22, 9 December 2023
  • The complexity of the normal surface solution space 2014-04-03 Paper A tree traversal algorithm for decision problems in knot theory and 3-manifold topology...
    10 bytes (19 words) - 14:08, 10 December 2023
  • ordered multi-class ROC analysis 2009-06-12 Paper Efficient tree traversal to reduce code growth in tree-based genetic programming 2009-03-31 Paper Artificial...
    10 bytes (16 words) - 18:05, 21 September 2023
  • https://portal.mardi4nfdi.de/entity/Q4415119 2003-07-28 Paper Object-oriented tree traversal with JJForester. 2003-05-14 Paper...
    10 bytes (16 words) - 14:19, 6 October 2023
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)