Notes
Other
Initializing search
    • Algorithms
    • Distributed
    • ML
    • Security
    • Theory
        • All Pairs Shortest Paths
        • Matrix Multiplication
        • Floyd-Warshall
        • Johnson's Algorithm
      • Disjoint Sets
        • Graph Algorithms
        • Breadth-First Search
        • Depth-First Search
        • Topological Sort & SCC
        • Flow Networks
        • Ford-Fulkerson Method
        • Minimum Spanning Tree
        • Kruskal's Algorithm
        • Prim's Algorithm
      • Multithreaded Algorithms
        • Single Source Shortest Path
        • Bellman-Ford Algorithm
        • DAG Shortest Path
        • Dijkstra's Algorithm
        • Preliminary Approaches
        • Proto van Emde Boas
        • Van Emde Boas Tree
      • ⌘ Resources
      • ABD Algorithm
      • PRAM Algorithms
        • Algorithm Groote
        • Algorithm W
        • Algorithm X
      • Simulations
      • Systems & Models
        • 1. Parallel Computation
        • 2. Parallelization
        • 3. Speedup & PRAMs
        • 4. Analysing
        • 5. Enumeration
        • 6. DO-ALL
        • 7. Chunking & Prefix
        • 8. Parallel Prefix
        • 9. Failure Models
        • 10. Redundancy
        • 11. Crashes
        • 12. Optimized W
        • 13. Algorithm X
        • 14. Groote Algorithm
        • 15. Simulation
        • 16. Majorities
        • 17. Atomicity
        • 18. Transition Systems
        • 19. Quorums
        • 20. HW architectures
        • 21. Zero-time sorter
        • 22. Cubes
        • 23. Architectures
        • 24. Omega Networks
        • 25. Parallel W
      • Types of Learning
      • Datasets & Attributes
        • Bayesian Inference
        • Decision Trees
        • Ensemble Learners
        • K-Nearest Neighbors
        • Neural Networks
        • Regression
        • Rule-Based Learning
        • Support Vector Machines
        • Basics
        • Agglomerative
        • DBSCAN
        • Fuzzy C-means
        • K-means
        • Basics
        • Detection Methods
      • Formulas
      • ⌘ Resources
      • Setuid Programs
      • Buffer Overflow
      • CSRF & XSS
      • SQL injection
      • Meltdown & Spectre
      • Sniffing & Spoofing
      • TCP Attacks
      • Firewalls
      • Terminology
      • Linux Commands
      • ⌘ Resources
        • Regular Languages
        • Context-Free Languages
        • Turing Machines
      • Computability
        • 1. Languages
        • 2. DFAs
        • 3. NFAs
        • 4. Regular Languages
        • 5. Regular Expressions
        • 6. Pumping Lemma
        • 7. Context Free Languages
        • 8. CFG Normal Forms
        • 9. Pushdown Automata
        • 10. PDAs and CFGs
        • 11. Pumping Lemma for CFGs
        • 12. Turing Machines
        • 13. TM Variations
        • 14. Chomsky Hierarchy
        • 15. UTM & Enumerators
        • 16. Uncountability
        • 17. Decidability
        • 18. Undecidability
        • 19. Undecidable Problems
        • 20. Reductions
        • 21. Post-Correspondence
        • 22. Time Complexity
        • 23. NP-Complete
        • 24. NP-Reductions
        • 25. Space Complexity
      • ⌘ Resources

    ⌘ Resources

    • Theory cheat sheet
    • CFG developer
    Previous 25. Space Complexity
    Made with Material for MkDocs