Encyclopedia of Algorithms
From MaRDI portal
Recommendations
Cited in
(25)- A universal concept for robust solving of shortest path problems in dynamically reconfigurable graphs
- A GRASP algorithm for the closest string problem using a probability-based heuristic
- A new representation of algorithmic approaches in the AlgoWiki encyclopedia
- Robust and approximately stable marriages under partial information
- Greed is good for deterministic scale-free networks
- Landmark diffusion maps (L-dMaps): accelerated manifold learning out-of-sample extension
- An effective compact formulation of the max cut problem on sparse graphs
- Encyclopedia of parallel computing.
- Pioneering the establishment of the foundations of the Internet of Things
- Encyclopedia of machine learning
- Checking oriented matroid isomorphism by means of canonical labeling
- Computing area in presentations of the trivial group
- Seeing Arboretum for the (partial k-) Trees
- High-dimensional circular quantum secret sharing using orbital angular momentum
- statistics
- Encyclopedia of algorithms. In 3 volumes
- From symmetry to asymmetry: generalizing TSP approximations by parametrization
- Remarks on some misconceptions about unequal probability sampling without replacement
- Bet-or-pass: adversarially robust Bloom filters
- Path-reporting distance oracles with linear size
- Some problems in distributed computational geometry
- Simple linear time algorithm for sorting strings in omega-order with applications
- Dynamic embeddings of dynamic single-source upward planar graphs
- Adversarially robust Bloom filters: monotonicity and betting
- Applications of machine learning in gravitational-wave research with current interferometric detectors
This page was built for publication: Encyclopedia of Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5900149)