Zimand, Marius - Department of Computer and Information Sciences,Towson University

• Relative to a random oracle, P/poly is not measurable in EXP Marius Zimand
• Sharing random bits with no process coordination Marius Zimand
• On derandomizing probabilistic sublinear-time algorithms Marius Zimand
• EXPOSURE-RESILIENT EXTRACTORS AND THE DERANDOMIZATION OF
• Power Balance and Apportionment Algorithms for the United States Congress
• Effective Category and Measure in Abstract Complexity Theory \Lambday
• Extracting the Kolmogorov complexity of strings and sequences from sources with limited
• Extractors for the real world 1 (School of Computer and Information Sciences
• A HighLow Kolmogorov Complexity Law Equivalent To The 01 Marius Zimand \Lambda
• Almost-Everywhere Superiority for Quantum Polynomial-Time Languages
• Symmetry of information and bounds on nonuniform randomness extraction via Kolmogorov extractors
• Combinatorial characterizations of extractors and Kolmogorov Marius Zimand
• Impossibility of independence amplification in Kolmogorov complexity theory
• Impossibility of independence amplification in Kolmogorov complexity theory
• Counting dependent and independent strings Marius Zimand
• Counting dependent and independent strings Marius Zimand
• Two sources are better than one for increasing the Kolmogorov complexity of infinite sequences
• Algorithmically Independent Sequences Cristian S. Calude
• Background Independence for sequences Impossibility results Algorithmically Independent Sequences
• Derandomizing BP(sublinear) Exposure-resilient extractors
• Exposure-resilient extractors Marius Zimand
• Simple extractors via crypto pseudo-random generators
• On The Topological Size of pmComplete Degrees Marius Zimand \Lambda
• Worlds To Die For \Lambda Lane A. Hemaspaandra, Ajit Ramachandran, and Marius Zimand
• The Complexity of Finding Top-Toda-Equivalence-Class Members
• On the Size of Classes with Weak Membership Properties Marius Zimand \Lambda
• Efficient Privatization of Random Bits Marius Zimand
• Background Main Results Proofs On generating independent random strings
• Symmetry of information and bounds on nonuniform randomness extraction via Kolmogorov extractors
• Weighted NP Optimization Problems: Logical Definability and Approximation Properties
• Probabilistically Checkable Proofs The Easy Way Marius Zimand
• Possibilities and impossibilities in Kolmogorov complexity Marius Zimand
• Submitted to the Symposium on Theoretical Aspects of Computer Science www.stacs-conf.org
• The Complexity of the Optimal Spanning Hypertree Problem Marius Zimand \Lambda
• Combinatorial characterizations of extractors and Kolmogorov extractors
• Intro Construction Derandomizing BP(sublinear) Exposure-resilient Extractors and Applications
• A list-decodable code with local encoding and decoding Marius Zimand
• PolynomialTime SemiRankable Sets Lane A. Hemaspaandra \Lambda Mohammed J. Zaki y Marius Zimand \Lambda
• Almost-Everywhere Superiority for Quantum Polynomial Time
• Sampling under adverse conditions Marius Zimand
• Large sets in AC 0 have many strings with low Kolmogorov Marius Zimand \Lambda
• Main Result Two sources are better than one for increasing the
• On generating independent random strings Marius Zimand1
• On the optimal compression of sets in PSPACE Marius Zimand
• Simple extractors via constructions of cryptographic pseudo-random Marius Zimand
• Strong SelfReducibility Precludes Strong Immunity \Lambda Lane A. Hemaspaandra and Marius Zimand
• On the optimal compression of sets in PSPACE Marius Zimand
• On the optimal compression of sets in PSPACE Marius Zimand