Deterministic Length Reduction: Fast Convolution in Sparse Data

A. Amihood, Oren Kapah, E. Porat

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


In this paper a deterministic algorithm for the length reduction problem is presented. This algorithm enables a new tool for performing fast convolution in sparse data. The proposed algorithm performs the convolution in O(n1log3n1)O(n1log3⁡n1), where n 1 is the number of non-zero values in V 1. This algorithm assumes that V 1 is given in advance, and the V 2 is given in running time.
Original languageAmerican English
Title of host publicationAnnual Symposium on Combinatorial Pattern Matching
EditorsBin Ma, Kaizhong Zhang
PublisherSpringer Berlin Heidelberg
StatePublished - 2007

Bibliographical note

Place of conference:London, Canada


Dive into the research topics of 'Deterministic Length Reduction: Fast Convolution in Sparse Data'. Together they form a unique fingerprint.

Cite this