Steffen Heinz

According to our database, Steffen Heinz authored at least 5 papers between 2001 and 2003.

Collaborative distances:

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

2003

Efficient single-pass index construction for text databases.

Steffen Heinz, Justin Zobel

J. Assoc. Inf. Sci. Technol., 2003

2002

Burst tries: a fast, efficient data structure for string keys.

Steffen Heinz, Justin Zobel, Hugh E. Williams

ACM Trans. Inf. Syst., 2002

Performance of Data Structures for Small Sets of Strings.

Steffen Heinz, Justin Zobel

Proceedings of the Computer Science 2002, 2002

2001

Self-adjusting trees in practice for large text collections.

Hugh E. Williams, Justin Zobel, Steffen Heinz

Softw. Pract. Exp., 2001

In-memory hash tables for accumulating text vocabularies.

Justin Zobel, Steffen Heinz, Hugh E. Williams

Inf. Process. Lett., 2001