Question: Who was known for being a convicted murder and entrepreneur, but also known for inventing what's known as the dancing tree in computer science?

Context articles: David Maier
Hans Reiser
Nivio Ziviani
Daniel A. Keim
Ellis Horowitz
AP Computer Science Principles
Venkatesan Guruswami
AP Computer Science A
Jason Cong
Dancing tree

David Maier (2 June 1953 - ) is the Maseeh Professor of Emerging Technologies in the Department of Computer Science at Portland State University.
 Born in Eugene, OR, he has also been a computer science faculty member at the State University of New York at Stony Brook (1978-82), Oregon Graduate Center (OGC, 1982-2001), University of Wisconsin (UW, 1997-8), Oregon Health & Science University (2001-present) and National University of Singapore (2012-5).
 He holds a B.A. in Mathematics and Computer Science from the University of Oregon (Honors College, 1974) and a Ph.D. in Electrical Engineering and Computer Science from Princeton University (1978).
Hans Thomas Reiser (born December 19, 1963) is an American convicted murderer, computer programmer, and entrepreneur.
 He is the creator of the ReiserFS computer file system, which is contained within the Linux kernel, as well as its attempted successor, Reiser4.
 In 2004, he founded Namesys, a corporation meant to coordinate the development of both file systems.
Nivio Ziviani (Belo Horizonte - Brazil, August 27, 1946) is a Professor Emeritus at the Department of Computer Science of the Federal University of Minas Gerais (UFMG).
 He has a Ph.D. in Computer Science from the University of Waterloo, Canada, 1982.
 Nivio Ziviani is well known for his research in computer science, mainly focused on Information Retrieval, Algorithms and Web Recommender Systems, as can be seen in his DBLP and Google Scholar.
 He is member of the Brazilian Academy of Sciences and the .
 In 2011 he received the Prize of Scientific Merit of the Brazilian Computer Science Society.
Daniel A. Keim is a German computer scientist and full professor (Chair of Information Processing) in the Computer Science department at the University of Konstanz, Germany.
 He received his Ph.D. in Computer Science from the University of Munich in 1994.
 He has been assistant professor in the Computer Science department at the University of Munich, and associate professor in the Computer Science department of the Martin Luther University of Halle-Wittenberg.
 Keim has also worked as a senior researcher at AT&T's Shannon Research Labs, Florham Park, NJ, USA.
Ellis Horowitz is an American computer scientist and Professor of Computer Science and Electrical Engineering at the University of Southern California (USC).
 Horowitz is best known for his computer science textbooks on data structures and algorithms, co-authored with Sartaj Sahni.
 At USC, Horowitz was chairman of the Computer Science Department from 1990 to 1999.
 During his tenure he significantly improved relations between Computer Science and the Information Sciences Institute(ISI), hiring senior faculty, and establishing the department's first industrial advisory board.
 From 1983 - 1993 with Lawrence Flon he co-founded Quality Software Products which designed and built UNIX application software.
 Their products included two spreadsheet programs, Q-calc and eXclaim, a project management system, MasterPlan, and a floating license server, Maitre D.
 The company was sold to Island Graphics.
Advanced Placement Computer Science Principles (also called AP CSP) is an AP Computer Science course and examination offered by the College Board to high school students as an opportunity to earn college credit for a college-level computer science course.
 AP Computer Science Principles is meant to be the equivalent of a first-semester course in computer science.
 Assessment for AP Computer Science Principles is divided into two parts, both an end of course exam as well as the creation of artifacts throughout the course.
Venkatesan Guruswami (born 1976) is a computer scientist at Carnegie Mellon University in Pittsburgh, United States.
 He did his schooling at Padma Seshadri Bala Bhavan in Chennai, India.
 He completed his undergraduate in Computer Science from IIT Madras and his doctorate from Massachusetts Institute of Technology under the supervision of Madhu Sudan in 2001 .
 After receiving his PhD, he spent a year at UC Berkeley as a Miller Fellow, and then was a member of the faculty at the University of Washington from 2002 to 2009.
 His primary area of research is computer science, and in particular on error-correcting codes.
 Following 2007, he was on leave from University of Washington.
 During 2007-2008, he visited the Institute for Advanced Study as a Member of School of Mathematics.
 He also visited SCS at Carnegie Mellon University during 2008-09 as a Visiting Faculty.
 In July 2009, he joined the School of Computer Science at Carnegie Mellon University as Associate Professor in the Computer Science Department.
Advanced Placement Computer Science A (also called AP Java or AP Comp Sci A) is an AP Computer Science course and examination offered by the College Board to high school students as an opportunity to earn college credit for a college-level computer science course.
 AP Computer Science A is meant to be the equivalent of a first-semester course in computer science.
 The AP exam currently tests students on their knowledge of Java.
Jingsheng Jason Cong (born 1963) is a computer scientist, educator, and serial entrepreneur.
 He was born in Beijing, China.
 He received his B.S. degree in computer science from Peking University in 1985, his M.S. and Ph. D. degrees in computer science from the University of Illinois at Urbana-Champaign in 1987 and 1990, respectively.
 He has been on the faculty in the Computer Science Department at the University of California, Los Angeles (UCLA) since 1990.
 Currently, he is a Chancellor’s Professor and the director of Center for Domain-Specific Computing (CDSC).
In computer science, a dancing tree is a tree data structure similar to B+ trees.
 It was invented by Hans Reiser, for use by the Reiser4 file system.
 As opposed to self-balancing binary search trees that attempt to keep their nodes balanced at all times, dancing trees only balance their nodes when flushing data to a disk (either because of memory constraints or because a transaction has completed).