On the Topological Size of Sets of Random Strings. - Marius Zimand (Math. Log. Q., 1986)

On Relativizations with Restricted Number of Accesses to the Oracle Set. - Marius Zimand (Math. Syst. Theory, 1987)

Recursive Baire Classification and Speedable Functions. - Cristian S. Calude; Gabriel Istrate; Marius Zimand (Math. Log. Q., 1992)

If not Empty, NP - P is Topologically Large. - Marius Zimand (Theor. Comput. Sci., 1993)

Minimum Spanning Hypertrees. - Ioan Tomescu; Marius Zimand (Discret. Appl. Math., 1994)

Effective Category and Measure in Abstract Complexity Theory (Extended Abstract). - Cristian Calude; Marius Zimand (FCT, 1995)

Worlds to die for. - Lane A. Hemaspaandra; Ajit Ramachandran; Marius Zimand (SIGACT News, 1995)

On the Topological Size of p-m-Complete Degrees. - Marius Zimand (Theor. Comput. Sci., 1995)

A High-Low Kolmogorov Complexity Law Equivalent to the 0-1 Law. - Marius Zimand (Inf. Process. Lett., 1996)

Strong Self-Reducibility Precludes Strong Immunity. - Lane A. Hemaspaandra; Marius Zimand (Math. Syst. Theory, 1996)

Effective Category and Measure in Abstract Complexity Theory. - Cristian Calude; Marius Zimand (Theor. Comput. Sci., 1996)

Large Sets in AC0 have Many Strings with Low Kolmogorov Complexity. - Marius Zimand (Inf. Process. Lett., 1997)

Sharing Random Bits with No Process Coordination. - Marius Zimand (IPPS/SPDP, 1998)

Power Balance and Apportionment Algorithms for the United States Congress. - Lane A. Hemaspaandra; Kulathur S. Rajasethupathy; Prasanna Sethupathy; Marius Zimand (ACM J. Exp. Algorithmics, 1998)

Weighted NP Optimization Problems: Logical Definability and Approximation Properties. - Marius Zimand (SIAM J. Comput., 1998)

On the Size of Classes with Weak Membership Properties. - Marius Zimand (Theor. Comput. Sci., 1998)

Almost-Everywhere Superiority for Quantum Computing - Edith Hemaspaandra; Lane A. Hemaspaandra; Marius Zimand (CoRR, 1999)

Relative to a Random Oracle, P/Poly is not Measurable in EXP. - Marius Zimand (Inf. Process. Lett., 1999)

Extractors for the Real World. - Kundi Xue; Marius Zimand (J. Univers. Comput. Sci., 2000)

Probabilistically Checkable Proofs The Easy Way - Marius Zimand (Electron. Colloquium Comput. Complex., 2001)

Almost-Everywhere Superiority for Quantum Polynomial Time. - Edith Hemaspaandra; Lane A. Hemaspaandra; Marius Zimand (Inf. Comput., 2002)

A Dedicated Undergraduate Track in Computer Security Education. - Shiva Azadegan; M. Lavine; Michael O'Leary; Alexander L. Wijesinha; Marius Zimand (World Conference on Information Security Education, 2003)

An undergraduate track in computer security. - Shiva Azadegan; M. Lavine; Michael O'Leary; Alexander L. Wijesinha; Marius Zimand (ITiCSE, 2003)

A List-Decodable Code with Local Encoding and Decoding. - Marius Zimand (SNPD, 2005)

Exposure-Resilient Extractors. - Marius Zimand (CCC, 2006)

The Complexity of Finding Top-Toda-Equivalence-Class Members. - Lane A. Hemaspaandra; Mitsunori Ogihara; Mohammed J. Zaki; Marius Zimand (Theory Comput. Syst., 2006)

On Derandomizing Probabilistic Sublinear-Time Algorithms. - Marius Zimand (CCC, 2007)

Selected Papers from the 1st ACIS International Workshop on Self-Assembling Wireless Networks. - Gruia Calinescu; Ion I. Mandoiu; Alexander Zelikovsky; Marius Zimand (J. Univers. Comput. Sci., 2007)

Combinatorics and Related Areas A Collection of Papers in Honour of the 65th Birthday of Ioan Tomescu. - Cristian S. Calude; Gheorghe Stefanescu; Marius Zimand (J. Univers. Comput. Sci., 2007)

Exposure-Resilient Extractors and the Derandomization of Probabilistic Sublinear Time. - Marius Zimand (Comput. Complex., 2008)

On Generating Independent Random Strings. - Marius Zimand (CiE, 2009)

Extracting the Kolmogorov Complexity of Strings and Sequences from Sources with Limited Independence. - Marius Zimand (STACS, 2009)

