__June 30__↓

__July 1__↓

June 30 | |
---|---|

11:10–11:25 — | Combinatorial Version of the Wolf-Slepian Coding Theorem for Binary Strings, Daniyar Chumbalov |

11:25–11:40 — | Lower bounds for the running time of drunken DPLL algorithms with a cut heuristic, Elena Ikonnikova |

11:40–11:55 — | Space Complexity in Algebraic Proof Systems, Ilario Bonacina |

11:55–12:10 — | Complexity of reset thresholds approximation, Mikhail Berlinkov |

July 1 | |

16:40–16:55 — | Maximum Induced Chordal Subgraph, Ivan Bliznets |

16:55–17:10 — | An optimal online algorithm for finding all distinct subpalindromes of a string, Dmitry Kosolobov |

17:10–17:25 — | On finite automata with quantum and classical states, Alex Grilo |

17:25–17:40 — | Several Sufficient Conditions For Uniformity of Finite Systems of Many-valued Logic, Pavel Tarasov |

17:40–17:55 — | Circuit Lower Bounds for Heuristic MA, Alexander Knop |

17:55–18:10 — | A 5n-o(n) Lower Bound on the Circuit Size over U2 of a Linear Boolean Function, Ivan Mihajlin |