Katalin Friedl
Katalin Friedl
E-mail megerősítve itt: cs.bme.hu
Cím
Hivatkozott rá
Hivatkozott rá
Év
Hidden translation and orbit coset in quantum computing
K Friedl, G Ivanyos, F Magniez, M Santha, P Sen
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, 1-9, 2003
1472003
Polynomial time solutions of some problems of computational algebra
K Friedl, L Rónyai
Proceedings of the seventeenth annual ACM symposium on Theory of computing …, 1985
1071985
Adaptive graph pattern matching for model transformations using model-sensitive search plans
G Varró, K Friedl, D Varró
Electronic Notes in Theoretical Computer Science 152, 191-205, 2006
992006
Some improvements to total degree tests
K Friedl, M Sudan
Proceedings Third Israel Symposium on the Theory of Computing and Systems …, 1995
91*1995
Practical zero-knowledge proofs: Giving hints and using deficiencies
J Boyar, K Friedl, C Lund
Journal of cryptology 4 (3), 185-206, 1991
761991
Implementing a graph transformation engine in relational databases
G Varró, K Friedl, D Varró
Software & Systems Modeling 5 (3), 313-341, 2006
352006
Low-degree tests
K Friedl, Z Hatsagi, A Shen
SODA, 57-64, 1994
271994
On the black-box complexity of Sperner’s lemma
K Friedl, G Ivanyos, M Santha, YF Verhoeven
Theory of Computing Systems 45 (3), 629, 2009
23*2009
Graph transformation in relational databases
G Varró, K Friedl, D Varró
Electronic Notes in Theoretical Computer Science 127 (1), 167-180, 2005
222005
Efficient testing of groups
K Friedl, G Ivanyos, M Santha
Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005
212005
Quantum testers for hidden group properties
K Friedl, M Santha, F Magniez, P Sen
Fundamenta Informaticae 91 (2), 325-340, 2009
20*2009
Approximate representation theory of finite groups
L Babai, K Friedl
[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science …, 1991
201991
Locally 2-dimensional Sperner problems complete for the Polynomial Parity Argument classes
K Friedl, G Ivanyos, M Santha, YF Verhoeven
Italian Conference on Algorithms and Complexity, 380-391, 2006
172006
Order shattering and Wilson's theorem
K Friedl, L Rónyai
Discrete Mathematics 270 (1-3), 127-136, 2003
172003
On slightly superlinear transparent proofs
L Babai, K Friedl
University of Chicago, 1993
15*1993
Singular value decomposition of large random matrices (for two-way classification of microarrays)
M Bolla, K Friedl, A Krámli
Journal of Multivariate Analysis 101 (2), 434-446, 2010
122010
Decomposition of*-closed algebras in polynomial time
L Babai, K Friedl, M Stricker
Proceedings of the 1993 international symposium on Symbolic and algebraic …, 1993
111993
Spectral properties of modularity matrices
M Bolla, B Bullins, S Chaturapruek, S Chen, K Friedl
Linear Algebra and Its Applications 473, 359-376, 2015
92015
Near representations of finite groups
L Babai, K Friedl, A Lukács
preprint, 2003
92003
L. R onyai. Polynomial time solutions of some problems in computational algebra
K Friedl
Proceedings, 7th ACM Symposium on Theory of Computing, 153-162, 0
6
A rendszer jelenleg nem tudja elvégezni a műveletet. Próbálkozzon újra később.
Cikkek 1–20