Search the dblp DataBase

Publications of Author

1. Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven
   Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes. [Citation Graph (0, 0)][DBLP]
   CIAC, 2006, pp:380-391 [Conf]
   
2. Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven
   On the Black-Box Complexity of Sperner's Lemma. [Citation Graph (0, 0)][DBLP]
   FCT, 2005, pp:245-257 [Conf]
   
3. Alexander L. Chistov, Gábor Ivanyos, Marek Karpinski
   Polynomial Time Algorithms for Modules over Finite Dimensional Algebras. [Citation Graph (0, 0)][DBLP]
   ISSAC, 1997, pp:68-74 [Conf]
   
4. Gábor Ivanyos
   Fast randomized algorithms for the structure of matrix algebras over finite fields (extended abstract). [Citation Graph (0, 0)][DBLP]
   ISSAC, 2000, pp:175-183 [Conf]
   
5. László Babai, Robert Beals, Jin-yi Cai, Gábor Ivanyos, Eugene M. Luks
   Multiplicative Equations over Commuting Matrices. [Citation Graph (0, 0)][DBLP]
   SODA, 1996, pp:498-507 [Conf]
   
6. Gábor Ivanyos, Frédéric Magniez, Miklos Santha
   Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem. [Citation Graph (0, 0)][DBLP]
   SPAA, 2001, pp:263-270 [Conf]
   
7. Gábor Ivanyos, Luc Sanselme, Miklos Santha
   An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Extraspecial Groups. [Citation Graph (0, 0)][DBLP]
   STACS, 2007, pp:586-597 [Conf]
   
8. Katalin Friedl, Gábor Ivanyos, Frédéric Magniez, Miklos Santha, Pranab Sen
   Hidden translation and orbit coset in quantum computing. [Citation Graph (0, 0)][DBLP]
   STOC, 2003, pp:1-9 [Conf]
   
9. Katalin Friedl, Gábor Ivanyos, Miklos Santha
   Efficient testing of groups. [Citation Graph (0, 0)][DBLP]
   STOC, 2005, pp:157-166 [Conf]
   
10. Willem A. de Graaf, Gábor Ivanyos, A. Küronya, Lajos Rónyai
    Computing Levi Decompositions in Lie algebras. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1997, v:8, n:4, pp:291-303 [Journal]
    
11. Willem A. de Graaf, Gábor Ivanyos, Lajos Rónyai
    Computing Cartan Subalgebras of Lie Algebras. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1996, v:7, n:5, pp:339-349 [Journal]
    
12. Gábor Ivanyos, Lajos Rónyai, Ágnes Szántó
    Decomptosition of Algebras over F_q(X₁, ..., X_m). [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1994, v:5, n:, pp:71-90 [Journal]
    
13. Gábor Ivanyos, Lajos Rónyai
    Finding Maximal Orders in Semisimple Algebras Over Q. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1993, v:3, n:, pp:245-261 [Journal]
    
14. Arjeh M. Cohen, Gábor Ivanyos
    Root shadow spaces. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2007, v:28, n:5, pp:1419-1441 [Journal]
    
15. Gábor Ivanyos, Frédéric Magniez, Miklos Santha
    Efficient Quantum Algorithms For Some Instances Of The Non-Abelian Hidden Subgroup Problem. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2003, v:14, n:5, pp:723-740 [Journal]
    
16. Gábor Ivanyos, Ágnes Szántó
    Lattice basis reduction for indefinite forms and an application. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:153, n:1-3, pp:177-188 [Journal]
    
17. 
    Schemes for deterministic polynomial factoring. [Citation Graph (, )][DBLP]
    
    
18. 
    An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups. [Citation Graph (, )][DBLP]
    
    
19. 
    Schemes for Deterministic Polynomial Factoring [Citation Graph (, )][DBLP]
    
    
20. 
    Trading GRH for algebra: algorithms for factoring polynomials and related structures [Citation Graph (, )][DBLP]
    
    
21. 
    Deterministic Polynomial Time Algorithms for Matrix Completion Problems [Citation Graph (, )][DBLP]
    
    
22. 
    Schemes for Deterministic Polynomial Factoring. [Citation Graph (, )][DBLP]
    
    
23. 
    Trading GRH for algebra: algorithms for factoring polynomials and related structures. [Citation Graph (, )][DBLP]