dblp.uni-trier.dewww.uni-trier.de

Mikael Goldmann

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2002
18EEMikael Goldmann, Alexander Russell: The Complexity of Solving Equations over Finite Groups. Inf. Comput. 178(1): 253-262 (2002)
2001
17EEMikael Goldmann, Mats Näslund, Alexander Russell: Complexity Bounds on General Hard-Core Predicates. J. Cryptology 14(3): 177-195 (2001)
2000
16EEMikael Goldmann, Alexander Russell: Spectral Bounds on General Hard Core Predicates. STACS 2000: 614-625
15EEMikael Goldmann, Alexander Russell, Denis Thérien: An ergodic theorem for read-once non-uniform deterministic finite automata. Inf. Process. Lett. 73(1-2): 23-28 (2000)
1999
14EEMikael Goldmann, Alexander Russell: The Complexity of Solving Equations over Finite Groups. IEEE Conference on Computational Complexity 1999: 80-86
1998
13 Mikael Goldmann, Marek Karpinski: Simulating Threshold Circuits by Majority Circuits. SIAM J. Comput. 27(1): 230-246 (1998)
12EEMikael Goldmann, Johan Håstad: Monotone Circuits for Connectivity Have Depth (log n)2-o(1). SIAM J. Comput. 27(5): 1283-1294 (1998)
1997
11EEMikael Goldmann, Mats Näslund: The Complexity of Computing Hard Core Predicates. CRYPTO 1997: 1-15
10EEMikael Goldmann: On the Power of a Threshold Gate at the Top. Inf. Process. Lett. 63(6): 287-293 (1997)
1995
9EEMikael Goldmann, Johan Håstad: Monotone circuits for connectivity have depth (log n)2-o(1) (Extended Abstract). STOC 1995: 569-574
8EEMikael Goldmann: A Note on the Power of Majority Gates and Modular Gates. Inf. Process. Lett. 53(6): 321-327 (1995)
1994
7 Mikael Goldmann, Per Grape, Johan Håstad: On Average Time Hierarchies. Inf. Process. Lett. 49(1): 15-20 (1994)
1993
6EEMikael Goldmann, Marek Karpinski: Simulating threshold circuits by majority circuits. STOC 1993: 551-560
1992
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)
1991
2 Johan Håstad, Mikael Goldmann: On the Power of Small-Depth Threshold Circuits. Computational Complexity 1: 113-129 (1991)
1990
1 Johan Håstad, Mikael Goldmann: On the Power of Small-Depth Threshold Circuits FOCS 1990: 610-618

Coauthor Index

1Per Grape [7]
2Johan Håstad [1] [2] [3] [4] [5] [7] [9] [12]
3Marek Karpinski [6] [13]
4Mats Näslund [11] [17]
5Alexander A. Razborov [4] [5]
6Alexander Russell [14] [15] [16] [17] [18]
7Denis Thérien [15]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)