2 citations · 2 across the 4 of their papers we have counts for
5 papers
A macro placer algorithm for chip design
Endre Csóka, Attila Deák
There is a set of rectangular macros with given dimensions, and there are wires connecting some pairs (or sets) of them. We have a placement area where these macros should be place…
Finite Permutable Putcha Semigroups
Attila Deák, Attila Nagy
A semigroup is called a permutable semigroup if is satified for all congruences and of . A semigroup is called a Putcha semigroup if it is a semi…
Limits of Random Trees
Attila Deák
Local convergence of bounded degree graphs was introduced by Benjamini and Schramm. This result was extended further by Lyons to bounded average degree graphs. In this paper, we st…
On a Problem of A. Nagy
Attila Deák
If the congruences of a semigroup are commutative, we say that the semigroup is permutable. In a previous paper, A. Nagy showed that every permutable semigroup satisfying an arbitr…
Limits of Random Trees II
Attila Deák
Local convergence of bounded degree graphs was introduced by Benjamini and Schramm. This result was extended further by Lyons to bounded average degree graphs. In this paper we stu…