| Computer method and system for intermediated exchange of commodities RA Ferstenberg, M Karchmer, R Hilai US Patent 5,873,071, 1999 | 770 | 1999 |
| On span programs M Karchmer, A Wigderson [1993] Proceedings of the Eigth Annual Structure in Complexity Theory …, 1993 | 656 | 1993 |
| Monotone circuits for connectivity require super-logarithmic depth M Karchmer, A Wigderson Proceedings of the twentieth annual ACM symposium on Theory of computing …, 1988 | 541 | 1988 |
| Super-logarithmic depth lower bounds via the direct sum in communication complexity M Karchmer, R Raz, A Wigderson Computational Complexity 5, 191-204, 1995 | 202* | 1995 |
| Fractional covers and communication complexity M Karchmer, E Kushilevitz, N Nisan SIAM Journal on Discrete Mathematics 8 (1), 76-92, 1995 | 98 | 1995 |
| Combinatorial characterization of read-once formulae M Karchmer, N Linial, I Newman, M Saks, A Wigderson Discrete Mathematics 114 (1-3), 275-282, 1993 | 72 | 1993 |
| Communication complexity: A new approach to circuit depth M Karchmer | 57 | 1989 |
| Computer method and system for intermediated exchanges RA Ferstenberg, M Karchmer, R Hilai US Patent 6,968,318, 2005 | 54 | 2005 |
| On proving lower bounds for circuit size M Karchmer [1993] Proceedings of the Eigth Annual Structure in Complexity Theory …, 1993 | 47 | 1993 |
| Bounds on universal sequences A Bar-Noy, A Borodin, M Karchmer, N Linial, M Werman SIAM Journal on Computing 18 (2), 268-277, 1989 | 45 | 1989 |
| Two time-space tradeoffs for element distinctness M Karchmer Theoretical Computer Science 47, 237-246, 1986 | 41 | 1986 |
| Linear Circuits over GF(2) N Alon, M Karchmer, A Wigderson SIAM Journal on Computing 19 (6), 1064-1067, 1990 | 39 | 1990 |
| A fast parallel algorithm to color a graph with Δ colors M Karchmer, J Naor Journal of Algorithms 9 (1), 83-91, 1988 | 34 | 1988 |
| Non-deterministic communication complexity with few witnesses M Karchmer, I Newman, M Saks, A Wigderson Journal of Computer and System Sciences 49 (2), 247-257, 1994 | 30 | 1994 |
| On span programs. In [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference M Karchmer, A Wigderson IEEE Comput. Soc. Press 10, 1993 | 23 | 1993 |
| Characterizing non-deterministic circuit size M Karchmer, A Wigderson Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing …, 1993 | 19 | 1993 |
| Computer Method and System for Intermediated Exchanges R Ferstenberg, M Karchmer, R Hilai US Patent App. 11/929,004, 2008 | 4 | 2008 |
| On ultrafilters and NP S Ben-David, M Karchmer, E Kushilevitz Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory …, 1994 | 4 | 1994 |
| The Complexity of Computation & Restricted Machines M Karchmer Hebrew University of Jerusalem., 1988 | 2 | 1988 |
| Communication Coniplexity and Circuit Depth M Karchmer MIT Press, 1989 | 1 | 1989 |
Ran RazPrinceton University在 princeton.edu 的电子邮件经过验证
