Marius Zimand

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

- CSB - MetaPress - Google - Bing - Yahoo

	2013
j24		Marius Zimand: Review of Deterministic Extraction from weak random sources by Ariel Gabizon. SIGACT News 44(1): 36-37 (2013)
c22		Marius Zimand: On Efficient Constructions of Short Lists Containing Mostly Ramsey Graphs. TAMC 2013: 205-211
i21		Bruno Bauwens, Anton Makhlin, Nikolay K. Vereshchagin, Marius Zimand: Short lists with short programs in short time. CoRR abs/1301.1547 (2013)
i20		Marius Zimand: Short lists with short programs in short time - a short proof. CoRR abs/1302.1109 (2013)
i19		N. V. Vinodchandran, Marius Zimand: On optimal language compression for sets in PSPACE/poly. CoRR abs/1304.1005 (2013)
i18		Bruno Bauwens, Anton Makhlin, Nikolay K. Vereshchagin, Marius Zimand: Short lists with short programs in short time. Electronic Colloquium on Computational Complexity (ECCC) 20: 7 (2013)
	2012
c21		Marius Zimand: Symmetry of Information: A Closer Look. Computation, Physics and Beyond 2012: 241-246
c20		Dan A. Simovici, Marius Zimand, Dan Pletea: Several Remarks on Index Generation Functions. ISMVL 2012: 179-184
i17		Marius Zimand: Nonuniform Kolmogorov extractors. CoRR abs/1204.6696 (2012)
i16		Marius Zimand: Symmetry of Information: A Closer Look. CoRR abs/1206.5184 (2012)
i15		Marius Zimand: On efficient constructions of short lists containing mostly Ramsey graphs. CoRR abs/1210.4408 (2012)
	2011
c19		Marius Zimand: Symmetry of Information and Bounds on Nonuniform Randomness Extraction via Kolmogorov Extractors. IEEE Conference on Computational Complexity 2011: 148-156
c18		Marius Zimand: On the Optimal Compression of Sets in PSPACE. FCT 2011: 65-77
i14		Marius Zimand: Symmetry of information and bounds on nonuniform randomness extraction via Kolmogorov extractors. CoRR abs/1103.5669 (2011)
i13		Marius Zimand: Possibilities and impossibilities in Kolmogorov complexity extraction. CoRR abs/1104.0872 (2011)
i12		Marius Zimand: On the optimal compression of sets in PSPACE. CoRR abs/1104.2816 (2011)
i11		Marius Zimand: On the optimal compression of sets in PSPACE. Electronic Colloquium on Computational Complexity (ECCC) 18: 69 (2011)
	2010
j23		Cristian S. Calude, Marius Zimand: Algorithmically independent sequences. Inf. Comput. 208(3): 292-308 (2010)
j22		Marius Zimand: Two Sources Are Better than One for Increasing the Kolmogorov Complexity of Infinite Sequences. Theory Comput. Syst. 46(4): 707-722 (2010)
j21		Marius Zimand: Simple extractors via constructions of cryptographic pseudo-random generators. Theor. Comput. Sci. 411(10): 1236-1250 (2010)
c17		Marius Zimand: Counting Dependent and Independent Strings. MFCS 2010: 689-700
c16		Marius Zimand: Impossibility of Independence Amplification in Kolmogorov Complexity Theory. MFCS 2010: 701-712
i10		Marius Zimand: Impossibility of independence amplification in Kolmogorov complexity theory. CoRR abs/1006.0701 (2010)
i9		Marius Zimand: Counting dependent and independent strings. CoRR abs/1006.1315 (2010)
	2009
c15		Marius Zimand: On Generating Independent Random Strings. CiE 2009: 499-508
c14		Marius Zimand: Extracting the Kolmogorov Complexity of Strings and Sequences from Sources with Limited Independence. STACS 2009: 697-708
i8		Marius Zimand: Extracting the Kolmogorov Complexity of Strings and Sequences from Sources with Limited Independence. CoRR abs/0902.2141 (2009)
i7		Marius Zimand: On generating independent random strings. CoRR abs/0903.3889 (2009)
	2008
j20		Marius Zimand: Exposure-Resilient Extractors and the Derandomization of Probabilistic Sublinear Time. Computational Complexity 17(2): 220-253 (2008)
c13		Marius Zimand: Two Sources Are Better Than One for Increasing the Kolmogorov Complexity of Infinite Sequences. CSR 2008: 326-338
c12		Cristian S. Calude, Marius Zimand: Algorithmically Independent Sequences. Developments in Language Theory 2008: 183-195
i6		Cristian S. Calude, Marius Zimand: Algorithmically independent sequences. CoRR abs/0802.0487 (2008)
	2007
j19		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)
j18		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)
c11		Marius Zimand: On Derandomizing Probabilistic Sublinear-Time Algorithms. IEEE Conference on Computational Complexity 2007: 1-9
i5		Marius Zimand: Two sources are better than one for increasing the Kolmogorov complexity of infinite sequences. CoRR abs/0705.4658 (2007)
	2006
j17		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)
c10		Marius Zimand: Exposure-Resilient Extractors. IEEE Conference on Computational Complexity 2006: 61-72
	2005
c9		Marius Zimand: Simple Extractors via Constructions of Cryptographic Pseudo-random Generators. ICALP 2005: 115-127
c8		Marius Zimand: A List-Decodable Code with Local Encoding and Decoding. SNPD 2005: 232-237
i4		Marius Zimand: Simple extractors via constructions of cryptographic pseudo-random generators. CoRR abs/cs/0501075 (2005)
i3		Marius Zimand: Simple extractors via constructions of cryptographic pseudo-random generators. Electronic Colloquium on Computational Complexity (ECCC)(071) (2005)
	2004
