scientific article; zbMATH DE number 193197
From MaRDI portal
Publication:4040055
complexitycryptographydata structuresefficiency of algorithmshistorical notesNP-completenessprobabilistic algorithms
Software, source code, etc. for problems pertaining to combinatorics (05-04) Software, source code, etc. for problems pertaining to number theory (11-04) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Algorithms in computer science (68W99) Cryptography (94A60)
Recommendations
Cited in
(57)- Minimum disclosure proofs of knowledge
- The generation of random numbers that are probably prime
- Solving the satisfiability problem by using randomized approach
- An almost-constant round interactive zero-knowledge proof
- Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
- Convergence rates for steady-state derivative estimators
- Characterization and processing of simple prefixed-chain recursion
- New approaches for understanding the asymptotic complexity of \(A^*\) tree searching.
- The mathematical modeling of heuristics.
- On the distribution for the duration of a randomized leader election algorithm
- The determinant of a tree's neighborhood matrix
- Perfect hashing
- On \(k\)-ary \(n\)-cubes: Theory and applications.
- The minimum labeling spanning trees
- Design and analysis of randomized algorithms. Introduction to design paradigms.
- Fast rectangular matrix multiplication and QR decomposition
- The exact fitting problem in higher dimensions
- New results on the Baire partial quasi-metric space, fixed point theory and asymptotic complexity analysis for recursive programs
- Fixed point theorems in generalized metric spaces with applications to computer science
- On fixed point theory in partially ordered sets and an application to asymptotic complexity of algorithms
- On quasi-metric aggregation functions and fixed point theorems
- Table design in dynamic programming
- A new contribution to the fixed point theory in partial quasi-metric spaces and its applications to asymptotic complexity analysis of algorithms
- On fixed point theory in topological posets, extended quasi-metric spaces and an application to asymptotic complexity of algorithms
- Path-based depth-first search for strong and biconnected components
- scientific article; zbMATH DE number 5960581 (Why is no real title available?)
- A MapReduce-based distributed SVM ensemble for scalable image classification and annotation
- scientific article; zbMATH DE number 3934391 (Why is no real title available?)
- scientific article; zbMATH DE number 3934393 (Why is no real title available?)
- scientific article; zbMATH DE number 4039250 (Why is no real title available?)
- scientific article; zbMATH DE number 4058818 (Why is no real title available?)
- Algorithmics for beginners. For students, teachers and pupils of the subjects of mathematics and informatics
- scientific article; zbMATH DE number 53101 (Why is no real title available?)
- scientific article; zbMATH DE number 54110 (Why is no real title available?)
- scientific article; zbMATH DE number 108389 (Why is no real title available?)
- scientific article; zbMATH DE number 568873 (Why is no real title available?)
- scientific article; zbMATH DE number 711994 (Why is no real title available?)
- Computing the reciprocal of units in Galois rings
- An elementary approach to design and analysis of algorithms
- Analysis of quickselect : an algorithm for order statistics
- Exchanging disks in the tower of hanoi
- New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces
- Algorithmic mathematics
- Lower bounds for the matrix chain ordering problem (extended abstract)
- Algorithms from THE BOOK
- On Fixed Point Theory in Partially Ordered (Quasi-)metric Spaces and an Application to Complexity Analysis of Algorithms
- How to count quickly and accurately: a unified analysis of probabilistic counting and other related problems
- Accelerating machines: a review
- scientific article; zbMATH DE number 7657198 (Why is no real title available?)
- An introduction to the analysis of algorithms.
- On aggregation of normed structures
- Fixed points on partially ordered quasi-metric spaces
- The Baire partial quasi-metric space: a mathematical tool for asymptotic complexity analysis in computer science
- Gaps, ambiguity, and establishing complexity-class containments via iterative constant-setting
- Science and practice of modelling
- Job distribution algorithms
- Searching for important factors in simulation models with many factors: Sequential bifurcation
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 Q4040055)
