Mikael Goldmann

875 total citations
19 papers, 463 citations indexed

About

Mikael Goldmann is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Mikael Goldmann has authored 19 papers receiving a total of 463 indexed citations (citations by other indexed papers that have themselves been cited), including 16 papers in Computational Theory and Mathematics, 12 papers in Artificial Intelligence and 5 papers in Computer Networks and Communications. Recurrent topics in Mikael Goldmann's work include Complexity and Algorithms in Graphs (13 papers), semigroups and automata theory (6 papers) and Machine Learning and Algorithms (5 papers). Mikael Goldmann is often cited by papers focused on Complexity and Algorithms in Graphs (13 papers), semigroups and automata theory (6 papers) and Machine Learning and Algorithms (5 papers). Mikael Goldmann collaborates with scholars based in Sweden, United States and Russia. Mikael Goldmann's co-authors include Alexander Razborov, Johan Håstad, Marek Karpiński, Gunnar Kreitz, Alexander Russell, Rolf Stadler, Viktória Fodor, Mats Näslund and Denis Thérien and has published in prestigious journals such as SIAM Journal on Computing, Information and Computation and Journal of Cryptology.

In The Last Decade

Mikael Goldmann

19 papers receiving 398 citations

Peers

Mikael Goldmann

AI

CTM

EEE

CNC

CVPR

V. Arvind India

Leslie M. Goldschlager Australia

Andrej Bogdanov Hong Kong

Mauricio Karchmer Israel

Stathis Zachos Greece

Heribert Vollmer Germany

Steven Homer United States

Michal Parnas Israel

Emanuele Viola United States

Carles Padró Spain

V. Arvind India

Mikael Goldmann

236 ×0.8

AI

305 ×1.0

CTM

35 ×0.4

EEE

48 ×0.6

CNC

27 ×0.7

CVPR

Citations per year, relative to Mikael Goldmann Mikael Goldmann (= 1×) peers V. Arvind

Countries citing papers authored by Mikael Goldmann

Since Specialization

Citations

This map shows the geographic impact of Mikael Goldmann's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Mikael Goldmann with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Mikael Goldmann more than expected).

Fields of papers citing papers by Mikael Goldmann

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Mikael Goldmann. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Mikael Goldmann. The network helps show where Mikael Goldmann may publish in the future.

Co-authorship network of co-authors of Mikael Goldmann

This figure shows the co-authorship network connecting the top 25 collaborators of Mikael Goldmann. A scholar is included among the top collaborators of Mikael Goldmann based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Mikael Goldmann. Mikael Goldmann is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

19 of 19 papers shown

1.

Kreitz, Gunnar, et al.. (2013). On the Performance of the Spotify Backend. Journal of Network and Systems Management. 23(1). 210–237. 4 indexed citations

2.

Kreitz, Gunnar, et al.. (2012). Predicting response times for the Spotify backend. 117–125. 6 indexed citations

3.

Goldmann, Mikael & Gunnar Kreitz. (2011). Measurements on the spotify peer-assisted music-on-demand streaming system. 22 indexed citations

4.

Goldmann, Mikael & Alexander Russell. (2003). The complexity of solving equations over finite groups. 80–86. 11 indexed citations

5.

Goldmann, Mikael & Alexander Russell. (2002). The Complexity of Solving Equations over Finite Groups. Information and Computation. 178(1). 253–262. 1 indexed citations

6.

Goldmann, Mikael. (2002). The Complexity of Solving Equations over Finite Groups. Information and Computation. 178(1). 253–262. 35 indexed citations

7.

Håstad, Johan & Mikael Goldmann. (2002). On the power of small-depth threshold circuits. 610–618. 18 indexed citations

8.

Goldmann, Mikael, Mats Näslund, & Alexander Russell. (2001). Complexity Bounds on General Hard-Core Predicates. Journal of Cryptology. 14(3). 177–195. 1 indexed citations

9.

Goldmann, Mikael, Alexander Russell, & Denis Thérien. (2000). An ergodic theorem for read-once non-uniform deterministic finite automata. Information Processing Letters. 73(1-2). 23–28. 1 indexed citations

10.

Goldmann, Mikael & Marek Karpiński. (1998). Simulating Threshold Circuits by Majority Circuits. SIAM Journal on Computing. 27(1). 230–246. 36 indexed citations

11.

Goldmann, Mikael & Johan Håstad. (1998). Monotone Circuits for Connectivity Have Depth (log n)^2-o(1). SIAM Journal on Computing. 27(5). 1283–1294. 7 indexed citations

12.

Goldmann, Mikael. (1997). On the power of a threshold gate at the top. Information Processing Letters. 63(6). 287–293. 10 indexed citations

13.

Goldmann, Mikael & Johan Håstad. (1995). Monotone circuits for connectivity have depth (log n)^2-o(1) (extended abstract). 569–574. 3 indexed citations

14.

Goldmann, Mikael. (1995). A note on the power of majority gates and modular gates. Information Processing Letters. 53(6). 321–327. 11 indexed citations

15.

Goldmann, Mikael, et al.. (1994). On average time hierarchies. Information Processing Letters. 49(1). 15–20. 3 indexed citations

16.

Goldmann, Mikael & Marek Karpiński. (1993). Simulating threshold circuits by majority circuits. 551–560. 17 indexed citations

17.

Goldmann, Mikael & Johan Håstad. (1992). A simple lower bound for monotone clique using a communication game. Information Processing Letters. 41(4). 221–226. 25 indexed citations

18.

Goldmann, Mikael, et al.. (1992). Majority gates vs. general weighted threshold gates. Computational Complexity. 2(4). 277–300. 116 indexed citations

19.

Goldmann, Mikael, et al.. (1991). On the power of small-depth threshold circuits. Computational Complexity. 1(2). 113–129. 136 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact