![](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
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 20 matches
- 2023
- Maryam Alsolami
, Michael Mascagni
:
A Metropolis random walk algorithm to estimate a lower bound of the star discrepancy. Monte Carlo Methods Appl. 29(2): 161-171 (2023) - Guilhem Balvet
, Jean-Pierre Minier
, Christophe Henry
, Yelva Roustan
, Martin Ferrand
:
A time-step-robust algorithm to compute particle trajectories in 3-D unstructured meshes for Lagrangian stochastic methods. Monte Carlo Methods Appl. 29(2): 95-126 (2023) - Guilhem Balvet
, Jean-Pierre Minier
, Yelva Roustan
, Martin Ferrand
:
Analysis of wall-modelled particle/mesh PDF methods for turbulent parietal flows. Monte Carlo Methods Appl. 29(4): 275-305 (2023) - Pierre Bras, Gilles Pagès:
Convergence of Langevin-simulated annealing algorithms with multiplicative noise II: Total variation. Monte Carlo Methods Appl. 29(3): 203-219 (2023) - Mircea Dan Grigoriu:
Monte Carlo estimates of extremes of stationary/nonstationary Gaussian processes. Monte Carlo Methods Appl. 29(2): 127-142 (2023) - Caiyu Jiao, Changpin Li:
Monte Carlo method for parabolic equations involving fractional Laplacian. Monte Carlo Methods Appl. 29(1): 33-53 (2023) - Evgenia Kablukova, Karl K. Sabelfeld
, Dmitry Protasov, Konstantin S. Zhuravlev:
Stochastic simulation of electron transport in a strong electrical field in low-dimensional heterostructures. Monte Carlo Methods Appl. 29(4): 307-322 (2023) - Anastasiya E. Kireeva
, Ivan Aksyuk, Karl K. Sabelfeld
:
Two stochastic algorithms for solving elastostatics problems governed by the Lamé equation. Monte Carlo Methods Appl. 29(2): 143-160 (2023) - Ines Lescheb, Walid Slimani:
On the stationarity and existence of moments of the periodic EGARCH process. Monte Carlo Methods Appl. 29(4): 333-350 (2023) - Sedigheh Zamani Mehreyan
:
Bootstrap choice of non-nested autoregressive model with non-normal innovations. Monte Carlo Methods Appl. 29(3): 243-258 (2023) - Hadjer Nita, Faïrouz Afroun, Mouloud Cherfaoui, Djamil Aïssani
:
Statistical analysis of the estimates of some stationary performances of the unreliable M/M/1/N queue with Bernoulli feedback. Monte Carlo Methods Appl. 29(4): 351-366 (2023) - Getut Pramesti
:
Parameter least-squares estimation for time-inhomogeneous Ornstein-Uhlenbeck process. Monte Carlo Methods Appl. 29(1): 1-32 (2023) - Karl K. Sabelfeld
, Anastasiya E. Kireeva:
Randomized vector iterative linear solvers of high precision for large dense system. Monte Carlo Methods Appl. 29(4): 323-332 (2023) - Irina A. Shalimova, Karl K. Sabelfeld
:
Development and implementation of branching random walk on spheres algorithms for solving the 2D elastostatics Lamé equation. Monte Carlo Methods Appl. 29(1): 79-93 (2023) - Patricio Javier Valades-Pelayo
, Manuel A. Ramirez-Cabrera
, Argelia Balbuena-Ortega
:
Linking the Monte Carlo radiative transfer algorithm to the radiative transfer equation. Monte Carlo Methods Appl. 29(2): 173-180 (2023) - Frontmatter. Monte Carlo Methods Appl. 29(1): i-iv (2023)
- Frontmatter. Monte Carlo Methods Appl. 29(3): i-iv (2023)
- Toshihiro Yamada:
Total variation bound for Milstein scheme without iterated integrals. Monte Carlo Methods Appl. 29(3): 221-242 (2023) - Az-eddine Zakrad, Abdelaziz Nasroallah:
Computation of the steady-state probability of Markov chain evolving on a mixed state space. Monte Carlo Methods Appl. 29(3): 259-274 (2023) - Bolong Zhang, Michael Mascagni:
Pass-efficient randomized LU algorithms for computing low-rank matrix approximation. Monte Carlo Methods Appl. 29(3): 181-202 (2023)
loading more results
failed to load more results, please try again later
![](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.
retrieved on 2024-09-03 20:37 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint