most citedModelling dynamic programming problems by generalized d-graphs

2 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

7 papers

cs.DM2011

On scattered subword complexity

Zoltán Kása

Special scattered subwords, in which the gaps are of length from a given set, are defined. The scattered subword complexity, which is the number of such scattered subwords, is comp…

cs.DM2011★ 2 cited

Super-d-complexity of finite words

Zoltán Kása

In this paper we introduce and study a new complexity measure for finite words. For positive integer special scattered subwords, called super--subwords, in which the gaps ar…

math.NT2010★ 1 cited

Generalized GCD matrices

Antal Bege

Let be an arithmetical function. The matrix given by the value of in greatest common divisor of , as its entry is…

cs.DS2010★ 2 cited

Modelling dynamic programming problems by generalized d-graphs

Zoltán Kátai

In this paper we introduce the concept of generalized d-graph (admitting cycles) as special dependency-graphs for modelling dynamic programming (DP) problems. We describe the d-gra…

math.NT2010

Generalized perfect numbers

Antal Bege, Kinga Fogarasi

In this paper some new ways of generalizing perfect numbers are investigated, numerical results are presented and some conjectures are established.

cs.CR2010

Public-key cryptography in functional programming context

Gyöngyvér Márton

Up to now, for efficiency reasons cryptographic algorithm has been written in an imperative language. But to get acquaintance with a functional programming language a question aris…

math.NT2010

Generalized Mobius-type functions and special set of k-free numbers

Antal Bege

In [3] Bege introduced the generalized Apostol's Mobius functions. In this paper we are presenting new properties of this functions. By introducing the special set of k-free number…