The algorithm design manual
From MaRDI portal
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Data structures (68P05) Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Analysis of algorithms (68W40)
Recommendations
Cited in
(74)- Sequencing surgical cases in a day-care environment: an exact branch-and-price approach
- A distributed Kalman filtering algorithm with fast finite-time convergence for sensor networks
- Localized method of approximate particular solutions with polynomial basis functions
- Approximations of arbitrary relations by partial orders
- How difficult is nonlinear optimization? A practical solver tuning approach, with illustrative results
- Model reduction of distributed nonstationary LPV systems
- Timed runtime monitoring for multiparty conversations
- Decomposition methods based on articulation vertices for degree-dependent spanning tree problems
- Median filtering: a new insight
- Stony Brook
- Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem
- Anytime coalition structure generation in multi-agent systems with positive or negative externalities
- Quality analysis in acyclic production networks
- Confluence up to garbage in graph transformation
- Safety in s-t paths, trails and walks
- Explicit physics-informed neural networks for nonlinear closure: the case of transport in tissues
- Fast three-valued abstract bit-vector arithmetic
- Optimal design of electromagnetic devices: development of an efficient optimization tool based on smart mutation operations implemented in a genetic algorithm
- A simplified algorithm computing all \(s\)-\(t\) bridges and articulation points
- Linear-space data structures for range mode query in arrays
- \textsc{QualityCover}: efficient binary relation coverage guided by induced knowledge quality
- A constant-time algorithm for middle levels Gray codes
- Properties of the \(d\)-dimensional Earth mover's problem
- Numerical solution of two-dimensional nonlinear sine-Gordon equation using localized method of approximate particular solutions
- Using basis dependence distance vectors in the modified Floyd-Warshall algorithm
- On kernelization and approximation for the vector connectivity problem
- Identifying codes on directed de Bruijn graphs
- A quantum algorithm for Viterbi decoding of classical convolutional codes
- Practical distribution-sensitive point location in triangulations
- Robust fixed-lag smoothing under model perturbations
- Shapley-Folkman-Lyapunov theorem and asymmetric first price auctions
- A Markov chain on the solution space of edge colorings of bipartite graphs
- Weak bisimulations for fuzzy automata
- Range Majority in Constant Time and Linear Space
- Algorithm engineering: Concepts and practice
- An obstruction to solvability of the reach control problem using affine feedback
- On implementing the symbolic preprocessing function over Boolean polynomial rings in Gröbner basis algorithms using linear algebra
- An Event-Driven Algorithm for Agents on the Web
- Bisimulations for fuzzy automata
- scientific article; zbMATH DE number 1064419 (Why is no real title available?)
- A note on testing axioms of revealed preference
- Method of searching for global extremum of a continuous function on a simplex
- Low dimensional manifolds in reservoir computers
- Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions
- Some problems and algorithms related to the weight order relation on the n-dimensional Boolean cube
- scientific article; zbMATH DE number 7456056 (Why is no real title available?)
- Algorithms. Design techniques and analysis
- Dynamic programming deconstructed: transformations of the Bellman equation and computational efficiency
- Replacing conjectures by positive knowledge: inferring proven precise worst-case execution time bounds using symbolic execution
- The Power of Linear-Time Data Reduction for Maximum Matching
- Path length statistics in reservoir computers
- A resource-efficient algorithm for study the growth in finite two-generator groups of exponent 5
- Complete search for feature selection in decision trees
- Monte Carlo solution of combinatorial optimization problems
- Solving partition problems almost always requires pushing many vertices around
- Noise-robust modes of the retinal population code have the geometry of ``ridges and correspond to neuronal communities
- Renovating the collected algorithms from ACM
- The secret life of keys: on the calculation of mechanical lock systems
- Backtracking Algorithms for Constructing the Hamiltonian Decomposition of a 4-regular Multigraph
- Linear-time graph algorithms in GP 2
- A localized approach for the method of approximate particular solutions
- Polynomial approximations of electronic wave functions
- Exploring \textit{ab initio} machine synthesis of quantum circuits
- Cognitive and computational complexity: considerations from mathematical problem solving
- Computation of the greatest simulations and bisimulations between fuzzy automata
- Approximating the directed Hausdorff distance
- An ILP approach to determine smallest 4-regular non-Hamiltonian, nontraceable, and nonhomogeneously traceable graphs
- A unified approach to link prediction in collaboration networks
- Modelling and solving the university course timetabling problem with hybrid teaching considerations
- From Turing to Peirce. A semiotic interpretation of computation
- Reachability in temporal graphs under perturbation
- From point patterns to networks: to what extent does the Delaunay triangulation reproduce key spatial and density information?
- Functional correctness of C implementations of Dijkstra's, Kruskal's, and Prim's algorithms
- Nondeterministic automata: equivalence, bisimulations, and uniform relations
This page was built for publication: The algorithm design manual
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3499247)
