default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMauricio Karchmer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1995
[j9]Mauricio Karchmer, Ran Raz
, Avi Wigderson:
Super-Logarithmic Depth Lower Bounds Via the Direct Sum in Communication Complexity. Comput. Complex. 5(3/4): 191-204 (1995)- [j8]Mauricio Karchmer, Eyal Kushilevitz, Noam Nisan:
Fractional Covers and Communication Complexity. SIAM J. Discret. Math. 8(1): 76-92 (1995) - 1994
- [j7]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) - [c8]Shai Ben-David, Mauricio Karchmer, Eyal Kushilevitz:
On Ultrafilters and NP. SCT 1994: 97-105 - 1993
- [j6]Mauricio Karchmer, Nathan Linial, Ilan Newman, Michael E. Saks, Avi Wigderson:
Combinatorial characterization of read-once formulae. Discret. Math. 114(1-3): 275-282 (1993) - [c7]Mauricio Karchmer, Avi Wigderson:
On Span Programs. SCT 1993: 102-111 - [c6]Mauricio Karchmer:
On Proving Lower Bounds for Circuit Size. SCT 1993: 112-118 - [c5]Mauricio Karchmer, Avi Wigderson:
Characterizing non-deterministic circuit size. STOC 1993: 532-540 - 1992
- [c4]Mauricio Karchmer, Eyal Kushilevitz, Noam Nisan:
Fractional Covers and Communication Complexity. SCT 1992: 262-274 - [c3]Mauricio Karchmer, Ilan Newman, Michael E. Saks, Avi Wigderson:
Non-deterministic Communication Complexity with Few Witness. SCT 1992: 275-281 - 1991
- [c2]Mauricio Karchmer, Ran Raz, Avi Wigderson:
Super-logarithmic Depth Lower Bounds via Direct Sum in Communication Coplexity. SCT 1991: 299-304 - 1990
- [j5]Noga Alon, Mauricio Karchmer, Avi Wigderson:
Linear Circuits over GF(2). SIAM J. Comput. 19(6): 1064-1067 (1990) - [j4]Mauricio Karchmer, Avi Wigderson:
Monotone Circuits for Connectivity Require Super-Logarithmic Depth. SIAM J. Discret. Math. 3(2): 255-265 (1990)
1980 – 1989
- 1989
- [b2]Mauricio Karchmer:
Communication complexity - a new approach to circuit depth. MIT Press 1989, ISBN 978-0-262-11143-0, pp. 1-68 - [j3]Amotz Bar-Noy, Allan Borodin, Mauricio Karchmer, Nathan Linial, Michael Werman:
Bounds on Universal Sequences. SIAM J. Comput. 18(2): 268-277 (1989) - 1988
- [b1]Mauricio Karchmer:
The complexity of computation & restricted machines (מרכבות חשובים ומכונות מגבלות.). Hebrew University of Jerusalem, Israel, 1988 - [j2]Mauricio Karchmer, Joseph Naor:
A Fast Parallel Algorithm to Color a Graph with Delta Colors. J. Algorithms 9(1): 83-91 (1988) - [c1]Mauricio Karchmer, Avi Wigderson:
Monotone Circuits for Connectivity Require Super-logarithmic Depth. STOC 1988: 539-550 - 1986
- [j1]Mauricio Karchmer:
Two Time-Space Tradeoffs for Element Distinctness. Theor. Comput. Sci. 47(3): 237-246 (1986)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
