LIST OF PUBLICATIONS
Dezső Miklós
Edited volumes
Halász G, Lovász L, Miklós D, Szőnyi T (Eds) Sets, graphs and numbers. Budapest, 1991 (Colloquia
[1]
Mathematica Societatis János Bolyai, 60) North-Holland, Amsterdam, 1992.
[2]
Frankl P, Füredi Z, Katona GOH, Miklós D (Eds) Extremal Problems for Finite Sets; Papers from the
conference held in Visegrád, June 16-21, 1991 (Bolyai Society Mathematical Studies, 3) János Bolyai
Mathematical Society, Budapest, 1994.
Miklós D, T.Sós V, Szőnyi T (Eds.) Combinatorics, Paul Erdős is eighty, Vol 1. János Bolyai Mathematical
[3]
Society, Budapest, 1993.
Miklós D, T.Sós V, Szőnyi T (Eds.) Combinatorics, Paul Erdős Is Eighty, Vol. 2, (Keszthely, 1993) J. Bolyai
[4]
Math. Soc., Budapest, 1996.
[5]
Bollobás B., Kozma, R., Miklós, D (Eds.) Handbook of Large-Scale Random Networks, Bolyai Society
Mathematical Studies, Vol. 18, Springer, 2009.
Conference volumes, other publications
[1]
D. Miklós, Some results related to a conjecture of Chvatal, Ph. D. Dissertation, Ohio State University, 1986
[2]
N. Manickam, D. Miklós, On the number of non-negative subsums of a non-negative partial sum, in
Combinatorics (eds.: A. Hajnal, L. Lovász, V. T. Sós), Colloquia Mathematica Societatis János Bolyai, 52
(1988) pp. 385–392.
•
G Marino, G Chiaselotti: A method to count the positive 3-subsets in a set of real numbers with nonnegative sum., European J. Combin. 23 (2002), no. 5, 619--629.
•
G Marino, G Chiaselotti New results related to a conjecture of Manickam and Singhi ., European J.
Combin. Volume 29, Issue 2, February 2008, Pages 361-368.
[3]
J. Demetrovics, G. O. H. Katona, D. Miklós, O. Seleznjev, B. Thalheim: The Average Length of Keys and
Functional Dependencies in (Random) Databases, Proceedings of ICDT'95, Praha, Springer-Verlag, 1995.
•
Demetrovics J, Katona GOH, Miklos D: MATHEMATICAL AND COMPUTER MODELLING,
38 (7-9) : 763-772 (2003)
•
Seleznjev O, Thalheim B: Average Case Analysis in Database Problems, METHODOLOGY
AND COMPUTING IN APPLIED PROBABILITY, 5 (4) : 395-418 (2003)
•
Biskup J: LECTURE NOTES IN COMPUTER SCIENCE, 1358 : 29-54 (1999)
•
Biskup J: HILDESHEIMER INFORMATIK-BERICHTE, (28) : 1 (1995)
•
J Biskup: Achievements of Relational Database Schema Design Theory Revisited , In: Semantics
in Databases eds Bernhard Thalheim, Leonid Libkin, LNCS 1358, Springer, 1998
•
C Wyss, C Giannella, E Robertson : FastFDs: A Heuristic-Driven, Depth-First Algorithm for
Mining Functional Dependencies from Relation Instances, in: Data Warehousing and Knowledge
Discovery eds: Y. Kambayashi, Werner Winiwarter, Masatoshi Arikawa , LNCS 2114, Springer,
2001
•
Henning Koehler: Finding Faithful Boyce-Codd Normal Form Decompositions, in: Algorithmic
Aspects in Information and Management eds Siu-Wing Cheng and Chung Keung Poon LNCS
4041, Springer, 2006
[4]
J. Demetrovics, G. O. H. Katona, D. Miklós: Error-correcting keys in relational databases, in: Foundations
of Information and Knowledge Systems, LNCS 1762, Springer, 2000, 88--93.
•
Sven Hartmann, Sebastian Link and Klaus-Dieter Schewe S Hartmann: Error-Robust Functional
Dependencies, Fundamenta Informaticae 59 (2004) 365–372
•
S Link, KD Schewe: Distance functional dependencies in the presence of complex values, Acta
Cybernetica, 2004
•
J. Demetrovics, G. O. H. Katona, D. Miklós: Functional dependencies in presence of errors, in:
Foundations of Information and Knowledge Systems, LNCS 2284, Springer, 2002, 85--92.
[5]
J. Demetrovics, G. O. H. Katona, D. Miklós: Functional dependencies in presence of errors, in:
Foundations of Information and Knowledge Systems, LNCS 2284, Springer, 2002, 85--92.
•
Sven Hartmann, Sebastian Link and Klaus-Dieter Schewe S Hartmann: Error-Robust Functional
Dependencies, Fundamenta Informaticae 59 (2004) 365–372
•
O. Seleznjev, B. Thalheim: Random databases with approximate record matching and epsilonentropy, Department of Mathematical Statistics Umea
•
O. Seleznjev: Random databases with approximate record matching and –entropy Department of
Mathematical Statistics Umea
•
S Link, KD Schewe: Distance functional dependencies in the presence of complex values, Acta
Cybernetica, 2004
•
G Bogdanova, T Georgieva Using error-correcting dependencies for collaborative filtering, Data
& Knowledge Engineering Volume 66, Issue 3, September 2008, Pages 402-413
[6]
Demetrovics J, Katona GOH, Miklós D Functional dependencies distorted by errors , Workshop on Discrete
Mathematics and Data Mining, Second SIAM International Conference on Data Mining, Arlington, VA (Eds:
Boros E, Hammer PL) SIAM, Philadelphia, 2002, pp 133-138
[7]
Demetrovics J, Katona GY, Miklós D, Sali A, Kombinatorikus problémák relációs adatbázisokban ,
Közgyűlési Előadások 2000. Az MTA 175 éve (Ed: Glatz F) Magyar Tudományos Akadémia, Budapest,
2002, pp 139-150
[8]
J. Demetrovics, G. O. H. Katona, D. Miklós: On the Security of Individual Data, in: Foundations of
Information and Knowledge Systems, LNCS 2942, (Eds. Dietmar Seipel and José Maria Turull-Torres),
Springer Verlag, Berlin, 2004, pp. 49--58.
R AHLSWEDE, H AYDINIAN ON SECURITY OF STATISTICAL DATABASES, Information Theory,
2006 IEEE International Symposium on, 2006
[9]
J. Demetrovics, G. O. H. Katona, D. Miklos, and B. Thalheim: On the Number of Independent Functional
Dependencies, in: Foundations of Information and Knowledge Systems, LNCS 3861, (Eds. Jürgen Dix,
Stephen J. Hegner), Springer Verlag, Berlin, 2006, pp. 83-91.
[10] D. Miklos, Subsums of a finite sum and extremal sets of vertices of the hypercube, Horizons of Combinatorics
(eds.: E. Győri, G.O.H. Katona, L. Lovász), Bolyai Society Mathematical Studies vol 17, Springer,
Heidelberg, 2008, pp. 141-161.
Journal articles
[1]
D.E. Daykin, A.J.W. Hilton, D. Miklós, Pairings from down-sets and up-sets in distributive lattices, J.
Combin. Theory (A), 34 (1983) pp. 215 – 230.
[2]
0.485
D. Miklós, Great intersecting families of edges in hereditary hypergraphs, Discrete Mathematics, 48 (1984)
pp. 95--99. 0.374
•
•
M. Gionfriddo: Discrete Math., 124(1994), 86.
A. Meyerowitz: European J. Comb., 16(1995), 501.
•
ERDOS–KO–RADO AND HILTON–MILNER TYPE THEOREMS FOR INTERSECTING
CHAINS IN POSETS, P.L.ERDOS, A SERESS, LA SZEKELY Janos Bolyai Mathematical
Society Combinatorica 20 (1) (2000) 27–45
•
[3]
Notes on Chvatal's conjecture, Y Wang, Discrete Mathematics 247 (2002) 255–259.
D. Miklós, Linear binary codes with intersection properties, Discrete Appl. Mathematics, 9 (1984) pp. 187–
196. 0.557
Oblivious transfers and intersecting codes G Brassard, C Crepeau, M Santha IEEE Transactions on
Information Theory, 42 (6): 1769-1780 Part 1 NOV 1996
Symmetry Breaking in Constraint Satisfaction, E Luks, A Roy Intl. Conf. of Artificial Intelligence and
Mathematics, Ft. Lauderdale, Florida, Jan 2-4, 2002.
Some Results on Nonlinear Zig-zag , D. R. Stinson, Designs, Codes and Cryptography, 3(1997), 215-243.
Eficient reductions among oblivious transfer protocols based on new self-intersecting codes, C Crepeau, M
Santha, Proceedings of Sequences II: Methods in Communications
Symmetry breaking and fault tolerance in boolean satisfiability, A Roy, PhD thesis. Downloadable from
http://www. cs. uoregon. edu
Minimal vectors in linear codes and sharing of secrets, A Ashikhmin, A Barg, Preprint - mathematik.unibielefeld.de
GD Cohen, S Litsyn, G Zemor, Binary Codes for Collusion-Secure Fingerprinting, in: Information Security
and Cryptology — ICISC 2001, LNCS 2288, Springer, 2002
The Complexity of Symmetry-Breaking Formulas, EM Luks, A Roy - Annals of Mathematics and
Artificial Intelligence 41: 19–45, 2004.
G.D. Cohen: Discr. Math., 56(1985), 35.
G.D. Cohen: Lect. N. Comp., 388(1989), 114.
C.T. Retter: IEEE Info. T., 35(1989), 822.
C.T. Retter: IEEE Info. T., 37(1991), 346.
Cohen G, Zemor G: Subset sums and coding theory, ASTERISQUE (258): 327-339 1999
ZEMOR G, COHEN GD: THE THRESHOLD PROBABILITY OF A CODE, IEEE TRANSACTIONS
ON INFORMATION THEORY 41 (2): 469-477 MAR 1995
COHEN GD, ZEMOR G: INTERSECTING CODES AND INDEPENDENT FAMILIES, IEEE
TRANSACTIONS ON INFORMATION THEORY 40 (6): 1872-1881 NOV 1994
RETTER CT: GAPS IN THE BINARY WEIGHT DISTRIBUTIONS OF REED-SOLOMON CODES
IEEE TRANSACTIONS ON INFORMATION THEORY 38 (6): 1688-1697 NOV 1992
RETTER CT: THE AVERAGE BINARY WEIGHT-ENUMERATOR FOR A CLASS OF
GENERALIZED REED-SOLOMON CODES , IEEE TRANSACTIONS ON INFORMATION THEORY
37 (2): 346-349 MAR 1991
COHEN GD, GODLEWSKI PJ, HWANG TY: GENERATING CODEWORDS IN REAL SPACE APPLICATION TO DECODING, LECTURE NOTES IN COMPUTER SCIENCE 388: 114-122 1989
RETTER CT: INTERSECTING GOPPA CODES IEEE TRANSACTIONS ON INFORMATION
THEORY 35 (4): 822-828 JUL 1989
COHEN G, LEMPEL A, LINEAR INTERSECTING CODES, DISCRETE MATHEMATICS 56 (1): 3543 1985
Ytrehus, O.: Binary [18,11]2 codes do not exist-Nor do [64,53]2 codes, Information Theory, IEEE
Transactions on Volume 37, Issue 2, Mar 1991 Page(s):349 – 351
N.J.A. Sloane, Covering arrays and intersecting codes, J. Combin. Des. 1 (1993) 51-63.
[4]
D. Miklós, M.J. Neuman, Á. Seress, D.B. West, The addition game: an abstraction of a communication
problem, Discrete Mathematics, 68 (1988) pp. 265–272. 0.374
•
[5]
S.M. Hedetnie: Networks, 18(1988), 319
J. Demetrovics, G.O.H. Katona, D. Miklós: Partial dependency in relational databases and their realization,
Discrete Applied Mathematics, 40 (1992), 127–138. 0.557
Giannella, C., Robertson, E.: On approximation measures for functional dependencies , 2004
Information Systems 29 (6), pp. 483-507
Chris Giannella, Approximation Measures for Functional, in: Advances in Databases and Information
Systems, , LNCS 2435 – Springer
Langeveldt, W.-D., Link, S., Empirical evidence for the usefulness of Armstrong relations in the
acquisition of meaningful functional dependencies, Information Systems 35 (3), pp. 352-374
[6]
J. Demetrovics, G. O. H. Katona, D. Miklós Parciális függőség relációs adatbázisokban, Alkalmazott
Matematikai Lapok, 15 (1990–91), 163–179.
•
[7]
J. Demetrovics: Discr. Appl. Math., 40(1992), 138
D. Miklós, Disproof of a conjecture in graph reconstruction theory, Combinatorica, 12 (1992), 367–369.
0.388
[8]
D. Miklós, On Product of Association Schemes and Shannon Capacity, Disc. Math., 150 (1996), 441–447.
0.374
W. Imrich, S. Klavˇzar: Product graphs: structure and recognition, JohnWiley & Sons, New York, USA, 2000.
[9]
D. Miklós, A. Telcs: On fully extended self-avoiding polygons, Disc. Math., 150 (1996), 437–440. 0.374
[10] J. Demetrovics, G. O. H. Katona, D. Miklós, O. Seleznjev, B. Thalheim: Asymptotic properties of keys and
functional dependencies in random databases, Theoretical Computer Science, 190 (1998), 151–166. 0.676
•
Chris Giannella , Edward Robertson: On approximation measures for functional dependencies,
Information Systems, Volume 29, Issue 6, September 2004, Pages 483-507
•
Jouni Järvinen: Dense Families and Key Functions of Database Relation Instances, in:
Fundamentals of Computation Theory , LNCS 2138/2001 – Springer.
•
Chris Giannella, Approximation Measures for Functional, in: Advances in Databases and
Information Systems, , LNCS 2435 – Springer
•
Giannella, C., Robertson, E., On approximation measures for functional dependencies,
Information Systems 29 (6), pp. 483-507
•
Demetrovics J, Katona GOH, Miklos D: MATHEMATICAL AND COMPUTER MODELLING,
38 (7-9) : 763-772 (2003)
•
Seleznjev O, Thalheim B: METHODOLOGY AND COMPUTING IN APPLIED
PROBABILITY, 5 (4) : 395-418 (2003)
•
Demetrovics J, Katona GOH, Miklós D et al.: STUDIA SCIENTIARUM MATHEMATICARUM
HUNGARICA, 34 : 127-140 (1998)
•
Biskup, J.: Achievements of Relational Database Schema Design Theory Revisited, in: Semantics
in Databases, 1995, pp. 29-54,
[11] J. Demetrovics, G. O. H. Katona, D. Miklós, O. Seleznjev, B. Thalheim: Functional dependencies in random
databases, Studia Sci. Math. Hung., 34 (1998), 127–140. 0.169
Seleznjev O, Thalheim B: METHODOLOGY AND COMPUTING IN APPLIED PROBABILITY, 5 (4) :
395-418 (2003)
Demetrovics J, Katona GOH, Miklos D: MATHEMATICAL AND COMPUTER MODELLING, 38 (7-9) :
763-772 (2003)
LYU KIANG, LEES LUAN, SUN YENENG: LOUIS HSIAO-YUN CHEN: EPITOME OF RARE
EVENTS, COSMOS, Year: 2005 Vol: 1 Issue: 1 (May 2005) Page: 1 - 15
[12] J. Demetrovics, G. O. H. Katona, D. Miklós: Recent combinatorial results in the theory of relational
databases
Math. and Computer Modelling, 38 (2003), 763-772. 0.479
[13] J. Demetrovics, G. O. H. Katona, D. Miklós: On the security of individual data Annals of Mathematics and
Artificial Intelligence, DOI: 10.1007/s10472-005-9014-x, 46(1-2) (2006), 98-113. 0.851
R AHLSWEDE, H AYDINIAN ON SECURITY OF STATISTICAL DATABASES, Information Theory,
2006 IEEE International Symposium on, 2006
[14] J. Demetrovics, G. O. H. Katona, D. Miklós: Functional dependencies distorted by errors Discrete Appied
Mathematics online first doi: 10.1016/j.dam.2007.05.038 0.374, 156(2008), no. 6, pp. 862-869.
G Bogdanova, T Georgieva Using error-correcting dependencies for collaborative filtering, Data &
Knowledge Engineering Volume 66, Issue 3, September 2008, Pages 402-413
Romero, O., Abelló, A Automatic validation of requirements to support multidimensional design
Data and Knowledge Engineering 69 (9), 2010, pp. 917-942
Romero, O., Abelló, A. A framework for multidimensional design of data warehouses from ontologies
Data and Knowledge Engineering 69 (11), 2010 pp. 1138-1157
Wu, Y., Ng, W. , Maintaining consistency of probabilistic databases: A linear programming approach,
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and
Lecture Notes in Bioinformatics) 6412 LNCS, pp. 302-316