Mikael Goldmann

According to our database, Mikael Goldmann authored at least 17 papers between 1990 and 2015.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2015

On the Performance of the Spotify Backend.

Rerngvit Yanggratoke, Gunnar Kreitz, Mikael Goldmann, Rolf Stadler, Viktoria Fodor

J. Netw. Syst. Manag., 2015

2012

Predicting response times for the Spotify backend.

Rerngvit Yanggratoke, Gunnar Kreitz, Mikael Goldmann, Rolf Stadler

Proceedings of the 8th International Conference on Network and Service Management, 2012

2011

Measurements on the spotify peer-assisted music-on-demand streaming system.

Mikael Goldmann, Gunnar Kreitz

Proceedings of the 2011 IEEE International Conference on Peer-to-Peer Computing, 2011

2001

Complexity Bounds on General Hard-Core Predicates.

Mikael Goldmann, Mats Näslund, Alexander Russell

J. Cryptol., 2001

2000

An ergodic theorem for read-once non-uniform deterministic finite automata.

Mikael Goldmann, Alexander Russell, Denis Thérien

Inf. Process. Lett., 2000

Spectral Bounds on General Hard Core Predicates.

Mikael Goldmann, Alexander Russell

Proceedings of the STACS 2000, 2000

1999

The Complexity of Solving Equations over Finite Groups.

Mikael Goldmann, Alexander Russell

Proceedings of the 14th Annual IEEE Conference on Computational Complexity, 1999

1998

Monotone Circuits for Connectivity Have Depth (log <i>n</i>)^{2-<i>o</i>(1)}.

Mikael Goldmann, Johan Håstad

SIAM J. Comput., 1998

1997

On the Power of a Threshold Gate at the Top.

Mikael Goldmann

Inf. Process. Lett., 1997

The Complexity of Computing Hard Core Predicates.

Mikael Goldmann, Mats Näslund

Proceedings of the Advances in Cryptology, 1997

1995

A Note on the Power of Majority Gates and Modular Gates.

Mikael Goldmann

Inf. Process. Lett., 1995

Monotone circuits for connectivity have depth (log n)^2-o(1) (Extended Abstract).

Mikael Goldmann, Johan Håstad

Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

1994

On Average Time Hierarchies.

Mikael Goldmann, Per Grape, Johan Håstad

Inf. Process. Lett., 1994

1993

Simulating threshold circuits by majority circuits.

Mikael Goldmann, Marek Karpinski

Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

1992

A Simple Lower Bound for Monotone Clique Using a Communication Game.

Mikael Goldmann, Johan Håstad

Inf. Process. Lett., 1992

Majority Gates vs. General Weighted Threshold Gates.

Mikael Goldmann, Johan Håstad, Alexander A. Razborov

Proceedings of the Seventh Annual Structure in Complexity Theory Conference, 1992

1990

On the Power of Small-Depth Threshold Circuits

Johan Håstad, Mikael Goldmann

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990