default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartijn P. F. Berger
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2014
[j13]Haftom T. Abebe
, Frans E. S. Tan, Gerard J. P. Van Breukelen, Martijn P. F. Berger:
Bayesian D-optimal designs for the two parameter logistic mixed effects model. Comput. Stat. Data Anal. 71: 1066-1076 (2014)- [j12]Haftom T. Abebe, Frans E. S. Tan, Gerard J. P. Van Breukelen, Jan Serroyen, Martijn P. F. Berger:
On the Choice of a Prior for Bayesian D-Optimal Designs for the Logistic Regression Model with a Single Predictor. Commun. Stat. Simul. Comput. 43(7): 1811-1824 (2014) - [j11]Haftom T. Abebe, Frans E. S. Tan, Gerard J. P. Van Breukelen, Martijn P. F. Berger:
Robustness of Bayesian D-optimal design for the logistic mixed model against misspecification of autocorrelation. Comput. Stat. 29(6): 1667-1690 (2014) - 2011
- [j10]Shirley Ortega, Frans E. S. Tan, Martijn P. F. Berger:
ODMixed: A tool to obtain optimal designs for heterogeneous longitudinal studies with dropout. Comput. Methods Programs Biomed. 101(1): 62-71 (2011) - [j9]Valéria Lima Passos, Frans E. S. Tan, Martijn P. F. Berger:
Cost-efficiency considerations in the choice of a microarray platform for time course experimental designs. Comput. Stat. Data Anal. 55(1): 944-954 (2011) - [j8]Bärbel Maus, Gerard J. P. Van Breukelen, Rainer Goebel, Martijn P. F. Berger:
Optimal design of multi-subject blocked fMRI experiments. NeuroImage 56(3): 1338-1352 (2011) - 2010
- [j7]Bärbel Maus, Gerard J. P. Van Breukelen, Rainer Goebel, Martijn P. F. Berger:
Robustness of optimal design of fMRI experiments with application of a genetic algorithm. NeuroImage 49(3): 2433-2443 (2010) - 2009
- [j6]Fetene B. Tekle, Frans E. S. Tan, Martijn P. F. Berger:
Interactive computer program for optimal designs of longitudinal cohort studies. Comput. Methods Programs Biomed. 94(2): 168-176 (2009) - [j5]S. A. Ortega-Azurduy, Frans E. S. Tan, Martijn P. F. Berger:
Highly Efficient Designs to Handle the Incorrect Specification of Linear Mixed Models. Commun. Stat. Simul. Comput. 38(1): 14-30 (2009) - [j4]Valéria Lima Passos, Frans E. S. Tan, Bjorn Winkens, Martijn P. F. Berger:
Optimal Designs for One- and Two-Color Microarrays Using Mixed Models: A Comparative Evaluation of Their Efficiencies. J. Comput. Biol. 16(1): 67-83 (2009) - 2008
- [j3]Fetene B. Tekle, Frans E. S. Tan, Martijn P. F. Berger:
Maximin D-optimal designs for binary longitudinal responses. Comput. Stat. Data Anal. 52(12): 5253-5262 (2008) - [j2]Math J. J. M. Candel, Gerard J. P. Van Breukelen, Larissa Kotova, Martijn P. F. Berger:
Optimality of Equal vs. Unequal Cluster Sizes in Multilevel Intervention Studies: A Monte Carlo Study for Small Sample Sizes. Commun. Stat. Simul. Comput. 37(1): 222-239 (2008) - 2003
- [j1]Mirjam Moerbeek, Gerard J. P. Van Breukelen, Martijn P. F. Berger:
A Comparison of Estimation Methods for Multilevel Logistic Models. Comput. Stat. 18(1): 19-37 (2003)
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 22:57 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:
