pith. sign in

Marius Zimand

Identifiers

  • name variant Marius Zimand 0.60 · backfill

Papers (23)

  1. On a conditional inequality in Kolmogorov complexity and its applications in communication complexity cs.CC · 2019 · author #2
  2. An operational characterization of mutual information in algorithmic information theory cs.IT · 2017 · author #2
  3. Distributed compression through the lens of algorithmic information theory: a primer cs.CC · 2017 · author #1
  4. List approximation for increasing Kolmogorov complexity cs.CC · 2016 · author #1
  5. Kolmogorov complexity version of Slepian-Wolf coding cs.IT · 2015 · author #1
  6. On approximate decidability of minimal programs math.LO · 2014 · author #2
  7. Linear list-approximation for short programs (or the power of a few random bits) cs.CC · 2013 · author #2
  8. On optimal language compression for sets in PSPACE/poly cs.CC · 2013 · author #2
  9. Short lists with short programs in short time - a short proof cs.CC · 2013 · author #1
  10. Short lists with short programs in short time cs.CC · 2013 · author #4
  11. On efficient constructions of short lists containing mostly Ramsey graphs cs.CC · 2012 · author #1
  12. Symmetry of Information: A Closer Look cs.IT · 2012 · author #1
  13. Nonuniform Kolmogorov extractors cs.CC · 2012 · author #1
  14. On the optimal compression of sets in PSPACE cs.CC · 2011 · author #1
  15. Possibilities and impossibilities in Kolmogorov complexity extraction cs.CC · 2011 · author #1
  16. Symmetry of information and bounds on nonuniform randomness extraction via Kolmogorov extractors cs.CC · 2011 · author #1
  17. Counting dependent and independent strings cs.CC · 2010 · author #1
  18. Impossibility of independence amplification in Kolmogorov complexity theory cs.CC · 2010 · author #1
  19. On generating independent random strings cs.IT · 2009 · author #1
  20. Extracting the Kolmogorov Complexity of Strings and Sequences from Sources with Limited Independence cs.CC · 2009 · author #1
  21. Algorithmically independent sequences cs.IT · 2008 · author #2
  22. Two sources are better than one for increasing the Kolmogorov complexity of infinite sequences cs.IT · 2007 · author #1
  23. Simple extractors via constructions of cryptographic pseudo-random generators cs.CC · 2005 · author #1

Mentions

  • 1511.03602 #1 · backfill · confidence 0.70 Marius Zimand
  • 1409.0496 #2 · backfill · confidence 0.70 Marius Zimand
  • 1311.7278 #2 · backfill · confidence 0.70 Marius Zimand
  • 1304.1005 #2 · backfill · confidence 0.70 Marius Zimand
  • 1302.1109 #1 · backfill · confidence 0.70 Marius Zimand
  • 1301.1547 #4 · backfill · confidence 0.70 Marius Zimand
  • 1210.4408 #1 · backfill · confidence 0.70 Marius Zimand
  • 1206.5184 #1 · backfill · confidence 0.70 Marius Zimand
  • 1204.6696 #1 · backfill · confidence 0.70 Marius Zimand
  • 1104.2816 #1 · backfill · confidence 0.70 Marius Zimand
  • 1104.0872 #1 · backfill · confidence 0.70 Marius Zimand
  • 1103.5669 #1 · backfill · confidence 0.70 Marius Zimand
  • 1006.1315 #1 · backfill · confidence 0.70 Marius Zimand
  • 1006.0701 #1 · backfill · confidence 0.70 Marius Zimand
  • 0903.3889 #1 · backfill · confidence 0.70 Marius Zimand
  • 0902.2141 #1 · backfill · confidence 0.70 Marius Zimand
  • 0802.0487 #2 · backfill · confidence 0.70 Marius Zimand
  • 0705.4658 #1 · backfill · confidence 0.70 Marius Zimand

Frequent Coauthors