Mikael Goldmann

21 papers A* 4A 2B 1Journal 12Unranked 2
YearRankTypeTitle / Venue / Authors
2015 J jnl
On the Performance of the Spotify Backend.
J. Netw. Syst. Manag.
Rerngvit Yanggratoke, Gunnar Kreitz, Mikael Goldmann, Rolf Stadler, Viktoria Fodor
2012 B conf
Predicting response times for the Spotify backend.
CNSM
Rerngvit Yanggratoke, Gunnar Kreitz, Mikael Goldmann, Rolf Stadler
2011 — conf
Measurements on the spotify peer-assisted music-on-demand streaming system.
Peer-to-Peer Computing
Mikael Goldmann, Gunnar Kreitz
2002 J jnl
The Complexity of Solving Equations over Finite Groups.
Inf. Comput.
Mikael Goldmann, Alexander Russell
2001 J jnl
Complexity Bounds on General Hard-Core Predicates.
J. Cryptol.
Mikael Goldmann, Mats Näslund, Alexander Russell
2000 J jnl
An ergodic theorem for read-once non-uniform deterministic finite automata.
Inf. Process. Lett.
Mikael Goldmann, Alexander Russell, Denis Thérien
2000 A conf
Spectral Bounds on General Hard Core Predicates.
STACS
Mikael Goldmann, Alexander Russell
1999 A conf
The Complexity of Solving Equations over Finite Groups.
CCC
Mikael Goldmann, Alexander Russell
1998 J jnl
Monotone Circuits for Connectivity Have Depth (log
SIAM J. Comput.
Mikael Goldmann, Johan Håstad
1998 J jnl
Simulating Threshold Circuits by Majority Circuits.
SIAM J. Comput.
Mikael Goldmann, Marek Karpinski
1997 J jnl
On the Power of a Threshold Gate at the Top.
Inf. Process. Lett.
Mikael Goldmann
1997 A* conf
The Complexity of Computing Hard Core Predicates.
CRYPTO
Mikael Goldmann, Mats Näslund
1995 J jnl
A Note on the Power of Majority Gates and Modular Gates.
Inf. Process. Lett.
Mikael Goldmann
1995 A* conf
Monotone circuits for connectivity have depth (log n)
STOC
Mikael Goldmann, Johan Håstad
1994 J jnl
On Average Time Hierarchies.
Inf. Process. Lett.
Mikael Goldmann, Per Grape, Johan Håstad
1993 A* conf
Simulating threshold circuits by majority circuits.
STOC
Mikael Goldmann, Marek Karpinski
1992 J jnl
A Simple Lower Bound for Monotone Clique Using a Communication Game.
Inf. Process. Lett.
Mikael Goldmann, Johan Håstad
1992 J jnl
Majority Gates VS. General Weighted Threshold Gates.
Comput. Complex.
Mikael Goldmann, Johan Håstad, Alexander A. Razborov
1992 — conf
Majority Gates vs. General Weighted Threshold Gates.
SCT
Mikael Goldmann, Johan Håstad, Alexander A. Razborov
1991 J jnl
On the Power of Small-Depth Threshold Circuits.
Comput. Complex.
Johan Håstad, Mikael Goldmann
1990 A* conf
On the Power of Small-Depth Threshold Circuits
FOCS
Johan Håstad, Mikael Goldmann