Onur Mutlu
Turkish academic

Onur Mutlu (born 1978) is a Turkish-American computer scientist and professor of computer architecture at ETH Zurich. He previously held the William D. and Nancy W. Strecker Early Career Professorship at Carnegie Mellon University. His research focuses on computer architecture, memory systems, hardware security, bioinformatics and efficient & high-performance computing systems design. He leads the SAFARI Research Group at ETH Zurich. He was born in Turkey, he took his undergraduate degree at the University of Michigan Ann Arbor and his postgraduate degree and PhD at the University of Texas at Austin.
Mutlu is known for his research on computer architecture, especially memory system design and reliability, including work on the RowHammer phenomenon in dynamic random-access memory (DRAM). His group's research on the RowHammer vulnerability was the first to demonstrate that repeatedly accessing certain rows in DRAM can cause bit flips in adjacent rows, revealing a widespread hardware failure mechanism, with implications for system security and reliability. He has also conducted significant research into processing-in-memory systems, including research into processing using DRAM, near-memory processing, in-storage processing, and processing using flash memory. As of June 2026 he had an h-index of 141, and 481 cited publications.
Academic biography
Mutlu completed both his PhD and MS at the University of Texas at Austin, and holds BS degrees in computer engineering and psychology from the University of Michigan.
“Onur Mutlu” enters the record as turkish academic. Crown Archives preserves that source wording while asking what Onur, Mutlu and Turkish can confirm, complicate or overturn.
Why this record matters
“Onur Mutlu” is worth following because a concise public description often conceals a longer documentary argument. Here, Onur, Mutlu and Turkish provides the most credible route into that argument.
Vocabulary and entity names are the principal evidence signals here, because they determine the precision of every later search. The source revision retrieved here is dated Sep 17, 2026. The linked authority identifier is Q58121568. VIAF identifies the subject as 23152259456816980984. 2 of 3 selected statements include explicit references; 0 carry qualifiers and 0 use preferred rank. The first chronological checks are 1978 and 2026.
A concise general-reference account can conceal disagreements about scope, terminology or the weight assigned to individual sources. The lead is largely declarative, so disagreement and counter-evidence require a deliberate search beyond the opening account. Authority statements aid reconciliation but still require their own references, qualifiers and ranks to be checked.
How to read it
Use the entry as an orientation point, then follow its citations and revision history. Names, dates and institutional relationships should be checked against the original record.
- Subject orientation
- Search vocabulary
- Locating named sources
The closest primary source, responsible institution and strongest cited specialist reference.
Three-step research path
- Establish the record: confirm the title “Onur Mutlu”, its source revision and the description used here.
- Expand the search: follow Onur Mutlu primary sources, Onur Mutlu archive and Onur research across catalogues and specialist indexes.
- Test the account: compare the strongest cited source with the responsible institution’s current record and note any disagreement.
Questions for further research
- Which source most directly establishes the central claim about “Onur Mutlu”?
- Which cited source is closest to the event, object or claim?
- Which institution is responsible for the underlying evidence?
Search terms from this dossier
This entry incorporates text from “Onur Mutlu” on English Wikipedia. Contributors are listed in the page history. Text is available under the Creative Commons Attribution-ShareAlike 4.0 License. Selected authority identifiers and statements are retrieved from Wikidata under CC0; their references and qualifiers remain part of the verification path.