1.2k citations
- Boston UniversityUS24 papers
- Tel Aviv UniversityIL17 papers
- Hebrew University of JerusalemIL15 papers
- Harvard UniversityUS13 papers
- Institute of Radio AstronomyUA13 papers
- Technion – Israel Institute of TechnologyIL13 papers
- Brookhaven National LaboratoryUS12 papers
- University of WürzburgDE12 papers
- Ben-Gurion University of the NegevIL10 papers
- Ariel UniversityIL9 papers
- Weizmann Institute of ScienceIL8 papers
- ETH ZurichCH6 papers
Showing 2011 · cs.DSShow all
2 papers · 2 filters
cs.DS2011★ 1 cited
Space Lower Bounds for Online Pattern Matching
Raphael Clifford, Markus Jalsenius, Ely Porat +1
We present space lower bounds for online pattern matching under a number of different distance measures. Given a pattern of length m and a text that arrives one character at a time…
cs.DS2011★ 2 cited
Minimum Weight Cycles and Triangles: Equivalences and Algorithms
Liam Roditty, Virginia Vassilevska Williams
We consider the fundamental algorithmic problem of finding a cycle of minimum weight in a weighted graph. In particular, we show that the minimum weight cycle problem in an undirec…