| |
- CSB - MetaPress - Google - Bing - Yahoo
Ask others: ACM DL/Guide - - CSB - MetaPress - Google - Bing - Yahoo
| 12 |       | Mikael Goldmann, Johan Håstad: Monotone Circuits for Connectivity Have Depth (log n)2-o(1). SIAM J. Comput. 27(5): 1283-1294 (1998) |
| 9 | | Mikael Goldmann, Johan Håstad: Monotone circuits for connectivity have depth (log n)2-o(1) (Extended Abstract). STOC 1995: 569-574 |
| 7 |  | Mikael Goldmann, Per Grape, Johan Håstad: On Average Time Hierarchies. Inf. Process. Lett. 49(1): 15-20 (1994) |
| 5 | | Mikael Goldmann, Johan Håstad, Alexander A. Razborov: Majority Gates vs. General Weighted Threshold Gates. Structure in Complexity Theory Conference 1992: 2-13 |
| 4 | | Mikael Goldmann, Johan Håstad, Alexander A. Razborov: Majority Gates VS. General Weighted Threshold Gates. Computational Complexity 2: 277-300 (1992) |
| 3 | | Mikael Goldmann, Johan Håstad: A Simple Lower Bound for Monotone Clique Using a Communication Game. Inf. Process. Lett. 41(4): 221-226 (1992) |
| 2 | | Johan Håstad, Mikael Goldmann: On the Power of Small-Depth Threshold Circuits. Computational Complexity 1: 113-129 (1991) |
| 1 | | Johan Håstad, Mikael Goldmann: On the Power of Small-Depth Threshold Circuits FOCS 1990: 610-618 |
Selection of 8 from 18 records - Mikael Goldmann has 7 coauthors
Copyright © 2009-12-04 by Michael Ley (ley@uni-trier.de)