Instytut Informatyki Analitycznej - lista publikacji

201-289 z 289.

2010

89.
New conditions for Taylor varieties and CSP, PROCEEDINGS OF THE 25TH IEEE/ACM SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE LICS'10 (2010), 100-109
86.
Common patterns for metric and ordered fixed point theorems, IN PROCEEDINGS OF THE 7TH WORKSHOP ON FIXED POINTS IN COMPUTER SCIENCE (2010), 83-87
84.
Dynamic Threshold Strategy for Universal Best Choice Problem, DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE PROCEEDINGS vol. AM (2010), 439–452
82.
The Sub-exponential Upper Bound for On-Line Chain Partitioning, (2010), "51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010, October 23-26, 2010, Las Vegas, Nevada, USA", Institute of Electrical and Electronics Engineers (IEEE)

2009

79.
Periodic solutions of scalar differential equations without uniqueness, BOLL. UNIONE MAT. ITAL. (9) vol. 2(2) (2009), 445–448
74.
Constraint Satisfaction Problems of Bounded Width, PROCEEDINGS OF THE 50TH SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, FOCS'09 (2009), 595-603

2008

59.
Graphs, polymorphisms and the complexity of homomorphism problems, PROCEEDINGS OF THE 40TH ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC'08 (2008), 789-796
49.
On the density and the structure of the Peirce-like formulae, DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE PROCEEDINGS (2008), 461-474
48.
Subcritical pattern languages for and/or trees, DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE PROCEEDINGS (2008), 437–448

2007

44.
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

2006

37.
Undecidable problems concerning densities of languages, DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE PROCEEDINGS (2006), 69-76
36.
On-line Coloring of I_s-free graphs and co-planar graphs, DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE PROCEEDINGS vol. AF (2006), 61-68
34.
On-line adaptive chain covering of upgrowing posets, DISCRETE MATHEMATICS & THEORETICAL COMPUTER SCIENCE PROCEEDINGS vol. AF (2006), 37-48

2005

33.
An automaton that recognizes the base of a semiretract, WORDS 2005, 5-TH INTERNATIONAL CONFERENCE ON WORDS (2005), 235-247
29.
Approximation Simply Characterized., ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE vol. 140 (2005), 113-117
28.
Conditional Densities of Regular Languages, ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE (2005), 67-79
26.
Probabilistic approach to the lambda definability for fourth order types, ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE (2005), 41-54
25.
Variants of Online Chain Partition Problem of Posets, ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE vol. 140 (2005), 3-13

2004

2003

17.
Statistics of implicational logic, ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE vol. 84 (2003), 205–216

2001

15.
Distance and Measurement in Domain Theory, ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE vol. 45 (2001), 448-462

2000

1997

1995

1992

1990

1989

1988

1987

1985

1984

1.
A computer model of evolution and ecological processes, MODELING, SIMULATION & CONTROL C (1984), 59-63