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