- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| c9 |      | Rerngvit Yanggratoke, Gunnar Kreitz, Mikael Goldmann, Rolf Stadler: Predicting response times for the Spotify backend. CNSM 2012: 117-125 |
| 2011 | ||
| c8 | | Mikael Goldmann, Gunnar Kreitz: Measurements on the spotify peer-assisted music-on-demand streaming system. Peer-to-Peer Computing 2011: 206-211 |
| 2002 | ||
| j11 | | Mikael Goldmann, Alexander Russell: The Complexity of Solving Equations over Finite Groups. Inf. Comput. 178(1): 253-262 (2002) |
| 2001 | ||
| j10 | | Mikael Goldmann, Mats Näslund, Alexander Russell: Complexity Bounds on General Hard-Core Predicates. J. Cryptology 14(3): 177-195 (2001) |
| 2000 | ||
| j9 | | Mikael 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) |
| c7 | | Mikael Goldmann, Alexander Russell: Spectral Bounds on General Hard Core Predicates. STACS 2000: 614-625 |
| 1999 | ||
| c6 | | Mikael Goldmann, Alexander Russell: The Complexity of Solving Equations over Finite Groups. IEEE Conference on Computational Complexity 1999: 80-86 |
| 1998 | ||
| j8 | | Mikael Goldmann, Marek Karpinski: Simulating Threshold Circuits by Majority Circuits. SIAM J. Comput. 27(1): 230-246 (1998) |
| j7 | | Mikael Goldmann, Johan Håstad: Monotone Circuits for Connectivity Have Depth (log n)2-o(1). SIAM J. Comput. 27(5): 1283-1294 (1998) |
| 1997 | ||
| j6 | | Mikael Goldmann: On the Power of a Threshold Gate at the Top. Inf. Process. Lett. 63(6): 287-293 (1997) |
| c5 | | |
| 1995 | ||
| j5 | | Mikael Goldmann: A Note on the Power of Majority Gates and Modular Gates. Inf. Process. Lett. 53(6): 321-327 (1995) |
| c4 | | Mikael Goldmann, Johan Håstad: Monotone circuits for connectivity have depth (log n)2-o(1) (Extended Abstract). STOC 1995: 569-574 |
| 1994 | ||
| j4 | | Mikael Goldmann, Per Grape, Johan Håstad: On Average Time Hierarchies. Inf. Process. Lett. 49(1): 15-20 (1994) |
| 1993 | ||
| c3 | | Mikael Goldmann, Marek Karpinski: Simulating threshold circuits by majority circuits. STOC 1993: 551-560 |
| 1992 | ||
| j3 | | Mikael Goldmann, Johan Håstad, Alexander A. Razborov: Majority Gates VS. General Weighted Threshold Gates. Computational Complexity 2: 277-300 (1992) |
| j2 | | Mikael Goldmann, Johan Håstad: A Simple Lower Bound for Monotone Clique Using a Communication Game. Inf. Process. Lett. 41(4): 221-226 (1992) |
| c2 | | Mikael Goldmann, Johan Håstad, Alexander A. Razborov: Majority Gates vs. General Weighted Threshold Gates. Structure in Complexity Theory Conference 1992: 2-13 |
| 1991 | ||
| j1 | | Johan Håstad, Mikael Goldmann: On the Power of Small-Depth Threshold Circuits. Computational Complexity 1: 113-129 (1991) |
| 1990 | ||
| c1 | | |
| 1 | Per Grape | |
| 2 | Johan Håstad | |
| 3 | Marek Karpinski | |
| 4 | Gunnar Kreitz | |
| 5 | Mats Näslund | |
| 6 | Alexander A. Razborov | |
| 7 | Alexander Russell | |
| 8 | Rolf Stadler | |
| 9 | Denis Thérien | |
| 10 | Rerngvit Yanggratoke |
Colors in the list of coauthors
Last update Mon May 20 19:04:27 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page