Mauricio Karchmer

19 papers A* 2Journal 9Unranked 6
YearRankTypeTitle / Venue / Authors
1995 J jnl
Fractional Covers and Communication Complexity.
SIAM J. Discret. Math.
Mauricio Karchmer, Eyal Kushilevitz, Noam Nisan
1995 J jnl
Super-Logarithmic Depth Lower Bounds Via the Direct Sum in Communication Complexity.
Comput. Complex.
Mauricio Karchmer, Ran Raz, Avi Wigderson
1994 J jnl
Non-Deterministic Communication Complexity with Few Witnesses.
J. Comput. Syst. Sci.
Mauricio Karchmer, Ilan Newman, Michael E. Saks, Avi Wigderson
1994 — conf
On Ultrafilters and NP.
SCT
Shai Ben-David, Mauricio Karchmer, Eyal Kushilevitz
1993 A* conf
Characterizing non-deterministic circuit size.
STOC
Mauricio Karchmer, Avi Wigderson
1993 J jnl
Combinatorial characterization of read-once formulae.
Discret. Math.
Mauricio Karchmer, Nathan Linial, Ilan Newman, Michael E. Saks, Avi Wigderson
1993 — conf
On Proving Lower Bounds for Circuit Size.
SCT
Mauricio Karchmer
1993 — conf
On Span Programs.
SCT
Mauricio Karchmer, Avi Wigderson
1992 — conf
Fractional Covers and Communication Complexity.
SCT
Mauricio Karchmer, Eyal Kushilevitz, Noam Nisan
1992 — conf
Non-deterministic Communication Complexity with Few Witness.
SCT
Mauricio Karchmer, Ilan Newman, Michael E. Saks, Avi Wigderson
1991 — conf
Super-logarithmic Depth Lower Bounds via Direct Sum in Communication Coplexity.
SCT
Mauricio Karchmer, Ran Raz, Avi Wigderson
1990 J jnl
Linear Circuits over GF(2).
SIAM J. Comput.
Noga Alon, Mauricio Karchmer, Avi Wigderson
1990 J jnl
Monotone Circuits for Connectivity Require Super-Logarithmic Depth.
SIAM J. Discret. Math.
Mauricio Karchmer, Avi Wigderson
1989 J jnl
Bounds on Universal Sequences.
SIAM J. Comput.
Amotz Bar-Noy, Allan Borodin, Mauricio Karchmer, Nathan Linial, Michael Werman
1989 — book
Communication complexity - a new approach to circuit depth.
Mauricio Karchmer
1988 J jnl
A Fast Parallel Algorithm to Color a Graph with Delta Colors.
J. Algorithms
Mauricio Karchmer, Joseph Naor
1988 A* conf
Monotone Circuits for Connectivity Require Super-logarithmic Depth
STOC
Mauricio Karchmer, Avi Wigderson
1988 — —
The complexity of computation & restricted machines (מרכבות חשובים ומכונות מגבלות.).
Mauricio Karchmer
1986 J jnl
Two Time-Space Tradeoffs for Element Distinctness.
Theor. Comput. Sci.
Mauricio Karchmer