Katedra Podstaw Informatyki - lista publikacji
Nadjednostka:
1-11 z 11.
2013
11.
Asymptotic properties of combinatory logic, Lecture Notes in Computer Science vol. 9076 (2013), 62-72
10.
Andrew Suk, Bartosz Walczak
New bounds on the maximum number of edges in k-quasi-planar graphs vol. 8242 of Lecture Notes in Computer Science (2013), "Graph Drawing, 21st International Symposium, GD 2013, Bordeaux, France, September 23-25, 2013, Revised Selected Papers", Springer
9.
Tomasz Krawczyk, Arkadiusz Pawlik, Bartosz Walczak
Coloring triangle-free rectangular frame intersection graphs with O(log log n) colors vol. 8165 of Lecture Notes in Computer Science (2013), "Graph-Theoretic Concepts in Computer Science, 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers", Springer
8.
Coloring intersection graphs of arcwise connected sets in the plane vol. 16 of CRM Series (2013), "The Seventh European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2013", Springer
7.
Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michał Lasoń, Piotr Micek, William T. Trotter, Bartosz Walczak
6.
Katarzyna Grygiel, Pierre Lescanne
Counting and generating lambda terms, Journal of Functional Programming vol. 23(5) (2013), 594-628
5.
Gábor Czédli, Joanna Grygiel, Katarzyna Grygiel
Distributive lattices determined by weighted double skeletons, Algebra Universalis vol. 69(4) (2013), 313-326
4.
Jarosław Grytczuk, Jakub Kozik, Piotr Micek
New approach to nonrepetitive sequences, Random Structures and Algorithms vol. 42 (2013), 214-225
3.
Nonrepetitive choice number of trees, SIAM Journal on Discrete Mathematics vol. 27-1 (2013), 436-446
2.
Asymptotically almost all λ-terms are strongly normalizing, Logical Methods in Computer Science vol. 9 (1:02) (2013), 1-30
1.
How big is BCI fragment of BCK logic, Journal of Logic and Computation vol. 23(3) (2013), 673-691