PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Karchmer, Mauricio"

Author of the publication

copydeleteadd this publication to your clipboard
Combinatorial characterization of read-once formulae.

, , , , and . Discrete Mathematics, 114 (1-3): 275-282 (1993)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Karchmer, Mauricio
add a person with the name Karchmer, Mauricio
 

Other publications of authors with the same name

On Ultrafilters and NP., , and . Computational Complexity Conference, page 97-105. IEEE Computer Society, (1994)Fractional Covers and Communication Complexity., , and . Computational Complexity Conference, page 262-274. IEEE Computer Society, (1992)A Fast Parallel Algorithm to Color a Graph with Delta Colors., and . J. Algorithms, 9 (1): 83-91 (1988)Fractional Covers and Communication Complexity., , and . SIAM J. Discrete Math., 8 (1): 76-92 (1995)Communication complexity - a new approach to circuit depth.. MIT Press, (1989)Super-Logarithmic Depth Lower Bounds Via the Direct Sum in Communication Complexity., , and . Computational Complexity, 5 (3/4): 191-204 (1995)Monotone Circuits for Connectivity Require Super-Logarithmic Depth., and . SIAM J. Discrete Math., 3 (2): 255-265 (1990)Linear Circuits over GF(2)., , and . SIAM J. Comput., 19 (6): 1064-1067 (1990)Characterizing non-deterministic circuit size., and . STOC, page 532-540. ACM, (1993)Two Time-Space Tradeoffs for Element Distinctness.. Theor. Comput. Sci., 47 (3): 237-246 (1986)