Marius Zimand

Available identifiers

zbMath Open zimand.mariusMaRDI QIDQ290243

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q5874292	2023-02-07	Paper
Effective category and measure in abstract complexity theory	2022-12-09	Paper
https://portal.mardi4nfdi.de/entity/Q5002777	2021-07-28	Paper
An Operational Characterization of Mutual Information in Algorithmic Information Theory	2020-02-11	Paper
Secret key agreement from correlated data, with no prior information	2019-10-08	Paper
Distributed Compression through the Lens of Algorithmic Information Theory: A Primer	2019-07-04	Paper
List approximation for increasing Kolmogorov complexity	2018-04-19	Paper
Short lists with short programs in short time	2018-04-18	Paper
Kolmogorov complexity version of Slepian-Wolf coding	2017-08-17	Paper
On Approximate Decidability of Minimal Programs	2016-10-24	Paper
Relative to a random oracle, P/poly is not measurable in EXP	2016-06-16	Paper
Large sets in \(\mathrm{AC}^{0}\) have many strings with low Kolmogorov complexity	2016-06-01	Paper
On optimal language compression for sets in PSPACE/poly	2015-07-20	Paper
Short Lists with Short Programs in Short Time – A Short Proof	2015-02-25	Paper
Counting Dependent and Independent Strings	2014-05-12	Paper
Generating Kolmogorov random strings from sources with limited independence	2013-08-27	Paper
On Efficient Constructions of Short Lists Containing Mostly Ramsey Graphs	2013-05-28	Paper
Symmetry of Information: A Closer Look	2012-06-15	Paper
Extracting the Kolmogorov Complexity of Strings and Sequences from Sources with Limited Independence	2012-04-24	Paper
On the Optimal Compression of Sets in PSPACE	2011-08-19	Paper
Counting Dependent and Independent Strings	2010-09-03	Paper
Impossibility of Independence Amplification in Kolmogorov Complexity Theory	2010-09-03	Paper
Two sources are better than one for increasing the Kolmogorov complexity of infinite sequences	2010-08-13	Paper
On Generating Independent Random Strings	2010-07-28	Paper
Algorithmically independent sequences	2010-04-14	Paper
Simple extractors via constructions of cryptographic pseudo-random generators	2010-03-10	Paper
LATIN 2004: Theoretical Informatics	2009-05-07	Paper
Algorithmically Independent Sequences	2008-10-30	Paper
Exposure-resilient extractors and the derandomization of probabilistic sublinear time	2008-08-20	Paper
Two sources are better than one for increasing the Kolmogorov complexity of infinite sequences	2008-06-05	Paper
The complexity of finding top-Toda-equivalence-class members	2006-10-16	Paper
Automata, Languages and Programming	2006-01-10	Paper
https://portal.mardi4nfdi.de/entity/Q4650347	2005-02-11	Paper
Almost-everywhere superiority for quantum polynomial time	2003-01-14	Paper
https://portal.mardi4nfdi.de/entity/Q4520817	2001-02-27	Paper
https://portal.mardi4nfdi.de/entity/Q4240343	1999-05-03	Paper
On the size of classes with weak membership properties	1999-01-12	Paper
Weighted NP Optimization Problems: Logical Definability and Approximation Properties	1998-09-21	Paper
Strong self-reducibility precludes strong immunity	1997-03-03	Paper
On the topological size of p-m-complete degrees	1997-02-28	Paper
A High-Low Kolmogorov Complexity Law equivalent to the 0-1 Law	1997-02-28	Paper
Effective category and measure in abstract complexity theory	1997-02-28	Paper
https://portal.mardi4nfdi.de/entity/Q4866587	1996-03-04	Paper
https://portal.mardi4nfdi.de/entity/Q4841303	1996-02-20	Paper
Is independence an exception?	1995-05-11	Paper
Minimum spanning hypertrees	1994-11-28	Paper
RECURSIVE BAIRE CLASSIFICATION AND SPEEDABLE FUNCTIONS	1994-06-08	Paper
If not empty, NP-P is topologically large	1994-02-17	Paper
https://portal.mardi4nfdi.de/entity/Q3976968	1992-06-25	Paper
On relativizations with restricted number of accesses to the oracle set	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3824299	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3484820	1987-01-01	Paper
On the Topological Size of Sets of Random Strings	1986-01-01	Paper
A relation between correctness and randomness in the computation of probabilistic algorithms	1984-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3336692	1983-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Marius Zimand