Instytut Informatyki Analitycznej - lista publikacji

1-30 z 30.

2020

30.
Antonios Antoniadis, Christian Coester, Marek Elias, Adam Polak, Bertrand Simon
Online metric algorithms with untrusted predictions, International Conference on Machine Learning [ICML], (2020),
29.
Lech Duraj, Krzysztof Kleiner, Adam Polak, Virginia Vassilevska Williams
Equivalences between triangle and range query problems, ACM/SIAM Symposium on Discrete Algorithms [SODA], (2020),
28.
Andrea Lincoln, Adam Polak, Virginia Vassilevska Williams
Monochromatic Triangles, Intermediate Matrix Products, and Convolutions, Innovations in Theoretical Computer Science [ITCS], (2020),
27.
Intermediate problems in modular circuits satisfiability, IEEE Symposium on Logic in Computer Science [LICS] vol. Association for Computing Machinery (ACM) (2020), 578–590
26.
Joanna Chybowska-Sokół, Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Patryk Mikos, Adam Polak
Online Coloring of Short Intervals, International Workshop on Approximation Algorithms for Combinatorial Optimization Problems [APPROX] vol. 176 (Leibniz International Proceedings in Informatics) (2020), 52:1-52:18
25.
Degree Distribution for Duplication-Divergence Graphs: Large Deviations, International Workshop on Graph-Theoretic Concepts in Computer Science [WG], (2020), 226-237
24.
Jithin K. Sreedharan, Wojciech Szpankowski, Krzysztof Turowski
Temporal Ordered Clustering in Dynamic Networks, IEEE International Symposium on Information Theory [ISIT], (2020), 1349-1354
23.
Power-Law Degree Distribution in the Connected Component of a Duplication Graph, International Conference on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms [AofA] vol. 16 (2020), 1-14
22.
Tony Huynh, Gwenaël Joret, Piotr Micek, David R. Wood
21.
Łukasz Bożyk, Jan Derbisz, Tomasz Krawczyk, Jana Novotná, Karolina Okrasa
Vertex Deletion into Bipartite Permutation Graphs, International Symposium on Parameterized and Exact Computation (was IWPEC pre 2004) [IPEC] vol. 180 of Leibniz International Proceedings in Informatics, 15th International Symposium on Parameterized and Exact Computation, IPEC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference) (2020), 5:1-5:16
20.
On The Relational Width of First-Order Expansions of Finitely Bounded Homogeneous Binary Cores with Bounded Strict Width, IEEE Symposium on Logic in Computer Science [LICS] vol. 35TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2020) (2020), 958-971
19.
Relational Width of First-Order Expansions of Homogeneous Graphs with Bounded Strict Width, International Symposium on Theoretical Aspects of Computer Science [STACS] vol. 154 (LIPIcs) (2020), 39:1-39:16
18.
A Sub-Quadratic Algorithm for the Longest Common Increasing Subsequence Problem, International Symposium on Theoretical Aspects of Computer Science [STACS] vol. 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020) (2020), 41:1-41:18
17.
Bartłomiej Bosek, Jarosław Grytczuk, William T. Trotter
16.
Vida Dujmović, Louis Esperet, Cyril Gavoille, Gwenaël Joret, Piotr Micek, Pat Morin
Adjacency labelling for planar graphs (and beyond), (2020), "2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)", Institute of Electrical and Electronics Engineers (IEEE)
15.
Vida Dujmović, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, David R. Wood
14.
Stefan Felsner, Tamás Mészáros, Piotr Micek
13.
Michał Dębski, Stefan Felsner, Piotr Micek, Felix Schröder
Improved bounds for centered colorings vol. SODA '20 (2020), "Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms", Society for Industrial and Applied Mathematics (SIAM)
12.
Tamás Mészáros, Piotr Micek, William T. Trotter
11.
Libor Barto, Tan Johnson, Marcin Kozik, Matthew Valeriote
Sensitive Instances of the Constraint Satisfaction Problem, International Colloquium on Automata Languages and Programming [ICALP](MAIN), (2020), 110:1-110:18
9.
Piotr Kawałek, Jacek Krzaczkowski
Even faster algorithms for CSAT over supernilpotent algebras, International Symposium on Mathematical Foundations of Computer Science [MFCS] vol. 170 (2020), 55:1-55:13
8.
Faster general parsing through context-free memoization, ACM-SIGPLAN Conference on Programming Language Design and Implementation [PLDI], (2020), 1022-1035
7.
Bartłomiej Bosek, Yann Disser, Andreas Emil Feldmann, Jakub Pawlewicz, Anna Zych-Pawlewicz
Recoloring Interval Graphs with Limited Recourse Budget vol. 162 (2020), "17th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2020, June 22-24, 2020, Tórshavn, Faroe Islands", Schloss Dagstuhl – Leibniz-Zentrum für Informatik
6.
Zofia Kostrzycka, Marek Zaionc
Quantitative Study of Fuzzy Logics, 2020 Ieee International Conference On Fuzzy Systems (fuzz-ieee) (2020), 1-8
5.
Antonios Antoniadis, Christian Coester, Marek Elias, Adam Polak, Bertrand Simon
Online metric algorithms with untrusted predictions, International Conference On Machine Learning (icml) vol. 119 (2020), 345–355
4.
Vida Dujmović, Louis Esperet, Gwenaël Joret, Bartosz Walczak, David R. Wood
Planar graphs have bounded nonrepetitive chromatic number, Advances in Combinatorics vol. 2020 (2020), 5:1-11
2.
Andrea Lincoln, Adam Polak, Virginia Vassilevska Williams
Monochromatic Triangles, Intermediate Matrix Products, and Convolutions, 11th Innovations in Theoretical Computer Science Conference (itcs 2020) vol. 151 (Leibniz International Proceedings in Informatics (LIPIcs)) (2020), 53:1-53:18
1.
Lech Duraj, Krzysztof Kleiner, Adam Polak, Virginia Vassilevska Williams
Equivalences between triangle and range query problems, Acm-siam Symposium On Discrete Algorithms 2020 (soda'20) (2020), 30-47