Two Time-Space Tradeoffs for Element Distinctness. - Mauricio Karchmer (Theor. Comput. Sci., 1986)

Monotone Circuits for Connectivity Require Super-logarithmic Depth - Mauricio Karchmer; Avi Wigderson (STOC, 1988)

A Fast Parallel Algorithm to Color a Graph with Delta Colors. - Mauricio Karchmer; Joseph Naor (J. Algorithms, 1988)

The complexity of computation & restricted machines (מרכבות חשובים ומכונות מגבלות.). - Mauricio Karchmer (1988)

Communication complexity - a new approach to circuit depth. - Mauricio Karchmer (MIT Press, 1989)

Bounds on Universal Sequences. - Amotz Bar-Noy; Allan Borodin; Mauricio Karchmer; Nathan Linial; Michael Werman (SIAM J. Comput., 1989)

Linear Circuits over GF(2). - Noga Alon; Mauricio Karchmer; Avi Wigderson (SIAM J. Comput., 1990)

Super-logarithmic Depth Lower Bounds via Direct Sum in Communication Coplexity. - Mauricio Karchmer; Ran Raz; Avi Wigderson (SCT, 1991)

Fractional Covers and Communication Complexity. - Mauricio Karchmer; Eyal Kushilevitz; Noam Nisan (SCT, 1992)

Non-deterministic Communication Complexity with Few Witness. - Mauricio Karchmer; Ilan Newman; Michael E. Saks; Avi Wigderson (SCT, 1992)

On Proving Lower Bounds for Circuit Size. - Mauricio Karchmer (SCT, 1993)

On Span Programs. - Mauricio Karchmer; Avi Wigderson (SCT, 1993)

Characterizing non-deterministic circuit size. - Mauricio Karchmer; Avi Wigderson (STOC, 1993)

Combinatorial characterization of read-once formulae. - Mauricio Karchmer; Nathan Linial; Ilan Newman; Michael E. Saks; Avi Wigderson (Discret. Math., 1993)

On Ultrafilters and NP. - Shai Ben-David; Mauricio Karchmer; Eyal Kushilevitz (SCT, 1994)

Non-Deterministic Communication Complexity with Few Witnesses. - Mauricio Karchmer; Ilan Newman; Michael E. Saks; Avi Wigderson (J. Comput. Syst. Sci., 1994)

Super-Logarithmic Depth Lower Bounds Via the Direct Sum in Communication Complexity. - Mauricio Karchmer; Ran Raz; Avi Wigderson (Comput. Complex., 1995)