Instytut Informatyki Analitycznej - lista publikacji
Nadjednostka:
Podjednostki:
1-22 z 22.
2025
22.
Mohsen Heidari, Masih Mozakka, Wojciech Szpankowski
Hadamard Test is Sufficient for Efficient Quantum Gradient Estimation with Lie Algebraic Symmetries, Advances in Neural Information Processing Systems [NeurIPS], (2025),
21.
Pramith Devulapalli, Changlong Wu, Ananth Grama, Wojciech Szpankowski
Agnostic Continuous-Time Online Learning, Advances in Neural Information Processing Systems [NeurIPS], (2025),
20.
Changlong Wu, Ananth Grama, Wojciech Szpankowski
No Free Lunch: Fundamental Limits of Learning Non-Hallucinating Generative Models, International Conference on Learning Representations [ICLR], (2025),
19.
Tara Abrishami, Louis Esperet, Ugo Giocanti, Matthias Hamann , Paul Knappe, Rögnvaldur G. Möller
Periodic colorings and orientations in infinite graphs, Combinatorial Theory vol. 5 (4) (2025),
18.
Brunar Johanna, Marcin Kozik, Tomáš Nagy, Michael Pinsker
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems, IEEE Symposium on Logic in Computer Science [LICS], (2025),
17.
16.
Alina Ene, Troy Lee, Piotr Micek, Sushant Sachdeva
15.
Nicolas Bousquet, Wouter Cames van Batenburg, Louis Esperet, Gwenaël Joret, Piotr Micek
Shallow brambles, Discrete Mathematics and Theoretical Computer Science vol. 27:3 (2025), 12
14.
Vida Dujmović, Gwenaël Joret, Piotr Micek, Pat Morin
Tight bound for the Erdős-Pósa property of tree minors, Combinatorics Probability and Computing vol. 34 (2) (2025), 321-325
13.
Vida Dujmović, Robert Hickingbotham, Jędrzej Hodor, Gwenaël Joret, Hoang La, Piotr Micek, Pat Morin, Clément Rambaud, David R. Wood
The Grid-Minor Theorem Revisited, Combinatorica vol. 45 (2025), 62
12.
Lech Duraj, Ross Kang, Hoang La, Jonathan Narboni, Filip Pokrývka, Clément Rambaud, Amadeus Reinald
The $\chi$-binding Function of d-Directional Segment Graphs, Discrete and Computational Geometry vol. 74 (2025), 758-770
11.
Steven Chaplick, Grzegorz Gutowski, Tomasz Krawczyk
A Note on the Complexity of Defensive Domination, International Symposium on Mathematical Foundations of Computer Science [MFCS] vol. 345 (2025), 35:1-35:15
10.
Michael Drmota, Philippe Jacquet, Wojciech Szpankowski, Changlong Wu
Precise Regularized Minimax Regret With Unbounded Weights, IEEE Transactions on Information Theory vol. 71 (11) (2025), 8753 - 8776
9.
Two-colorability of random non-uniform hypergraphs, EuroConference on Combinatorics, Graph Theory and Applications [EUroComb], (2025),
8.
Marcin Anholcer, Bartłomiej Bosek, Jarosław Grytczuk, Grzegorz Gutowski, Jakub Przybyło, Mariusz Zając
Mrs. Correct and Majority Colorings, Discrete Mathematics vol. 348 (11) (2025), 114577
7.
Tara Abrishami, Marcin Briański, Jadwiga Czyżewska, Rose McCarty, Martin Milanič, Paweł Rzążewski, Bartosz Walczak
6.
Classical simulation of quantum CSP strategies, IEEE Symposium on Logic in Computer Science [LICS], (2025), 372-388
5.
Jędrzej Hodor, William T. Trotter
Forcing the wheel, Order (2025),
4.
Vida Dujmović, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood
Planar graphs in blowups of fans, ACM/SIAM Symposium on Discrete Algorithms [SODA], (2025), 3382-3391
3.
Jędrzej Hodor, Hoang La, Piotr Micek, Clément Rambaud
Weak coloring numbers of minor-closed graph classes, ACM/SIAM Symposium on Discrete Algorithms [SODA], (2025), 3325-3334
2.
Kevin Beanland, Jędrzej Hodor
The depth of Tsirelson’s norm, Studia Mathematica vol. 280 (2025), 27-54
1.
Boolean dimension of a Boolean lattice, Order vol. 42 (2025), 25-36