Instytut Informatyki Analitycznej - lista publikacji
Nadjednostka:
Podjednostki:
401-478 z 478.
2009
78.
Jarosław Grytczuk, Stanisław Niwczyk, Tomasz Bartnicki
Weight choosability of graphs, Journal of Graph Theory vol. 60 (2009), 242-256
77.
Paweł Idziak, Ralph McKenzie, Matthew Valeriote
76.
Paweł Idziak, Keith Kearnes, Emil Kiss, Matthew Valeriote
Definable principal congruences and solvability, Annals of Pure and Applied Logic vol. 157 (2009), 30-49
75.
Paweł Idziak, Irena Katarzyna Korwin-Słomczyńska
Fregean Varieties, International Journal of Algebra and Computation vol. 19 (2009), 595–645
74.
Noga Alon, Jarosław Grytczuk, Michał Lasoń, Mateusz Michałek
Splitting necklaces and measurable colorings of the real line, Proceedings of the American Mathematical Society vol. 137 (2009), 1593-1599
73.
On Domain Theory over Girard Quantales, Fundamenta Informaticae vol. 92 (2009), 169-192
72.
Antoine Genitrini, Jakub Kozik
71.
Rene David, Marek Zaionc
Counting proofs in propositional logic, Archive for Mathematical Logic vol. 48 (2009), 185-199
2008
70.
Witold Charatonik, Michał Wrona
69.
Witold Charatonik, Michał Wrona
Quantified Positive Temporal Constraints, Lecture Notes in Computer Science vol. 5213 (2008), 94-108
68.
A finite set of functions with an EXPTIME-complete composition problem, Theoretical Computer Science vol. 407 (2008), 330-341
67.
Marcin Kozik, Gábor Kun
The subdirectly irreducible algebras in the variety generated by graph algebras, Algebra Universalis vol. 58 (2008), 229-242
66.
Libor Barto, Marcin Kozik, Todd Niven
Graphs, polymorphisms and the complexity of homomorphism problems, Proceedings of the 40th Acm Symposium On Theory of Computing, Stoc'08 (2008), 789-796
65.
Bostjan Bresar, Jarosław Grytczuk, Iztok Peterin, Sandi Klavzar, Stanisław Niwczyk
Nonrepetitive colorings of trees, Discrete Mathematics vol. 307 (2008), 163-172
64.
Jarosław Grytczuk, Hal Kierstead, Tomasz Bartnicki
The game of arboricity, Discrete Mathematics vol. 308 (2008), 1388-1393
63.
Jarosław Grytczuk, Tomasz Bartnicki
A note on the game chromatic index of graphs, Graphs and Combinatorics vol. 24 (2008), 1-4
62.
Noga Alon, Jarosław Grytczuk
Breaking the rhythm on graphs, Discrete Mathematics vol. 308 (2008), 1375-1380
61.
Bostjan Bresar, Jarosław Grytczuk, Iztok Peterin, Matijaz Kovse, Tomasz Bartnicki, Zofia Miechowicz
Game chromatic number of Cartesian product graphs, Electronic Journal of Combinatorics vol. 15 (2008), 13
60.
Jarosław Grytczuk
Thue type problems for graphs, points, and numbers, Discrete Mathematics vol. 308 (2008), 4419-4429
59.
Jarosław Grytczuk
Invisible runners in finite fields, Information Processing Letters vol. 108 (2008), 64-67
58.
Jarosław Grytczuk, Hal Kierstead, Paweł Prałat
On-line Ramsey numbers for paths and stars, Discrete Mathematics and Theoretical Computer Science vol. 10 (2008), 63-74
57.
On-line coloring of P_5-free graphs, Acta Informatica vol. 45 (2008), 79-91
56.
Antoine Genitrini, Jakub Kozik, Grzegorz Matecki
On the density and the structure of the Peirce-like formulae, Discrete Mathematics and Theoretical Computer Science Proceedings (2008), 461-474
55.
Subcritical pattern languages for and/or trees, Discrete Mathematics and Theoretical Computer Science Proceedings (2008), 437–448
54.
Zofia Kostrzycka, Marek Zaionc
Asymptotic densities in logic and type theory, Studia Logica vol. 88 (2008), 385-403
53.
Antoine Genitrini, Jakub Kozik, Marek Zaionc
Intuitionistic vs. Classical Tautologies, Quantitative Comparison, Lecture Notes in Computer Science vol. 4941 (2008), 100-109
52.
Optimal Orientation On-Line, Lecture Notes in Computer Science vol. 4910 (2008), 271-279
2007
51.
Witold Charatonik, Michał Wrona
2-SAT Problems in Some Multi-Valued Logics Based on Finite Lattices, 37th International Symposium On Multiple-valued Logic, Ismvl 2007 vol. IEEE Computer Society (2007), 21
50.
49.
Lidia Badura, Marek Zaionc
Parametrizability by regular expressions for equations on words, Bulletin of the Section of Logic vol. 36 (2007), 79-93
48.
Daniele Gardy, Herve Fournier, Antoine Genitrini, Marek Zaionc
Classical and intuitionistic logic are asymptotically identical, Lecture Notes in Computer Science vol. 4646 (2007), 177-193
47.
Patrick Baier, Bartłomiej Bosek, Piotr Micek
On-line Chain Partitioning of Up-growing Interval Orders, Order vol. 24(1) (2007), 1-13
2006
46.
Wit Foryś, Tomasz Krawczyk
An algorithmic approach to the problem of a semiretract base, Theoretical Computer Science vol. 369 (2006), 314-322
45.
Partial metrisability of continuous posets, Mathematical Structures in Computer Science vol. 16 (2006), 359-372
44.
Undecidable problems concerning densities of languages, Discrete Mathematics and Theoretical Computer Science Proceedings (2006), 69-76
43.
On-line Coloring of I_s-free graphs and co-planar graphs, Discrete Mathematics and Theoretical Computer Science Proceedings vol. AF (2006), 61-68
42.
Probability distribution for simple tautologies, Theoretical Computer Science vol. 355 (2006), 243-260
41.
On-line adaptive chain covering of upgrowing posets, Discrete Mathematics & Theoretical Computer Science Proceedings vol. AF (2006), 37-48
2005
40.
Wit Foryś, Tomasz Krawczyk
An automaton that recognizes the base of a semiretract, Words 2005, 5-th International Conference On Words (2005), 235-247
39.
Joel Berman, Paweł Idziak
Generative Complexity in Algebra, Memoirs of the American Mathematical Society vol. 175 (2005), 1-168
38.
On-line coloring and cliques covering for K_st-free graphs, Acta Informatica vol. 42 (2005), 1-20
37.
Completeness and Compactness of Quantitative Domains, Lecture Notes in Computer Science vol. 3623 (2005), 341-351
36.
Approximation Simply Characterized., Electronic Notes in Theoretical Computer Science vol. 140 (2005), 113-117
35.
Conditional Densities of Regular Languages, Electronic Notes in Theoretical Computer Science (2005), 67-79
34.
33.
Probabilistic approach to the lambda definability for fourth order types, Electronic Notes in Theoretical Computer Science (2005), 41-54
32.
Variants of Online Chain Partition Problem of Posets, Electronic Notes in Theoretical Computer Science vol. 140 (2005), 3-13
2004
31.
Fredholm lternative and boundary value problems, Proceedings of the American Mathematical Society vol. 132(6) (2004), 1779-1784
30.
Zofia Kostrzycka, Marek Zaionc
Statistics of intuitionistic versus classical logics, Studia Logica vol. 76 (2004), 307 - 328
2003
29.
Jerzy Jaromczyk, Andrzej Pezarski, Maciej Ślusarek
An optimal competitive algorithm for the minimal clique covering in circular arc graphs, European Workshop on Computational Geometry [EuroCG], (2003), 48-51
28.
27.
Wit Foryś, Tomasz Krawczyk
Semiretracts – a counterexample and some results , Theoretical Computer Science vol. 307 (2003), 117-127
26.
Asymptotic properties of logics, Schedae Informaticae vol. 12 (2003), 129-138
25.
Zofia Kostrzycka, Marek Zaionc
On the density of truth in Dummet logic, Bulletin of the Section of Logic vol. 32 (2003), 43-55
24.
Quantitative Continuous Domains, Applied Categorical Structures vol. 11 (2003), 41-67
23.
Statistics of implicational logic, Electronic Notes in Theoretical Computer Science vol. 84 (2003), 205–216
2001
22.
21.
Distance and Measurement in Domain Theory, Electronic Notes in Theoretical Computer Science vol. 45 (2001), 448-462
2000
20.
1998
19.
Tomasz Kaczynski, Marian Mrozek, Maciej Ślusarek
Homology Computation by Reduction of Chain Complexes, Computers and Mathematics with Applications vol. 35 (1998), 59-70
1997
18.
17.
Jan Małolepszy, Małgorzata Moczurad, Marek Zaionc
Schwichtenberg style lambda definability is undecidable, Lecture Notes in Computer Science vol. 1210 (1997), 267-283
1995
16.
15.
1992
14.
Lambda definability on free algebras, Annals of Pure and Applied Logic vol. 51 (1992), 279-300
1990
13.
A Characterization of Lambda Definable Tree Operations, Information and Computation vol. 89 (1990), 35-46
1989
12.
A coloring algorithm for interval graphs, International Symposium on Mathematical Foundations of Computer Science [MFCS], (1989), 471-480
11.
On the lambda definable higher-order boolean functionals, Fundamenta Informaticae vol. 12 (1989), 181-190
10.
1988
9.
Marek Chrobak, Maciej Ślusarek
8.
7.
On the lambda definable tree operations, Lecture Notes in Computer Science vol. 425 (1988), 279-292
1987
6.
Word Operations Definable in the Typed lambda Calculus, Theoretical Computer Science vol. 52 (1987), 1-14
5.
1985
4.
A note on the dynamic storage allocation problem, Information Processing Letters vol. 20 (1985), 223-227
3.
Nondeterministic Programs Definable in Typed Lambda Calculus, Fundamenta Informaticae vol. 8 (1985), 63-72
2.
The set of Unifiers in Typed lambda calculus as Regular Expression, Lecture Notes in Computer Science vol. 202 (1985), 430-440
1984
1.
A computer model of evolution and ecological processes, Modeling, Simulation & Control C (1984), 59-63
Przejdź do strony: