STACS 2021 | Geometric Cover with Outliers Removal

(21:59)

STACS 2021 | On the fluted fragment

(59:53)

STACS 2021 | Barrington Plays Cards: The Complexity of Card-based Protocols

(27:32)

STACS 2021 | 6-Uniform Maker-Breaker Game Is PSPACE-Complete

(22:26)

STACS 2021 | A Ramsey Theorem for Finite Monoids

(26:56)

STACS 2021 | A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location

(24:16)

STACS 2021 | On Euclidean Steiner 1+ε-Spanners

(25:31)

STACS 2021 | Parameterised Counting in Logspace

(21:9)

STACS 2021 | Resolution with Symmetry Rule applied to Linear Equations

(16:15)

Věda na UK: matematik Libor Barto a ERC grant

(8:)

Proving P=NP Requires Concepts We Don't Have | Richard Karp and Lex Fridman

(2:50)

Velocity Stacks - What they do and how to make them... a.k.a. Air horns, ram pipes, air trumpets....

(12:27)

Overview: SpatioTemporal Asset Catalogs (STAC)

(22:16)

4G Spectrum Auction - Total bids for more than Rs 77814 crore received - Jio buys most 4G spectrum

(11:3)

Spring 2021 Convocation: Faculty of Social Sciences

(48:56)

BMW M4 Competition 2021 | STACS Car Review

(20:51)

A tutorial on Quantum Approximate Optimization Algorithm (Oct 2020). Part 1: Theory

(52:38)

Creating STACs with PySTAC

(40:37)

STACS 2021 | Simple Multi-Pass Streaming Algorithms for Skyline Points and Extreme Points

(28:46)

STACS 2021 | Spectrum preserving short cycle removal on regular graphs

(15:58)

STACS 2021 | Efficiently Testing Simon’s Congruence

(25:49)

STACS 2021 | A faster algorithm for finding Tarski fixed points

(27:53)

STACS 2021 | A Framework of Quantum Strong Exponential-Time Hypotheses

(24:39)

STACS 2021 | Quantum Approximate Counting with Nonadaptive Grover Iterations

(24:52)

STACS 2021 | Fine-grained complexity of the list homomorphism problem: feedback vertex set and cu...

(26:34)

STACS 2021 | Exploiting Dense Structures in Parameterized Complexity

(29:45)

STACS 2021 | Cluster Editing parameterized above modification-disjoint P₃-packings

(22:57)

STACS 2021 | Binary Matrix Completion Under Diameter Constraints

(31:6)

STACS 2021 | Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries

(24:21)