default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGusztáv Morvai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j15]Gusztáv Morvai, Benjamin Weiss:
Estimating the conditional expectations for continuous time stationary processes. Kybernetika 56(3): 410-431 (2020)- [j14]Gusztáv Morvai, Benjamin Weiss:
Universal rates for estimating the residual waiting time in an intermittent way. Kybernetika 56(4): 601-616 (2020)
2010 – 2019
- 2019
- [j13]Gusztáv Morvai, Benjamin Weiss:
A note on discriminating Poisson processes from other point processes with stationary inter arrival times. Kybernetika 55(5): 802-808 (2019) - 2016
- [j12]Gusztáv Morvai, Benjamin Weiss:
A versatile scheme for predicting renewal times. Kybernetika 52(3): 348-358 (2016) - 2014
- [j11]Gusztáv Morvai, Benjamin Weiss:
Inferring the residual waiting time for binary stationary time series. Kybernetika 50(6): 869-882 (2014) - 2013
- [j10]Gusztáv Morvai, Benjamin Weiss:
Universal Tests for Memory Words. IEEE Trans. Inf. Theory 59(10): 6873-6879 (2013) - 2012
- [j9]Gusztáv Morvai, Benjamin Weiss:
A note on prediction for discrete time series. Kybernetika 48(4): 809-823 (2012) - 2010
- [j8]Gábor Molnár-Sáska, Gusztáv Morvai:
Intermittent estimation for Gaussian processes. IEEE Trans. Inf. Theory 56(6): 2778-2782 (2010)
2000 – 2009
- 2009
- [c1]Gusztáv Morvai, Benjamin Weiss:
Estimating the residual waiting time for binary stationary time series. ITW 2009: 67-70 - 2008
- [j7]Gusztáv Morvai, Benjamin Weiss:
Estimating the Lengths of Memory Words. IEEE Trans. Inf. Theory 54(8): 3804-3807 (2008) - [i20]Gusztáv Morvai, Benjamin Weiss:
On Sequential Estimation and Prediction for Discrete Time Series. CoRR abs/0803.4332 (2008) - [i19]Gusztáv Morvai, Sidney Yakowitz, Paul H. Algoet:
Weakly Convergent Nonparametric Forecasting of Stationary Time Series. CoRR abs/0805.3082 (2008) - [i18]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) - [i17]Gusztáv Morvai, Benjamin Weiss:
Estimating the Lengths of Memory Words. CoRR abs/0808.2964 (2008) - 2007
- [i16]László Györfi, Gusztáv Morvai:
Queueing for ergodic arrivals and services. CoRR abs/0709.2330 (2007) - [i15]Gusztáv Morvai, Sanjeev R. Kulkarni, Andrew B. Nobel:
Regression estimation from an individual stable sequence. CoRR abs/0710.2496 (2007) - [i14]Andrew B. Nobel, Gusztáv Morvai, Sanjeev R. Kulkarni:
Density estimation from an individual numerical sequence. CoRR abs/0710.2500 (2007) - [i13]Gusztáv Morvai, Benjamin Weiss:
Inferring the conditional mean. CoRR abs/0710.3757 (2007) - [i12]Gusztáv Morvai:
Guessing the output of a stationary binary time series. CoRR abs/0710.3760 (2007) - [i11]Gusztáv Morvai, Benjamin Weiss:
Limitations on intermittent forecasting. CoRR abs/0710.3773 (2007) - [i10]Gusztáv Morvai, Benjamin Weiss:
On classifying processes. CoRR abs/0710.3775 (2007) - [i9]Gusztáv Morvai, Benjamin Weiss:
Forecasting for stationary binary time series. CoRR abs/0710.5144 (2007) - [i8]Gusztáv Morvai, Benjamin Weiss:
Intermittent estimation of stationary time series. CoRR abs/0711.0350 (2007) - [i7]Gusztáv Morvai, Sidney Yakowitz, László Györfi:
Nonparametric inference for ergodic, stationary time series. CoRR abs/0711.0367 (2007) - [i6]Gusztáv Morvai, Benjamin Weiss:
Prediction for discrete time series. CoRR abs/0711.0471 (2007) - [i5]Gusztáv Morvai, Benjamin Weiss:
Order estimation of Markov chains. CoRR abs/0711.0472 (2007) - [i4]Gusztáv Morvai, Benjamin Weiss:
Forward estimation for ergodic time series. CoRR abs/0711.3856 (2007) - [i3]Gusztáv Morvai, Benjamin Weiss:
On estimating the memory for finitarily Markovian processes. CoRR abs/0712.0105 (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) - 2005
- [j6]Gusztáv Morvai, Benjamin Weiss:
Order estimation of Markov chains. IEEE Trans. Inf. Theory 51(4): 1496-1497 (2005)
1990 – 1999
- 1999
- [j5]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
- [j4]Andrew B. Nobel, Gusztáv Morvai, Sanjeev R. Kulkarni:
Density Estimation from an Individual Numerical Sequence. IEEE Trans. Inf. Theory 44(2): 537-541 (1998) - [j3]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) - 1997
- [j2]Gusztáv Morvai, Sidney Yakowitz, Paul H. Algoet:
Weakly convergent nonparametric forecasting of stationary time series. IEEE Trans. Inf. Theory 43(2): 483-498 (1997) - 1992
- [j1]Gusztáv Morvai:
Portfolio choice based on the empirical distribution. Kybernetika 28(6): 484-493 (1992)
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-24 23:14 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:
