Mikael Goldmann

Publication Activity (10 Years)

Years Active: 1990-2015
Publications (10 Years): 0

Top Topics

Network Latency

Publish Subscribe

Version Control

Top Venues

J. Netw. Syst. Manag.

Publications

Rerngvit Yanggratoke, Gunnar Kreitz, Mikael Goldmann, Rolf Stadler, Viktoria Fodor
On the Performance of the Spotify Backend. J. Netw. Syst. Manag. 23 (1) (2015)
Rerngvit Yanggratoke, Gunnar Kreitz, Mikael Goldmann, Rolf Stadler
Predicting response times for the Spotify backend. CNSM (2012)
Mikael Goldmann, Gunnar Kreitz
Measurements on the spotify peer-assisted music-on-demand streaming system. Peer-to-Peer Computing (2011)
Mikael Goldmann, Alexander Russell
The Complexity of Solving Equations over Finite Groups. Inf. Comput. 178 (1) (2002)
Mikael Goldmann, Mats Näslund, Alexander Russell
Complexity Bounds on General Hard-Core Predicates. J. Cryptol. 14 (3) (2001)
Mikael Goldmann, Alexander Russell, Denis Thérien
An ergodic theorem for read-once non-uniform deterministic finite automata. Inf. Process. Lett. 73 (1-2) (2000)
Mikael Goldmann, Alexander Russell
Spectral Bounds on General Hard Core Predicates. STACS (2000)
Mikael Goldmann, Alexander Russell
The Complexity of Solving Equations over Finite Groups. Computational Complexity Conference (1999)
Mikael Goldmann, Marek Karpinski
Simulating Threshold Circuits by Majority Circuits. SIAM J. Comput. 27 (1) (1998)
Mikael Goldmann, Johan Håstad
. SIAM J. Comput. 27 (5) (1998)
Mikael Goldmann, Mats Näslund
The Complexity of Computing Hard Core Predicates. CRYPTO (1997)
Mikael Goldmann
On the Power of a Threshold Gate at the Top. Inf. Process. Lett. 63 (6) (1997)
Mikael Goldmann
A Note on the Power of Majority Gates and Modular Gates. Inf. Process. Lett. 53 (6) (1995)
Mikael Goldmann, Johan Håstad
(Extended Abstract). STOC (1995)
Mikael Goldmann, Per Grape, Johan Håstad
On Average Time Hierarchies. Inf. Process. Lett. 49 (1) (1994)
Mikael Goldmann, Marek Karpinski
Simulating threshold circuits by majority circuits. STOC (1993)
Mikael Goldmann, Johan Håstad
A Simple Lower Bound for Monotone Clique Using a Communication Game. Inf. Process. Lett. 41 (4) (1992)
Mikael Goldmann, Johan Håstad, Alexander A. Razborov
Majority Gates VS. General Weighted Threshold Gates. Comput. Complex. 2 (1992)
Mikael Goldmann, Johan Håstad, Alexander A. Razborov
Majority Gates vs. General Weighted Threshold Gates. Computational Complexity Conference (1992)
Johan Håstad, Mikael Goldmann
On the Power of Small-Depth Threshold Circuits. Comput. Complex. 1 (1991)
Johan Håstad, Mikael Goldmann
On the Power of Small-Depth Threshold Circuits FOCS (1990)