The following pages link to (Q3651735):
Displaying 50 items.
- Metrics and barycenters for point pattern data (Q89375) (← links)
- FDR-control in multiscale change-point segmentation (Q153065) (← links)
- Upper bounds on number of steals in rooted trees (Q255260) (← links)
- A distributed enumeration algorithm and applications to all pairs shortest paths, diameter\dots (Q259059) (← links)
- \(K\)-Knuth equivalence for increasing tableaux (Q259166) (← links)
- Efficient execution of dynamically controllable simple temporal networks with uncertainty (Q262129) (← links)
- Authenticated hash tables based on cryptographic accumulators (Q262258) (← links)
- Succinct dynamic cardinal trees (Q262263) (← links)
- On computing the 2-vertex-connected components of directed graphs (Q266828) (← links)
- Strong articulation points and strong bridges in large scale graphs (Q270023) (← links)
- Asymptotic existence of proportionally fair allocations (Q277310) (← links)
- Computing role assignments of split graphs (Q287443) (← links)
- A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs (Q288235) (← links)
- Differential and integral equations for the 2-iterated Appell polynomials (Q289296) (← links)
- General theory of fuzzy connectedness segmentations (Q294400) (← links)
- On structural decompositions of finite frames (Q295388) (← links)
- Fast and fine quickest path algorithm (Q296816) (← links)
- Fast computation of bounds for two-terminal network reliability (Q296891) (← links)
- Integrating security constraints into fixed priority real-time schedulers (Q298053) (← links)
- Planning safe navigation routes through mined waters (Q299795) (← links)
- A heuristic rating estimation algorithm for the pairwise comparisons method (Q301489) (← links)
- On estimation of the diagonal elements of a sparse precision matrix (Q302437) (← links)
- A linear-time algorithm for the orbit problem over cyclic groups (Q303693) (← links)
- Minimum vertex cover in generalized random graphs with power law degree distribution (Q306728) (← links)
- Analysis of pivot sampling in dual-pivot Quicksort: a holistic analysis of Yaroslavskiy's partitioning scheme (Q308946) (← links)
- A note on the complexity of the causal ordering problem (Q309924) (← links)
- Diagnosability of Petri nets with observation graphs (Q312654) (← links)
- Integral flow decomposition with minimum longest path length (Q320005) (← links)
- List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility (Q320008) (← links)
- Procedures for the bin packing problem with precedence constraints (Q322561) (← links)
- Optimal production-inventory policy for an integrated multi-stage supply chain with time-varying demand (Q323539) (← links)
- A graph theoretic approach to input-to-state stability of switched systems (Q328048) (← links)
- Constrained pairwise and center-star sequences alignment problems (Q328691) (← links)
- Succinct posets (Q329288) (← links)
- A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem (Q337491) (← links)
- An adaptive meshless local Petrov-Galerkin method based on a posteriori error estimation for the boundary layer problems (Q338537) (← links)
- Road network emergency accessibility planning after a major earthquake (Q339942) (← links)
- Approximation of smallest linear tree grammar (Q342719) (← links)
- On the arithmetic complexity of Strassen-like matrix multiplications (Q346560) (← links)
- An \(O(n^3 \log \log n / \log^2 n)\) time algorithm for all pairs shortest paths (Q350723) (← links)
- Cellular tree classifiers (Q358883) (← links)
- On the succinctness of some modal logics (Q360052) (← links)
- Queueing systems with hard delay constraints: a framework for real-time communication over unreliable wireless channels (Q383255) (← links)
- Largest area convex hull of imprecise data based on axis-aligned squares (Q386441) (← links)
- Further analysis of the remedian algorithm (Q391134) (← links)
- Bounded-degree minimum-radius spanning trees in wireless sensor networks (Q391199) (← links)
- An analysis of chain characteristics in the cryptanalytic TMTO method (Q391319) (← links)
- Asymptotics and random sampling for BCI and BCK lambda terms (Q391429) (← links)
- A scalable approach to computing representative lowest common ancestor in directed acyclic graphs (Q391971) (← links)
- Approximation with a fixed number of solutions of some multiobjective maximization problems (Q396664) (← links)
