20 results for “Binary trees”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
This paper proves that the number of distinct rooted binary phylogenetic trees displayed by a binary tree-child network with n leaves is at most 2^(n-1)-1, and shows that this upper bound is sharp.
This paper proves the competitiveness of Greedy binary search tree as 2^(O(sqrt(loglog n))), improving upon the widely held belief of O(1)-competitiveness.
This paper proposes a splay-like rotation design for concurrent binary search trees to preserve the main benefit of splaying on skewed workloads while reducing contention near the root.
The paper presents an algorithm for pebble games that achieves optimal work and parallel depth for complete binary trees under a fixed space budget.
The paper studies encodings of phylogenetic networks based on least common ancestor constraints and identifies which parts of the network are determined by this relation.
Enrica Duchi, Adrián Lillo, Pablo Puerto, Mercedes Rosas +1 more
The paper establishes bijections between tree records, girth of connected endofunctions, and genesis sequences, deriving generating functions for tree and forest record numbers using Cayley's tree fun…
This paper characterizes acyclic hypergraphs according to whether they admit unique canonical join trees as root and provides a linear-time algorithm to construct them.
This paper improves the upper bound for the (μ+1) EA on the Binary Value function BinVal.
This paper develops a parameterized algorithm for the NP-complete Tree Containment problem, showing it can be solved efficiently based on a structural parameter called scanwidth.
An approach is described to support rigid α canonical variables in an e-graph.
The paper introduces graph linear notation as an alternative definition for finite graphs, simplifying graph illustration and isomorphism comparison.
One clear sentence describing what this paper does
This paper proves lower bounds on the number of recursive calls made by two algorithms for monotone Boolean duality testing.
This paper presents an optimized algorithm for computing cut sets of a path set in graph theory and introduces a vectorized computational framework for property calculations.