Katalin Friedl - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 24 from 24

2017

Storing the Quantum Fourier Operator in the QuIDD Data StructureKatalin Friedl, László Kabódi. actaC, 23(2):503-512, 2017. [doi]

2014

Hidden Translation and Translating Coset in Quantum ComputingKatalin Friedl, Gábor Ivanyos, Frédéric Magniez, Miklos Santha, Pranab Sen. SICOMP, 43(1):1-24, 2014. [doi]

2010

Singular value decomposition of large random matrices (for two-way classification of microarrays)Marianna Bolla, Katalin Friedl, András Krámli. ma, 101(2):434-446, 2010. [doi]

2009

On the Black-Box Complexity of Sperner s LemmaKatalin Friedl, GÃ¡bor Ivanyos, Miklos Santha, Yves F. Verhoeven. mst, 45(3):629-646, 2009. [doi]

Quantum Testers for Hidden Group PropertiesKatalin Friedl, Miklos Santha, Frédéric Magniez, Pranab Sen. FUIN, 91(2):325-340, 2009. [doi]

2006

Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument ClassesKatalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven. ciac 2006: 380-391 [doi]

Implementing a Graph Transformation Engine in Relational DatabasesGergely Varró, Katalin Friedl, Dániel Varró. SoSyM, 5(3):313-341, 2006. [doi]

Adaptive Graph Pattern Matching for Model Transformations using Model-sensitive Search PlansGergely Varró, Katalin Friedl, Dániel Varró. ENTCS, 152:191-205, 2006. [doi]

2005

Efficient testing of groupsKatalin Friedl, Gábor Ivanyos, Miklos Santha. stoc 2005: 157-166 [doi]

On the Black-Box Complexity of Sperner s LemmaKatalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven. fct 2005: 245-257 [doi]

Graph Transformation in Relational DatabasesGergely Varró, Katalin Friedl, Dániel Varró. ENTCS, 127(1):167-180, 2005. [doi]

2003

2000

Two Results on the Bit Extraction ProblemKatalin Friedl, Shi-Chun Tsai. DAM, 99(1-3):443-454, 2000. [doi]

1996

Recycling Random Bits in ParallelKatalin Friedl, Shi-Chun Tsai. paapp, 8(1):85-94, 1996. [doi]

1995

Some Improvements to Total Degree TestsKatalin Friedl, Madhu Sudan. istcs 1995: 190-198

Recycling random bits in parallelKatalin Friedl, Shi-Chun Tsai. hicss 1995: 14-19 [doi]

1994

Low-degree TestsKatalin Friedl, Zsolt Hátsági, Alexander Shen. soda 1994: 57-64

1993

Decomposition of *-closed Algebras in Polynomial TimeLászló Babai, Katalin Friedl, Markus Stricker. issac 1993: 86-94 [doi]

1991

Approximate Representation Theory of Finite GroupsLászló Babai, Katalin Friedl. focs 1991: 733-742

Practical Zero-Knowledge Proofs: Giving Hints and Using DeficienciesJoan Boyar, Katalin Friedl, Carsten Lund. joc, 4(3):185-206, 1991.

1989

Practical Zero-Knowledge Proofs: Giving Hints and Using DeficienciesJoan Boyar, Katalin Friedl, Carsten Lund. eurocrypt 1989: 155-172 [doi]

1985

Polynomial Time Solutions of Some Problems in Computational AlgebraKatalin Friedl, Lajos Rónyai. stoc 1985: 153-162

Sign in or sign up to see more results.

runs on WebDSL