Volume 14,
Number 1,
1999
Dedicated to Professor Ferenc Gécseg on the occasion of his 60th birthday
- András Ádám:
On Some Cyclic Connectivity Properties of Directed Graphs (Examples and Problems).
1-12
- János Csirik, J. B. G. Frenk, Martine Labbé, Shuzhong Zhang:
Two Simple Algorithms for bin Covering.
13-26
- János Demetrovics, Attila Pethö, Lajos Rónyai:
On 1-Representations of Integers.
27-36
- Pál Dömösi, Chrystopher L. Nehaniv:
Complete Finite Automata Network Graphs with Minimal Number of Edges.
37-50
- Joost Engelfriet, Hendrik Jan Hoogeboom, Jan-Pascal Van Best:
Trips on Trees.
51-64
- Zoltán Ésik:
Axiomatizing Iteration Categories.
65-82
- Zoltán Fülöp, Eija Jurvanen, Magnus Steinby, Sándor Vágvölgyi:
On One-Pass Term Rewriting.
83-98
- Balázs Imreh, Masami Ito:
A Note on the Star-Product.
99-104
- Balázs Imreh, Magnus Steinby:
Directable Nondeterministic Automata.
105-116
- Helmut Jürgensen:
Syntactic Monoids of Codes.
117-134
- Werner Kuich:
Tree Transducers and Formal Tree Series.
135-164
- Carlos Martín-Vide, Gheorghe Paun:
Duplication Grammars.
151-164
- Victor Mitrana, Grzegorz Rozenberg:
Some Properties of Duplication Grammars.
165-178
- Arto Salomaa:
Watson-Crick Walks and Roads on DOL Graphs.
179-192
- Kai Salomaa, Sheng Yu:
Generalized Fairness and Context-Free Languages.
193-204
Curriculum Vitae of Ferenc Gécseg
List of Publications by Ferenc Gécseg
Volume 14,
Number 2,
1999
Conference for PhD Students in Computer Science (CSCS),
József Attila University,
Szeged,
Hungary,
July 18-22,
1998
- Tibor Csendes, Zoltán Fülöp:
Preface - Papers from the Conference for PhD Students in Computer Science.
215-216
- Béla Csaba:
On the Partitioning Algorithm.
217-228
- Tibor Csöndes, Sarolta Dibuz, Balázs Kotnyek:
Test Suite Reduction in Conformance Testing.
229-238
- Harri Hakonen, Timo Raita:
A Family of Fast Constant-Space Substring Search Algorithms.
239-250
- Cs. Holló, Z. Blázsik, Csanád Imreh, Z. Kovacs:
On Merging Reduction of the Process Network Synthesis Problem.
251-262
- Dragan Jankovic:
Construction of Recursive Algorithms for Polarity Matrices Calculation in Polynomial Logical Function Representation.
263-284
- Jaakko Järvi:
Object-Oriented Model for Partially Seperable Functions in Parameter Estimation.
285-302
- Gábor Kallós:
Hausdorff Dimension of Univoque Sets.
303-314
- András Kocsor, László Tóth, I. Bálint:
Optimal Parameters of a Sinusoidal Representation of Signals.
315-330
- Ferenc Kruzslicz:
Improved Greedy Algorithm for Computing Approximate Median Strings.
331-340
- Joonas Lehtinen:
Limiting Distortion of a Wavelet Image Codec.
341-356
- Gábor Magyar, Mika Johnsson, Olli Nevalainen:
On the Exact Solution of the Euclidean Three-Matching Problem.
357-376
- Mazen Malek, Roland Gecse:
Testing Internet Applications - Terminology and Applicability.
377-388
- András Micsik:
A Study of Portability in the Deployment of WWW.
389-402
- Pilar Martínez Ortigosa, J. Balogh, Inmaculada García:
A Parallelized Sequential Random Search Global Optimization Algorithm.
403-418
Volume 14,
Number 3,
2000
- Klaus-Dieter Schewe, Torsten Ripke, Sven Drechsler:
Hybrid Concurrency Control and Recovery for Multi-Level Transactions.
419-453
- Ferucio Laurentiu Tiplea, Cristina Badarau:
A Note on Decidability of Reachability for Conditional Petri Nets.
455-459
- Pál Dömösi:
Unusual Algorithms for Lexicographical Enumeration.
461-468
- Takeshi Koshiba, Erkki Mäkinen, Yuji Takada:
Inferring pure context-free languages from positive data.
469-477
- Erkki Mäkinen:
On inferring zero-reversible languages.
479-484
- Marek Michalik:
F codes.
485-489
- Jovanka Pantovic, Dusan Vojvodic:
Note on the Cardinality of some Sets of Clones.
491-495
- Balázs Imreh, J. Fülöp, Ferenc Friedler:
A Note on the Equivalence of the Set Covering and Process Network Synthesis Problems.
497-501
- Béla Csaba:
Note on the Work Function Algorithm.
503-506
- Zsolt Kalmár, Csaba Szepesvári, András Lörincz:
Modular Reinforcement Learning: A Case Study in a Robot Domain.
507-522
Volume 14,
Number 4,
2000
Copyright © Fri Nov 27 19:48:44 2009
by Michael Ley (ley@uni-trier.de)