c7		Lane A. Hemaspaandra, Mitsunori Ogihara, Mohammed Javeed Zaki, Marius Zimand: The Complexity of Finding Top-Toda-Equivalence-Class Members. LATIN 2004: 90-99
	2003
c6		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
c5		Shiva Azadegan, M. Lavine, Michael O'Leary, Alexander L. Wijesinha, Marius Zimand: An undergraduate track in computer security. ITiCSE 2003: 207-210
	2002
j16		Edith Hemaspaandra, Lane A. Hemaspaandra, Marius Zimand: Almost-Everywhere Superiority for Quantum Polynomial Time. Inf. Comput. 175(2): 171-181 (2002)
c4		Marius Zimand: Probabilistically Checkable Proofs the Easy Way. IFIP TCS 2002: 337-351
	2001
i2		Marius Zimand: Probabilistically Checkable Proofs The Easy Way. Electronic Colloquium on Computational Complexity (ECCC) 8(27) (2001)
	2000
j15		Kundi Xue, Marius Zimand: Extractors for the Real World. J. UCS 6(1): 212-225 (2000)
	1999
j14		Marius Zimand: Relative to a Random Oracle, P/Poly is not Measurable in EXP. Inf. Process. Lett. 69(2): 83-86 (1999)
i1		Edith Hemaspaandra, Lane A. Hemaspaandra, Marius Zimand: Almost-Everywhere Superiority for Quantum Computing. CoRR quant-ph/9910033 (1999)
	1998
j13		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)
j12		Marius Zimand: Weighted NP Optimization Problems: Logical Definability and Approximation Properties. SIAM J. Comput. 28(1): 36-56 (1998)
j11		Marius Zimand: On the Size of Classes with Weak Membership Properties. Theor. Comput. Sci. 209(1-2): 225-235 (1998)
c3		Marius Zimand: Sharing Random Bits with No Process Coordination. IPPS/SPDP 1998: 455-459
	1997
j10		Marius Zimand: Large Sets in AC⁰ have Many Strings with Low Kolmogorov Complexity. Inf. Process. Lett. 62(3): 165-170 (1997)
	1996
j9		Marius Zimand: A High-Low Kolmogorov Complexity Law Equivalent to the 0-1 Law. Inf. Process. Lett. 57(2): 59-64 (1996)
j8		Lane A. Hemaspaandra, Marius Zimand: Strong Self-Reducibility Precludes Strong Immunity. Mathematical Systems Theory 29(5): 535-548 (1996)
j7		Cristian Calude, Marius Zimand: Effective Category and Measure in Abstract Complexity Theory. Theor. Comput. Sci. 154(2): 307-327 (1996)
	1995
j6		Lane A. Hemaspaandra, Ajit Ramachandran, Marius Zimand: Worlds to die for. SIGACT News 26(4): 5-15 (1995)
j5		Marius Zimand: On the Topological Size of p-m-Complete Degrees. Theor. Comput. Sci. 147(1&2): 137-147 (1995)
c2		Marius Zimand: Weighted NP Optimization Problems: Logical Definability and Approximation Properties. Structure in Complexity Theory Conference 1995: 12-28
c1		Cristian Calude, Marius Zimand: Effective Category and Measure in Abstract Complexity Theory (Extended Abstract). FCT 1995: 156-170
	1994
j4		Marius Zimand: On the Topological Size of p-m-Complete Degrees. Sci. Ann. Cuza Univ. 3: 107-116 (1994)
j3		Ioan Tomescu, Marius Zimand: Minimum Spanning Hypertrees. Discrete Applied Mathematics 54(1): 67-76 (1994)
	1993
j2		Marius Zimand: If not Empty, NP - P is Topologically Large. Theor. Comput. Sci. 119(2): 293-310 (1993)
	1987
j1		Marius Zimand: On Relativizations with Restricted Number of Accesses to the Oracle Set. Mathematical Systems Theory 20(1): 1-11 (1987)

Coauthor Index

1	Shiva Azadegan	[c6] [c5]
2	Bruno Bauwens	[i21] [i18]
3	Gruia Calinescu	[j19]
4	Cristian S. Calude (Cristian Calude)	[j23] [c12] [i6] [j18] [j7] [c1]
5	Edith Hemaspaandra (Edith Spaan)	[j16] [i1]
6	Lane A. Hemaspaandra (Lane A. Hemachandra)	[j17] [c7] [j16] [i1] [j13] [j8] [j6]
7	M. Lavine	[c6] [c5]
8	Anton Makhlin	[i21] [i18]
9	Ion I. Mandoiu	[j19]
10	Michael O'Leary	[c6] [c5]
11	Mitsunori Ogihara (Mitsunori Ogiwara)	[j17] [c7]
12	Dan Pletea	[c20]
13	Kulathur S. Rajasethupathy	[j13]
14	Ajit Ramachandran	[j6]
15	Prasanna Sethupathy	[j13]
16	Dan A. Simovici	[c20]
17	Gheorghe Stefanescu	[j18]
18	Ioan Tomescu	[j3]
19	Nikolai K. Vereshchagin (Nikolay K. Vereshchagin)	[i21] [i18]
20	N. V. Vinodchandran (N. Variyam Vinodchandran)	[i19]
21	Alexander L. Wijesinha	[c6] [c5]
22	Kundi Xue	[j15]
23	Mohammed Javeed Zaki (Mohammed J. Zaki)	[j17] [c7]
24	Alexander Zelikovsky (Alex Zelikovsky)	[j19]

Colors in the list of coauthors

Last update Tue May 21 15:00:43 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page