default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeriodica Mathematica Hungarica, Volume 50
Volume 50, Numbers 1-2, August 2005
- Miklós Csörgo:
Tribute to Endre Csáki and Pál Révész. 1-27 - Mátyás Barczy, Gyula Pap:
Connection between deriving bridges and radial parts from multidimensional Ornstein-Uhlenbeck processes. 47-60 - Alexey Chuprunov, István Fazekas:
Integral analogues of almost sure limit theorems. 61-78 - Miklós Csörgo, Zhan Shi:
An Lp-view of the Bahadur-Kiefer Theorem. 79-98 - Sándor Csörgo, Gordon Simons:
Laws of large numbers for cooperative St. Petersburg gamblers. 99-115 - Antónia Földes:
Some of my favorite results with Endre Csáki and Pál Révész - A survey. 117-134 - Edit Gombay, Daniel Serban:
An adaptation of Page's CUSUM test for change detection. 135-147 - Khurelbaatar Gonchigdanzan:
A note on the almost sure limit theorem for U-statistic. 149-153 - Karl Gril:
Finite-range interactions and phases. 155-163 - Yueyun Hu:
A note on the empty balls left by a critical branching Wiener process. 165-174 - Yuji Kasahara, Shinzo Watanabe:
Occupation time theorems for a class of one-dimensional diffusion processes. 175-188 - Marina Kozlova, Paavo Salminen:
An occupation time identity for reflecting Brownian motion with drift. 189-198 - Lídia Rejtõ, Gábor E. Tusnády:
Clustering Methods in Microarrays. 199-221 - Jay Rosen:
A random walk proof of the Erdős-Taylor conjecture. 223-245 - Bernard Roynette, Pierre Vallois, Marc Yor:
Limiting laws for long Brownian bridges perturbed by their one-sided maximum, III. 247-280
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.
last updated on 2025-02-03 20:15 CET 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:
