Algorithms and Data Structures
From MaRDI portal
Publication:5900028
DOI10.1007/978-3-540-77978-0zbMath1146.68069OpenAlexW2999097525WikidataQ54200828 ScholiaQ54200828MaRDI QIDQ5900028
Publication date: 28 May 2008
Full work available at URL: https://doi.org/10.1007/978-3-540-77978-0
Analysis of algorithms (68W40) Searching and sorting (68P10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)
Related Items
Towards faster polynomial-time lattice reduction ⋮ Secure wire shuffling in the probing model ⋮ GLOUDS: representing tree-like graphs ⋮ Red–green refinement of simplicial meshes in $d$ dimensions ⋮ Integer codes correcting single errors and random asymmetric errors within a byte ⋮ 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] ⋮ System \(\text{Z}^{\text{FO}}\): default reasoning with system Z-like ranking functions for unary first-order conditional knowledge bases ⋮ Parallel Weighted Random Sampling ⋮ Integer codes correcting/detecting burst errors within one Byte and detecting burst errors within two bytes ⋮ Integer codes correcting burst and random asymmetric errors within a byte ⋮ Book review of: Kurt Mehlhorn, Peter Sanders, Algorithms and data structures: the basic toolbox ⋮ Certifying algorithms ⋮ Generating star-shaped blocks for scaled boundary multipatch IGA ⋮ Identifying consistent statements about numerical data with dispersion-corrected subgroup discovery ⋮ Integer codes correcting single errors and burst asymmetric errors within a byte ⋮ New local searches for solving the multi-source Weber problem ⋮ Determining optimal multilevel Monte Carlo parameters with application to fault tolerance ⋮ Loop invariants ⋮ Shortest-path queries in static networks ⋮ Applications of dimensionality reduction and exponential sums to graph automorphism ⋮ Graph Transformation by Computational Category Theory ⋮ Lempel-Ziv-78 compressed string dictionaries ⋮ A discrete theory and efficient algorithms for forward-and-backward diffusion filtering ⋮ A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon ⋮ The spectra of reducible matrices over complete commutative idempotent semifields and their spectral lattices ⋮ Multi-Finger Binary Search Trees ⋮ Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics ⋮ Probabilistic model based path planning ⋮ Real-time Traffic Assignment Using Engineered Customizable Contraction Hierarchies ⋮ Integer codes correcting sparse byte errors ⋮ Comparative study and proof of single-pass connected components algorithms ⋮ Unidirectional solid burst correcting integer codes ⋮ Fast reduction of algebraic lattices over cyclotomic fields ⋮ Synchronizing Almost-Group Automata ⋮ ReHub ⋮ Scalable SAT solving in the cloud
Uses Software
