Symmetric Encryption Algorithms: Understanding Block and Stream Ciphers
A deep dive into symmetric encryption algorithms, including block ciphers like AES and DES, stream ciphers, and their applications in modern cryptography.
Read More →Thoughts on machine learning, algorithm analysis, and the journey through computer science research. Exploring technical concepts, sharing learning experiences, and documenting project insights.
A deep dive into symmetric encryption algorithms, including block ciphers like AES and DES, stream ciphers, and their applications in modern cryptography.
Read More →Exploring public key cryptography systems, including the RSA algorithm, Diffie-Hellman key exchange, and how asymmetric encryption enables secure communication without shared secrets.
Read More →An introduction to the fundamental concepts of cryptography, exploring how secure communication systems work and why they are essential in modern computing.
Read More →Understanding cryptographic hash functions, their properties, applications in data integrity verification, digital signatures, and password storage systems.
Read More →Comprehensive guide to unit testing strategies, covering test case design, coverage metrics, mocking techniques, and best practices for writing maintainable test suites.
Read More →Exploring the fundamentals of software verification and validation, covering testing strategies, quality assurance techniques, and methods for building reliable software systems.
Read More →Exploring integration testing methodologies and continuous verification practices, including test automation, CI/CD pipelines, and strategies for maintaining software quality throughout development.
Read More →An introduction to formal methods for software verification, including model checking, theorem proving, and mathematical techniques for proving program correctness.
Read More →Upgrade the perceptron into a calibrated probabilistic classifier with logistic regression and its multiclass softmax extension, unpacking the sigmoid link, cross-entropy loss, gradient descent, and the bridge to modern neural networks.
Read More →Transition from probabilistic to discriminative models with the Perceptron algorithm, learning how linear classifiers use weighted features to make predictions and laying the foundation for neural networks.
Read More →Learn how to handle zero-frequency problems and overfitting in Naive Bayes through Laplace smoothing and understand the theoretical foundations of maximum likelihood estimation.
Read More →Learn how Naive Bayes bridges probabilistic reasoning and machine learning, using conditional independence assumptions to build powerful classifiers for spam detection, digit recognition, and more.
Read More →Learn how variable elimination dramatically reduces computational complexity in Bayesian network inference through strategic factor manipulation and elimination ordering.
Read More →Master d-separation algorithms for determining conditional independence in Bayesian networks and understand the foundation of probabilistic inference.
Read More →Worked guide for Logic for Computer Scientists Homework 3: scoping, inference proofs, CNF transformations, and predicate encodings.
Read More →A comprehensive review of advanced logic concepts including Hilbert Systems, the Tableaux Method, and Herbrand Semantics, showing how they feed into model checking with concrete transition-system examples.
Read More →Master Linear Temporal Logic (LTL) for specifying and verifying time-dependent properties of reactive systems, from safety invariants to liveness guarantees.
Read More →Explore non-monotonic reasoning systems where new information can invalidate previous conclusions, from the classic Tweety the bird example to stable models in logic programming.
Read More →Learn how Herbrand semantics reduce the infinite complexity of first-order logic interpretations to finite, manageable models through ground atoms and the Herbrand base.
Read More →An in-depth exploration of Hilbert proof systems and the Tableaux method for predicate logic, with detailed examples on quantifier manipulation and step-by-step proof construction.
Read More →Learn how the unification algorithm finds the most general unifier (MGU) that makes two terms identical, a fundamental operation in automated reasoning and logic programming.
Read More →Learn to analyze propositional formulas using truth tables and formation trees—essential tools for understanding logical structure and validity.
Read More →Master the fundamental building blocks of logical reasoning: propositions, truth values, and logical connectives that form the bedrock of computer science applications.
Read More →Discover how logic—the study of reasoning—forms the invisible foundation of every computer program, database query, and artificial intelligence system you build.
Read More →An introduction to Prolog's unique declarative paradigm, exploring facts, rules, queries, and how logic programming differs from imperative approaches.
Read More →A comprehensive guide to understanding and applying the Master's Theorem for analyzing divide-and-conquer algorithms.
Read More →An overview of my Spring 2026 courses focusing on Cryptography (CS-6343) and Software Verification and Validation (CS-5374), including learning objectives and planned topics.
Read More →An introduction to this blog and what I plan to share about my journey in computer science and machine learning research.
Read More →