default search action
Mikael Goldmann
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
- [j12]Rerngvit Yanggratoke, Gunnar Kreitz, Mikael Goldmann, Rolf Stadler, Viktoria Fodor:
On the Performance of the Spotify Backend. J. Netw. Syst. Manag. 23(1): 210-237 (2015) - 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
2000 – 2009
- 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. Cryptol. 14(3): 177-195 (2001) - 2000
- [j9]Mikael Goldmann, Alexander Russell
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
1990 – 1999
- 1999
- [c6]Mikael Goldmann, Alexander Russell:
The Complexity of Solving Equations over Finite Groups. CCC 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]Mikael Goldmann, Mats Näslund:
The Complexity of Computing Hard Core Predicates. CRYPTO 1997: 1-15 - 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
Majority Gates VS. General Weighted Threshold Gates. Comput. Complex. 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. SCT 1992: 2-13 - 1991
- [j1]Johan Håstad
On the Power of Small-Depth Threshold Circuits. Comput. Complex. 1: 113-129 (1991) - 1990
- [c1]Johan Håstad, Mikael Goldmann:
On the Power of Small-Depth Threshold Circuits. FOCS 1990: 610-618
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: