Regular articles

• Preface

  Tibor Csendes, Zoltán Fülöp

  215

  • PDF
• On the partitioning algorithm

  Béla Csaba

  217-227

  • PDF
• Test suite reduction in conformance testing

  Tibor Csöndes, Sarolta Dibuz, Balázs Kotnyek

  229-238

  • PDF
• A family of fast constant-space substring search algorithms

  Harri Hakonen, Timo Raita

  239-250

  • PDF
• On a merging reduction of the process network synthesis problem

  Csaba Holló

  251-261

  • PDF
• Construction of recursive algorithms for polarity matrices calculation in polynomial logical function representation

  Dragan Janković

  263-283

  • PDF
• Object-oriented model for partially separable functions in parameter estimation

  Jaakko Järvi

  285-302

  • PDF
• Hausdorff dimension of univoque sets

  Gábor Kallós

  303-314

  • PDF
• Optimal parameters of a sinusoidal representation of signals

  András Kocsor, László Tóth, Imre Bálint

  315-330

  • PDF
• Improved greedy algorithm for computing approximate median strings

  Ferenc Kruzslicz

  331-339

  • PDF
• Limiting distortion of a wavelet image codec

  Joonas Lehtinen

  341-356

  • PDF
• On the exact solution of the Euclidean Three- Matching Problem

  Gábor Magyar, Mika Johnsson, Olli Nevalainen

  357-366

  • PDF
• Testing Internet applications : terminology and applicability

  Mazen Malek, Roland Gecse

  377-387

  • PDF
• A study of portability in the deployment of WWW

  András Micsik

  389-402

  • PDF
• A parallelized sequential random search global optimization algorithm

  Pilar M. Ortigosa, János Balogh, Inmaculada García

  403-418

  • PDF