Mauricio Karchmer

	1995
18		Mauricio Karchmer, Ran Raz, Avi Wigderson: Super-Logarithmic Depth Lower Bounds Via the Direct Sum in Communication Complexity. Computational Complexity 5(3/4): 191-204 (1995)
17		Mauricio Karchmer, Eyal Kushilevitz, Noam Nisan: Fractional Covers and Communication Complexity. SIAM J. Discrete Math. 8(1): 76-92 (1995)
	1994
16		Shai Ben-David, Mauricio Karchmer, Eyal Kushilevitz: On Ultrafilters and NP. Structure in Complexity Theory Conference 1994: 97-105
15		Mauricio Karchmer, Ilan Newman, Michael E. Saks, Avi Wigderson: Non-Deterministic Communication Complexity with Few Witnesses. J. Comput. Syst. Sci. 49(2): 247-257 (1994)
	1993
14		Mauricio Karchmer, Avi Wigderson: Characterizing non-deterministic circuit size. STOC 1993: 532-540
13		Mauricio Karchmer, Avi Wigderson: On Span Programs. Structure in Complexity Theory Conference 1993: 102-111
12		Mauricio Karchmer: On Proving Lower Bounds for Circuit Size. Structure in Complexity Theory Conference 1993: 112-118
11		Mauricio Karchmer, Nathan Linial, Ilan Newman, Michael E. Saks, Avi Wigderson: Combinatorial characterization of read-once formulae. Discrete Mathematics 114(1-3): 275-282 (1993)
	1992
10		Mauricio Karchmer, Eyal Kushilevitz, Noam Nisan: Fractional Covers and Communication Complexity. Structure in Complexity Theory Conference 1992: 262-274
9		Mauricio Karchmer, Ilan Newman, Michael E. Saks, Avi Wigderson: Non-deterministic Communication Complexity with Few Witness. Structure in Complexity Theory Conference 1992: 275-281
	1991
8		Mauricio Karchmer, Ran Raz, Avi Wigderson: Super-logarithmic Depth Lower Bounds via Direct Sum in Communication Coplexity. Structure in Complexity Theory Conference 1991: 299-304
	1990
7		Noga Alon, Mauricio Karchmer, Avi Wigderson: Linear Circuits over GF(2). SIAM J. Comput. 19(6): 1064-1067 (1990)
6		Mauricio Karchmer, Avi Wigderson: Monotone Circuits for Connectivity Require Super-Logarithmic Depth. SIAM J. Discrete Math. 3(2): 255-265 (1990)
	1989
5		Mauricio Karchmer: Communication complexity - a new approach to circuit depth. MIT Press 1989: 1-68
4		Amotz Bar-Noy, Allan Borodin, Mauricio Karchmer, Nathan Linial, Michael Werman: Bounds on Universal Sequences. SIAM J. Comput. 18(2): 268-277 (1989)
	1988
3		Mauricio Karchmer, Avi Wigderson: Monotone Circuits for Connectivity Require Super-logarithmic Depth STOC 1988: 539-550
2		Mauricio Karchmer, Joseph Naor: A Fast Parallel Algorithm to Color a Graph with Delta Colors. J. Algorithms 9(1): 83-91 (1988)
	1986
1		Mauricio Karchmer: Two Time-Space Tradeoffs for Element Distinctness. Theor. Comput. Sci. 47(3): 237-246 (1986)

Coauthor Index

1	Noga Alon	[7]
2	Amotz Bar-Noy	[4]
3	Shai Ben-David	[16]
4	Allan Borodin	[4]
5	Eyal Kushilevitz	[10] [16] [17]
6	Nathan Linial (Nati Linial)	[4] [11]
7	Joseph Naor (Seffi Naor)	[2]
8	Ilan Newman	[9] [11] [15]
9	Noam Nisan	[10] [17]
10	Ran Raz	[8] [18]
11	Michael E. Saks (Michael Saks)	[9] [11] [15]
12	Michael Werman	[4]
13	Avi Wigderson	[3] [6] [7] [8] [9] [11] [13] [14] [15] [18]

Last update Fri Jun 1 15:44:53 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page