This paper proposes MoX, an optimized load-oblivious routing method for efficient training and inference of sparse Model-of-Experts (MoE) on static direct-connect fabrics.

The paper presents an algorithm for updating a Directed Minimum Spanning Tree using the weighted matroid intersection algorithm and a dynamic auxiliary graph.

This paper presents four novel parallel algorithms for maintaining a rooted spanning forest in dynamic graphs, achieving a throughput of 2 million insertions and 1.4 million deletions per second.

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 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 presents an optimized algorithm for computing cut sets of a path set in graph theory and introduces a vectorized computational framework for property calculations.

This paper develops a runtime recovery framework for broadcasting in dense Gaussian networks under static and dynamic faults, proving necessary and sufficient repair edges and providing efficient repa…

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.

This paper proves a coarse tree decomposition of graphs with bounded adhesion sets and separators.

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.

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 presents three new algorithms for maximizing revenue in the Stackelberg Vertex Cover problem on certain kinds of trees.

This paper proves lower bounds for the size of multiplicative graph spanners in the $f$-degree fault tolerant model, matching previous conditional lower bounds and current upper bounds.