prof. dr Wojciech Szpankowski

Certifying Capabilities from Finite Tests: When Is It Possible?, International Conference on Machine Learning [ICML], (2026),

Phase Transition of Regret for Logistic Regression with Large Weights, Algorithmic Learning Theory [ALT], (2026),

Hadamard Test is Sufficient for Efficient Quantum Gradient Estimation with Lie Algebraic Symmetries, Advances in Neural Information Processing Systems [NeurIPS], (2025),

Agnostic Continuous-Time Online Learning, Advances in Neural Information Processing Systems [NeurIPS], (2025),

No Free Lunch: Fundamental Limits of Learning Non-Hallucinating Generative Models, International Conference on Learning Representations [ICLR], (2025),

Precise Regularized Minimax Regret With Unbounded Weights, IEEE Transactions on Information Theory vol. 71 (11) (2025), 8753 - 8776

Scheduling with complete multipartite incompatibility graph on parallel machines: Complexity and algorithms, Artificial Intelligence vol. 309 (2022), 103711

The Concentration of the Maximum Degree in the Duplication-Divergence Models, International Conference on Computing and Combinatorics [COCOON], (2021), 413-424

Revisiting Parameter Estimation in Biological Networks: Influence of Symmetries, IEEE-ACM Transactions on Computational Biology and Bioinformatics vol. 18(3) (2021), 836-849

Towards Degree Distribution of a Duplication-Divergence Graph Model, Electronic Journal of Combinatorics vol. 28(1) (2021), P1.18

Temporal Ordered Clustering in Dynamic Networks: Unsupervised and Semi-supervised Learning Algorithms, IEEE Transactions on Network Science and Engineering vol. 8(2) (2021), 1426-1442

Degree Distribution for Duplication-Divergence Graphs: Large Deviations, International Workshop on Graph-Theoretic Concepts in Computer Science [WG], (2020), 226-237

Temporal Ordered Clustering in Dynamic Networks, IEEE International Symposium on Information Theory [ISIT], (2020), 1349-1354

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

Compression of Dynamic Graphs Generated by a Duplication Model, Algorithmica vol. 82 (2020), 2687-2707

Asymptotics of Entropy of the Dirichlet-Multinomial Distribution, IEEE International Symposium on Information Theory [ISIT], (2019), 1517-1521

Lossless Compression of Binary Trees With Correlated Vertex Names, IEEE Transactions on Information Theory vol. 64 (9) (2018), 6070-6080

On Symmetries of Non-Plane Trees in a Non-Uniform Model, Workshop on Analytic Algorithmics and Combinatorics [ANALCO], (2017), 156-163

Lossless compression of binary trees with correlated vertex names, IEEE International Symposium on Information Theory [ISIT], (2016), 1217-1221

Types of Markov Fields and Tilings, IEEE Transactions on Information Theory vol. 62 Issue 8, Aug 2016 (2016), 4361 - 4375

Markov Fields Types and Tilings, Information Theory (isit), 2014 Ieee International Symposium On vol. Information Theory (ISIT), 2014 IEEE International Symposium on (2014), 2639 - 2643