34:42Abelian Repetition Threshold Revisited | CSR2022
Advanced
A 35-minute video from PDMI Logic Lab: “Abelian Repetition Threshold Revisited | CSR2022”.
PDMI Logic Lab
92 subscribers on YouTube
Shorts, livestreams, trailers and promos are never listed. Unless a curator approved this channel in full, only individually picked videos appear.
34:42
21:56Bounds for Synchronizing Markov Decision Processes | CSR2022
Advanced
A 22-minute video from PDMI Logic Lab: “Bounds for Synchronizing Markov Decision Processes | CSR2022”.
18:18Coloring a Dominating Set without Conflicts: q-Subset Square Coloring | CSR2022
Advanced
A 18-minute video from PDMI Logic Lab: “Coloring a Dominating Set without Conflicts: q-Subset Square Coloring | CSR2022”.
33:13Discrete versions of KKM lemma and their PPAD-completeness | CSR2022
Advanced
A 33-minute video from PDMI Logic Lab: “Discrete versions of KKM lemma and their PPAD-completeness | CSR2022”.
20:22Eternal Vertex Cover on Bipartite and Co-Bipartite Graphs | CSR2022
Advanced
A 20-minute video from PDMI Logic Lab: “Eternal Vertex Cover on Bipartite and Co-Bipartite Graphs | CSR2022”.
1:00:40Expanders in Higher Dimensions | CSR2022
Advanced
A 61-minute video from PDMI Logic Lab: “Expanders in Higher Dimensions | CSR2022”.
38:51Finite Ambiguity and Finite Sequentiality in Weighted Automata over Fields | CSR2022
Advanced
A 39-minute video from PDMI Logic Lab: “Finite Ambiguity and Finite Sequentiality in Weighted Automata over Fields | CSR2022”.
18:28Heterogeneous Multi-Commodity Network Flows Over Time | CSR2022
Advanced
A 18-minute video from PDMI Logic Lab: “Heterogeneous Multi-Commodity Network Flows Over Time | CSR2022”.
27:34How much randomness is needed to convert MA protocols to AM protocols? | CSR2022
Advanced
A 28-minute video from PDMI Logic Lab: “How much randomness is needed to convert MA protocols to AM protocols? | CSR2022”.
31:20Lossy Kernelization of Same-Size Clustering | CSR2022
Advanced
A 31-minute video from PDMI Logic Lab: “Lossy Kernelization of Same-Size Clustering | CSR2022”.
54:21Low-bandwidth Computation on Reed-Solomon-Encoded Data | CSR2022
Advanced
A 54-minute video from PDMI Logic Lab: “Low-bandwidth Computation on Reed-Solomon-Encoded Data | CSR2022”.
52:08New Bounds for the Flock-of-Birds Problem | CSR2022
Advanced
A 52-minute video from PDMI Logic Lab: “New Bounds for the Flock-of-Birds Problem | CSR2022”.
26:46Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time | CSR2022
Advanced
A 27-minute video from PDMI Logic Lab: “Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time | CSR2022”.
46:26On the proof theory of modal logics with fixed points | Thomas Studer, 13.05.2021
Advanced
A 46-minute video from PDMI Logic Lab: “On the proof theory of modal logics with fixed points | Thomas Studer, 13.05.2021”.
51:27On the relationship between stable models and program completion | Vladimir Lifshitz, 12.05.2021
Advanced
A 51-minute video from PDMI Logic Lab: “On the relationship between stable models and program completion | Vladimir Lifshitz, 12.05.2021”.
1:02:09Optimization-friendly generic mechanisms without money | CSR2022
Advanced
A 62-minute video from PDMI Logic Lab: “Optimization-friendly generic mechanisms without money | CSR2022”.
16:50Output Sensitive Fault Tolerant Maximum Matching | CSR2022
Advanced
A 17-minute video from PDMI Logic Lab: “Output Sensitive Fault Tolerant Maximum Matching | CSR2022”.
24:27Parameterized Algorithms for Finding Highly Connected Solution | CSR2022
Advanced
A 24-minute video from PDMI Logic Lab: “Parameterized Algorithms for Finding Highly Connected Solution | CSR2022”.
30:40Parameterized Complexity of List Coloring and Max Coloring | CSR2022
Advanced
A 31-minute video from PDMI Logic Lab: “Parameterized Complexity of List Coloring and Max Coloring | CSR2022”.
27:38Parameterized Complexity of Set-Restricted Disjoint Paths on Chordal Graphs | CSR2022
Advanced
A 28-minute video from PDMI Logic Lab: “Parameterized Complexity of Set-Restricted Disjoint Paths on Chordal Graphs | CSR2022”.
45:00Partial Vertex Cover on Graphs of Bounded Degeneracy | CSR2022
Advanced
A 45-minute video from PDMI Logic Lab: “Partial Vertex Cover on Graphs of Bounded Degeneracy | CSR2022”.
1:00:18Private Frequency Estimation via Projective Geometry | CSR2022
Advanced
A 60-minute video from PDMI Logic Lab: “Private Frequency Estimation via Projective Geometry | CSR2022”.
13:17Quotient structures and groups computable in polynomial time | CSR2022
Advanced
A 13-minute video from PDMI Logic Lab: “Quotient structures and groups computable in polynomial time | CSR2022”.
54:55Strictly positive provability logics: a survey | Lev Beklemishev, 12.05.2021
Advanced
A 55-minute video from PDMI Logic Lab: “Strictly positive provability logics: a survey | Lev Beklemishev, 12.05.2021”.
1:01:26Testing quantum computers and quantum mechanics | CSR2022
Advanced
A 61-minute video from PDMI Logic Lab: “Testing quantum computers and quantum mechanics | CSR2022”.
21:09The Fast Algorithm for Online k-server Problem on Trees | CSR2022
Advanced
A 21-minute video from PDMI Logic Lab: “The Fast Algorithm for Online k-server Problem on Trees | CSR2022”.
32:33The GKK Algorithm is the Fastest over Simple Mean-Payoff Games | CSR2022
Advanced
A 33-minute video from PDMI Logic Lab: “The GKK Algorithm is the Fastest over Simple Mean-Payoff Games | CSR2022”.
1:42:39Нижние оценки и вопросы оптимальности для систем доказательств | Дмитрий Ицыксон, 21.02.2022
Advanced
A 103-minute video from PDMI Logic Lab: “Нижние оценки и вопросы оптимальности для систем доказательств | Дмитрий Ицыксон, 21.02.2022”.
51:21Оценки удлинения высоты доказательства при устранении сечений | В.П. Оревков, 15.05.2021
Advanced
A 51-minute video from PDMI Logic Lab: “Оценки удлинения высоты доказательства при устранении сечений | В.П. Оревков, 15.05.2021”.
51:57Поиск полиномиальных зависимостей между значениями знакопеременной дзета-функции и её производных
Advanced
A 52-minute video from PDMI Logic Lab: “Поиск полиномиальных зависимостей между значениями знакопеременной дзета-функции и её производных”.