- CSB - MetaPress - Google - Bing - Yahoo
 | 2010 | |
|---|---|---|
| j10 |      | Marianna Bolla, Katalin Friedl, András Krámli: Singular value decomposition of large random matrices (for two-way classification of microarrays). J. Multivariate Analysis 101(2): 434-446 (2010) |
| 2009 | ||
| j9 | | Katalin Friedl, Miklos Santha, Frédéric Magniez, Pranab Sen: Quantum Testers for Hidden Group Properties. Fundam. Inform. 91(2): 325-340 (2009) |
| j8 | | Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven: On the Black-Box Complexity of Sperner's Lemma. Theory Comput. Syst. 45(3): 629-646 (2009) |
| 2006 | ||
| j7 | | Gergely Varró, Katalin Friedl, Dániel Varró: Adaptive Graph Pattern Matching for Model Transformations using Model-sensitive Search Plans. Electr. Notes Theor. Comput. Sci. 152: 191-205 (2006) |
| j6 | | Gergely Varró, Katalin Friedl, Dániel Varró: Implementing a Graph Transformation Engine in Relational Databases. Software and System Modeling 5(3): 313-341 (2006) |
| c12 | | Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven: Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes. CIAC 2006: 380-391 |
| 2005 | ||
| j5 | | Gergely Varró, Katalin Friedl, Dániel Varró: Graph Transformation in Relational Databases. Electr. Notes Theor. Comput. Sci. 127(1): 167-180 (2005) |
| c11 | | Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven: On the Black-Box Complexity of Sperner's Lemma. FCT 2005: 245-257 |
| c10 | | |
| 2003 | ||
| j4 | | Katalin Friedl, Lajos Rónyai: Order shattering and Wilson's theorem. Discrete Mathematics 270(1-3): 126-135 (2003) |
| c9 | | Katalin Friedl, Frédéric Magniez, Miklos Santha, Pranab Sen: Quantum Testers for Hidden Group Properties. MFCS 2003: 419-428 |
| c8 | | Katalin Friedl, Gábor Ivanyos, Frédéric Magniez, Miklos Santha, Pranab Sen: Hidden translation and orbit coset in quantum computing. STOC 2003: 1-9 |
| 2000 | ||
| j3 | | Katalin Friedl, Shi-Chun Tsai: Two Results on the Bit Extraction Problem. Discrete Applied Mathematics 99(1-3): 443-454 (2000) |
| 1996 | ||
| j2 | | Katalin Friedl, Shi-Chun Tsai: Recycling Random Bits in Parallel. Parallel Algorithms Appl. 8(1): 85-94 (1996) |
| 1995 | ||
| c7 | | |
| c6 |  | |
| 1994 | ||
| c5 | | |
| 1993 | ||
| c4 | | László Babai, Katalin Friedl, Markus Stricker: Decomposition of *-closed Algebras in Polynomial Time. ISSAC 1993: 86-94 |
| 1991 | ||
| j1 | | Joan Boyar, Katalin Friedl, Carsten Lund: Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies. J. Cryptology 4(3): 185-206 (1991) |
| c3 | | László Babai, Katalin Friedl: Approximate Representation Theory of Finite Groups. FOCS 1991: 733-742 |
| 1989 | ||
| c2 | | Joan Boyar, Katalin Friedl, Carsten Lund: Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies. EUROCRYPT 1989: 155-172 |
| 1985 | ||
| c1 | | Katalin Friedl, Lajos Rónyai: Polynomial Time Solutions of Some Problems in Computational Algebra. STOC 1985: 153-162 |
Colors in the list of coauthors
Last update Mon May 20 06:52:51 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page