- Word level model checking /E . M . Clarke, X. Zhao .
-Code problems on traces /V. Diekert, A. Muscholl .
-Models of DNA computation /A . Gibbons, M. A m o s , D. Hodgson .
-Theory and practice of action semantics /P.D. Mosses .
-Linear time temporal logics over Mazurkiewicz traces /M. Mukund, P.S. Thiagarajan.
-Partial order reduction: model-checking using representatives /D . A . Peled.
-Nonmonotonic rule systems: forward chaining, constraints, and complexity /J.B. Remmel.
-Mind the gap! Abstract versus concrete models of specifications /D. Sannella, A. Tarlecki.
-A sequent calculus for subtyping polymorphic types /J. Tiuryn.
-Kolmogorov complexity: recent research in Moscow /V.A. Uspensky.
-A modal logic for data analysis /P. Balbiani.
-From specifications to programs: a fork-algebraic approach to bridge the gap /G. A. Baum, M.F. Frias, A . M . Haeberer, P.E. Martinez Lopez.
-Logic of predicates with explicit substitutions /M . A . Bednarczyk.
-On the query complexity of sets /R. Beigel, W. Gasarch, M. Kummer, G. Martin, T. McNicholl, F. Stephan.
-A lambda calculus of incomplete objects /V. Bono, M. Bugliesi, L. Liquori.
-Bisimilarity problems requiring exponential time /M. Boreale, L. Trevisan.
-Linear dynamic Kahn networks are deterministic /A. de Bruin, S.H. Nienhuys-Cheng.
-Shortest path problems with time constraints /X. Cai, T. Kloks, C.K. Wong.
-Parallel alternating-direction access machine /B. S. Chlebus, A. Czumaj, L. Gasieniec, M. Kowaluk, W. Plandowski.
-Specification and verification of timed lazy systems /F. Corradini, M. Pistore.
-A class of information logics with a decidable validity problem /S. Demri.
-On the power of nonconservative PRAM /A. Dessmark, A. Lingas.
-Self-similarity viewed as a local property via tile sets /B. Durand.
-Simulation of specification statements in Hoare logic /K. Engelhardt, W.-P. de Roever.
-Equational properties of iteration in algebraically complete categories /Z. Esik, A. Labella.
-On unconditional transfer /H. Fernau.
-(poly(log log n), poly(Iog log n))-restricted verifiers are unlikely to exist for languages in NP /D. Fotakis, P. Spirakis.
-Minimizing congestion of layouts for ATM networks with faulty links /L. Gasieniec, E. Kranakis, D. Krizanc, A. Pelc.
-Polynomial automaticity, context-free languages, and fixed points of morphisms (extended abstract) /L Glaister, J. Shallit.
-Causal testing /U. Goltz, H. Wehrheim.
-Construction of list homomorphisms by tupling and fusion /Z. Hu, H. Iwasaki, M. Takeichi.
-Probabilistic metric semantics for a simple language with recursion /M. Kwiatkowska, G. Norman.
-Dynamic graphs /A. Maggiolo-Schettini, J. Winkowski.
-Equations on trees /S. Mantaci, A. Restivo.
-On the equivalence problem for E-pattern languages (extended abstract) /E. Ohlebusch, E. Ukkonen.
-Specifying and verifying parametric processes /W. Pawtowski, P. Paczkowski, S. Sokotowski .
-On saturation with flexible function symbols /R. Pliuskevicius.
-Approximating good simultaneous diophantine approximations is almost NP-hard /C. Rôssner, J.-P. Seifert.
-On the conjugation of standard morphisms /P. Séébold.
-A semantic matching algorithm: analysis and implementation /H. Shi. -Routing on triangles, tori and honeycombs /J.F. Sibeyn.
-A uniform analysis of trie structures that store prefixing-keys with application to doubly-chained prefixing-tries /P. de la Torte , D. T. Kao.
-On fairness in terminating and reactive programs /A. Wabenhorst.
-Polynomial time samplable distributions /T. Yamakami.
-From static to dynamic abstract data-types /E . Zucca
