Search the dblp DataBase
Mauricio Karchmer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Shai Ben-David, Mauricio Karchmer, Eyal Kushilevitz
On Ultrafilters and NP. [Citation Graph (0, 0)][DBLP]
Structure in Complexity Theory Conference, 1994, pp:97-105 [Conf] - Mauricio Karchmer
On Proving Lower Bounds for Circuit Size. [Citation Graph (0, 0)][DBLP]
Structure in Complexity Theory Conference, 1993, pp:112-118 [Conf] - Mauricio Karchmer, Eyal Kushilevitz, Noam Nisan
Fractional Covers and Communication Complexity. [Citation Graph (0, 0)][DBLP]
Structure in Complexity Theory Conference, 1992, pp:262-274 [Conf] - Mauricio Karchmer, Ilan Newman, Michael E. Saks, Avi Wigderson
Non-deterministic Communication Complexity with Few Witness. [Citation Graph (0, 0)][DBLP]
Structure in Complexity Theory Conference, 1992, pp:275-281 [Conf] - Mauricio Karchmer, Ran Raz, Avi Wigderson
Super-logarithmic Depth Lower Bounds via Direct Sum in Communication Coplexity. [Citation Graph (0, 0)][DBLP]
Structure in Complexity Theory Conference, 1991, pp:299-304 [Conf] - Mauricio Karchmer, Avi Wigderson
On Span Programs. [Citation Graph (0, 0)][DBLP]
Structure in Complexity Theory Conference, 1993, pp:102-111 [Conf] - Mauricio Karchmer, Avi Wigderson
Monotone Circuits for Connectivity Require Super-logarithmic Depth [Citation Graph (0, 0)][DBLP]
STOC, 1988, pp:539-550 [Conf] - Mauricio Karchmer, Avi Wigderson
Characterizing non-deterministic circuit size. [Citation Graph (0, 0)][DBLP]
STOC, 1993, pp:532-540 [Conf] - Mauricio Karchmer, Ran Raz, Avi Wigderson
Super-Logarithmic Depth Lower Bounds Via the Direct Sum in Communication Complexity. [Citation Graph (0, 0)][DBLP]
Computational Complexity, 1995, v:5, n:3/4, pp:191-204 [Journal] - Mauricio Karchmer, Joseph Naor
A Fast Parallel Algorithm to Color a Graph with Delta Colors. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1988, v:9, n:1, pp:83-91 [Journal] - Mauricio Karchmer, Ilan Newman, Michael E. Saks, Avi Wigderson
Non-Deterministic Communication Complexity with Few Witnesses. [Citation Graph (0, 0)][DBLP]
J. Comput. Syst. Sci., 1994, v:49, n:2, pp:247-257 [Journal] - Noga Alon, Mauricio Karchmer, Avi Wigderson
Linear Circuits over GF(2). [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 1990, v:19, n:6, pp:1064-1067 [Journal] - Amotz Bar-Noy, Allan Borodin, Mauricio Karchmer, Nathan Linial, Michael Werman
Bounds on Universal Sequences. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 1989, v:18, n:2, pp:268-277 [Journal] - Mauricio Karchmer, Eyal Kushilevitz, Noam Nisan
Fractional Covers and Communication Complexity. [Citation Graph (0, 0)][DBLP]
SIAM J. Discrete Math., 1995, v:8, n:1, pp:76-92 [Journal] - Mauricio Karchmer, Avi Wigderson
Monotone Circuits for Connectivity Require Super-Logarithmic Depth. [Citation Graph (0, 0)][DBLP]
SIAM J. Discrete Math., 1990, v:3, n:2, pp:255-265 [Journal] - Mauricio Karchmer
Two Time-Space Tradeoffs for Element Distinctness. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1986, v:47, n:3, pp:237-246 [Journal] - Mauricio Karchmer, Nathan Linial, Ilan Newman, Michael E. Saks, Avi Wigderson
Combinatorial characterization of read-once formulae. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1993, v:114, n:1-3, pp:275-282 [Journal]
Search in 0.002secs, Finished in 0.002secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002