Instytut Informatyki Analitycznej - lista publikacji

Nadjednostka:

Podjednostki:

[Wszystkie publikacje]


[2024] [2023] [2022] [2021] [2020] [2019] [2018] [2017] [2016] [2015] [2014] [2013] [2012] [2011] [2010] [2009] [2008] [2007] [2006] [2005] [2004] [2003] [2001] [2000] [1998] [1997] [1995] [1992] [1990] [1989] [1988] [1987] [1985] [1984]
401-434 z 434.

2005

34.
Marek Zaionc
On the asymptotic density of tautologies in logic of implication and negation, Reports on Mathematical Logic vol. 39 (2005), 67-87
33.
Marek Zaionc
Probabilistic approach to the lambda definability for fourth order types, Electronic Notes in Theoretical Computer Science (2005), 41-54
32.
Bartłomiej Bosek, Piotr Micek
Variants of Online Chain Partition Problem of Posets, Electronic Notes in Theoretical Computer Science vol. 140 (2005), 3-13

2004

31.
Stanisław Sędziwy
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.
Stanisław Sędziwy
Bounded solutions of second-order systems of differential equations, Journal of Mathematical Analysis and Applications vol. 281(2) (2003), 697–706
27.
Wit Foryś, Tomasz Krawczyk
Semiretracts – a counterexample and some results , Theoretical Computer Science vol. 307 (2003), 117-127
26.
Marek Zaionc
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.
Paweł Waszkiewicz
Quantitative Continuous Domains, Applied Categorical Structures vol. 11 (2003), 41-67
23.
Marek Zaionc
Statistics of implicational logic, Electronic Notes in Theoretical Computer Science vol. 84 (2003), 205–216

2001

22.
Stanisław Sędziwy
Upper and lower solutions method for even order two point boundary value problems, Rocky Mountain Journal of Mathematics vol. 31(4) (2001), 1429-1434
21.
Paweł Waszkiewicz
Distance and Measurement in Domain Theory, Electronic Notes in Theoretical Computer Science vol. 45 (2001), 448-462

2000

20.
Małgorzata Moczurad, Jerzy Tyszkiewicz, Marek Zaionc
Statistical properties of simple types, Mathematical Structures in Computer Science vol. 10 (2000), 575-594

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.
Paweł Idziak
A Characterization of Finitely Decidable Congruence Modular Varieties, Transactions of the American Mathematical Society vol. 349 (1997), 903-934
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.
Maciej Ślusarek
Optimal on-line coloring of circular arc graphs, RAIRO - Theoretical Informatics and Applications vol. 20 (1995), 423-429
15.
Marek Zaionc
Lambda representations of operations between different term algebras, Lecture Notes in Computer Science vol. 993 (1995), 91-105

1992

14.
Marek Zaionc
Lambda definability on free algebras, Annals of Pure and Applied Logic vol. 51 (1992), 279-300

1990

13.
Marek Zaionc
A Characterization of Lambda Definable Tree Operations, Information and Computation vol. 89 (1990), 35-46

1989

12.
Maciej Ślusarek
A coloring algorithm for interval graphs, International Symposium on Mathematical Foundations of Computer Science [MFCS], (1989), 471-480
11.
Marek Zaionc
On the lambda definable higher-order boolean functionals, Fundamenta Informaticae vol. 12 (1989), 181-190
10.
Marek Zaionc
How To Define Functionals on Free Structures in Typed lambda Calculus, Lecture Notes in Computer Science vol. 379 (1989), 566-576

1988

9.
Marek Chrobak, Maciej Ślusarek
On some packing problem related to dynamic storage allocation, RAIRO - Theoretical Informatics and Applications vol. 22 (1988), 487-499
8.
Marek Zaionc
Mechanical Procedure for Proof Construction via Closed Terms in Typed lambda Calculus, Journal of Automated Reasoning vol. 4 (1988), 173-190
7.
Marek Zaionc
On the lambda definable tree operations, Lecture Notes in Computer Science vol. 425 (1988), 279-292

1987

6.
Marek Zaionc
Word Operations Definable in the Typed lambda Calculus, Theoretical Computer Science vol. 52 (1987), 1-14
5.
Marek Zaionc
The Regular Expression Descriptions of Unifier Sets in the Typed lambda Calculus, Fundamenta Informaticae vol. 10 (1987), 309-322

1985

4.
Maciej Ślusarek
A note on the dynamic storage allocation problem, Information Processing Letters vol. 20 (1985), 223-227
3.
Marek Zaionc
Nondeterministic Programs Definable in Typed Lambda Calculus, Fundamenta Informaticae vol. 8 (1985), 63-72
2.
Marek Zaionc
The set of Unifiers in Typed lambda calculus as Regular Expression, Lecture Notes in Computer Science vol. 202 (1985), 430-440

1984

1.
Marian Mrozek, Marek Zaionc
A computer model of evolution and ecological processes, Modeling, Simulation & Control C (1984), 59-63
Przejdź do strony: