The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Ákos Seress: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. László Babai, Gábor Hetyei, William M. Kantor, Alexander Lubotzky, Ákos Seress
    On the Diameter of Finite Groups [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:857-865 [Conf]
  2. László Babai, Eugene M. Luks, Ákos Seress
    Fast Management of Permutation Groups [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:272-282 [Conf]
  3. László Babai, Gene Cooperman, Larry Finkelstein, Ákos Seress
    Nearly Linear Time Algorithms for Permutation Groups with a Small Base. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1991, pp:200-209 [Conf]
  4. Martin Schönert, Ákos Seress
    Finding Blocks of Imprimitivity in Small-Base Groups in Nearly Linear Time. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1994, pp:154-157 [Conf]
  5. Max Neunhöffer, Ákos Seress
    A data structure for a uniform approach to computations with finite groups. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2006, pp:254-261 [Conf]
  6. László Babai, Robert Beals, Ákos Seress
    On the diameter of the symmetric group: polynomial bounds. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:1108-1112 [Conf]
  7. László Babai, Gene Cooperman, Larry Finkelstein, Eugene M. Luks, Ákos Seress
    Fast Monte Carlo Algorithms for Permutation Groups [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:90-100 [Conf]
  8. László Babai, Eugene M. Luks, Ákos Seress
    Permutation Groups in NC [Citation Graph (0, 0)][DBLP]
    STOC, 1987, pp:409-420 [Conf]
  9. Robert Beals, Ákos Seress
    Structure Forest and Composition Factors for Small Base Groups in Nearly Linear Time [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:116-125 [Conf]
  10. Aart Blokhuis, Ákos Seress, Henny A. Wilbrink
    Characterization of complete exterior sets of conics. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1992, v:12, n:2, pp:143-147 [Journal]
  11. Péter L. Erdös, Ákos Seress, László A. Székely
    Erdös-Ko-Rado and Hilton-Milner Type Theorems for Intersecting Chains in Posets. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2000, v:20, n:1, pp:27-45 [Journal]
  12. Robert Beals, Charles R. Leedham-Green, Alice C. Niemeyer, Cheryl E. Praeger, Ákos Seress
    Permutations With Restricted Cycle Structure And An Algorithmic Application. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2002, v:11, n:5, pp:- [Journal]
  13. Péter L. Erdös, Ákos Seress, László A. Székely
    On Intersecting Chains in Boolean Algebras. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:57-62 [Journal]
  14. Ákos Seress
    Large Families of Cospectral Graphs. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2000, v:21, n:1/3, pp:205-208 [Journal]
  15. Ákos Seress
    All Lambda-Designs With are Type-1. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2001, v:22, n:1, pp:5-17 [Journal]
  16. Ákos Seress
    Square-Free Non-Cayley Numbers. On Vertex-Transitive Non-Cayley Graphs of Square-Free Order. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2005, v:34, n:2-3, pp:265-281 [Journal]
  17. Aart Blokhuis, Ákos Seress
    The Number of Directions Determined by Points in the Three-Dimensional Euclidean Space. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2002, v:28, n:4, pp:491-494 [Journal]
  18. Gyula O. H. Katona, Ákos Seress
    Greedy Construction of Nearly Regular Graphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1993, v:14, n:3, pp:213-229 [Journal]
  19. László Lovász, Ákos Seress
    The Cocycle Lattice of Binary Matroids . [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1993, v:14, n:3, pp:241-250 [Journal]
  20. László Babai, Gene Cooperman, Larry Finkelstein, Eugene M. Luks, Ákos Seress
    Fast Monte Carlo Algorithms for Permutation Groups. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:50, n:2, pp:296-308 [Journal]
  21. László Babai, Ákos Seress
    On the degree of transitivity of permutation groups: A short proof. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1987, v:45, n:2, pp:310-315 [Journal]
  22. László Babai, Ákos Seress
    On the diameter of cayley graphs of the symmetric group. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1988, v:49, n:1, pp:175-179 [Journal]
  23. Peter A. Brooksbank, Hongxun Qin, Edmund Robertson, Ákos Seress
    On Dowling geometries of infinite groups. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2004, v:108, n:1, pp:155-158 [Journal]
  24. Zoltán Füredi, Felix Lazebnik, Ákos Seress, Vasiliy A. Ustimenko, Andrew J. Woldar
    Graphs of Prescribed Girth and Bi-Degree. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1995, v:64, n:2, pp:228-239 [Journal]
  25. Ákos Seress
    Some characterizations of type-1 lambda-designs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1989, v:52, n:2, pp:288-300 [Journal]
  26. Ákos Seress, Tibor Szabó
    Dense Graphs with Cycle Neighborhoods. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1995, v:63, n:2, pp:281-293 [Journal]
  27. Cai Heng Li, Ákos Seress
    Symmetrical path-cycle covers of a graph and polygonal graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2007, v:114, n:1, pp:35-51 [Journal]
  28. Michael Giudici, Cai Heng Li, Cheryl E. Praeger, Ákos Seress, Vladimir I. Trofimov
    On limit graphs of finite vertex-primitive graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2007, v:114, n:1, pp:110-134 [Journal]
  29. László Babai, Eugene M. Luks, Ákos Seress
    Fast Management of Permutation Groups I. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:5, pp:1310-1342 [Journal]
  30. Ákos Seress
    Quick Gossiping by Conference Calls. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1988, v:1, n:1, pp:109-120 [Journal]
  31. Paul Erdös, Zoltán Füredi, András Hajnal, Péter Komjáth, Vojtech Rödl, Ákos Seress
    Coloring graphs with locally few colors. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:59, n:1-2, pp:21-34 [Journal]
  32. Dezsö Miklós, Mark J. Newman, Ákos Seress, Douglas B. West
    The addition game: an abstraction of a communication problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:68, n:2-3, pp:265-272 [Journal]
  33. Ákos Seress
    Gossiping old ladies. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:46, n:1, pp:75-81 [Journal]
  34. Ákos Seress
    On vertex-transitive, non-Cayley graphs of order pqr. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:182, n:1-3, pp:279-292 [Journal]

  35. Polynomial-time theory of matrix groups. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002