| 2006 |
| 282. |
Łukasz Bolikowski, Anna Gambin: New metrics for phylogenies
|
| 2005 |
| 281. |
Stefan Dziembowski: Intrusion-Resilience via the Bounded-Storage Model
|
| 280. |
Sibylle Froeschle, Sławomir Lasota: Decomposition and Complexity of Hereditary History Preserving Bisimulation on BPP
|
| 2004 |
| 279. |
Norbert Dojer, Anna Gambin, Bartek Wilczyński, Jerzy Tiuryn: Applying Dynamic Bayesian Networks to Perturbed Gene Expression Data
|
| 278. |
Michał Drabikowski: Wykorzystanie przypisań strukturalnych do odtwarzania struktury białek z lokalnych deskryptorów
|
| 277. |
Michał Drabkowski, Jerzy Tiuryn: Complexity analisys of finding optimal assignments' problem in local descriptor- based approach to protein structure prediction
|
| 276. |
Sibylle Froeschle: Composition and Decomposition in True- Concurrency
|
| 275. |
Łukasz Kowalik: More on Light Graphs in 3-Connected Plane Graphs Without Triangular or Quadrangular Faces
|
| 2003 |
| 274. |
A. Zadrożny: A Method of Encrypting Groups of Pixels
|
| 2002 |
| 273. |
Wojciech Moczydłowski, Alfons Geser: Termination of Single-Threaded One-rule Semi-Thue Systems
|
| 272. |
Michał J. Gajda: Extensible syntax as an orthogonal language feature
|
| 271. |
Viviana Bono, Jerzy Tiuryn, Paweł Urzyczyn: Type Inference for Nested Self Types
|
| 270. |
Łukasz Krzeszczakowski: Pebble games on trees
|
| 269. |
Włodzimerz Drabent, Mirosława Miłkowska: Proving Program Correctness and Completeness of Normal Programs - a Declarative Approach
|
| 268. |
Marcin Kubica: Temporal-Style Specifications of Pointer Data-Structures
|
| 267. |
Aleksy Schubert: Algebraic Higher-Order Matching
|
| 266. |
Aleksy Schubert: A Note on Observational Equivalence in the Simply Typed lambda-calculus
|
| 2001 |
| 265. |
Linh Anh Nguyen: A Fixpoint Semantics and an SLD-Resolution Calculus for Modal Logic Programs
|
| 264. |
Alfred Tarski Centenary Conference 28 May - 1 June 2001:
|
| 2000 |
| 263. |
A. Malinowski: Selected communication problems in networks with faults
|
| 262. |
J. Kachniarz, A. Szałas: Rule Based Definition Language for Logical Transformers
|
| 261. |
Linh Anh Nguyen: Clausal Tableau Systems and Space Bounds for the Modal Logics K, D, T, KB, KDB and B
|
| 1999 |
| 260. |
A.Gambin: Combinatorial Methods in Approximation Algorithms for Markov Chains with Large State Space (Ph. D. Thesis)
|
| 259. |
Linh Anh Nguyen: Constructing the Least Models for Positive Modal Logic Programs
|
| 258. |
J.Tiuryn: Type Reconstruction for Functional Programs with Subtyping over a Lattice of Atomic Types
|
| 257. |
W.Ogryczak: Inequality Measures and Equitable Approaches to Location Problems
|
| 256. |
P.Urzyczyn: Recursive Types and Type Embeddings
|
| 1998 |
| 255. |
G.Grudziński: Aminimal system of disjunctive properties for strictness analysis
|
| 254. |
M.Zawadzki: Exact and approximation algorithms for the p-centre problem
|
| 253. |
Helmut Seidl, Damian Niwiński: On Distributive Fixpoint Expressions
|
| 252. |
Jacek Chrząszcz: Polymorphic Subtyping Without Distributivity
|
| 251. |
Marcin Benke: Predicative Polymorphic Subtyping
|
| 250. |
Janusz S. Bień: Język polski w sieciach komputerowych
|
| 1997 |
| 249. |
Sławomir Lasota: Open Maps as a Bridge between Algebraic Observational Equivalence and Bisimilarity
|
| 248. |
Martin Dietzfelbinger, Anna Gambin, Sławomir Lasota: On Different Models for Packet Flow in Multistage Interconnection Networks
|
| 247. |
G.Grudziński: An improved disjunctive strictness analysis for lazy functional languages
|
| 246. |
W.Ogryczak: On the Distribution Approach to Location Problems
|
| 245. |
Mariangiola Dezani-Ciancaglini, J.Tiuryn, P.Urzyczyn: Discrimination by Parallel Observers: the Algorithm
|
| 244. |
J.Tiuryn: Subtyping over a Lattice
|
| 243. |
W.Ogryczak: Multiple Criteria Linear Programming Model for Portfolio Selection
|
| 242. |
W.Ogryczak, A.Ruszczyński: From Stochastic Dominance to Mean-Risk Models: Semideviations as Risk Measures
|
| 241. |
M.Kowaluk: Geometrical algorithms for selected 2-center problems (Ph. D. Thesis)
|
| 240. |
L.Czaja: Examples of specification by cause-effect structures (30 case studies)
|
| 239. |
A.Schubert: Second-order unification and type inference for Church-style polymorphism
|
| 238. |
M.Iglewski, M.Kubica, J.Madey, J.Mincer-Daszkiewicz, K.Stencel: TAM'97 the Trace Assertion Method of Module Interface Specification. Reference Manual
|
| 1996 |
| 237. |
A.Schubert: Linear interpolation for the higher order matching problem
|
| 236. |
P.Urzyczyn: Inhabitation in typed lambda-calculi (A syntactic approach).
|
| 235. |
M.Benke: An Algebraic Characterization of Typability in ML with Subtyping
|
| 234. |
S.Dziembowski: The fixpoint Bounded-Variable Queries are PSPACE-complete
|
| 233. |
10. Forum Informatyki Teoretycznej:
|
| 232. |
Logic, Algebra and Computer Science Helena Rasiowa in memoriam:
|
| 231. |
A.Malinowski: Efficient Byzantine Agreement in Networks with Random Faults
|
| 230. |
W.M. Turski: Five Philosophers Revisited and an Unrelated Addendum
|
| 229. |
P.Gajewski: A simulator for behavioural specifications
|
| 228. |
L.Czaja: Minimal/maximal time cause-effect structures (revised version)
|
| 227. |
J.S. Bień: Komputerowa weryfikacja opisu składni polskiej
|
| 226. |
K.Szafran: Analizator morfologiczny SAM-95 -- opis użytkowy
|
| 225. |
M.Jurdziński, M.Konarski, A.Schubert: The EML Kit Version 1
|
| 224. |
L.Czaja: Cause-effect structure processes and their link with Mazurkiewicz's traces
|
| 223. |
W.Ogryczak: Equitable Multiple Criteria Programming
|
| 222. |
J.Tiuryn: A Sequent Calculus for Subtyping Polymorphic Types
|
| 1995 |
| 221. |
G.Grudziński: Intersection Types Spell Polymorphic Invariance for Strictness Analysis
|
| 220. |
M.Benke: Some Complexity Bounds for Subtype Inequalities
|
| 219. |
J.Tiuryn, P.Urzyczyn: The Subtyping Problem for Second-Order Types is Udecidable
|
| 218. |
M.Iglewski, M.Kubica, J.Madey, J.Mincer-Daszkiewicz, K.Stencel: The Fun-Project: From Requirements Specification to Program Presentation
|
| 217. |
K.Stencel: Refined Simulation Techniques for the Trace Assertion Method
|
| 216. |
D.Niwiński: Fixed points characterization of infinite behaviour of finite state systems
|
| 215. |
V.Pratt, J.Tiuryn: Satisfiability of Inequalities in a Poset
|
| 214. |
W.Ogryczak: On the Lexicographic Minimax Approach to Location Problems
|
| 213. |
J.Tiuryn, M.Wand: Untyped Lambda-Calculus with Input-Output
|
| 212. |
L.Czaja: Representing CSP-like system as cause-effect structures
|
| 211. |
A.Szałas: Relational Calculus with Recursion Quantifiers
|
| 210. |
L.Czaja: Behaviour of cause-effect structures (Properties of four semantics)
|
| 209. |
ANNUAL REPORT 1995:
|
| 208. |
FMTA'95 Formal Specifications: Foundations, Methods, Tools and Applications
|
| 207. |
L.Czaja: Decomposition of cause-effect structures
|
| 206. |
L.Czaja: Lattice of cause-effect structures and their set-theoretic representation
|
| 205. |
M.Iglewski, M.Kubica, J.Madey: Trace Specifications of Non-deterministic Multi - object Modules
|
| 204. |
J.Tiuryn: Equational Axiomatization of Bicoercibility for Polymorphic Types
|
| 203. |
P.Urzyczyn: Positive Recursive Type Assignment
|
| 202. |
W.M.Turski: Behavioural specifications
|
| 201. |
T.Nowicki: A dynamical model of behavioural specifications
|
| 1994 |
| 200. |
S. van Bakel, L.Liquori, S.Ronchi, P.Urzyczyn: Comparing Cubes of Typed and Type Assignment Systems
|
| 199. |
M.Benke: Efficient Type Reconstruction in the Presence of Inheritance
|
| 198. |
M.Iglewski, J.Madey, K.Stencel: On Fundamentals of the Trace Assertion Method
|
| 197. |
CSL'94, 1994 Annual Conference of the European Association for Computer Science Logic:
|
| 196. |
ANNUAL REPORT 1994:
|
| 195. |
L.Gąsieniec, Kunso Park: Fully Optimal Parallel Prefix Matching
|
| 194. |
T.Rogula, Z.Weiss: DICS Distributed Interprocess Communication System
|
| 193. |
P.Urzyczyn: The emptiness problem for intersection types
|
| 192. |
D.Niwiński, I.Walukiewicz: Games for the u - calculus
|
| 191. |
I.Walukiewicz: A Complete Deductive System for the u - Calculus
|
| 190. |
J.Bojanowski, M.Iglewski, J.Madey, Abdellatif Obaid: Functional Approach to Protocols Speciffication
|
