default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKatalin Friedl
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[i2]Bálint Daróczy, Katalin Friedl, László Kabódi, Attila Pereszlényi, Dániel Szabó:
Quantum Inspired Adaptive Boosting. CoRR abs/2102.00949 (2021)
2010 – 2019
- 2017
- [j10]Katalin Friedl, László Kabódi:
Storing the Quantum Fourier Operator in the QuIDD Data Structure. Acta Cybern. 23(2): 503-512 (2017) - 2014
- [j9]Katalin Friedl, Gábor Ivanyos
, Frédéric Magniez, Miklos Santha, Pranab Sen:
Hidden Translation and Translating Coset in Quantum Computing. SIAM J. Comput. 43(1): 1-24 (2014) - 2013
- [i1]Katalin Friedl, Madhu Sudan:
Some Improvements to Total Degree Tests. CoRR abs/1307.3975 (2013) - 2010
- [j8]Marianna Bolla, Katalin Friedl, András Krámli:
Singular value decomposition of large random matrices (for two-way classification of microarrays). J. Multivar. Anal. 101(2): 434-446 (2010)
2000 – 2009
- 2009
- [j7]Katalin Friedl, Miklos Santha, Frédéric Magniez, Pranab Sen:
Quantum Testers for Hidden Group Properties. Fundam. Informaticae 91(2): 325-340 (2009) - [j6]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
- [j5]Gergely Varró, Katalin Friedl, Dániel Varró:
Implementing a Graph Transformation Engine in Relational Databases. Softw. Syst. Model. 5(3): 313-341 (2006) - [c14]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
- [c13]Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven:
On the Black-Box Complexity of Sperner's Lemma. FCT 2005: 245-257 - [c12]Katalin Friedl, Gábor Ivanyos, Miklos Santha:
Efficient testing of groups. STOC 2005: 157-166 - [c11]Gergely Varró, Katalin Friedl, Dániel Varró:
Adaptive Graph Pattern Matching for Model Transformations using Model-sensitive Search Plans. GRaMoT@GPCE 2005: 191-205 - 2004
- [c10]Gergely Varró, Katalin Friedl, Dániel Varró:
Graph Transformation in Relational Databases. GraBaTs 2004: 167-180 - 2003
- [j4]Katalin Friedl, Lajos Rónyai:
Order shattering and Wilson's theorem. Discret. Math. 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. Discret. Appl. Math. 99(1-3): 443-454 (2000)
1990 – 1999
- 1996
- [j2]Katalin Friedl, Shi-Chun Tsai:
Recycling Random Bits in Parallel. Parallel Algorithms Appl. 8(1): 85-94 (1996) - 1995
- [c7]Katalin Friedl, Shi-Chun Tsai:
Recycling random bits in parallel. HICSS (2) 1995: 14-19 - [c6]Katalin Friedl, Madhu Sudan:
Some Improvements to Total Degree Tests. ISTCS 1995: 190-198 - 1994
- [c5]Katalin Friedl, Zsolt Hátsági, Alexander Shen:
Low-degree Tests. SODA 1994: 57-64 - 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. Cryptol. 4(3): 185-206 (1991) - [c3]László Babai, Katalin Friedl:
Approximate Representation Theory of Finite Groups. FOCS 1991: 733-742
1980 – 1989
- 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
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
