MTA SZTAKIEU Centre of Excellence in Information Technology and AutomationMTA SZTAKI is a member of ERCIM - the European Research Consortium for Informatics and MathematicsMTA SZTAKI is a member of W3C - the World Wide Web ConsortiumISO 9001 Quality Management




NewsServicesThe InstituteContactIntrawebContentsSearchMagyarul

Laboratory of dynamical and discrete structures


Group of dynamical structures


184-97
BIRÓ, Zs.: Attractors in a density-dependent diffusion-reaction model.
Nonlinear Analysis, Theory, Methods and Applications. 29 (5) : 485-499. (1997) 0.367

185-97
BIRÓ, Zs. - KERSNER, R.: On the compactly supported solutions of KPP or Fisher type equations.
AMS/IP Studies in Advanced Mathematics. 3 : 129-137. (1997)

186-97
BIRÓ, Zs. - MICHALETZKY, Gy.: The first passage density of the Brownian motion to a Lipschitz-continuous boundary.
Studia Scientiarum Mathematicarum Hungarica. 33 : 25-41. (1997)

187-97
KERSNER, R. - VICSEK, M.: Travelling waves and dynamic scaling in a singular interface equation: analytic results.
Journal of Physics. A. Mathematical and General Physics. 30 : 2457-2465. (1997) 1.528

188-97
VICSEK, M. - VICSEK, T.: Aggregation models of fractal growth.
CWI Quarterly. 10 (2) :153-178. (1997)

189-97
VICSEK, M. - VICSEK, T.: Fractal growth models.
ERCIM News. (29) : 36. (1997)
 
 
 


Group of discrete structures


190-97
AHLSWEDE, R. - ALON, N. - ERDÔS, P. L. - RUSZINKÓ, M. - SZÉKELY, L.: Intersecting systems.
Combinatorics, Probability and Computing. 6 (2) : 127-137. (1997) N

191-97
ALON, N. - RUSZINKÓ, M.: Short certificates for tournaments.
Electronic Journal of Combinatorics. 4 (#R12) : 1-6. (1997) N

192-97
CHEN, G. - ERDŐS, P. - GYÁRFÁS, A. - SCHELP, R. H.: A class of edge critical 4-chromatic graphs.
Graphs and Combinatorics. 13 (2) : 139-146. (1997) N 0.118

193-97
FAUDREE, R. J. - GYÁRFÁS, A.: Path matchings in graphs.
Congressus Numerantium. 120 : 83-96. (1996) N

194-97
FÜREDI, Z. - RUSZINKÓ, M.: Superimposed codes are almost big distance ones.
In: 1997 IEEE international symposium on information theory. Proceedings. Ulm, 1997.
Piscataway, IEEE, 1997. pp. 118.

195-97
GYÁRFÁS, A.: Fruit salad.
Electronic Journal of Combinatorics. 4 (#R8) : 1-8. (1997)

196-97
GYÁRFÁS, A.: Reflections on a problem of Erdős and Hajnal.
In: The mathematics of Paul Erdős. (Eds.: R. L. Graham, J. Nesetril.) Vol. 2.
Berlin, Springer, 1997. pp. 93-98.
(Algorithms and combinatorics 14.)

197-97
GYÁRFÁS, A. - KIRÁLY, Z. - LEHEL, J.: On-line 3-chromatic graphs - II. Critical graphs.
Discrete Mathematics. 177 (1-3) : 99-122. (1997) 0.271

198-97
KOHAYAKAWA, Y. - GYÁRFÁS, A.: The size of the largest bipartite subgraph.
Discrete Mathematics. 177 (1-3) : 267-271. (1997) N 0.271

199-97
RUSZINKÓ, M. - TARDOS, G.: On a search problem in multidimensional grids.
Journal of Statistical Planning and Inference. 59 (1) : 101-109. (1997) 0.238

200-97
RUSZINKÓ, M. - VANROOSE, P.: How an Erdős-Rényi-type search approach gives explicit code construction of rate 1 for random access with multiplicity feedback.
IEEE Transactions on Information Theory. 43 (1) : 368-373. (1997) N 1.698

201-97
SZABADY, B. - RUSZINKÓ, M. - NYIREDY, Sz.: Prediction of retention data when using incremental multiple development techniques.
Chromatographia. 45 : 369-372. (1997) 1.869

202-97
SZABADY, B. - RUSZINKÓ, M. - NYIREDY, Sz.: Application of multiple development.
In: Proceedings of the 9th international symposium on instrumental planar chromatography. Interlaken, 1997. (Eds.: Sz. Nyiredy, R. E. Kaiser, A. Studer.)
Budakalász, Res. Inst. for Med. Plants, 1997. pp. 337-339.

 
 

wwwold.sztaki.hu
copyright (c) 2000 mta sztakiwebmaster