4 citations · 8 across the 5 of their papers we have counts for
7 papers
Periodicity in Data Streams with Wildcards
Funda Ergün, Elena Grigorescu, Erfan Sadeqi Azer +1
We investigate the problem of detecting periodic trends within a string of length , arriving in the streaming model, containing at most wildcard characters, where $k=o(n…
Longest Alignment with Edits in Data Streams
Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou
Analyzing patterns in data streams generated by network traffic, sensor networks, or satellite feeds is a challenge for systems in which the available storage is limited. In additi…
Streaming Periodicity with Mismatches
Funda Ergün, Elena Grigorescu, Erfan Sadeqi Azer +1
We study the problem of finding all -periods of a length- string , presented as a data stream. is said to have -period if its prefix of length differs fro…
Nearly Optimal Sparse Group Testing
Venkata Gandikota, Elena Grigorescu, Sidharth Jaggi +1
Group testing is the process of pooling arbitrary subsets from a set of items so as to identify, with a minimal number of tests, a "small" subset of defective items. In "cl…
Streaming for Aibohphobes: Longest Palindrome with Mismatches
Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou
A palindrome is a string that reads the same as its reverse, such as "aibohphobia" (fear of palindromes). Given an integer , a -near-palindrome is a string of Hamming dista…
Streaming Weighted Matchings: Optimal Meets Greedy
Elena Grigorescu, Morteza Monemizadeh, Samson Zhou
We consider the problem of approximating a maximum weighted matching, when the edges of an underlying weighted graph are revealed in a streaming fashion. We analyze a vari…