×

zbMATH — the first resource for mathematics

Zimand, Marius

Compute Distance To:
Author ID: zimand.marius Recent zbMATH articles by "Zimand, Marius"
Published as: Zimand, M.; Zimand, Marius
Documents Indexed: 51 Publications since 1983, including 1 Book
Reviewing Activity: 181 Reviews

Publications by Year

Citations contained in zbMATH

30 Publications have been cited 84 times in 57 Documents Cited by Year
Short lists with short programs in short time. Zbl 1390.68356
Bauwens, Bruno; Makhlin, Anton; Vereshchagin, Nikolay; Zimand, Marius
10
2018
Is independence an exception? Zbl 0822.03024
Calude, C.; Jürgensen, H.; Zimand, M.
7
1994
Extracting the Kolmogorov complexity of strings and sequences from sources with limited independence. Zbl 1236.68113
Zimand, Marius
6
2009
Two sources are better than one for increasing the Kolmogorov complexity of infinite sequences. Zbl 1143.68020
Zimand, Marius
6
2008
Short lists with short programs in short time – a short proof. Zbl 1432.68201
Zimand, Marius
5
2014
Computational complexity: a quantitative perspective. Zbl 1106.68048
Zimand, Marius
5
2004
Strong self-reducibility precludes strong immunity. Zbl 0857.68046
Hemaspaandra, L. A.; Zimand, M.
5
1996
Exposure-resilient extractors and the derandomization of probabilistic sublinear time. Zbl 1149.68035
Zimand, Marius
3
2008
Almost-everywhere superiority for quantum polynomial time. Zbl 1012.68067
Hemaspaandra, Edith; Hemaspaandra, Lane A.; Zimand, Marius
3
2002
On approximate decidability of minimal programs. Zbl 1347.68096
Teutsch, Jason; Zimand, Marius
2
2015
On the optimal compression of sets in PSPACE. Zbl 1342.68140
Zimand, Marius
2
2011
Impossibility of independence amplification in Kolmogorov complexity theory. Zbl 1287.68085
Zimand, Marius
2
2010
Two sources are better than one for increasing the Kolmogorov complexity of infinite sequences. Zbl 1205.68182
Zimand, Marius
2
2010
On generating independent random strings. Zbl 1268.68090
Zimand, Marius
2
2009
Algorithmically independent sequences. Zbl 1159.68012
Calude, Cristian S.; Zimand, Marius
2
2008
The complexity of finding top-Toda-equivalence-class members. Zbl 1100.68033
Hemaspaandra, Lane A.; Ogihara, Mitsunori; Zaki, Mohammed J.; Zimand, Marius
2
2006
Efficient privatization of random bits. Zbl 0922.68051
Zimand, Marius
2
1998
On the size of classes with weak membership properties. Zbl 0912.68048
Zimand, Marius
2
1998
Weighted NP optimization problems: logical definability and approximation properties. Zbl 0914.68074
Zimand, Marius
2
1998
Minimum spanning hypertrees. Zbl 0812.68105
Tomescu, Ioan; Zimand, Marius
2
1994
If not empty, NP-P is topologically large. Zbl 0781.68072
Zimand, Marius
2
1993
Recursive Baire classification and speedable functions. Zbl 0798.03042
Calude, Cristian; Istrate, Gabriel; Zimand, Marius
2
1992
Generating Kolmogorov random strings from sources with limited independence. Zbl 1271.68114
Zimand, Marius
1
2013
Counting dependent and independent strings. Zbl 1287.68084
Zimand, Marius
1
2010
Algorithmically independent sequences. Zbl 1187.68268
Calude, Cristian S.; Zimand, Marius
1
2010
Large sets in \(\mathrm{AC}^{0}\) have many strings with low Kolmogorov complexity. Zbl 1337.68142
Zimand, Marius
1
1997
Effective category and measure in abstract complexity theory. Zbl 0872.03027
Calude, Cristian; Zimand, Marius
1
1996
On the topological size of p-m-complete degrees. Zbl 0873.68066
Zimand, Marius
1
1995
On the existence of complete sets for positive relativized classes. Zbl 0672.03027
Zimand, Marius
1
1988
On the topological size of sets of random strings. Zbl 0576.03031
Zimand, M.
1
1986
Short lists with short programs in short time. Zbl 1390.68356
Bauwens, Bruno; Makhlin, Anton; Vereshchagin, Nikolay; Zimand, Marius
10
2018
On approximate decidability of minimal programs. Zbl 1347.68096
Teutsch, Jason; Zimand, Marius
2
2015
Short lists with short programs in short time – a short proof. Zbl 1432.68201
Zimand, Marius
5
2014
Generating Kolmogorov random strings from sources with limited independence. Zbl 1271.68114
Zimand, Marius
1
2013
On the optimal compression of sets in PSPACE. Zbl 1342.68140
Zimand, Marius
2
2011
Impossibility of independence amplification in Kolmogorov complexity theory. Zbl 1287.68085
Zimand, Marius
2
2010
Two sources are better than one for increasing the Kolmogorov complexity of infinite sequences. Zbl 1205.68182
Zimand, Marius
2
2010
Counting dependent and independent strings. Zbl 1287.68084
Zimand, Marius
1
2010
Algorithmically independent sequences. Zbl 1187.68268
Calude, Cristian S.; Zimand, Marius
1
2010
Extracting the Kolmogorov complexity of strings and sequences from sources with limited independence. Zbl 1236.68113
Zimand, Marius
6
2009
On generating independent random strings. Zbl 1268.68090
Zimand, Marius
2
2009
Two sources are better than one for increasing the Kolmogorov complexity of infinite sequences. Zbl 1143.68020
Zimand, Marius
6
2008
Exposure-resilient extractors and the derandomization of probabilistic sublinear time. Zbl 1149.68035
Zimand, Marius
3
2008
Algorithmically independent sequences. Zbl 1159.68012
Calude, Cristian S.; Zimand, Marius
2
2008
The complexity of finding top-Toda-equivalence-class members. Zbl 1100.68033
Hemaspaandra, Lane A.; Ogihara, Mitsunori; Zaki, Mohammed J.; Zimand, Marius
2
2006
Computational complexity: a quantitative perspective. Zbl 1106.68048
Zimand, Marius
5
2004
Almost-everywhere superiority for quantum polynomial time. Zbl 1012.68067
Hemaspaandra, Edith; Hemaspaandra, Lane A.; Zimand, Marius
3
2002
Efficient privatization of random bits. Zbl 0922.68051
Zimand, Marius
2
1998
On the size of classes with weak membership properties. Zbl 0912.68048
Zimand, Marius
2
1998
Weighted NP optimization problems: logical definability and approximation properties. Zbl 0914.68074
Zimand, Marius
2
1998
Large sets in \(\mathrm{AC}^{0}\) have many strings with low Kolmogorov complexity. Zbl 1337.68142
Zimand, Marius
1
1997
Strong self-reducibility precludes strong immunity. Zbl 0857.68046
Hemaspaandra, L. A.; Zimand, M.
5
1996
Effective category and measure in abstract complexity theory. Zbl 0872.03027
Calude, Cristian; Zimand, Marius
1
1996
On the topological size of p-m-complete degrees. Zbl 0873.68066
Zimand, Marius
1
1995
Is independence an exception? Zbl 0822.03024
Calude, C.; Jürgensen, H.; Zimand, M.
7
1994
Minimum spanning hypertrees. Zbl 0812.68105
Tomescu, Ioan; Zimand, Marius
2
1994
If not empty, NP-P is topologically large. Zbl 0781.68072
Zimand, Marius
2
1993
Recursive Baire classification and speedable functions. Zbl 0798.03042
Calude, Cristian; Istrate, Gabriel; Zimand, Marius
2
1992
On the existence of complete sets for positive relativized classes. Zbl 0672.03027
Zimand, Marius
1
1988
On the topological size of sets of random strings. Zbl 0576.03031
Zimand, M.
1
1986

Citations by Year