Nikolas Askitis

According to our database, Nikolas Askitis authored at least 7 papers between 2005 and 2010.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2010

Engineering scalable, cache and space efficient tries for strings.

Nikolas Askitis, Ranjan Sinha

VLDB J., 2010

Redesigning the string hash table, burst trie, and BST to exploit cache.

Nikolas Askitis, Justin Zobel

ACM J. Exp. Algorithmics, 2010

RepMaestro: scalable repeat detection on disk-based genome sequences.

Nikolas Askitis, Ranjan Sinha

Bioinform., 2010

2009

B-tries for disk-based string management.

Nikolas Askitis, Justin Zobel

VLDB J., 2009

Fast and Compact Hash Tables for Integer Keys.

Nikolas Askitis

Proceedings of the Computer Science 2009, 2009

2007

HAT-Trie: A Cache-Conscious Trie-Based Data Structure For Strings.

Nikolas Askitis, Ranjan Sinha

Proceedings of the Computer Science 2007. Proceedings of the Thirtieth Australasian Computer Science Conference (ACSC2007). Ballarat, Victoria, Australia, January 30, 2007

2005

Cache-Conscious Collision Resolution in String Hash Tables.

Nikolas Askitis, Justin Zobel

Proceedings of the String Processing and Information Retrieval, 2005