The following pages link to Algorithms and Data Structures (Q5900028):
Displaying 36 items.
- Book review of: Kurt Mehlhorn, Peter Sanders, Algorithms and data structures: the basic toolbox (Q458475) (← links)
- Certifying algorithms (Q465678) (← links)
- Integer codes correcting single errors and burst asymmetric errors within a byte (Q509896) (← links)
- New local searches for solving the multi-source Weber problem (Q512988) (← links)
- Applications of dimensionality reduction and exponential sums to graph automorphism (Q551192) (← links)
- Lempel-Ziv-78 compressed string dictionaries (Q724216) (← links)
- System \(\text{Z}^{\text{FO}}\): default reasoning with system Z-like ranking functions for unary first-order conditional knowledge bases (Q1678418) (← links)
- Integer codes correcting burst and random asymmetric errors within a byte (Q1707866) (← links)
- Identifying consistent statements about numerical data with dispersion-corrected subgroup discovery (Q1741345) (← links)
- A discrete theory and efficient algorithms for forward-and-backward diffusion filtering (Q1799615) (← links)
- Generating star-shaped blocks for scaled boundary multipatch IGA (Q1979740) (← links)
- Determining optimal multilevel Monte Carlo parameters with application to fault tolerance (Q2006545) (← links)
- Probabilistic model based path planning (Q2066244) (← links)
- Unidirectional solid burst correcting integer codes (Q2089250) (← links)
- Fast reduction of algebraic lattices over cyclotomic fields (Q2096520) (← links)
- Scalable SAT solving in the cloud (Q2118345) (← links)
- Towards faster polynomial-time lattice reduction (Q2128584) (← links)
- Secure wire shuffling in the probing model (Q2128997) (← links)
- Integer codes correcting burst asymmetric within a byte and double asymmetric errors. [Integer codes correcting burst asymmetric errors within a byte and double asymmetric errors] (Q2179516) (← links)
- A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon (Q2300726) (← links)
- Integer codes correcting sparse byte errors (Q2325306) (← links)
- Comparative study and proof of single-pass connected components algorithms (Q2331087) (← links)
- GLOUDS: representing tree-like graphs (Q2634715) (← links)
- Integer codes correcting single errors and random asymmetric errors within a byte (Q2661853) (← links)
- The spectra of reducible matrices over complete commutative idempotent semifields and their spectral lattices (Q2817078) (← links)
- Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics (Q2827798) (← links)
- Graph Transformation by Computational Category Theory (Q3059706) (← links)
- Red–green refinement of simplicial meshes in $d$ dimensions (Q4561371) (← links)
- Real-time Traffic Assignment Using Engineered Customizable Contraction Hierarchies (Q4984867) (← links)
- Parallel Weighted Random Sampling (Q5075804) (← links)
- Multi-Finger Binary Search Trees (Q5091047) (← links)
- Loop invariants (Q5176169) (← links)
- Shortest-path queries in static networks (Q5176178) (← links)
- ReHub (Q5266603) (← links)
- Synchronizing Almost-Group Automata (Q5859664) (← links)
- Integer codes correcting/detecting burst errors within one Byte and detecting burst errors within two bytes (Q6125421) (← links)
