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
Reliable Broadcast: Overview and Algorithms
Graph Chatbot
Related lectures (28)
Total Order Broadcast: Basics and Consensus Equivalences
Explores total order broadcast and its equivalence to consensus in reliable systems.
Solving Parity Games in Practice
Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.
Group Membership and View Synchrony
Explores group membership and view synchrony in distributed systems, ensuring accurate knowledge and coordinated views.
Algorithms & Growth of Functions
Covers optimization algorithms, stable matching, and Big-O notation for algorithm efficiency.
Assessment of Learning: Validity and Reliability
Explores the concepts of validity and reliability in assessment in higher education.
Search Algorithms: Abductive Reasoning
Covers search algorithms, focusing on abductive reasoning and heuristic search strategies.
Register Swapping Techniques
Covers register swapping techniques, consensus algorithms, and winner determination.
Untitled
Algorithms in Computer Science: Search and Sort Techniques
Provides an overview of essential search and sort algorithms in computer science.
Reliable Broadcast: Causal Order
Explores reliable broadcast algorithms, focusing on causal order and uniform reliability, with exercises on failure detector properties and memory optimization.
Entropy and Algorithms: Applications in Sorting and Weighing
Covers the application of entropy in algorithms, focusing on sorting and decision-making strategies.
Effective Teaching Evaluations: Dimensions and Formulation Tips
Discusses the multidimensional nature of teaching evaluations and offers tips for formulating effective questions.
Causal Broadcast: Understanding Ordering of Messages
Covers causal broadcast, ensuring messages are delivered in a causal order using algorithms and reliable broadcast.
Untitled
Distinct Elements: Count and Hash Functions
Covers counting distinct elements using hash functions and the median trick.
Assessment Process Design
Focuses on designing an assessment process for effective measurement in various settings.
Taylor Polynomial: Order, Development, and Limits
Explores Taylor polynomials, including order, development, limits, and algebraic operations.
Recursive Functions: Examples and Applications
Explores recursive functions, including factorials and Fibonacci sequences, and their scope and namespaces.
Student Evaluation of Teaching: Effective Strategies
Discusses the importance of student evaluations in improving teaching effectiveness and understanding student perspectives.
Closest Vector Problem: Voronoi Cells
Explores the Closest Vector Problem and Voronoi cells in lattice reduction algorithms.
Previous
Page 1 of 2
Next