 | 2009 |
|---|
| 42 |       | Marius Zimand:
On Generating Independent Random Strings.
CiE 2009: 499-508 |
| 41 | | Marius Zimand:
Extracting the Kolmogorov Complexity of Strings and Sequences from Sources with Limited Independence.
STACS 2009: 697-708 |
| 40 | | Marius Zimand:
Extracting the Kolmogorov Complexity of Strings and Sequences from Sources with Limited Independence
CoRR abs/0902.2141: (2009) |
| 39 | | Marius Zimand:
On generating independent random strings
CoRR abs/0903.3889: (2009) |
| 2008 |
|---|
| 38 | | Marius Zimand:
Two Sources Are Better Than One for Increasing the Kolmogorov Complexity of Infinite Sequences.
CSR 2008: 326-338 |
| 37 | | Cristian S. Calude,
Marius Zimand:
Algorithmically Independent Sequences.
Developments in Language Theory 2008: 183-195 |
| 36 | | Cristian S. Calude,
Marius Zimand:
Algorithmically independent sequences
CoRR abs/0802.0487: (2008) |
| 35 | | Marius Zimand:
Exposure-Resilient Extractors and the Derandomization of Probabilistic Sublinear Time.
Computational Complexity 17(2): 220-253 (2008) |
| 2007 |
|---|
| 34 | | Marius Zimand:
On Derandomizing Probabilistic Sublinear-Time Algorithms.
IEEE Conference on Computational Complexity 2007: 1-9 |
| 33 | | Marius Zimand:
Two sources are better than one for increasing the Kolmogorov complexity of infinite sequences
CoRR abs/0705.4658: (2007) |
| 32 | | Gruia Calinescu,
Ion I. Mandoiu,
Alexander Zelikovsky,
Marius Zimand:
Selected Papers from the 1st ACIS International Workshop on Self-Assembling Wireless Networks.
J. UCS 13(1): 1-3 (2007) |
| 31 | | Cristian S. Calude,
Gheorghe Stefanescu,
Marius Zimand:
Combinatorics and Related Areas A Collection of Papers in Honour of the 65th Birthday of Ioan Tomescu.
J. UCS 13(11): 1498-1500 (2007) |
| 2006 |
|---|
| 30 | | Marius Zimand:
Exposure-Resilient Extractors.
IEEE Conference on Computational Complexity 2006: 61-72 |
| 29 | | Lane A. Hemaspaandra,
Mitsunori Ogihara,
Mohammed J. Zaki,
Marius Zimand:
The Complexity of Finding Top-Toda-Equivalence-Class Members.
Theory Comput. Syst. 39(5): 669-684 (2006) |
| 2005 |
|---|
| 28 | | Marius Zimand:
Simple Extractors via Constructions of Cryptographic Pseudo-random Generators.
ICALP 2005: 115-127 |
| 27 | | Marius Zimand:
A List-Decodable Code with Local Encoding and Decoding.
SNPD 2005: 232-237 |
| 26 | | Marius Zimand:
Simple extractors via constructions of cryptographic pseudo-random generators
CoRR abs/cs/0501075: (2005) |
| 25 | | Marius Zimand:
Simple extractors via constructions of cryptographic pseudo-random generators
Electronic Colloquium on Computational Complexity (ECCC)(071): (2005) |
| 2004 |
|---|
| 24 | | Lane A. Hemaspaandra,
Mitsunori Ogihara,
Mohammed Javeed Zaki,
Marius Zimand:
The Complexity of Finding Top-Toda-Equivalence-Class Members.
LATIN 2004: 90-99 |
| 2003 |
|---|
| 23 | | Shiva Azadegan,
M. Lavine,
Michael O'Leary,
Alexander L. Wijesinha,
Marius Zimand:
An undergraduate track in computer security.
ITiCSE 2003: 207-210 |
| 22 |  | Shiva Azadegan,
M. Lavine,
Michael O'Leary,
Alexander L. Wijesinha,
Marius Zimand:
A Dedicated Undergraduate Track in Computer Security Education.
World Conference on Information Security Education 2003: 319-332 |
| 2002 |
|---|
| 21 | | Marius Zimand:
Probabilistically Checkable Proofs the Easy Way.
IFIP TCS 2002: 337-351 |
| 20 | | Edith Hemaspaandra,
Lane A. Hemaspaandra,
Marius Zimand:
Almost-Everywhere Superiority for Quantum Polynomial Time.
Inf. Comput. 175(2): 171-181 (2002) |
| 2001 |
|---|
| 19 | | Marius Zimand:
Probabilistically Checkable Proofs The Easy Way
Electronic Colloquium on Computational Complexity (ECCC) 8(27): (2001) |
| 2000 |
|---|
| 18 | | Kundi Xue,
Marius Zimand:
Extractors for the Real World.
J. UCS 6(1): 212-225 (2000) |
| 1999 |
|---|
| 17 | | Edith Hemaspaandra,
Lane A. Hemaspaandra,
Marius Zimand:
Almost-Everywhere Superiority for Quantum Computing
CoRR quant-ph/9910033: (1999) |
| 16 | | Marius Zimand:
Relative to a Random Oracle, P/Poly is not Measurable in EXP.
Inf. Process. Lett. 69(2): 83-86 (1999) |
| 1998 |
|---|
| 15 | | Marius Zimand:
Sharing Random Bits with No Process Coordination.
IPPS/SPDP 1998: 455-459 |
| 14 | | Lane A. Hemaspaandra,
Kulathur S. Rajasethupathy,
Prasanna Sethupathy,
Marius Zimand:
Power Balance and Apportionment Algorithms for the United States Congress.
ACM Journal of Experimental Algorithmics 3: 1 (1998) |
| 13 | | Marius Zimand:
Weighted NP Optimization Problems: Logical Definability and Approximation Properties.
SIAM J. Comput. 28(1): 36-56 (1998) |
| 12 | | Marius Zimand:
On the Size of Classes with Weak Membership Properties.
Theor. Comput. Sci. 209(1-2): 225-235 (1998) |
| 1997 |
|---|
| 11 | | Marius Zimand:
Large Sets in AC0 have Many Strings with Low Kolmogorov Complexity.
Inf. Process. Lett. 62(3): 165-170 (1997) |
| 1996 |
|---|
| 10 | | Marius Zimand:
A High-Low Kolmogorov Complexity Law Equivalent to the 0-1 Law.
Inf. Process. Lett. 57(2): 59-64 (1996) |
| 9 | | Lane A. Hemaspaandra,
Marius Zimand:
Strong Self-Reducibility Precludes Strong Immunity.
Mathematical Systems Theory 29(5): 535-548 (1996) |
| 8 | | Cristian Calude,
Marius Zimand:
Effective Category and Measure in Abstract Complexity Theory.
Theor. Comput. Sci. 154(2): 307-327 (1996) |
| 1995 |
|---|
| 7 | | Cristian Calude,
Marius Zimand:
Effective Category and Measure in Abstract Complexity Theory (Extended Abstract).
FCT 1995: 156-170 |
| 6 | | Marius Zimand:
Weighted NP Optimization Problems: Logical Definability and Approximation Properties.
Structure in Complexity Theory Conference 1995: 12-28 |
| 5 | | Marius Zimand:
On the Topological Size of p-m-Complete Degrees.
Theor. Comput. Sci. 147(1&2): 137-147 (1995) |
| 1994 |
|---|
| 4 | | Ioan Tomescu,
Marius Zimand:
Minimum Spanning Hypertrees.
Discrete Applied Mathematics 54(1): 67-76 (1994) |
| 3 | | Marius Zimand:
On the Topological Size of p-m-Complete Degrees.
Sci. Ann. Cuza Univ. 3: 107-116 (1994) |
| 1993 |
|---|
| 2 | | Marius Zimand:
If not Empty, NP - P is Topologically Large.
Theor. Comput. Sci. 119(2): 293-310 (1993) |
| 1987 |
|---|
| 1 | | Marius Zimand:
On Relativizations with Restricted Number of Accesses to the Oracle Set.
Mathematical Systems Theory 20(1): 1-11 (1987) |
