12 citations · 30 across the 13 of their papers we have counts for
5 papers · 1 filter
Algorithms in the Ultra-Wide Word Model
Arash Farzan, Alejandro López-Ortiz, Patrick K. Nicholson +1
The effective use of parallel computing resources to speed up algorithms in current multi-core parallel architectures remains a difficult challenge, with ease of programming playin…
Optimal Encodings for Range Top-k, Selection, and Min-Max
Pawel Gawrychowski, Patrick K. Nicholson
We consider encoding problems for range queries on arrays. In these problems the goal is to store a structure capable of recovering the answer to all queries that occupies the info…
Encodings of Range Maximum-Sum Segment Queries and Applications
Pawel Gawrychowski, Patrick K. Nicholson
Given an array A containing arbitrary (positive and negative) numbers, we consider the problem of supporting range maximum-sum segment queries on A: i.e., given an arbitrary range…
Weighted ancestors in suffix trees
Pawel Gawrychowski, Moshe Lewenstein, Patrick K. Nicholson
The classical, ubiquitous, predecessor problem is to construct a data structure for a set of integers that supports fast predecessor queries. Its generalization to weighted trees,…
Cache-Oblivious VAT-Algorithms
Tomasz Jurkiewicz, Kurt Mehlhorn, Patrick Nicholson
The VAT-model (virtual address translation model) extends the EM-model (external memory model) and takes the cost of address translation in virtual memories into account. In this m…