Papers in refereed journals

Most papers are available on-line here . The other papers are available by request via surface mail or e-mail (the most recent ones).

E. Hemaspaandra, L. Hemaspaandra, and M. Zimand, Almost-everywhere superiority for quantum polynomial time, Information and Computation, vol. 175(2002), 171-181, 2002.

K. Xue and M. Zimand, Extractors for the real world, Journal of Universal Computer Science, vol. 6(1), 212-225, 2000.

M. Zimand, Weighted NP optimization problems: logical definability and approximation properties, SIAM J. on Computing, vol. 28(1), 36-56, 1999.

M. Zimand, Relative to a random oracle, P/poly is not measurable in EXP, Information Processing Letters 69 83-86, 1999.

M. Zimand, On the size of classes with weak membership properties, Theoretical Computer Science, vol. 209, pp. 225-235, 1998.

M. Zimand, Large Sets in $AC^0$ have many strings with high Kolmogorov complexity, Information Processing Letters, 62(3):165-170, 1997.

M. Zimand, A high-low Kolmogorov complexity law equivalent to the 0-1 law, Information Processing Letters, 57(2)(1996), pp. 59-64.

L. Hemaspaandra and M. Zimand, Strong Self-Reducibility Precludes Strong Immunity, Mathematical Systems Theory, 29(5)(1996), pp. 535-548.

C. Calude and M. Zimand, Effective Category and Measure in Abstract Complexity Theory, Theoretical Computer Science 154(2)(1996), pp. 307-327.

L. Hemaspaandra, A. Ramachandran and M. Zimand, Worlds to die for, Sigact News, 26(4), December 1995, pp. 5-15.

M. Zimand, On the Topological Size of p-m-Complete Sets, Theoretical Computer Science 147(2)(1995), pp. 137-147.

C. Calude, H. J\"{u}rgensen and M. Zimand, Is Independence an Exception ?, Applied Mathematics and Computation 66, 1(1994), 63-76.

I. Tomescu, M. Zimand, Minimum Spanning Hypertrees, Discrete Appl. Mathematics 54(1994), 67-76.

M. Zimand, If not empty, NP-P is topologically large, Theoret. Comput. Science 119(1993), 293-310.

M. Zimand, Pr\`{e}cisions sur la methode topologique en complexit\`{e} algorithmique (Note), Singularit\`{e}, 3 (1992), 25-27.

C. Calude, G. Istrate, M. Zimand, Recursive Baire Classification and Speedable Functions, Zeitschr. f\"{u}r Math. Logik und Grundlagen der Mathematik, 38 (1992), 169-178.

M. Zimand, Set Restricted Relativization, Anal. Univ. Al.I. Cuza Iasi, 25(1989), 329-335 (reviewed in MR 92e:03058, M.I. Dekhtyar).

M. Zimand, On the existence of Complete Problems for Positive Relativized Complexity Classes, Anal. Univ. Bucharest Mat.-Inf., 2(1988), 88-92 (reviewed in MR 90b:03056, Wen Qi Huang).

M. Zimand, The P =? NP Problem or the Challenge of Computer Science, in Mastering the Complexity, eds. M. Malita, C. Calude, Ed. Academiei, 1993 (in romanian).

M. Zimand, On Relativizations with Restricted Number of Accesses to the Oracle Set, Math. Systems Theory 20(1987), 1-11 (reviewed in MR 89a:68080, K. W. Wagner; ZBL 638.68030, D. Yu. Grigoriev).

M. Zimand, Complexity Bounded Martin-L\"{o}f Tests, Proc. Conf. Math. Logic and its Applications, Druzhba (Bulgaria), 1986, Plenum Press, 351-359 (reviewed in MR 89i:03108, J. L. Balcazar).

M. Zimand, On the Topological Size of Sets of Random Strings, Zeitschr. f\"{u}r Math. Logik und Grundlagen der Mathematik, 32 (1986), 81-88 (reviewed in MR 87f:03108, C.P. Schnorr).

M. Zimand, Baire Classification and partial recursive functions, Recursive Function Theory Newsletter, 32(1984), 346.

C. Calude, M. Zimand, A Relation Between Correctness and Randomness in the Computation of Probabilistic Algorithms, International Journal of Computer Math., 16 (1984), 47-53 (reviewed in MR 86e: 68052, C.P. Schnorr).

M. Zimand, Complexity of Probabilistic Algorithms, Found. of Control Engrg. 8 (1983), 33-49 (reviewed in MR 85e:03096, self-review).

Back to Marius Zimand's Home Page

Last Modified 08/26/1998

zimand@canes.gsw.edu