Harald Prokop - Wikipedia

This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these template messages)

The topic of this article may not meet Wikipedia's notability guideline for academics. Please help to demonstrate the notability of the topic by citing reliable secondary sources that are independent of the topic and provide significant coverage of it beyond a mere trivial mention. If notability cannot be shown, the article is likely to be merged, redirected, or deleted.
Find sources: "Harald Prokop" – news · newspapers · books · scholar · JSTOR (October 2023) (Learn how and when to remove this message)

This article needs to be updated. The reason given is: According to LinkedIn, Mr. Prokop has left Akamai many years ago.. Please help update this article to reflect recent events or newly available information. (October 2023)

This biography of a living person needs additional citations for verification. Please help by adding reliable sources. Contentious material about living persons that is unsourced or poorly sourced must be removed immediately from the article and its talk page, especially if potentially libelous.
Find sources: "Harald Prokop" – news · newspapers · books · scholar · JSTOR (October 2023) (Learn how and when to remove this message)

(Learn how and when to remove this message)

Harald Prokop is the Chief Technical Officer of SCVNGR, parent company of LevelUp, as of April 2012.

Harald Prokop
Alma mater	Massachusetts Institute of Technology
Scientific career
Academic advisors	Charles E. Leiserson

He worked at Akamai Technologies from 1999 to 2012, where he was Senior Vice President of Engineering^[1] and is also known for having elucidated the concept of the cache-oblivious algorithm.

References edit

^ "Harald Prokop". Retrieved December 8, 2010.

P ≟ NP

This biographical article relating to a computer scientist is a stub. You can help Wikipedia by expanding it.

This business-related biographical article is a stub. You can help Wikipedia by expanding it.