Logical Tree with its derived basic Thesaurus
003 ACM_al, Algorithms and Complexity
Algorithms are fundamental to computer science and software engineering The real-world performance of any software system depends on only two things: (1) the algorithms chosen and (2) the suitability and efficiency of the various layers of implementation Good algorithm design is therefore crucial for the performance of all software systems Moreover, the study of algorithms provides insight into the intrinsic nature of the problem as well as possible solution techniques independent of programming language, programming paradigm, computer hardware, or any other implementation aspect
An important part of computing is the ability to select algorithms appropriate to particular purposes and to apply them, recognizing the possibility that no suitable algorithm may exist This facility relies on understanding the range of algorithms that address an important set of well-defined problems, recognizing their strengths and weaknesses, and their suitability in particular contexts
|
Global Keywords
Algorithmic analysis, Algorithmic strategies, Computing algorithms, Distributed algorithms, Computability, Automata, Cryptographic algorithms, Geometric algorithms, Parallel algorithms, Complexity classes, Classes P and NP, P and NP, Automata theory.
|
003001 AL1, Basic algorithmic analysis
Asymptotic analysis, Complexity bounds, Best case behaviors, Average case behaviors, Worst case behaviors, Big "O,", Little "o," , Omega, Theta notation, Complexity classes, Performance, Empirical measurements, Time algorithms tradeoffs, Space algorithms tradeoffs, Algorithms tradeoffs, Recurrence relations, Recursive algorithms,
003002 AL2, Algorithmic strategies
Brute-force, Algorithms, Greedy algorithms, Divide-and-conquer, Backtracking, Branch-and-bound, Heuristics, Pattern matching, String/text algorithms, Numerical algorithms, Approximation algorithms.
003003 AL3, Fundamental computing algorithms
Numerical algorithms, Sequential search algorithms, Binary search algorithms, Search algorithms, Quadratic, Sorting algorithms, O(N log N), Sorting algorithms, Quicksort, Heapsort, Mergesort, Hash tables, Collision-avoidance, Binary search, Search trees, Graphs Representations, Adjacency list, Adjacency matrix, Depth traversals, Breadth-first traversals, Shortest-path algorithms, Dijkstra, Floyd Algorithms, Transitive closure, spanning tree, prim, Kruskal, Topological sort.
003004 AL4, Distributed algorithms
Consensus, Election, Termination detection, Fault tolerance, Stabilization
003005 AL5, Basic computability
Finite-state machines, Context-free grammars, Tractable problems, Intractable problems, Uncomputable functions, Halting problem, Uncomputability Implications.
003006 AL6, The complexity classes P and NP
Classes P, Classes NP, NP-completeness, Cook's theorem, NP-complete, Reduction techniques.
003007 AL7, Automata theory
Deterministic, Finite automata, Dfas, Nondeterministic, Nfas, Dfas Equivalence, Nfas Equivalence, Regular expressions, Pumping lemma, Regular expressions, Push-down automata, Pdas, Pdas Relationship, Context-free grammars, Context-free grammars, Turing machines, Sets, Languages, Chomsky hierarchy, Church-Turing thesis.
003008 AL8, Advanced algorithmic analysis
Amortized analysis, Algorithms, Online, Offline, Randomized, Dynamic programming, Combinatorial, Optimization.
003009 AL9, Cryptographic algorithms
Historical, Cryptography, Private-key, Key-exchange problem, Public-key, Digital signatures, Security protocols, Applications, Zero-knowledge, Proofs, Authentication.
003010 AL10, Geometric algorithms
Line segments, Properties, Intersections, Convex hull, Algorithms.
003011 AL11, Parallel algorithms
PRAM model, Exclusive, Concurrent, Reads, Writes, Pointer jumping, Brent's theorem,
Work efficiency, Brent.
|
|
|
E-mail 
