![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
László Györfi
Person information
- affiliation: Budapest University of Technology and Economics, Hungary
- award: Széchenyi Prize
SPARQL queries ![](https://dblp.uni-trier.de/img/new.blue.24x12.png)
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2002
- [b2]László Györfi, Michael Kohler, Adam Krzyzak, Harro Walk:
A Distribution-Free Theory of Nonparametric Regression. Springer series in statistics, Springer 2002, ISBN 978-0-387-95441-7, pp. I-XVI, 1-647 - 1996
- [b1]Luc Devroye, László Györfi, Gábor Lugosi:
A Probabilistic Theory of Pattern Recognition. Stochastic Modelling and Applied Probability 31, Springer 1996, ISBN 978-1-4612-6877-2, pp. 1-638
Journal Articles
- 2023
- [j43]László Györfi
, Tamás Linder, Harro Walk:
Lossless Transformations and Excess Risk Bounds in Statistical Inference. Entropy 25(10): 1394 (2023) - [j42]Hüseyin Afser
, László Györfi
, Harro Walk:
Classification With Repeated Observations. IEEE Signal Process. Lett. 30: 1522-1526 (2023) - [j41]László Györfi, Aryeh Kontorovich
, Roi Weiss
:
Tree Density Estimation. IEEE Trans. Inf. Theory 69(2): 1168-1176 (2023) - 2022
- [j40]Luc Devroye, László Györfi:
On the Consistency of the Kozachenko-Leonenko Entropy Estimate. IEEE Trans. Inf. Theory 68(2): 1178-1185 (2022) - 2021
- [j39]László Györfi, Roi Weiss:
Universal consistency and rates of convergence of multiclass prototype algorithms in metric spaces. J. Mach. Learn. Res. 22: 151:1-151:25 (2021) - 2019
- [j38]László Györfi, Norbert Henze, Harro Walk:
The limit distribution of the maximum probability nearest-neighbour ball. J. Appl. Probab. 56(2): 574-589 (2019) - 2017
- [j37]Luc Devroye, László Györfi, Gábor Lugosi, Harro Walk:
On the measure of Voronoi cells. J. Appl. Probab. 54(2): 394-408 (2017) - [j36]Maik Döring, László Györfi, Harro Walk:
Rate of Convergence of $k$-Nearest-Neighbor Classification Rule. J. Mach. Learn. Res. 18: 227:1-227:16 (2017) - 2015
- [j35]László Györfi, Harro Walk:
On the asymptotic normality of an estimate of a regression functional. J. Mach. Learn. Res. 16: 1863-1877 (2015) - 2012
- [j34]László Györfi, Harro Walk:
Empirical Portfolio Selection Strategies With Proportional Transaction Costs. IEEE Trans. Inf. Theory 58(10): 6320-6331 (2012) - 2011
- [j33]László Györfi, Adam Krzyzak:
Why L1 view and what is next? Kybernetika 47(6): 840-854 (2011) - [j32]László Györfi, Péter Kevei
:
On the rate of convergence of the St. Petersburg game. Period. Math. Hung. 62(1): 13-37 (2011) - 2010
- [j31]Arthur Gretton, László Györfi:
Consistent Nonparametric Tests of Independence. J. Mach. Learn. Res. 11: 1391-1423 (2010) - [j30]László Györfi, György Turán, Thomas Zeugmann:
Guest editors' foreword. Theor. Comput. Sci. 411(29-30): 2629-2631 (2010) - 2008
- [j29]László Györfi, Marten H. Wegkamp
:
Quantization for Nonparametric Regression. IEEE Trans. Inf. Theory 54(2): 867-874 (2008) - 2007
- [j28]László Györfi, Michael Kohler:
Nonparametric Estimation of Conditional Distributions. IEEE Trans. Inf. Theory 53(5): 1872-1879 (2007) - 2005
- [j27]László Györfi, Sándor Györi:
Analysis of Collision Channel with Asynchronous Access. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(10): 2878-2884 (2005) - [j26]Gérard Biau, László Györfi:
On the asymptotic properties of a nonparametric L1-test statistic of homogeneity. IEEE Trans. Inf. Theory 51(11): 3965-3973 (2005) - [j25]András Antos, László Györfi, András György
:
Individual convergence rates in empirical vector quantizer design. IEEE Trans. Inf. Theory 51(11): 4013-4022 (2005) - 2002
- [j24]Luc Devroye, László Györfi, Gábor Lugosi
:
A note on robust hypothesis testing. IEEE Trans. Inf. Theory 48(7): 2111-2114 (2002) - [j23]László Györfi, Dominik Schäfer, Harro Walk:
Relative stability of global errors of nonparametric function estimators. IEEE Trans. Inf. Theory 48(8): 2230-2242 (2002) - 2000
- [j22]László Györfi, Árpád Jordán, István Vajda:
Exact Error Probability for Slow Frequency Hopping. Eur. Trans. Telecommun. 11(2): 183-190 (2000) - 1999
- [j21]András Antos, Luc Devroye, László Györfi:
Lower Bounds for Bayes Error Estimation. IEEE Trans. Pattern Anal. Mach. Intell. 21(7): 643-645 (1999) - [j20]László Györfi, András Rácz, Ken Duffy, John T. Lewis, Raymond Russell, Fergal Toomey:
Distribution-free confidence intervals for measurement of effective bandwidths. SIGMETRICS Perform. Evaluation Rev. 27(3): 19 (1999) - [j19]László Györfi, Gábor Lugosi
, Gusztáv Morvai:
A simple randomized algorithm for sequential prediction of ergodic time series. IEEE Trans. Inf. Theory 45(7): 2642-2650 (1999) - 1998
- [j18]László Györfi, Gusztáv Morvai, Sidney Yakowitz:
Limits to Consistent On-Line Forecasting for Ergodic Time Series. IEEE Trans. Inf. Theory 44(2): 886-892 (1998) - [j17]László Györfi, István Vajda:
Analysis of protocol sequences for slow frequency hopping. Wirel. Networks 4(5): 411-418 (1998) - 1994
- [j16]Jan Beirlant, László Györfi:
Pitman efficiencies of Lp-goodness-of-fit tests. Kybernetika 30(3): 223-232 (1994) - [j15]László Györfi, Istvan Pali, Edward C. van der Meulen:
There is no universal source code for an infinite source alphabet. IEEE Trans. Inf. Theory 40(1): 267-271 (1994) - 1993
- [j14]László Györfi, Istvan Pali, Edward C. van der Meulen:
On Universal Noiseless Source Coding for Infinite Source Alphabets. Eur. Trans. Telecommun. 4(2): 125-132 (1993) - [j13]László Györfi, István Vajda:
Constructions of protocol sequences for multiple access collision channel without feedback. IEEE Trans. Inf. Theory 39(5): 1762-1765 (1993) - 1992
- [j12]Nguyen Q. A, László Györfi, James L. Massey:
Constructions of binary constant-weight cyclic codes and cyclically permutable codes. IEEE Trans. Inf. Theory 38(3): 940-949 (1992) - [j11]Andrew R. Barron, László Györfi, Edward C. van der Meulen:
Distribution estimation consistent in total variation and in two types of information divergence. IEEE Trans. Inf. Theory 38(5): 1437-1454 (1992) - 1990
- [j10]László Györfi, Elias Masry:
The L1 and L2 strong consistency of recursive kernel density estimation from dependent samples. IEEE Trans. Inf. Theory 36(3): 531-539 (1990) - 1988
- [j9]Thomas H. E. Ericson, László Györfi:
Superimposed codes in Rn. IEEE Trans. Inf. Theory 34(4): 877-880 (1988) - 1984
- [j8]László Györfi:
Adaptive linear procedures under general conditions. IEEE Trans. Inf. Theory 30(2): 262-267 (1984) - 1982
- [j7]G. Dallos, László Györfi:
An Error Correcting Rule Using Memory for Simple ALOHA Channels. IEEE Trans. Commun. 30(5): 1208-1212 (1982) - 1981
- [j6]László Györfi:
The rate of convergence of kn-NN regression estimates and classification rules. IEEE Trans. Inf. Theory 27(3): 362-364 (1981) - [j5]László Györfi, István Kerekes:
A block code for noiseless asynchronous multiple-access OR channel. IEEE Trans. Inf. Theory 27(6): 788-791 (1981) - 1978
- [j4]László Györfi:
On the rate of convergence of nearest neighbor rules (Corresp.). IEEE Trans. Inf. Theory 24(4): 509-512 (1978) - [j3]László Györfi, Zoltán Györfi:
An upper bound on the asymptotic error probability on the k-nearest neighbor rule for multiple classes (Corresp.). IEEE Trans. Inf. Theory 24(4): 512-514 (1978) - 1975
- [j2]T. Farago, László Györfi:
On the continuity of the error distortion function for multiple-hypothesis decisions (Corresp.). IEEE Trans. Inf. Theory 21(4): 458-460 (1975) - 1974
- [j1]László Györfi:
On the estimation of asymptotic error probability (Corresp.). IEEE Trans. Inf. Theory 20(2): 277-278 (1974)
Conference and Workshop Papers
- 2014
- [c12]Ezio Biglieri, László Györfi:
Some remarks on robust binary hypothesis testing. ISIT 2014: 566-570 - 2013
- [c11]Luc Devroye, Paola G. Ferrario
, László Györfi, Harro Walk:
Strong Universal Consistent Estimate of the Minimum Mean Squared Error. Empirical Inference 2013: 143-160 - 2009
- [c10]László Györfi, Péter Kevei
:
St. Petersburg Portfolio Games. ALT 2009: 83-96 - [c9]Erol Gelenbe, László Györfi:
Performance of Auctions and Sealed Bids. EPEW 2009: 30-43 - 2008
- [c8]László Györfi, István Vajda:
Growth Optimal Investment with Transaction Costs. ALT 2008: 108-122 - [c7]Arthur Gretton
, László Györfi:
Nonparametric Independence Tests: Space Partitioning and Kernel Approaches. ALT 2008: 183-198 - 2007
- [c6]György Ottucsák, László Györfi:
Sequential prediction of binary sequence with side information only. ISIT 2007: 2351-2355 - 2006
- [c5]Chamy Allenberg, Peter Auer, László Györfi, György Ottucsák:
Hannan Consistency in On-Line Learning in Case of Unbounded Losses Under Partial Monitoring. ALT 2006: 229-243 - 2004
- [c4]András Antos, László Györfi, András György:
Improved convergence rates in empirical vector quantizer design. ISIT 2004: 301 - [c3]László Györfi, Bálint Laczay:
Signature coding and information transfer for the multiple access adder channel. ITW 2004: 242-246 - 2000
- [c2]Tuan Anh Trinh, Tamás Éltetö, László Györfi:
On Some Metrics of TCP. LCN 2000: 544-545 - 1982
- [c1]László Györfi, István Kerekes:
Analysis of Multiple Access Channel using Multiple Level FSK. EUROCRYPT 1982: 165-172
Parts in Books or Collections
- 2016
- [p1]Maik Döring, László Györfi, Harro Walk:
Exact Rate of Convergence of Kernel-Based Classification Rule. Challenges in Computational Statistics and Data Mining 2016: 71-91
Editorship
- 2008
- [e1]Yoav Freund, László Györfi, György Turán, Thomas Zeugmann:
Algorithmic Learning Theory, 19th International Conference, ALT 2008, Budapest, Hungary, October 13-16, 2008. Proceedings. Lecture Notes in Computer Science 5254, Springer 2008, ISBN 978-3-540-87986-2 [contents]
Informal and Other Publications
- 2023
- [i10]Hüseyin Afser, László Györfi, Harro Walk:
Repeated Observations for Classification. CoRR abs/2307.09896 (2023) - [i9]László Györfi, Tamás Linder, Harro Walk:
Lossless Transformations and Excess Risk Bounds in Statistical Inference. CoRR abs/2307.16735 (2023) - [i8]Balázs Csanád Csáji, László Györfi, Ambrus Tamás:
On rate-optimal classification from non-private and from private data. CoRR abs/2312.14889 (2023) - 2021
- [i7]László Györfi, Aryeh Kontorovich, Roi Weiss:
Tree density estimation. CoRR abs/2111.11971 (2021) - 2020
- [i6]László Györfi, Roi Weiss:
Universal consistency and rates of convergence of multiclass prototype algorithms in metric spaces. CoRR abs/2010.00636 (2020) - 2008
- [i5]László Györfi, Gábor Lugosi, Gusztáv Morvai:
A simple randomized algorithm for sequential prediction of ergodic time series. CoRR abs/0805.3091 (2008) - 2007
- [i4]László Györfi, Gusztáv Morvai:
Queueing for ergodic arrivals and services. CoRR abs/0709.2330 (2007) - [i3]Gusztáv Morvai, Sidney Yakowitz, László Györfi:
Nonparametric inference for ergodic, stationary time series. CoRR abs/0711.0367 (2007) - [i2]László Györfi, Gusztáv Morvai, Sidney Yakowitz:
Limits to consistent on-line forecasting for ergodic time series. CoRR abs/0712.2430 (2007) - [i1]Sidney Yakowitz, László Györfi, John C. Kieffer, Gusztáv Morvai:
Strongly consistent nonparametric forecasting and regression for stationary ergodic sequences. CoRR abs/0712.2592 (2007)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-09-12 03:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint