Computing Atlas

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

Justin Zobel

Information Systems

Justin Zobel is an Australian computer scientist whose work centres on information retrieval, search engine technology and research evaluation. He is a Redmond Barry Distinguished Professor in the School of Computing and Information Systems at the University of Melbourne, where he also serves as Pro Vice-Chancellor for Graduate and International Research. In this atlas he matters as a co-author, with Ranjan Sinha, of the 2003 paper Efficient Trie-Based Sorting of Large Sets of Strings, listed in the references of the burstsort article. Burstsort is a cache-efficient string sorting algorithm that keeps string prefixes in a trie whose leaves are growable buckets and bursts a bucket into a new trie level when it grows past a threshold. The same article lists a later Sinha, Zobel and Ring paper on a copying variant, C-burstsort. His wider publications, supervision and awards are not drawn on here.

Justin Zobel
Filter Results1 entry
Connections

Credited

Burstsort, Algorithms
Source Burstsort (Wikipedia)

In Field

Source Justin Zobel (Wikipedia)

Invented By

Burstsort, Algorithms
Source Burstsort (Wikipedia)
In the Other Atlases

Nationality

Also in Geography Atlas: the nationality of this subject.

Source Justin Zobel (Wikipedia)Lead sentence
Quote, Lead sentence
is an Australian computer scientist
Sources
Justin Zobel (Wikipedia)
  • Lead sentence
    is an Australian computer scientist
  • In Group: Information Retrieval Systems, Lead paragraph
    working in information retrieval, search engine technology, and research evaluation
  • In Field: Information Retrieval, Lead paragraph
    working in information retrieval, search engine technology, and research evaluation
View the Source
Burstsort (Wikipedia)
  • Credited: Burstsort, References, first publication of 2003
    Zobel, Justin (2003)
  • Invented By: Burstsort, References, first publication of 2003
    Zobel, Justin (2003)
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.