The SCEAS System
Navigation Menu

Search the dblp DataBase


András Gács: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. András Gács, Péter Sziklai
    On the structure of a generalization of weakly associative lattices. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2002, v:62, n:, pp:- [Journal]
  2. András Gács
    On a Generalization of Rédei's Theorem. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2003, v:23, n:4, pp:585-598 [Journal]
  3. András Gács, Tamás Szonyi
    On Maximal Partial Spreads in PG(n, q). [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2003, v:29, n:1-3, pp:123-129 [Journal]
  4. András Gács, Péter Sziklai, Tamás Szonyi
    Two Remarks on Blocking Sets and Nuclei in Planes of Prime Order. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1997, v:10, n:1, pp:29-39 [Journal]
  5. András Gács, Zsuzsa Weiner
    On (q + t, t)-Arcs of Type (0, 2, t). [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2003, v:29, n:1-3, pp:131-139 [Journal]
  6. András Gács
    On the Size of the Smallest Non-Classical Blocking Set of Rédei Type in PG(2, p). [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2000, v:89, n:1, pp:43-54 [Journal]
  7. András Gács
    On the number of directions determined by a point set in AG(2, p). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:208, n:, pp:299-309 [Journal]

  8. Random constructions and density results. [Citation Graph (, )][DBLP]

  9. On the maximality of linear codes. [Citation Graph (, )][DBLP]

  10. On the graph of a function over a prime field whose small powers have bounded degree. [Citation Graph (, )][DBLP]

Search in 0.003secs, Finished in 0.004secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002