Katalin Friedl

According to our database, Katalin Friedl authored at least 22 papers between 1985 and 2025.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2025

A linear-time algorithm computing the resident fitness in interacting trajectories.

Katalin Friedl, Viktória Nemkin, András Tóbiás

CoRR, February, 2025

2021

Quantum Inspired Adaptive Boosting.

Bálint Daróczy, Katalin Friedl, László Kabódi, Attila Pereszlényi, Dániel Szabó

CoRR, 2021

2017

Storing the Quantum Fourier Operator in the QuIDD Data Structure.

Katalin Friedl, László Kabódi

Acta Cybern., 2017

2014

Hidden Translation and Translating Coset in Quantum Computing.

Katalin Friedl, Gábor Ivanyos, Frédéric Magniez, Miklos Santha, Pranab Sen

SIAM J. Comput., 2014

2010

Singular value decomposition of large random matrices (for two-way classification of microarrays).

Marianna Bolla, Katalin Friedl, András Krámli

J. Multivar. Anal., 2010

2006

Implementing a Graph Transformation Engine in Relational Databases.

Gergely Varró, Katalin Friedl, Dániel Varró

Softw. Syst. Model., 2006

Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes.

Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven

Proceedings of the Algorithms and Complexity, 6th Italian Conference, 2006

2005

Adaptive Graph Pattern Matching for Model Transformations using Model-sensitive Search Plans.

Gergely Varró, Katalin Friedl, Dániel Varró

Proceedings of the International Workshop on Graph and Model Transformation, 2005

Efficient testing of groups.

Katalin Friedl, Gábor Ivanyos, Miklos Santha

Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

On the Black-Box Complexity of Sperner's Lemma.

Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven

Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

2004

Graph Transformation in Relational Databases.

Gergely Varró, Katalin Friedl, Dániel Varró

Proceedings of the 2nd International Workshop on Graph-Based Tools, 2004

2003

Order shattering and Wilson's theorem.

Katalin Friedl, Lajos Rónyai

Discret. Math., 2003

Hidden translation and orbit coset in quantum computing.

Katalin Friedl, Gábor Ivanyos, Frédéric Magniez, Miklos Santha, Pranab Sen

Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

Quantum Testers for Hidden Group Properties.

Katalin Friedl, Frédéric Magniez, Miklos Santha, Pranab Sen

Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

2000

Two Results on the Bit Extraction Problem.

Katalin Friedl, Shi-Chun Tsai

Discret. Appl. Math., 2000

1995

Some Improvements to Total Degree Tests.

Katalin Friedl, Madhu Sudan

Proceedings of the Third Israel Symposium on Theory of Computing and Systems, 1995

Recycling random bits in parallel.

Katalin Friedl, Shi-Chun Tsai

Proceedings of the 28th Annual Hawaii International Conference on System Sciences (HICSS-28), 1995

1994

Low-degree Tests.

Katalin Friedl, Zsolt Hátsági, Alexander Shen

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

1993

Decomposition of *-closed Algebras in Polynomial Time.

László Babai, Katalin Friedl, Markus Stricker

Proceedings of the 1993 International Symposium on Symbolic and Algebraic Computation, 1993

1991

Approximate Representation Theory of Finite Groups

László Babai, Katalin Friedl

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1989

Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies.

Joan Boyar, Katalin Friedl, Carsten Lund

Proceedings of the Advances in Cryptology, 1989

1985

Polynomial Time Solutions of Some Problems in Computational Algebra

Katalin Friedl, Lajos Rónyai

Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985