List of publications of János
Demetrovics
1. On cardinal numbers of sets of
precomplete classes in
limit-logics. (in Russian; English summary) Acta Cybernetica, Szeged,
1(1972)4,233-239.
2. Maximal classes of limit-logics.
(in Russian)
Proceedings of University of Moscow, Moscow, (1973)1-12.
3. The number of pairwise
non-isomorphic limit logics.
(in Russian; Russian summary) Metody Diskret. Analiz, Novosibirsk,
24(1974)21-29.
4. On properties of minimal
limit-logics. (in Russian)
Studia Sci.Math. Hungarica, Budapest, 9(1974)233-245.
5. On some homomorphisms and orderings
of limit-logics.
(in Russian) Problemy Kibernetiki, Moscow, 30(1975)5-42.
6. On the comparison of limit-logics
by the simulation of
finite-valued logic. (in Russian; English summary) Acta Cybernetica,
Szeged,
2(1975)4,307-312.
7. On the homomorphisms of
limit-logics. (in Hungarian;
Russian summary) Alkalmazott Matematikai Lapok, Budapest,
2(1975)125-138.
8. The main diagonal of Sheffer
functions. (in Hungarian;
Russian and English summary) MTA SZTAKI Közlemények, Budapest,
14(1975)39-46.
9. Structural analysis of the
two-valued logic. (in
Hungarian; Russian summary) Alkalmazott Matematikai Lapok,
Budapest,1(1975)405-424.
10. The utilization of the package
PSL/PSA in the
planning of information systems. (in Russian) Proceedings of Gruz
Academy,
Tbilisi, (1976)95-96.
11. On some problems solvable with
pattern recognition
methods. (with I. Gaudi; in Russian) Proc. of pattern recognition of
Polish
Academy, Warsaw, (1976)285-288.
12. The M maximal limit-logics. (in
Hungarian; English
summary) Alkalmazott Matematikai Lapok, Budapest,
2(1976)57-66.
13. The structure of linear classes in
the prime-valued
logics. (with J. Bagyinszki; in Hungarian; Russian and English summary)
MTA
SZTAKI Közlemények, Budapest, 16(1976)25-52.
14. On the diagonals of Sheffer
functions. (in Russian)
Mitteilungen der Mathematischen Gesellschaft der DDR, Berlin,
2-3(1977)31.
15. On the number of candidate keys.
(in Hungarian;
English summary) Alkalmazott Matematikai Lapok, Budapest,
3(1977)185-191.
16. The structure of the class of
symmetric languages
invariant for inner linear transformations. (with J. Bagyinszki)
In:Proc. of
the Second Hungarian Computer Science Conference, Budapest,
(1977)100-129.
17. On the main diagonal of
Shefferfunctions. Discrete
Mathematics, North-Holland, 21(1978)1-5.
18. On the number of candidate keys.
Informations
Processing Letters, 7(1978)6,266-269.
19. Relational data model. (in
Hungarian; English and
Russian summary) MTA SZTAKI Közlemények, Budapest,
20(1978)21-33.
20. The lattice of symmetric languages
invariant under
inner linear transformaitons. (with J. Bagyinszki; Hungarian and Russian
summary) MTA SZTAKI Közlemények, Budapest, 19(1978)7-16.
21. On the cardinality of candidate
keys. (in Russian)
Rostocker- Mathematisches Kolloquium, Rostock, 1(1978).
22. On the velocity of algorithms for
finding candidate
keys. Theory of operating systems, Visegrád, (1978)21-22.
23. On the cardinality of self-dual
closed classes in
k-valued logics. (with L. Hannák; Russian and Hungarian summary) MTA
SZTAKI
Közlemények, Budapest, 23(1979)8-17.
24. The cardinality of closed sets in
pre-complete
classes in k-valued logics. (with L. Hannák) Acta Cybernetica, Szeged,
4(1979)3,273-277.
25. Contribution to the theory of data
base relations.
(with A. Békéssy) Discrete Mathematics, North-Holland,
27(1979)1-10.
26. On the equivalence of candidate
keys with Sperner
systems. Acta Cybernetica, Szeged, 4(1979)3,247-252.
27. On the number of maximal
dependencies in a data base
relation on fixed order. (with A. Békéssy, L. Hannák, P. Frankl and Gy.
Katona) Discrete Mathematics, North-Holland, 30(1980)2,83-88.
28. A generalization of the functional
dependencies in
the relational data base. (with Gy. Gyepesi; in Russian; English and
Hungarian summary) MTA SZTAKI Közlemények, Budapest,
24(1980)55-79.
29. Generation of functional
dependencies and their
representation by relations. (with Gy. Gyepesi; in Russian; English and
Hungarian summary) MTA SZTAKI Közlemények, Budapest,
24(1980)7-18.
30. Candidate keys and antichains.
SIAM J.
Alg.Disc.Math.,1(1980)1,92.
31. Logical investigation of the
relational data model in
view of functional dependency. (with A. Békéssy and Gy. Gyepesi; in
Hungarian) MTA SZTAKI Tanulmányok, Budapest, 109(1980)1-56.
32. Some remarks on the structure of
P3. (with L. Hannák
and S. S. Marchenkov) Comptes Rendus Math. Acad. Sci., Canada,
2(1980)4,215-219.
33. The structure of the maximal
linear classes in
prime-valued logics. (with J. Bagyinszki). Comptes Rendus Math. Acad.
Sci.,
Canada, 2(1980)4,209-213.
34. On closed classes of self-dual
functions in P3. (with
S. S. Marchenkov and L. Hannák; in Russian) Metody Diskret. Analiz.,
Novosibirsk, 34(1980)38-73,101.
35. Logical and structural study of
relational data
model. (in Hungarian) MTA SZTAKI Tanulmányok, Budapest,
114(1980)1-94.
36. On the minimal keys of homogenous
file. (in Russian)
In: Fundamental Problems of the Application of Math.in Comp. Sci.,Hanoi,
(1980)40-47.
37. Some properties of data base
relations. (with A.
Békéssy) In: Proc. of the 6th conference on the theory of operating
systems, Visegrád, (1980)12-14.
38. About finite algebras with one
operation. (with L.
Hannák; in Russian) Algebrai logika, Novosibirsk, 19(1980)6,
640-645.
39. Generalized functional
dependencies in the relational
data bases. (in Hungarian; with Gy. Gyepesi; English summary) Alk. Mat.
Lapok, Budapest, 6(1980)313-322.
40. Generation of full families and
their reprezentation
by relations. (with Gy. Gyepesi; in Hungarian; English summary) Alk.
Mat.
Lapok, Budapest, 6(1980)323-329.
41. Logical and structural
investigations of the
relational data model. (in Hungarian) Theses of D.Sc.dissert., Budapest,
(1980)1-12.
42. Almost all prime-element algebras
with transitive
automorphism groups are functionally complete. (with L. Hannák and L.
Rónyai) Finite Algebra and Multiple-valued Logic, (Proc. Conf.; Szeged,
1979) In:Colloq. Math.28. Soc. J. Bolyai 28, North-Holland,
28(1981)191-201.
43. On closed classes of selfdual
functions in P3. (with
S. S. Marchenkov and L. Hannák) Finite Algebra and Multiple-valued
Logic,
(Proc. Conf.; Szeged, 1979) In: Colloq. Math.28. Soc. J. Bolyai 28,
North-
Holland, 28(1981)183-189.
44. Mathematical analyisis of the
relational data model.
(Invited Paper) In: Computer Science Conference III., Budapest,
(1981)35-43.
45. Prime-element algebras with
transitive automorphism
groups. (with L. Hannák and L. Rónyai) Comptes Rendus Math. Rep.Acad.
Sci.,
Canada, 3(1981)1,19-22.
46. General dependencies and
algorithms for queries in
relational data bases. (with Gy. Gyepesi; in Hungarian) MTA SZTAKI
Tanulmányok, Budapest, 118(1981)1-55.
47. Extremal combinatorial problems in
relational data
base. (with Gy. Katona) In: Fundamentals of Computation Theory 81,
Lecture
Notes in Comp. Sci., Springer-Verlag, 117(1981)110-119.
48. On the functional dependency and
some generalizations
of it. (with Gy. Gyepesi) Acta Cybernetica, Szeged,
5(1981)3,295-305.
49. Axiomatization of general
functional dependencies in
relational data bases. (with Gy. Gyepesi; in Russian) Kibernetika, Kiev,
2(1981)42-48.
50. Mathematical analysis of the
relational data model.
In: Proc. Third Hungarian Comp. Sci. Conf., Budapest,
(1981)65-73.
51. The number of reducts of a
preprimal algebra. (with
L. Hannák) In: Proc. the twelfth international symposium on
multiple-valued
logic, Paris, IEEE Computer Society, (1982)331-335.
52. On the number of functionally
complete algebras.
(with L. Hannák) In: Proc. the twelfth international symposium on
multiple-valued logic, Paris, IEEE Computer Society,
(1982)329-330.
53. Specification meta systems. (with
E. Knuth and P.
Radó) IEEE Computer, 15(1982)5,29-35.
54. Extremal problems of relational
data bases. (with Gy.
Katona; in Hungarian; English summary) Alk.Mat.Lapok, Budapest,
8(1982)183-193.
55. How to construct a large set of
non-equivalent
functionally complete algebras. (with L. Hannák; Russian and Hungarian
summary) MTA SZTAKI Közlemények, Budapest, 25(1982)49-52.
56. Some logical dependencies in
relational data
base.(with Gy. Gyepesi) Rostock Math. Colloq., 20(1982)33-52.
57. Logical and structural
investigations of the
relational data model. (Russian and Hungarian summary) MTA SZTAKI
Közlemények, Budapest, 27(1982)23-35.
58. Logical dependencies in relational
data base. (with
Gy. Gyepesi) MTA SZTAKI Tanulmányok, Budapest,
133(1982)59-78.
59. On functionally completeness of
prime-element
algebras. (with L. Hannák and L. Rónyai; Russian and Hungarian summary)
MTA SZTAKI Közlemények, Budapest, 25(1982)53-59.
60. The lattice of linear classes in
prime-valued logics.
(with J. Bagyinszki) Banach Center Publ., Warsaw,
7(1982)105-123.
61. On the free spectra of maximal
clones. (with L.
Hannák and L. Rónyai) Comptes Rendus Math.Rep.Acad. Sci., Canada,
IV(1982)6,363-366.
62. Axiomatization of generalized
functional dependencies
in relational data bases. (with Gy. Gyepesi) Kibernetica, Kiev,
2(1982)202-210.
63. Logical and Structual
Investigations of the
Relational Data Model. (Hungarian and Russian summary) MTA SZTAKI
Közlemények, Budapest, 27(1982)23-36.
64. Logical dependencies in relational
data model.
Conference on System Theoretical Aspects in Computer Science, Department
of
Mathematics, Karl Marx University of Economics, Budapest,
2(1982)71-79.
65. Relational data model. (in
Russian) Papers on
Computation, I., Karl Marx Univ. of Economics, Dept. Math., Budapest,
3(1982)19-37.
66. The number of reducts of a
preprimal algebra. (with
L. Hannák) Algebra Universalis, Birkhauser Verlag, Basel,
16(1983)178-186.
67. Selfdual classes and automorphism
groups. (with L.
Hannák and L. Rónyai) Proceedings the Thirteenth International Syposium
on
Multiplevalued Logic, IEEE Computer Society Press, Kyoto,
(1983)122-125.
68 Clones with sharply transitive
automorphism group.
(with L. Rónyai; Russian summary) MTA SZTAKI Tanulmányok, Budapest,
147(1983)11-22.
69. On cardinality of the sets of
closed classes being in
precomplete classes in Pk. (with L. Hannák; in Russian; English summary)
MTA SZTAKI Tanulmányok, Budapest, 147(1983)23-32.
70. On free spectra of clones with
sharply transitive
automorphism group. (with L. Rónyai) Proceedings the Thirteenth
International Symposium on Multiple-valued Logics, IEEE Computer Society
Press, Kyoto, (1983)126-128.
71 The relation between the number of
individuals and
dependencies in the composed data bases. (with Z. Füredi and Gy. Katona,
in
Hungarian, English summary) Alk.Mat.Lapok, Budapest,
9(1983)13-21.
72. A note on minimal matrix
representation of closure
operations. (with Gy. Gyepesi) Combinatorica, Budapest,
3(1983)2,177-179.
73. Extremal problems of a
matrix-representation of
closure relations. (with Gy. Katona) Communications of ICM-82
Proceedings,
Warsaw, 16(1983)40.
74. Minimum matrix representation of
closure operations.
(with Z. Füredi and Gy. Katona) Preprint Mat.Kut., Budapest,
12(1983)1-22.
75. Some generalized type functional
dependencies
formalized as equality set on matrices. (with Gy. Gyepesi) Discrete
Applied
Mathematics, North-Holland, 6(1983)35-47.
76. Problems of extrema in the theory
of relational data
bases. (with Gy. Katona; in Russian) Kibernetika, Kiev,
6(1984)33-37.
77. Discrete mathematics. (with J.
Denev and R. Pavlov;
in Bulgarian; book) Nauka i iszkoszvo, Sofia, 1984.
78. Some remarks on statistical data
procesing. (with P.
Kerékfy etc.; Hungarian and Russian summary) MTA SZTAKI Közlemények,
Budapest, 30(1984)37-51.
79. A Microcomputer-Network Based
Decision Support System
for Health- care Organizations. (with P. Bakonyi etc.) IFAC 9th World
Congress, Preprint, Budapest, XI(1984)85-92.
80 Near unanimity functions of partial
orderings. (with
L. Hannák and L. Rónyai) Proceedings of 14th International Symposium on
Multiple- valued Logic, IEEE, Manitoba, (1984)52-56.
81. Computer Applications in the
Hungarian Agriculture.
(with A. Békéssy etc.) IFAC 9th World Congress, Preprint, Budapest,
XI(1984)99-106.
82. On free spectra of selfdual
clones. (with L. Rónyai)
Mathematical Structures-Computational Mathematics-Mathematical
Modelling, 2,
Sofia, (1984)136-140.
83. Essential minimal TC clones in the
3-valued logics.
(with I.A. Malcev; in Russian; English and Hungarian summary) MTA SZTAKI
Közlemények, Budapest, 31(1984)115-151.
84. On the structure of the relational
data model. In:
Proc. of Conf. on Automata, Languages and Math. Systems, Karl Marx Univ.
of
Economics, Budapest, DM 84-2(1984)28-36.
85. Subclones Burle's in P3. (with
I.A. Malcev; in
Russian) In: Proc. of 9th Conf. of Math. Logic, Novosibirsk,
(1984)56.
86. A Microcomputer-Network Based
Decision Support System
for Health- Care Organizations. (with P. Bakonyi etc.) In: A Bridge
between
Control Science and Technology, IFAC 9th Triennial World Congress,
Pergamon
Press, 3(1985)1651-1658.
87. Balanced relation scheme and the
problem of key
representation. (with H. Thuan etc.; Hungarian and Russian summary) MTA
SZTAKI Közlemények, Budapest, 32(1985)51-80.
88. Computer applications in the
agriculture. (in
Hungarian; with A. Békéssy etc.) Magyar Elektronika, Budapest,
1(1985)26-32.
89. Introduction to computer science.
(with J. Denev and
R. Pavlov; in Hungarian; book) Tankönyvkiadó, Budapest, 1985.
90. Combinatorial Problems of Database
Models. (with Gy.
Katona) In: Algebra, Combinatorics and Logic in Computer Science, (Proc.
Conf., Györ, 1983), Colloq. Math. 42, Soc. J. Bolyai, North-Holland,
42(1985)331-354.
91. Minimum matrix reprezentation of
closure operations.
(with Z. Füredi and Gy. Katona) Disc. Appl. Math., North-Holland,
11(1985)115-128.
92. A microcomputer aided decision
support system for
health-care organizations. (with P. Bakonyi etc.; in Hungarian) Magyar
Elektronika, Budapest, 1(1985)34-40.
93. Connexion between the number of
attributes and
functional dependencies in complex data systems. (with Z. Füredi and Gy.
Katona; in Russian) Kibernetika, Kiev, 5(1985)107-115.
94 Computer Applications in the
Hungarian Agriculture.
(with A. Békéssy etc.) In: A Brige between Control Science and
Technology,
IFAC 9th Triennial World Congress, Pergamon Press,
3(1985)1659-1666.
95. Optimization of selection in
relational expression.
(with H. Thuan and N. X. Huy; Hungarian and Russian summary) MTA SZTAKI
Közlemények, Budapest, 32(1985)27-49.
96. Free spectra of TC-clones in P3.
(with I. A. Malcev;
in Russian) Proc. of 7th Comp. Science Conf., Irkutsk,
1(1985)69-70.
97. Some Remarks on Statistical Data
Processing System
SIS79/GENERA. (with P. Kerékfy etc.) In: System description
methodologies,
IFIP, North-Holland (1985)519-534.
98. TC-clones in P3. (with
I.A. Malcev; in Russian) Proc. of 18th Conf. of Algebra, Kishinev,
(1985)162.
99. Data-base Applications in the
Hungarian Agriculture.
(with G. Buvár etc.; in Rumanian) Automatica, Management, Calculatoare,
Editura Technica, Bucuresti, 49(1985)117-126.
100. Computer-aided Specification
Techniques. (with E.
Knuth and P. Radó; book) Series in Computer Science, World Scientific
Press, 1985.
101. MICRO-SHIVA a form management
system. (with P.
Kerékfy and M. Ruda; in Hungarian) Magyar Elektronika, Budapest,
6(1985)22-31.
102. A Microcomputer Application in a
Hungarian
Health-Organization. (with P. Bakonyi etc.) Automatica, Management,
Calculatoare, Editura Tehnica, Bucuresti, 50(1985)17-27.
103. On the number of clones
containing all constants. A
problem of McKenzie. (with I. Ágoston and L. Hannák) In: Lectures in
Universal Algebra, (Proc. Conf.; Szeged; 1983) Colloq. Math. 43., Soc.
J.
Bolyai, North-Holland, 43(1986)21-25.
104. On the depth of infinitely
generated subalgebras of
Post's iterative algebra P3. (with I. A. Malcev)
In: Lectures in Universal Algebra, (Proc. Conf.; Szeged; 1983) Colloq.
Math.
43., Soc. J. Bolyai, North-Holland, 43(1986)85-96.
105. Conceptual knowledge operations.
(with E. Knuth and
L. Hannák) Computers and Artifical Intelligence, Bratislava,
5(1986)1,3-11.
106. Essential minimal TC-clones on
three-element base
set. (with I.A. Malcev) C.R. Math. Acad. Sci., Canada,
8(1986)3,191-196.
107. On algebraic properties of
monotone clones. (with L.
Hannák and L. Rónyai) Order, D. Reidel Publ. Co.
3(1986)219-225.
108. Some additional properties of
keys for relation
scheme. (with H. Thuan; Russian and Hungarian summary) MTA SZTAKI
Közlemények, Budapest, 34(1986)37-51.
109. On Computer Aided
Conceptualization. (with E. Knuth)
In: Proc. of 19th Hawaii Int. Conf. on System Sciences, Software, Ed.:
B. D.
Shriver, II/A(1986)109.
110. Information System Design: On
Conceptual
Foundations. (with Á. Hernádi and E. Knuth) Information Processing '86,
IFIP North- Holland, (1986)635-640.
111. Keys and superkeys for relation
schemes. (with H.
Thuan) Comp. and Art. Int., Bratislava, 5(1986)6,511-519.
112. Balanced relational schemes and
keys in relational
scheme.(with H. Thuan and N. Huy; in Russian). In: Kibernetica and
Computer
Science. Nauka, Moscow, 3(1986)296-316.
113. Translations of Relation Schemes,
Balanced Relation
Scheme and the Problem of Key Representation. (with H. Thuan etc.)
J.Inf.
Process. Cybern. EIK, Berlin, 23(1987)2-3,81-97.
114. The Poset of Closures as a Model
of Changing
Databases. (with G. Burosch and G.O.H. Katona) Order, D. Reidel Publ.
Co.
4(1987)127-142.
115. Construction of large set of
clones. (with L.
Hannák) Zeitschr. für Math. Logic und Grundlagen der Mathematik, Basel,
33(1987)127-133.
116. Keys, antikeys and prime
attributes. (with V. D. Thi)
Annales Univ. Sci., Setct. Comp., Budapest, 8(1987)35-52.
117. On transformation properties of
conceptual
structures. (with E. Knuth and Á. Hernádi; Proc. of conf.; in Charlotte,
North Carolina ) In: Methodologies for Intelligent Systems,
North-Holland,
New York, London, Amsterdam,(1987)217-223.
118. Some additonal properties of keys
for relation
schemes.(with H. Thuan) Serdica, Bulgaricae math. publ.,
Sofia,13(1987)267-271.
119. On the construction of Burle on
clone the three-elementset.
(with I. A. Malcev; in Russian) Preprint of Ins. of Math., Novosibirsk,
1(1987)3-43.
120. On monotone clones. (with L.
Hannák and L. Rónyai;
English summary) MTA SZTAKI Tanulmányok,
Budapest,202(1987)39-62.
121. On conceptual transformations.
(with E. Knuth and S.
Csizmazia) In: Artifical Intelligence and Information-Control Systems of
Robots-87.(Proc. of conf. Smolenice; 1987, invited paper)
(1987)55-62.
122. Transformation properties of
conceptual
structures.(with E. Knuth, Á. Hernádi) MTA SZTAKI, Working
Paper,Budapest,
II-78(1987)1-19.
123. Extremal combinatorial problems
of database models.
(with G.O.H. Katona) Lecture Notes in Comp. Sci.,Springer-Verlag,
305(1988)99-127.
124. On Keys in the Relational Data
Model. (with V. D.
Thi) J. Inf. Process. Cybern. EIK, Berlin,
24(1988)10,515-519.
125. On the number of databases and
closure operations.
(with G. Burosch etc.) Preprint of Math. Inst. of Hung. Acad of
Sci.,Budapest, 4(1988)1-33.
126. Algebraic properties of crowns
and fences. (with L.
Rónyai) Preprint, MTA SZTAKI Budapest, IA, 1(1988)1-10.
127. Some results about functional
dependencies.(with
V.D.Thi) Acta Cybernetica, Szeged, 8(1988)3,273-278.
128. LATOR - a Professional Database
Management System
for Local Network. (with L. Hannák etc.; in Korean) In: International
Conference KNVVT Artificial Intelligence, Pyongyang,
(1988)147-159.
129. On the Information Retrieval
ABLAK. (with L. Hannák
etc.; in Russian) In: International Conference KNVVT Artificial
Intelligence, Pyongyang, (1988)247-252.
130. Relations and minimal keys. (with
V.D.Thi) Acta
Cybernetica, Szeged, 8(1988)3,279-285.
131. LATOR - a Database Management
System for Local
Networks. (with Gy. Gyepesi etc.) In: Artificial Intelligence III.
Methodology, Systems, Applications, Elsevier Science Publ. B.V.,
North-Holland, (1988)347-354.
132. Keys, antikeys and prime
attributes. (with V.D.Thi)
ICOMIDC - Symposium on Math of Comput, HoChiMinch,
(1988)31-45.
133. Insurance Information System -
ABLAK (with L.
Hannák etc.; in Korean) International Conference. Artificial
Intelligence,
Pyongyang, (1988)159-162.
134. Application of Petri Nets for
Planning DBMS. (with
E. Knuth etc.; in Russian; book) Nauka, Moscow, (1988).
135. LATOR - a Professional Database
Management System
for Local Network. (with L. Hannák etc.; in Russian) In: International
Conference KNVVT Artificial Intelligence, Pyongyang,
(1988)225-247.
136. Extremal Combinatorial Problems
of Database Models.
(with G. O. H. Katona) In: Math. Fundamentals of Database
Systems,Technische
Universitat Dresden, Dresden 98(1988)1,7-34.
137. On the Number of Unions in a
Family of Sets. (with
Gy. Katona and P. P. Pálfy) Annals of New York Academy of Sciences,
(1988)18-27.
138. On the Construction of Burle
Clones and the Set of
three elements. (with I. A. Malcev; in Russian) Acta Cybernetica,
Szeged,
9(1989)1,1-25.
139. About closure operation in
relation database (with
N. X. Huy; in Russian) Publicationes Mathematicae, Debrecen,
36(1989)33-50.
140. Structure of Closure in
Relational Databases. (with
N. X. Huy; in Russian) In: Conference on intelligent management systems,
Bulgarian Academy of Sciences, Varna, (1989)148-154.
141. Algebraic Properties of Crowns
and Fences. (with L.
Rónyai) Order D. Reidel Publ. Co. 6(1989)91-99.
142. Functional dependencies and the
semilattice of
closed classes. (with L. O. Libkin, etc.) MFDBS 89, 2nd Symposium on
Math.
Fundamentals of Database Systems, Visegrad, Hungary, 1989. Lecture Notes
in
Computer Science, 364(1989)136-147.
143. Translations of relation schemes
and representations
of closed sets. (with N. X. Huy) PU.M.A.Ser. A,1(1990)3-4,
299-315.
144. Generating sets for Crones and
Fences.(with L.
Rónyai) Rostocker Mathematisches Kolloquium, Rostock, 39(1990)II,
65-73.
145. Intersections of Isotone Clones
on a Finite Set.
(with M. Miyakawa etc.) IEEE Proc. of the 20th International Symposium
on
Multiple-Valued Logic (1990)248-253.
146. Closed Sets and Translations of
Relation Schemes.
(with N. X. Huy) Computers Math. Applic., Pergamon Press,
21(1991)1,13-23.
147. LATOR - professional database
management system for
local networks. (with Gy. Gyepesi etc.) Math. and Comp. in Simulation,
North-Holland, 33(1991)121-128.
148. Information system for insurance
companies (ABLAK).
(with L. Hannák etc.) Math. and Comp. in Simulation, North-Holland,
33(1991)1-9.
149. Dependency Types. (with L.
Rónyai, H.N.Son)
Computers Math. Applic.,Pergamon Press, 21(1991)1,25-33.
150. On the number of databases and
closure operations.
(with G. Burosch etc.) Theoretical Comp. Science, North-Holland,
78(1991)377-381.
151. Models for database and closure
operations. (with L.
O. Libkin etc; in Russian) In: Kibernetika, Kiev,
1(1991)40-50.
152. On the representation of
dependencies by
propostional logic. (with L. Rónyai, H.N.Son) MFDBS 3rd Symp. on Math.
Fundamentals of Database. 1991; In: Lecture Notes in Computer Science,
Springer-Verlag, 495(1991)230-257.
153. On Relational Database Schemes
Having Unique Minimal
Key. (with J. Biskup etc.) J.Inform.Process.Cybern, EIK, Berlin,
27(1991)4,217-225.
154. Partial dependencies in
relational databases.
(with Gy. Katona; in Hungarian) Alk. Mat. Lapok, Budapest,
15(1991)163-179.
155. Branching dependency in
relational databases. (with
G.O.H. Katona, A. Sali; in Hungarian) Alk. Mat.Lapok, Budapest,
15(1991)181-196.
156. On the composition and
decomposition of
attributes and tuples. (with L. Rónyai and H.N. Son) Proc. of the 4th
International Conference on Database Theory, Berlin,
(1992)71-86.
157. Representation of Closure for
Functional
Multivaluated and Join Dependencies. (with N. X. Huy) Computers and
Artificial Intelligence,11(1992)2,143-154.
158. Partial dependencies in
relational databases and
their realization. (with G.O.H. Katona etc.) Disc. Appl. Math.
North-Holland, 40(1992)127-138.
159. Functional dependencies in
relational databases: A
lattice point of view. (with L. Libkin etc.) Disc. Appl. Math.
North-Holland, 40(1992)155-185.
160. A note on intersections of
isotone clones. (with L.
Rónyai) Acta Cybernetica, Szeged, 10(1992)3,217-220.
161. Normal Form Relation Schemes: A
New
Characterization. (with G. Hencsey, L. Libkin, etc.) Acta Cybernatica,
Szeged, 10(1992)3,141-153.
162. On the interaction between
closure operations and
choice functions with applications to relational databases (with G.
Hencsey,
L. Libkin, etc.) Acta Cybernatica, Szeged, 10(1992)3,129-139.
163. Functional dependencies among
Boolean dependencies.
(with L. Rónyai and H.N. Son.) Annals of Mathematics and Artificial
Intelligence,7(1993)83-106.
164. A survey of some combinatorial
results concerning
functional dependencies in database relations. (with G.O.H. Katona)
Annals
of Mathematics and Artificial Intelligence, 7(1993)63-82.
165. Some problems concerning keys for
relation schemes
and relations in the relational datamodel. (with V.D. Thi) Information
Processing Letters, 46(1993)179-184.
166. Algorithms for Generating an
Armstrong Relation and
Inferring Functional Dependencies in the Relational Datamodel. (with
V.D.
Thi) Computers Math. Applic. 26(1993)4,43-55.
167. On the Number of Closure
Operations. (with G.
Burosch, G.O.H. Katona, etc.) Bolyai Society Mathematical Studies,
Combinatorics, Keszthely, 1(1993)91-105
168. Generating Armstrong Relations
for Relation Schemes
and Inferring Functional Dependencies from Relations. (with V.D. Thi)
International Journal on Information Theories & Applications, Sofia,
1(1993)4, 3-12
169. Some computational problems
related to the
functional dependency in the relational datamodel (with V.D. Thi) Acta
Sci.
Math., Szeged, 57(1993)1-4, 627-638
170. On the time complexity of
algorithms related to
Boyce-Codd normal form (with V.D. Thi) Serdica - Bulgaricae mathematicae
publicationes, Sofia, 19(1993)134-144
171. Equality schemes and equality
scheme dependencies in
relational databases (with L. Rónyai and H.N. Son) Serdica - Bulgaricae
mathematicae publicationes, Sofia, 19(1993)121-133
172. Some problems concerning
Armstrong relations of dual
schemes and relation schemes in the relation datamodel (with V.D. Thi)
Acta
Cybernetica, Szeged, 11(1993)1-2, 35-47
173. Normal Forms and Minimal Keys in
the Relational
Datamodel (with V. D. Thi) Acta Cybernetica, Szeged, 11(1994)3,
205-215
174. Databases, Closure Operations and
Sperner Families
(with H.N. Son) Proc. Conference on Extremal Problems for Finite Sets,
Visegrád, (1991), Bolyai Society Mathematical Studies, Budapest,
3(1994)199-203
175. Adatvédelem kommersz-rendszerekben (in Russian)
(with F.Urbánszki)
ITA-94 Conference, Second International Workshop, Information theories
and
application. Sandanski, Bulgaria, (1994)
176. Family of Functional Dependencies and Its
Equivalent
Descriptions.(with V.D.Thi) Computers and Mathematics with Applications.
29(1995)4. 101-109
177. Armstrong relations, functional dependencies and
strong
dependencies. with V.D. Thi) Computers and Artificial Intelligence,
Bratislava,14(1995)3, 279-298
178. Minimal Representations of Branching
Dependencies.(with Gy. Katona,
A. Sali) Acta Sci. Mathematica, Szeged,
90(1995)213-223
179. The Average Lenght of Keys and Functional
Dependencies in (Random)
Databases. (with G.O.H. Katona, D. Miklós,O. Seleznjev, B. Thalheim)
Proc.
of the 5th International ICDT' 95 Conference on Database Theory. Lecture
Notes in Computer Science, Springer Verlag, Prague,
893(1995)266-279
180. Some Remarks On Generating Armstrong Relation And
Inferring
Functional Dependencies. (with V.D. Thi) Acta Cybernetica.
12(1995)167-180
181. Some Observations on the Minimal Armstrong
Relations for Normalized
Relation Schemes. (with V. D. Thi) Computers and Artificial
Intelligence.
14(1995)5, 455-467
182. Some Results about Normal Forms for Functional
Dependency in the
Relational Datamodel. (with V.D. Thi) Discrete Applied
Mathematics.69(1996)61-74
183. Enumeration of Function and Bases
of Three-Valued
Set Logic under Compositions with Boolean Functions. (with C. Reischer,
D.
Simovici, I.Stojmenovic): In: Proc. 24th IEEE ISMVL,
(1994)164-171
184. Clones and maximal sets in set
logic containing all
Boolean functions.(with Rónyai, L., Rosenberg, I. G. and I. Stojmenovic)
(1996). Acta Sci. Math., Szeged,
62(1996)345-357
185. Asymptotic properties of keys and
functional
dependencies in random databases. (with G.O.H. Katona, D. Miklós, O.
Seleznjev, B. Thalheim) Theoretical Computer Science.
190(1998)151-166
186. Periodical scheduling. (with K.
Friedl, L. Rónyai).
Publicationes Mathematicae, Debrecen, 52(1998)/3-4,337-342;
Proceedings of the Numbers, Functions, Equations’98 International
Conference, Noszvaj, Hungary, (1998) 77-78
187. Design type problems motivated by
database theory. (with
G.O.H. Katona, A. Sali). Journal of Statistical Planning and
Inference.
72(1998) 149-164
188. Describing candidate keys by
hypergraphs (with V.D. Thi).
Computer and Artificial Intelligence. 18(1999) 2, 191-207
189. Functional dependencies in Random
databases. (with G.O.H.
Katona, D. Miklós, O. Seleznjev, B. Thalheim). Studia Scientiarum
Mathematicarum Hungarica 34(1998) 127-140
190. Előadások adatbázis
szerkezetekből. (Békéssy
A.). ELTE Egyetemi Jegyzet. ELTE Eötvös Kiadó. (1999)
191.DEMETROVICS, J. - PETHŐ, A. - RÓNYAI, L.:
On plus-minus 1 representations of integers. Acta Cybernetica.
14:27-36.
(1999)
192. ANSTEE, R. - DEMETROVICS,
J. - KATONA, G.O.H. -
SALI, A.:Low Discrepancy Allocation of Two-Dimensional Data. Proc. of
the
1st International Symposium, FoIKS 2000, Germany. Lecture
Notes in
Computer Science. 1762. 1-12.
(2000)
193. DEMETROVICS, J. - KATONA, G.O.H.
- MIKLÓS, D.:
Error-Correcting Keys in Relational Databases. Proc. of the 1st
International Symposium, FoIKS 2000, Germany. Lecture Notes in Computer
Science. 1762. 88-93. (2000)
| 