Impossibility of Independence Amplification in Kolmogorov Complexity Theory. - Marius Zimand (MFCS, 2010)

Algorithmically independent sequences. - Cristian S. Calude; Marius Zimand (Inf. Comput., 2010)

Two Sources Are Better than One for Increasing the Kolmogorov Complexity of Infinite Sequences. - Marius Zimand (Theory Comput. Syst., 2010)

Simple extractors via constructions of cryptographic pseudo-random generators. - Marius Zimand (Theor. Comput. Sci., 2010)

Symmetry of Information and Bounds on Nonuniform Randomness Extraction via Kolmogorov Extractors. - Marius Zimand (CCC, 2011)

Possibilities and impossibilities in Kolmogorov complexity extraction - Marius Zimand (CoRR, 2011)

On the optimal compression of sets in PSPACE. - Marius Zimand (Electron. Colloquium Comput. Complex., 2011)

Symmetry of Information: A Closer Look. - Marius Zimand (Computation, Physics and Beyond, 2012)

Several Remarks on Index Generation Functions. - Dan A. Simovici; Marius Zimand; Dan Pletea (ISMVL, 2012)

Nonuniform Kolmogorov extractors - Marius Zimand (CoRR, 2012)

On Efficient Constructions of Short Lists Containing Mostly Ramsey Graphs. - Marius Zimand (TAMC, 2013)

Generating Kolmogorov random strings from sources with limited independence. - Marius Zimand (J. Log. Comput., 2013)

Review of Deterministic Extraction from weak random sources by Ariel Gabizon. - Marius Zimand (SIGACT News, 2013)

Short Lists with Short Programs in Short Time - A Short Proof. - Marius Zimand (CiE, 2014)

Counting Dependent and Independent Strings. - Marius Zimand (Fundam. Informaticae, 2014)

Linear list-approximation for short programs (or the power of a few random bits). - Bruno Bauwens; Marius Zimand (Electron. Colloquium Comput. Complex., 2015)

On Optimal Language Compression for Sets in PSPACE/poly. - N. V. Vinodchandran; Marius Zimand (Theory Comput. Syst., 2015)

On Approximate Decidability of Minimal Programs. - Jason Teutsch; Marius Zimand (ACM Trans. Comput. Theory, 2015)

A Brief on Short Descriptions. - Jason Teutsch; Marius Zimand (SIGACT News, 2016)

Kolmogorov complexity version of Slepian-Wolf coding. - Marius Zimand (STOC, 2017)

Distributed compression through the lens of algorithmic information theory: a primer. - Marius Zimand (CoRR, 2017)

Short lists with short programs in short time. - Bruno Bauwens; Anton Makhlin; Nikolai K. Vereshchagin; Marius Zimand (Comput. Complex., 2018)

An operational characterization of mutual information in algorithmic information theory. - Andrei E. Romashchenko; Marius Zimand (Electron. Colloquium Comput. Complex., 2018)

On a conditional inequality in Kolmogorov complexity and its applications in communication complexity. - Andrei E. Romashchenko; Marius Zimand (CoRR, 2019)

Secret Key Agreement from Correlated Data, with No Prior Information. - Marius Zimand (STACS, 2020)

Universal codes in the shared-randomness model for channels with general distortion capabilities. - Bruno Bauwens; Marius Zimand (CoRR, 2020)

List Approximation for Increasing Kolmogorov Complexity. - Marius Zimand (Axioms, 2021)

Online matching in lossless expanders. - Marius Zimand (CoRR, 2021)

27 Open Problems in Kolmogorov Complexity. - Andrei E. Romashchenko; Alexander Shen 001; Marius Zimand (SIGACT News, 2021)

Hall-type theorems for fast almost dynamic matching and applications. - Bruno Bauwens; Marius Zimand (CoRR, 2022)

Optimal Coding Theorems in Time-Bounded Kolmogorov Complexity. - Zhenjian Lu; Igor Carboni Oliveira; Marius Zimand (Electron. Colloquium Comput. Complex., 2022)

Frontiers of Computability, Randomness, and Complexity (dedicated to the 70th birthday of Professor Cristian Calude). - Alastair A. Abbott; Cezar Câmpeanu; Ludwig Staiger; Marius Zimand; Arto Salomaa (Theor. Comput. Sci., 2023)

Universal almost Optimal Compression and Slepian-wolf Coding in Probabilistic Polynomial Time. - Bruno Bauwens; Marius Zimand (J. ACM, 2023)

On one-way functions and the average time complexity of almost-optimal compression. - Marius Zimand (Electron. Colloquium Comput. Complex., 2024)