Search the dblp DataBase
Mikael Goldmann: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Mikael Goldmann, Johan Håstad, Alexander A. Razborov
Majority Gates vs. General Weighted Threshold Gates. [Citation Graph (0, 0)][DBLP]
Structure in Complexity Theory Conference, 1992, pp:2-13 [Conf] - Mikael Goldmann, Alexander Russell
The Complexity of Solving Equations over Finite Groups. [Citation Graph (0, 0)][DBLP]
IEEE Conference on Computational Complexity, 1999, pp:80-86 [Conf] - Mikael Goldmann, Mats Näslund
The Complexity of Computing Hard Core Predicates. [Citation Graph (0, 0)][DBLP]
CRYPTO, 1997, pp:1-15 [Conf] - Johan Håstad, Mikael Goldmann
On the Power of Small-Depth Threshold Circuits [Citation Graph (0, 0)][DBLP]
FOCS, 1990, pp:610-618 [Conf] - Mikael Goldmann, Alexander Russell
Spectral Bounds on General Hard Core Predicates. [Citation Graph (0, 0)][DBLP]
STACS, 2000, pp:614-625 [Conf] - Mikael Goldmann, Johan Håstad
Monotone circuits for connectivity have depth (log n)2-o(1) (Extended Abstract). [Citation Graph (0, 0)][DBLP]
STOC, 1995, pp:569-574 [Conf] - Mikael Goldmann, Marek Karpinski
Simulating threshold circuits by majority circuits. [Citation Graph (0, 0)][DBLP]
STOC, 1993, pp:551-560 [Conf] - Mikael Goldmann, Johan Håstad, Alexander A. Razborov
Majority Gates VS. General Weighted Threshold Gates. [Citation Graph (0, 0)][DBLP]
Computational Complexity, 1992, v:2, n:, pp:277-300 [Journal] - Johan Håstad, Mikael Goldmann
On the Power of Small-Depth Threshold Circuits. [Citation Graph (0, 0)][DBLP]
Computational Complexity, 1991, v:1, n:, pp:113-129 [Journal] - Mikael Goldmann, Alexander Russell
The Complexity of Solving Equations over Finite Groups. [Citation Graph (0, 0)][DBLP]
Inf. Comput., 2002, v:178, n:1, pp:253-262 [Journal] - Mikael Goldmann
A Note on the Power of Majority Gates and Modular Gates. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1995, v:53, n:6, pp:321-327 [Journal] - Mikael Goldmann
On the Power of a Threshold Gate at the Top. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1997, v:63, n:6, pp:287-293 [Journal] - Mikael Goldmann, Per Grape, Johan Håstad
On Average Time Hierarchies. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1994, v:49, n:1, pp:15-20 [Journal] - Mikael Goldmann, Johan Håstad
A Simple Lower Bound for Monotone Clique Using a Communication Game. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1992, v:41, n:4, pp:221-226 [Journal] - Mikael Goldmann, Alexander Russell, Denis Thérien
An ergodic theorem for read-once non-uniform deterministic finite automata. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 2000, v:73, n:1-2, pp:23-28 [Journal] - Mikael Goldmann, Mats Näslund, Alexander Russell
Complexity Bounds on General Hard-Core Predicates. [Citation Graph (0, 0)][DBLP]
J. Cryptology, 2001, v:14, n:3, pp:177-195 [Journal] - Mikael Goldmann, Johan Håstad
Monotone Circuits for Connectivity Have Depth (log n)2-o(1). [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 1998, v:27, n:5, pp:1283-1294 [Journal] - Mikael Goldmann, Marek Karpinski
Simulating Threshold Circuits by Majority Circuits. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 1998, v:27, n:1, pp:230-246 [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