K. Friedl, Lajos Rónyai:
Polynomial time solutions of some problems in computational algebra,
17th ACM Symposium on Theory of Computing, Providence, 1985, pp. 153-162.
Joan Boyar, K. Friedl, Carsten Lund:
Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies,
Journal of Cryptology, 1991, pp. 185-206.
(Preliminary version in Proceedings of EUROCRYPT'89).
László Babai, K. Friedl:
Approximate representation theory of finite groups,
32nd IEEE Foundations of Computer Science, 1991, pp. 733-742.
László Babai, K. Friedl, Markus Stricker:
Decomposition of *-closed algebras in polynomial time,
Proc. International Symposium on Symbolic and Algebraic Computation,
1993, pp. 86-94.
K. Friedl, Zsolt Hátsági:
Low degree test,
Tech. Report CS 93-02, University of Chicago, 1993.
László Babai, K. Friedl:
On slightly superlinear transparent proofs,
Tech. Report CS 93-13, University of Chicago, 1993.
K. Friedl, Zsolt Hátsági, Alexander Shen:
Low-degree tests,
Proc. 5th ACM-SIAM Symposium on Discrete Algorithms, 1994, pp. 57-64.
K. Friedl:
Decomposition of Matrix Groups and Algebras,
Tech. Report CS 94-11, University of Chicago, 1994 (Ph.D. thesis).
K. Friedl, Shi-Chun Tsai:
Recycling random bits in parallel,
28th Hawaii International Conference on System Sciences, 1995, Vol.II.
pp. 14-19.
K. Friedl, Madhu Sudan:
Some improvements to total degree tests,
3rd Israel Symposium on the Theory of Computing and Systems, 1995,
pp. 190-198.
K. Friedl, Shi-Chun Tsai:
Recycling random bits in parallel,
Parallel Algorithms and Applications, 8(1996), 85-94.
János Demetrovics, K. Friedl, Lajos Rónyai:
Periodical scheduling,
Publicationes Mathematicae, Debrecen, 52(1998), 337-342.
K. Friedl, Shi-Chun Tsai:
Two results on the bit extraction problem,
Discrete Appl. Math. 99 (2000), no. 1-3, 443-454.
K. Friedl:
Periodic functions and quantum computing,
The 3rd Hungarian-Japanese Symposium on Discrete Mathematics and Its
Applications 2002, pp. 303-308. (invited paper)
K. Friedl, Gábor Ivanyos, Frédéric Magniez,
Miklos Santha, Pranab Sen:
Hidden translation and orbit coset in quantum computing,
35th ACM Symposium on Theory of Computing, 2003, 1-9.
( http://xxx.lanl.gov/abs/quant-ph/0211091
).
K. Friedl, Frédéric Magniez, Miklos Santha, Pranab Sen:
Quantum testers for hidden group properties,
Mathematical Foundations of Computer Science 2003, Springer, LNCS 2747,
pp. 419-428.
( http://xxx.lanl.gov/abs/quant-ph/0208184
).
K. Friedl, Lajos Rónyai:
Order shattering and Wilson's theorem,
Discrete Mathematics 270 (2003), 126-135.
( Preprint ).
K. Friedl, Gábor Ivanyos, Miklos Santha:
Efficient testing of groups,
37th ACM Symposium on Theory of Computing, 2005, 157-166.
Gergely Varró, K. Friedl, Dániel Varró:
Graph Transformation in Relational Databases.
In Proc. GraBaTs'04, Graph-Based Tools,
Rome, Italy, October 2004.
pdf
K. Friedl, Gábor Ivanyos, Miklos Santha, Yves Verhoeven:
On the black-box complexity of Sperner's Lemma,
15th International Symp. on Foundamentals of Computation Theory (FCT),
2005, 245-257.
( http://xxx.lanl.gov/abs/quant-ph/0505185
).
Gergely Varró, Dániel Varró, K. Friedl:
Adaptive Graph Pattern Matching for Model Transformations using Model-sensitive Search Plans.
In Proc. of the Int. Workshop on Graph and Model Transformation (GraMoT'05),
Tallinn, Estonia, September 2005.
pdf
Gergely Varró, K. Friedl, Dániel Varró:
Implementing a Graph Transformation Engine in Relational Databases.
Journal on Software and Systems Modeling (2006).
Gábor Hegedüs, K. Friedl, Lajos Rónyai:
Gröbner bases for complete l-wide families,
Publ. Math Debrecen 70(2007), pp. 271--290.
László Babai, K. Friedl, András Lukács:
Approximate representations of groups,
manuscript
Friedl K., Recski András, Simonyi Gábor:
Gráfelméleti feladatok,
Typotex, 2006.