Michael Brand
From MaRDI portal
Person:477621
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| MML Is Not Consistent for Neyman-Scott IEEE Transactions on Information Theory | 2020-09-29 | Paper |
| A taxonomy of estimator consistency on discrete estimation problems | 2019-09-12 | Paper |
| The IMP game: learnability, approximability and adversarial learning beyond \(\Sigma^0_1\) Journal Of Logic And Computation | 2018-02-13 | Paper |
| P-RAM vs. RP-RAM Theoretical Computer Science | 2017-09-07 | Paper |
| Compressed Genotyping IEEE Transactions on Information Theory | 2017-07-27 | Paper |
| Small polyomino packing Information Processing Letters | 2017-06-30 | Paper |
| No easy puzzles: hardness results for jigsaw puzzles Theoretical Computer Science | 2015-05-26 | Paper |
| Arbitrary sequence RAMs Information Processing Letters | 2014-12-09 | Paper |
| Lower bounds on the Münchhausen problem The Australasian Journal of Combinatorics | 2014-08-15 | Paper |
| Constant-time sorting Information and Computation | 2014-07-18 | Paper |
| Friedman numbers have density 1 Discrete Applied Mathematics | 2014-04-10 | Paper |
| On the density of nice Friedmans | 2013-10-09 | Paper |
| Münchhausen matrices The Electronic Journal of Combinatorics | 2013-06-07 | Paper |
| Computing with and without arbitrary large numbers Lecture Notes in Computer Science | 2013-05-28 | Paper |
| Does indirect addressing matter? Acta Informatica | 2013-02-15 | Paper |
| Tightening the bounds on the Baron's omni-sequence Discrete Mathematics | 2012-03-16 | Paper |
Research outcomes over time
This page was built for person: Michael Brand
