Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Lecture
Total Order Broadcast: Basics and Consensus Equivalences
Graph Chatbot
Related lectures (30)
Reliable Broadcast: Overview and Algorithms
Explores reliable broadcast in distributed systems, presenting specifications, algorithms, and properties for different types of broadcast.
Taylor Polynomial: Order, Development, and Limits
Explores Taylor polynomials, including order, development, limits, and algebraic operations.
Assessment of Learning: Validity and Reliability
Explores the concepts of validity and reliability in assessment in higher education.
Group Membership and View Synchrony
Explores group membership and view synchrony in distributed systems, ensuring accurate knowledge and coordinated views.
Untitled
Register Swapping Techniques
Covers register swapping techniques, consensus algorithms, and winner determination.
Distinct Elements: Count and Hash Functions
Covers counting distinct elements using hash functions and the median trick.
Latent Tree Learning
Explores latent tree learning, covering node properties, sibling relationships, and algorithmic structure.
Reliable Broadcast: Causal Order
Explores reliable broadcast algorithms, focusing on causal order and uniform reliability, with exercises on failure detector properties and memory optimization.
Predicate Logic: Summary of Week 2
Covers the concept of universe of discourse and truth values in predicate logic.
Effective Teaching Evaluations: Dimensions and Formulation Tips
Discusses the multidimensional nature of teaching evaluations and offers tips for formulating effective questions.
Assessment Process Design
Focuses on designing an assessment process for effective measurement in various settings.
Improved Algorithm: Three-Color Parity Games
Introduces an improved algorithm for three-color parity games, focusing on progress measures, acceleration, and practical speed-up.
Connect Four: Winning Strategy
Explains the winning strategy in Connect Four by checking for winning combinations.
Student Evaluation of Teaching: Effective Strategies
Discusses the importance of student evaluations in improving teaching effectiveness and understanding student perspectives.
Solving Parity Games in Practice
Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.
Recursive Functions: Examples and Applications
Explores recursive functions, including factorials and Fibonacci sequences, and their scope and namespaces.
Propositional Logic: Inference Rules
Covers the interpretation of propositional logic and inference rules for implication, conjunction, and double negation.
Hidden Sub-group Problem and Simon Algorithm
Explores the hidden sub-group problem and Simon algorithm in quantum computing.
Coin Rendering: Part 1
Covers coin rendering and the limitations of the greedy algorithm in finding optimal solutions.
Previous
Page 1 of 2
Next