The SCEAS System
| |||||||

## Search the dblp DataBase
Ákos Seress:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- 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] - László Babai, Eugene M. Luks, Ákos Seress
**Fast Management of Permutation Groups**[Citation Graph (0, 0)][DBLP] FOCS, 1988, pp:272-282 [Conf] - 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] - 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] - 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] - 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] - 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] - László Babai, Eugene M. Luks, Ákos Seress
**Permutation Groups in NC**[Citation Graph (0, 0)][DBLP] STOC, 1987, pp:409-420 [Conf] - 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] - 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] - 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] - 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] - 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] - Á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] - Á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] - Á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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - Á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] - Á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] - 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] - 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] - 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] - Á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] - 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] - 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] - Ákos Seress
**Gossiping old ladies.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1983, v:46, n:1, pp:75-81 [Journal] - Á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] **Polynomial-time theory of matrix groups.**[Citation Graph (, )][DBLP]
Search in 0.033secs, Finished in 0.036secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |