scientific article; zbMATH DE number 194559
From MaRDI portal
Publication:4692525
cryptologydynamic programmingexhaustive searchgeometric algorithmsgraph algorithmslinear programmingmathematical algorithmsNP-complete problemsparsingPASCALpattern matchingstring processing
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) General topics in the theory of software (68N01) Data structures (68P05) Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)
Recommendations
Cited in
(22)- Easing the conscience of the guilty net
- The optimization of an organizational restructuring problem.
- Table design in dynamic programming
- On the stack-size of general tries
- Analysis of algorithms. An active learning approach
- Algorithmen
- scientific article; zbMATH DE number 5688248 (Why is no real title available?)
- Analysis für Informatiker
- Introduction to algorithms.
- scientific article; zbMATH DE number 1033260 (Why is no real title available?)
- scientific article; zbMATH DE number 1052004 (Why is no real title available?)
- scientific article; zbMATH DE number 1178976 (Why is no real title available?)
- On optimizing multiplications of sparse matrices
- scientific article; zbMATH DE number 2155528 (Why is no real title available?)
- scientific article; zbMATH DE number 194823 (Why is no real title available?)
- scientific article; zbMATH DE number 1864855 (Why is no real title available?)
- Positioning an autonomous off-road vehicle by using fused DGPS and inertial navigation
- Lower bounds for the matrix chain ordering problem (extended abstract)
- Agent-Based Modeling and Computer Languages
- Renovating the collected algorithms from ACM
- A limit theorem for “quicksort”
- Linear-time graph algorithms in GP 2
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4692525)
