47th International Colloquium on Automata, Languages and Programming (ICALP) 2020

Open this series as search result
Share series
1-36 out of 123 results
1
Video thumbnail
A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion
27:39
3
Geevarghese, Philip
2020
Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
2
Video thumbnail
Active Learning a Convex Body in Low Dimensions
24:00
4
Jones, Mitchell
2020
Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
3
Video thumbnail
A dichotomy for bounded degree graph homomorphisms with nonnegative weights
24:16
Hovarau, Artsiom
2020
Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
4
Video thumbnail
A General Stabilization Bound for Influence Propagation in Graphs
22:34
Papp, Pál András
2020
Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
5
Video thumbnail
An Efficient PTAS for Stochastic Load Balancing with Poisson Jobs
22:27
4
Li, Huan et al.
2020
Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
6
Video thumbnail
An Optimal Algorithm for Online Multiple Knapsack
20:43
9
Pacut, Maciej
2020
Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
7
Video thumbnail
Approximate Nearest Neighbor for Curves --- Simple, Efficient, and Deterministic
19:54
14
Filtser, Omrit
2020
Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
8
Video thumbnail
A Recipe for Quantum Graphical Languages
18:20
1
Carette, Titouan
2020
Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
9
Video thumbnail
A Simple Dynamization of Trapezoidal Point Location in Planar Subdivisions
25:09
Seybold, Martin
2020
Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
10
Video thumbnail
A spectral bound on hypergraph discrepancy
21:50
Potukuchi, Aditya
2020
Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
11
Video thumbnail
Asynchronous Majority Dynamics in Preferential Attachment Trees
19:42
1
Bahrani, Maryam
2020
Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
12
Video thumbnail
A Water-Filling Primal-Dual Algorithm for Approximating Non-Linear Covering Problems
24:33
4
Fielbaum, Andres
2020
Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
13
Video thumbnail
Bisimulation Equivalence of Pushdown Automata is Ackermann-Complete
21:15
4
Zhang, Wenbo
2020
Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
14
Video thumbnail
Breaking the Barrier of 2 for the Storage Allocation Problem
23:07
2
Mömke, Tobias
2020
Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
15
Video thumbnail
Bridge-Depth Characterizes which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel
25:54
3
Jansen, Bart M. P.
2020
Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
16
Video thumbnail
Can Verifiable Delay Functions be Based on Random Oracles?
25:04
Wu, David J.
2020
Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
17
Video thumbnail
Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds
21:44
1
Zehavi, Meirav
2020
Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
18
Video thumbnail
Computational Complexity of the α-Ham-Sandwich Problem
21:01
1
Choudhary, Aruni
2020
Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
19
Video thumbnail
Computing measures of weak-MSO definable sets of trees
24:27
2
Skrzypczak, Michał
2020
Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
20
Video thumbnail
Conditionally optimal approximation algorithms for the girth of a directed graph
22:58
6
Dalirrooyfard, Mina
2020
Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
21
Video thumbnail
Contraction: a Unified Perspective of Correlation Decay and Zero-Freeness of 2-Spin Systems
25:03
Shao, Shuai
2020
Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
22
Video thumbnail
Cost Automata, Safe Schemes, and Downward Closures
25:10
2
Barozzini, David
2020
Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
23
Video thumbnail
Counting homomorphisms in plain exponential time
26:20
Bulatov, Andrei
2020
Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
24
Video thumbnail
Counting perfect matchings and the eight-vertex model
23:49
1
Liu, Tianyu
2020
Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
25
Video thumbnail
Counting solutions to random CNF formulas
22:37
2
Yang, Kuan
2020
Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
26
Video thumbnail
Cryptographic Reverse Firewalls for Interactive Proof Systems
23:47
2
Magri, Bernardo
2020
Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
27
Video thumbnail
Decision Problems in Information Theory
25:17
2
Suciu, Dan
2020
Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
28
Video thumbnail
Descriptive complexity on non-Polish spaces II
24:51
Hoyrup, Mathieu
2020
Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
29
Video thumbnail
Deterministic Sparse Fourier Transform with an
19:51
1
Li, Yi
2020
Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
30
Video thumbnail
d-to-1 Hardness of Coloring 3-colorable Graphs with O(1) colors
25:09
Sandeep, Sai
2020
Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
31
Video thumbnail
Dynamic Averaging Load Balancing on Cycles
17:25
13
Sabour, Amirmojtaba
2020
Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
32
Video thumbnail
Dynamic Longest Common Substring in Polylogarithmic Time
26:20
2
Pokorski, Karol
2020
Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
33
Video thumbnail
Efficient diagonalization of symmetric matrices associated with graphs of small treewidth
22:45
Hoppen, Carlos
2020
Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
34
Video thumbnail
Existence and Complexity of Approximate Equilibria in Weighted Congestion Games
23:41
Poças, Diogo
2020
Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
35
Video thumbnail
Extending Partial 1-Planar Drawings
24:57
2
Hamm, Thekla
2020
Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
36
Video thumbnail
Faster Dynamic Range Mode
21:16
Xu, Yinzhan
2020
Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
out of 4 pages
Feedback