Concurrency control algorithms
Peterson's algorithm (or Peterson's solution) is a concurrent programming algorithm for mutual exclusion that allows two or more processes to share a single-use resource without conflict, using only shared memory for communication. It was formulated by in 1981. While Peterson's original formulation worked with only two processes, the algorithm can be generalized for more than two. (Wikipedia).
Heap Sort - Intro to Algorithms
This video is part of an online course, Intro to Algorithms. Check out the course here: https://www.udacity.com/course/cs215.
From playlist Introduction to Algorithms
Breadth-first search, visualized | Graph Algorithm 1
Play with the visualization yourself, with random edges each time you refresh the page: https://jazonjiao.github.io/bfs/ Source code: https://github.com/JazonJiao/Manim.js/tree/master/Graph%20Algorithms BGM: Cjbeards - Dreams
From playlist Graph Algorithms
Introduction to Algorithms - What are they and how are they useful?
#3B1B #SoMe2 This is my submission for this year's SoME, SoME2!! I hope you enjoy, and please feel free to leave any comments. Any feedback is hugely appreciated~! ーーーーーーーーーーーーーーーーーーーーーーー Time Stamps: 00:00 Intro 00:37 Introduction to Algorithms 03:47 Exploring Algorithms - Binary Searc
From playlist Summer of Math Exposition 2 videos
👉 Learn about graphing linear equations. A linear equation is an equation whose highest exponent on its variable(s) is 1. i.e. linear equations has no exponents on their variables. The graph of a linear equation is a straight line. To graph a linear equation, we identify two values (x-valu
From playlist ⚡️Graph Linear Equations | Learn About
Summary for graph an equation in Standard form
👉 Learn about graphing linear equations. A linear equation is an equation whose highest exponent on its variable(s) is 1. i.e. linear equations has no exponents on their variables. The graph of a linear equation is a straight line. To graph a linear equation, we identify two values (x-valu
From playlist ⚡️Graph Linear Equations | Learn About
Graph Data Structure 4. Dijkstra’s Shortest Path Algorithm
This is the fourth in a series of computer science videos about the graph data structure. This is an explanation of Dijkstra’s algorithm for finding the shortest path between one vertex in a graph and another. Indeed, this explains how Dijkstra’s shortest path algorithm generates a set o
From playlist Path Finding Algorithms
Rosalind Cameron - Surrounding cops and robber: a vertex-pursuit game
Rosalind Cameron (University of Canterbury) presents “Surrounding cops and robber: a vertex-pursuit game”, 17 February 2021 (CMSA Combinatorics Seminar).
From playlist CMSA Combinatorics Seminar
Nicolas Curien: Random maps and hyperbolic surfaces
CONFERENCE Recorded during the meeting " Structures on Surfaces " the May 02, 2022 by the Centre International de Rencontres Mathématiques (Marseille, France) Filmmaker: Guillaume Hennenfent Find this video and other talks given by worldwide mathematicians on CIRM's Audiovisual Mathema
From playlist Probability and Statistics
Does your job match your personality? | Jordan Peterson | Big Think
Does your job match your personality? New videos DAILY: https://bigth.ink Join Big Think Edge for exclusive video lessons from top thinkers and doers: https://bigth.ink/Edge ---------------------------------------------------------------------------------- Your personality will partially d
From playlist Jordan Peterson | Big Think
Modular forms and multiple q-Zeta values (Lecture 2) by Ulf Kuehn
PROGRAM : ALGEBRAIC AND ANALYTIC ASPECTS OF AUTOMORPHIC FORMS ORGANIZERS : Anilatmaja Aryasomayajula, Venketasubramanian C G, Jurg Kramer, Dipendra Prasad, Anandavardhanan U. K. and Anna von Pippich DATE & TIME : 25 February 2019 to 07 March 2019 VENUE : Madhava Lecture Hall, ICTS Banga
From playlist Algebraic and Analytic Aspects of Automorphic Forms 2019
Motivic action on coherent cohomology of Hilbert modular varieties - Aleksander Horawa
Joint IAS/Princeton University Number Theory Seminar Topic: Motivic action on coherent cohomology of Hilbert modular varieties Speaker: Aleksander Horawa Affiliation: University of Michigan Date: February 03, 2022 A surprising property of the cohomology of locally symmetric spaces is tha
From playlist Mathematics
How do you graph an equation using the intercept method
👉 Learn about graphing linear equations. A linear equation is an equation whose highest exponent on its variable(s) is 1. i.e. linear equations has no exponents on their variables. The graph of a linear equation is a straight line. To graph a linear equation, we identify two values (x-valu
From playlist ⚡️Graph Linear Equations | Learn About
Using Graphs with Linear Functions
Evaluate linear functions from their graphs. Draw the graph of a linear function. Write the equation of a linear function from its graph.
From playlist Algebra 1
Bernadette Perrin Riou - Promenade dans le jardin des symboles modulaires.
Je revisiterai un certain nombre de notions ou de résultats sur les symboles modulaires de Pollack-Stevens, le produit de Petersson ou les séries d'Eisenstein qui nous ont été utiles pour mettre en place dans Pari/GP les fonctions L p-adiques associées à des formes modulaires pour T0(N), l
From playlist The Paris-London Number Theory Seminar, Oct. 2019
Idealness of k-wise intersecting families, by Tony Huynh
CMSA Combinatorics Seminar, 6 October 2020
From playlist CMSA Combinatorics Seminar
MIT MAS.S62 Cryptocurrency Engineering and Design, Spring 2018 Instructor: Neha Narula View the complete course: https://ocw.mit.edu/MAS-S62S18 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP61KHzhg3JIJdK08JLSlcLId zkLedger, a private, auditable transaction ledger for
From playlist MIT MAS.S62 Cryptocurrency Engineering and Design, Spring 2018
Effective short conjugators and volumes....pants complexes - Tarik Aougab
Tarik Aougab, Yale October 5, 2015 http://www.math.ias.edu/wgso3m/agenda 015-2016 Monday, October 5, 2015 - 08:00 to Friday, October 9, 2015 - 12:00 This workshop is part of the topical program "Geometric Structures on 3-Manifolds" which will take place during the 2015-2016 academic year
From playlist Workshop on Geometric Structures on 3-Manifolds
Math for Liberal Studies: The Greedy Coloring Algorithm
In this video, we use the Greedy Coloring Algorithm to solve a couple of graph coloring problems. For more info, visit the Math for Liberal Studies homepage: http://webspace.ship.edu/jehamb/mls/index.html
From playlist Math for Liberal Studies
Topological Sort, visualized | Graph Algorithm 5
Play with the visualization yourself, with random edges each time you refresh the page: https://jazonjiao.github.io/topsort/ Source code: https://github.com/JazonJiao/Manim.js/ BGM: 闫东炜 - 风屿
From playlist Graph Algorithms
GraphData: New Developments and Research Applications
GraphData is an extensive curated database of simple graphs and their properties available in Mathematica as a built-in data paclet and in Wolfram|Alpha via natural language queries. GraphData was first introduced in Mathematica Version 6, and the number of graphs, property count, and frac
From playlist Wolfram Technology Conference 2013