The following pages link to Introduction to algorithms (Q2747613):
Displaying 50 items.
- Mapping workflow applications with types on heterogeneous specialized platforms (Q645854) (← links)
- Counting subset sums of finite Abelian groups (Q645970) (← links)
- Contracting preference relations for database applications (Q646521) (← links)
- Analysing DNA microarray data using Boolean techniques (Q646703) (← links)
- Parallelization of nullspace algorithm for the computation of metabolic pathways (Q647302) (← links)
- New geometry-inspired relaxations and algorithms for the metric Steiner tree problem (Q647390) (← links)
- Optimization of heuristic search using recursive algorithm selection and reinforcement learning (Q647446) (← links)
- On computing the minimum 3-path vertex cover and dissociation number of graphs (Q650941) (← links)
- Evolutionary algorithms and dynamic programming (Q652137) (← links)
- An efficient scaling algorithm for the minimum weight bibranching problem (Q652532) (← links)
- Breaking an orbit-based symmetric cryptosystem (Q652864) (← links)
- The two variable per inequality abstract domain (Q656848) (← links)
- Low order-value approach for solving var-constrained optimization problems (Q656968) (← links)
- Switching codes and designs (Q658111) (← links)
- The cycle switching graph of the Steiner triple systems of order 19 is connected (Q659722) (← links)
- Linear loss networks (Q660138) (← links)
- An asymptotic formula for counting subset sums over subgroups of finite fields (Q661990) (← links)
- An overview of channel assignment methods for multi-radio multi-channel wireless mesh networks (Q666110) (← links)
- On collaborative tracking of a target group using binary proximity sensors (Q666188) (← links)
- Adaptive broadcast by fault-tolerant spanning tree switching (Q666207) (← links)
- Unified parallel encoding and decoding algorithms for Dandelion-like codes (Q666249) (← links)
- More Turán-type theorems for triangles in convex point sets (Q668054) (← links)
- Computing \(\{2,4\}\) and \(\{2,3\}\)-inverses by using the Sherman-Morrison formula (Q668524) (← links)
- A guide on spectral methods applied to discrete data in one dimension (Q670438) (← links)
- Faster approximate string matching for short patterns (Q692899) (← links)
- An improved approximation algorithm for the most points covering problem (Q692901) (← links)
- Layered hashing algorithm for real-time systems (Q692912) (← links)
- On clustering \textsc{Dag}s for task-hungry computing platforms (Q692974) (← links)
- Algorithmic parameterization of mixed treatment comparisons (Q693345) (← links)
- Simple and optimal output-sensitive construction of contour trees using monotone paths (Q705555) (← links)
- Feasibility of motion planning on acyclic and strongly connected directed graphs (Q708329) (← links)
- MonALISA: an agent based, dynamic service system to monitor, control and optimize distributed systems (Q711742) (← links)
- Twin Mahalanobis distance-based support vector machines for pattern recognition (Q712487) (← links)
- Set-based broadcast scheduling for minimizing the worst access time of multiple data items in wireless environments (Q712676) (← links)
- Scheduling tasks with exponential duration on unrelated parallel machines (Q714038) (← links)
- The index of a binary word (Q714791) (← links)
- An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs (Q714793) (← links)
- The binary perfect phylogeny with persistent characters (Q714807) (← links)
- Using hash tables to manage the time-storage complexity in a point location problem: application to explicit model predictive control (Q716135) (← links)
- Computation of stationary 3D halo currents in fusion devices with accuracy control (Q728555) (← links)
- Path optimization with limited sensing ability (Q729301) (← links)
- Directed width parameters and circumference of digraphs (Q730003) (← links)
- Rank/select on dynamic compressed sequences and applications (Q732036) (← links)
- Exact cover with light (Q732172) (← links)
- A simple greedy algorithm for a class of shuttle transportation problems (Q732773) (← links)
- Resource restricted computability theoretic learning: Illustrative topics and problems (Q733738) (← links)
- On codeword design in metric DNA spaces (Q734201) (← links)
- Paper-craft from 3D polygonal models using generalized cylinders (Q735509) (← links)
- An elementary theory of product-line variations (Q736801) (← links)
- Multi-path algorithms for minimum-colour path problems with applications to approximating barrier resilience (Q742417) (← links)
