The following pages link to (Q3651735):
Displaying 50 items.
- An efficient algorithm for solving elliptic problems on percolation clusters (Q2083264) (← links)
- On zero-error codes produced by greedy algorithms (Q2084654) (← links)
- Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane (Q2084662) (← links)
- Succinct representation for (non)deterministic finite automata (Q2084735) (← links)
- A hybrid adjacency and time-based data structure for analysis of temporal networks (Q2086647) (← links)
- Negativity spectra in random tensor networks and holography (Q2087212) (← links)
- Worst-case analysis of clique MIPs (Q2089781) (← links)
- \(l\)-clique metric dimension of graphs (Q2091129) (← links)
- A binomial sum of harmonic numbers (Q2092321) (← links)
- Some algorithmic results on Hamiltonicity and its variants in \(P_6\)-free graphs (Q2093879) (← links)
- Algorithms for influence maximization in socio-physical networks (Q2095554) (← links)
- Koopman-based spectral clustering of directed and time-evolving graphs (Q2096996) (← links)
- Foremost non-stop journey arrival in linear time (Q2097355) (← links)
- Polynomial modular product verification and its implications (Q2100047) (← links)
- Computing newforms using supersingular isogeny graphs (Q2100578) (← links)
- Approximating TSP walks in subcubic graphs (Q2101165) (← links)
- An improved quantum network communication model based on compressed tensor network states (Q2101528) (← links)
- Hierarchical clustering of constrained dynamic systems using robust positively invariant sets (Q2103718) (← links)
- Very fast algorithms for implied barriers and moving-barrier options pricing (Q2104341) (← links)
- Faster algorithms for \(k\)-subset sum and variations (Q2105266) (← links)
- An efficient algorithm for 1-dimensional (Persistent) path homology (Q2105324) (← links)
- Linear-time parameterized algorithms with limited local resources (Q2105436) (← links)
- Complexity and approximability of minimum path-collection exact covers (Q2110360) (← links)
- Graph-theoretic algorithms for Kolmogorov operators: approximating solutions and their gradients in elliptic and parabolic problems on manifolds (Q2111184) (← links)
- Prioritization of candidate genes through Boolean networks (Q2112144) (← links)
- Half-trek criterion for identifiability of latent variable models (Q2112804) (← links)
- Structural properties of NFAs and growth rates of nondeterminism measures (Q2113384) (← links)
- Sparse regularization via bidualization (Q2114593) (← links)
- Two deadline reduction algorithms for scheduling dependent tasks on parallel processors (Q2117220) (← links)
- Improving the filtering of branch-and-bound MDD solver (Q2117223) (← links)
- An FPTAS for the \(\varDelta \)-modular multidimensional knapsack problem (Q2117618) (← links)
- Adaptive succinctness (Q2118203) (← links)
- Safety in \(s\)-\(t\) paths, trails and walks (Q2118205) (← links)
- 2 mm: a new technique for sorting data (Q2118864) (← links)
- OptORAMa: optimal oblivious RAM (Q2119019) (← links)
- A formal model for a linear time correctness condition of proof nets of multiplicative linear logic (Q2119124) (← links)
- Medians in median graphs and their cube complexes in linear time (Q2119403) (← links)
- Complexity of the multilevel critical node problem (Q2121476) (← links)
- Certain properties of the Laguerre-Sheffer polynomials (Q2124723) (← links)
- Asynchronous optimization of part logistics routing problem (Q2124805) (← links)
- Approximation algorithms for simple assembly line balancing problems (Q2125223) (← links)
- Determining the edge metric dimension of the generalized Petersen graph \(P(n, 3)\) (Q2125226) (← links)
- An overview of structural systems theory (Q2125521) (← links)
- SportLight: statistically principled crowdsourcing method for sports highlight selection (Q2126024) (← links)
- A review on instance ranking problems in statistical learning (Q2127240) (← links)
- FFT program generation for ring LWE-based cryptography (Q2128754) (← links)
- Scheduling deferrable electric appliances in smart homes: a bi-objective stochastic optimization approach (Q2130061) (← links)
- The non-positive circuit weight problem in parametric graphs: a solution based on dioid theory (Q2133400) (← links)
- Weighted complete graphs for condensing data (Q2133440) (← links)
- Faster minimization of tardy processing time on a single machine (Q2134746) (← links)
