Mauricio Karchmer

zbMath Openkarchmer.mauricioMaRDI QIDQ1095659

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Characterizing non-deterministic circuit size	2015-05-07	Paper
Super-logarithmic depth lower bounds via the direct sum in communication complexity	1996-11-10	Paper
scientific article; zbMATH DE number 806749 (Why is no real title available?)	1996-03-18	Paper
Fractional Covers and Communication Complexity	1995-07-10	Paper
Non-deterministic communication complexity with few witnesses	1994-11-06	Paper
Combinatorial characterization of read-once formulae	1993-10-24	Paper
Monotone Circuits for Connectivity Require Super-Logarithmic Depth	1990-01-01	Paper
Linear Circuits over $\operatorname{GF}(2)$	1990-01-01	Paper
Bounds on Universal Sequences	1989-01-01	Paper
A fast parallel algorithm to color a graph with Δ colors	1988-01-01	Paper
Two time-space tradeoffs for element distinctness	1986-01-01	Paper

Research outcomes over time

This page was built for person: Mauricio Karchmer