| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Marius Zimand |
Nonuniform Kolmogorov extractors  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Marius Zimand |
Symmetry of Information: A Closer Look. |
Computation, Physics and Beyond |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Marius Zimand |
On the optimal compression of sets in PSPACE. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Marius Zimand |
Possibilities and impossibilities in Kolmogorov complexity extraction |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Marius Zimand |
Symmetry of information and bounds on nonuniform randomness extraction via Kolmogorov extractors |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Marius Zimand |
On the optimal compression of sets in PSPACE |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Marius Zimand |
On the Optimal Compression of Sets in PSPACE. |
FCT |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Marius Zimand |
Symmetry of Information and Bounds on Nonuniform Randomness Extraction via Kolmogorov Extractors. |
IEEE Conference on Computational Complexity |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Marius Zimand |
Simple extractors via constructions of cryptographic pseudo-random generators. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristian S. Calude, Marius Zimand |
Algorithmically independent sequences. |
Inf. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Marius Zimand |
Impossibility of independence amplification in Kolmogorov complexity theory |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Marius Zimand |
Counting dependent and independent strings |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Marius Zimand |
Two Sources Are Better than One for Increasing the Kolmogorov Complexity of Infinite Sequences. |
Theory Comput. Syst. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Marius Zimand |
Impossibility of Independence Amplification in Kolmogorov Complexity Theory. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Marius Zimand |
Counting Dependent and Independent Strings. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Marius Zimand |
On generating independent random strings |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Marius Zimand |
Extracting the Kolmogorov Complexity of Strings and Sequences from Sources with Limited Independence |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Marius Zimand |
Extracting the Kolmogorov Complexity of Strings and Sequences from Sources with Limited Independence. |
STACS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Marius Zimand |
On Generating Independent Random Strings. |
CiE |
2009 |
DBLP DOI BibTeX RDF |
random strings, independent strings, Kolmogorov complexity, randomness extraction |
| 1 | Marius Zimand |
Exposure-Resilient Extractors and the Derandomization of Probabilistic Sublinear Time. |
Computational Complexity |
2008 |
DBLP DOI BibTeX RDF |
Subject classification, 68Q15 |
| 1 | Cristian S. Calude, Marius Zimand |
Algorithmically independent sequences |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Marius Zimand |
Two Sources Are Better Than One for Increasing the Kolmogorov Complexity of Infinite Sequences. |
CSR |
2008 |
DBLP DOI BibTeX RDF |
Hausdorff dimension, Kolmogorov complexity |
| 1 | Cristian S. Calude, Marius Zimand |
Algorithmically Independent Sequences. |
Developments in Language Theory |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2007 |
DBLP BibTeX RDF |
|
| 1 | Gruia Calinescu, Ion I. Mandoiu, Alexander Zelikovsky, Marius Zimand |
Selected Papers from the 1st ACIS International Workshop on Self-Assembling Wireless Networks. |
J. UCS |
2007 |
DBLP BibTeX RDF |
|
| 1 | Marius Zimand |
Two sources are better than one for increasing the Kolmogorov complexity of infinite sequences |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Marius Zimand |
On Derandomizing Probabilistic Sublinear-Time Algorithms. |
IEEE Conference on Computational Complexity |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Lane A. Hemaspaandra, Mitsunori Ogihara, Mohammed J. Zaki, Marius Zimand |
The Complexity of Finding Top-Toda-Equivalence-Class Members. |
Theory Comput. Syst. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Marius Zimand |
Exposure-Resilient Extractors. |
IEEE Conference on Computational Complexity |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Marius Zimand |
Simple extractors via constructions of cryptographic pseudo-random generators |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Marius Zimand |
Simple extractors via constructions of cryptographic pseudo-random generators |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | Marius Zimand |
Simple Extractors via Constructions of Cryptographic Pseudo-random Generators. |
ICALP |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Marius Zimand |
A List-Decodable Code with Local Encoding and Decoding. |
SNPD |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Lane A. Hemaspaandra, Mitsunori Ogihara, Mohammed Javeed Zaki, Marius Zimand |
The Complexity of Finding Top-Toda-Equivalence-Class Members. |
LATIN |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Shiva Azadegan, M. Lavine, Michael O'Leary, Alexander L. Wijesinha, Marius Zimand |
An undergraduate track in computer security. |
ITiCSE |
2003 |
DBLP DOI BibTeX RDF |
application software security, computer security case studies, undergraduate computer security education, security, cryptography, network, operating systems security |
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Marius Zimand |
Almost-Everywhere Superiority for Quantum Polynomial Time. |
Inf. Comput. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Marius Zimand |
Probabilistically Checkable Proofs the Easy Way. |
IFIP TCS |
2002 |
DBLP BibTeX RDF |
|
| 1 | Marius Zimand |
Probabilistically Checkable Proofs The Easy Way |
Electronic Colloquium on Computational Complexity (ECCC) |
2001 |
DBLP BibTeX RDF |
|
| 1 | Kundi Xue, Marius Zimand |
Extractors for the Real World. |
J. UCS |
2000 |
DBLP BibTeX RDF |
|
| 1 | Marius Zimand |
Relative to a Random Oracle, P/Poly is not Measurable in EXP. |
Inf. Process. Lett. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Marius Zimand |
Almost-Everywhere Superiority for Quantum Computing |
CoRR |
1999 |
DBLP BibTeX RDF |
|
| 1 | Marius Zimand |
On the Size of Classes with Weak Membership Properties. |
Theor. Comput. Sci. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Marius Zimand |
Weighted NP Optimization Problems: Logical Definability and Approximation Properties. |
SIAM J. Comput. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Marius Zimand |
Sharing Random Bits with No Process Coordination. (PDF / PS) |
IPPS/SPDP |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Marius Zimand |
Large Sets in AC0 have Many Strings with Low Kolmogorov Complexity. |
Inf. Process. Lett. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Marius Zimand |
A High-Low Kolmogorov Complexity Law Equivalent to the 0-1 Law. |
Inf. Process. Lett. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristian Calude, Marius Zimand |
Effective Category and Measure in Abstract Complexity Theory. |
Theor. Comput. Sci. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Lane A. Hemaspaandra, Marius Zimand |
Strong Self-Reducibility Precludes Strong Immunity. |
Mathematical Systems Theory |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Marius Zimand |
On the Topological Size of p-m-Complete Degrees. |
Theor. Comput. Sci. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Lane A. Hemaspaandra, Ajit Ramachandran, Marius Zimand |
Worlds to die for. |
SIGACT News |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristian Calude, Marius Zimand |
Effective Category and Measure in Abstract Complexity Theory (Extended Abstract). |
FCT |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Marius Zimand |
Weighted NP Optimization Problems: Logical Definability and Approximation Properties. |
Structure in Complexity Theory Conference |
1995 |
DBLP BibTeX RDF |
|
| 1 | Marius Zimand |
On the Topological Size of p-m-Complete Degrees. |
Sci. Ann. Cuza Univ. |
1994 |
DBLP BibTeX RDF |
|
| 1 | Ioan Tomescu, Marius Zimand |
Minimum Spanning Hypertrees. |
Discrete Applied Mathematics |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Marius Zimand |
If not Empty, NP - P is Topologically Large. |
Theor. Comput. Sci. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Marius Zimand |
On Relativizations with Restricted Number of Accesses to the Oracle Set. |
Mathematical Systems Theory |
1987 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")