Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Pioneer

Cecilia R. Aragon

Also Known As Cecilia Rodriguez Aragon · Cecilia Aragon · Cecilia Rodriguez · Cecilia Berta Rodriguez
Theory of Computation

Cecilia Rodriguez Aragon is an American computer scientist, professor, author and champion aerobatic pilot best known as co-inventor, with Raimund Seidel, of the treap data structure, a binary search tree that orders nodes by both priority and key. She is also known for her work in data-intensive science and visual analytics of very large data sets, for which she received the Presidential Early Career Award for Scientists and Engineers.

Facts
Birth Year
1960 1
Nationality
American 2
Award
Presidential Early Career Award for Scientists and Engineers 1
Contribution Kind
Algorithm 2
Connections

Credited

Source NIST Dictionary of Algorithms and Data Structures: treap

In Field

Source Wikipedia: Cecilia R. Aragon

Invented

Source NIST Dictionary of Algorithms and Data Structures: treap

Long-Form Articles

In the Other Atlases

Same As

Also in Sport and Games Atlas: the same subject.

Nationality

Also in Geography Atlas: the nationality of this subject.

Sources
1. Wikidata: Cecilia R. Aragon
  • Wikidata Q9931, class allow-list match (w-wdresolver-0926)
  • Wikidata Q9931 P569 (date of birth)
2. Wikipedia: Cecilia R. Aragon
Wikimedia Foundation
  • Lead section
    Cecilia Rodriguez Aragon is an American computer scientist, professor, author, and champion aerobatic pilot who is best known as the co-inventor (with Raimund Seidel) of the treap data structure, a type of binary search tree that orders nodes by adding a priority as well as a key to each node. She is also known for her work in data-intensive science and visual analytics of very large data sets, for which she received the prestigious Presidential Early Career Award for Scientists and Engineers (PECASE).
  • Lead paragraph
    Cecilia Rodriguez Aragon is an American computer scientist, professor, author, and champion aerobatic pilot who is best known as the co-inventor (with Raimund Seidel) of the treap data structure, a type of binary search tree that orders nodes by adding a priority as well as a key to each node.
View the Source
NIST Dictionary of Algorithms and Data Structures: treap
NIST Dictionary of Algorithms and Data Structures
  • Credited: Treap Algorithm, References
    Raimund G. Seidel and Cecilia R. Aragon , Randomized Search Trees , Algorithmica, 16:464-497 (1996).
  • Invented: Treap Algorithm, References
    Raimund G. Seidel and Cecilia R. Aragon , Randomized Search Trees , Algorithmica, 16:464-497 (1996).
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.