dblp.uni-trier.dewww.uni-trier.de

Mauricio Karchmer Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*1995
17 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)
16EEMauricio Karchmer, Eyal Kushilevitz, Noam Nisan: Fractional Covers and Communication Complexity. SIAM J. Discrete Math. 8(1): 76-92 (1995)
1994
15 Shai Ben-David, Mauricio Karchmer, Eyal Kushilevitz: On Ultrafilters and NP. Structure in Complexity Theory Conference 1994: 97-105
14 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
13EEMauricio Karchmer, Avi Wigderson: Characterizing non-deterministic circuit size. STOC 1993: 532-540
12 Mauricio Karchmer, Avi Wigderson: On Span Programs. Structure in Complexity Theory Conference 1993: 102-111
11 Mauricio Karchmer: On Proving Lower Bounds for Circuit Size. Structure in Complexity Theory Conference 1993: 112-118
10EEMauricio 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
9 Mauricio Karchmer, Eyal Kushilevitz, Noam Nisan: Fractional Covers and Communication Complexity. Structure in Complexity Theory Conference 1992: 262-274
8 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
7 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
6 Noga Alon, Mauricio Karchmer, Avi Wigderson: Linear Circuits over GF(2). SIAM J. Comput. 19(6): 1064-1067 (1990)
5 Mauricio Karchmer, Avi Wigderson: Monotone Circuits for Connectivity Require Super-Logarithmic Depth. SIAM J. Discrete Math. 3(2): 255-265 (1990)
1989
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

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

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)