Follow
Marius Zimand
Marius Zimand
Professor of Computer Science, Towson University
Verified email at towson.edu
Title
Cited by
Cited by
Year
An undergraduate track in computer security
S Azadegan, M Lavine, M O'Leary, A Wijesinha, M Zimand
Proceedings of the 8th Annual Conference on innovation and Technology in …, 2003
492003
Is independence an exception?
C Calude, H Jürgensen, M Zimand
Applied Mathematics and Computation 66 (1), 63-76, 1994
451994
Short lists with short programs in short time
B Bauwens, A Makhlin, N Vereshchagin, M Zimand
2013 IEEE Conference on Computational Complexity, 98-108, 2013
37*2013
Two sources are better than one for increasing the Kolmogorov complexity of infinite sequences
M Zimand
Theory of Computing Systems 46 (4), 707-722, 2010
302010
Strong self-reducibility precludes strong immunity
LA Hemaspaandra, M Zimand
Mathematical systems theory 29 (5), 535-548, 1996
30*1996
Computational complexity: a quantitative perspective
M Zimand
Elsevier, 2004
282004
Extracting the Kolmogorov complexity of strings and sequences from sources with limited independence
M Zimand
arXiv preprint arXiv:0902.2141, 2009
232009
Linear list-approximation for short programs (or the power of a few random bits)
B Bauwens, M Zimand
2014 IEEE 29th Conference on Computational Complexity (CCC), 241-247, 2014
222014
Algorithmically independent sequences
CS Calude, M Zimand
Information and Computation 208 (3), 292-308, 2010
222010
Exposure-resilient extractors and the derandomization of probabilistic sublinear time
M Zimand
computational complexity 17, 220-253, 2008
22*2008
Almost-everywhere superiority for quantum polynomial time
E Hemaspaandra, LA Hemaspaandra, M Zimand
Information and Computation 175 (2), 171-181, 2002
222002
Several remarks on index generation functions
DA Simovici, M Zimand, D Pletea
2012 IEEE 42nd International Symposium on Multiple-Valued Logic, 179-184, 2012
212012
Short lists with short programs in short time–A short proof
M Zimand
Conference on Computability in Europe, 403-408, 2014
192014
Worlds to die for
LA Hemaspaandra, A Ramachandran, M Zimand
ACM SIGACT News 26 (4), 5-15, 1995
191995
Weighted NP optimization problems: logical definability and approximation properties
M Zimand
Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference …, 1995
191995
Minimum spanning hypertrees
I Tomescu, M Zimand
Discrete Applied Mathematics 54 (1), 67-76, 1994
181994
Possibilities and impossibilities in Kolmogorov complexity extraction
M Zimand
arXiv preprint arXiv:1104.0872, 2011
162011
Kolmogorov complexity version of Slepian-Wolf coding
M Zimand
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
142017
Optimal coding theorems in time-bounded kolmogorov complexity
Z Lu, IC Oliveira, M Zimand
arXiv preprint arXiv:2204.08312, 2022
132022
The complexity of finding top-Toda-equivalence-class members
LA Hemaspaandra, M Ogihara, MJ Zaki, M Zimand
Theory of Computing Systems 39 (5), 669-684, 2006
132006
The system can't perform the operation now. Try again later.
Articles 1–20