Space Lower Bounds for Online Pattern Matching Rapha¨el Clifford1 , Markus Jalsenius1 , Ely Porat2 , and Benjamin Sach1 1 2

First Page		Document Content
Date: 2011-03-12 09:28:52 Analysis of algorithms Coding theory Computational complexity theory Pattern matching Communication Communication complexity Matching Time complexity Hamming distance Theoretical computer science Applied mathematics Mathematics		Space Lower Bounds for Online Pattern Matching Rapha¨el Clifford1 , Markus Jalsenius1 , Ely Porat2 , and Benjamin Sach1 1 2 Add to Reading List Source URL: www.cs.bris.ac.uk Download Document from Source Website File Size: 322,63 KB Share Document on Facebook

	Theoretical Computer Science–40 www.elsevier.com/locate/tcs Presorting algorithms: An average-case point of view DocID: 1xVR3 - View Document
	Theoretical Computer Science – 551 www.elsevier.com/locate/tcs On the computational strength of pure ambient calculi夡 Sergio Maffeis, Iain Phillips∗ DocID: 1xUAX - View Document
	Theoretical Computer Science–24 Contents lists available at ScienceDirect Theoretical Computer Science www.elsevier.com/locate/tcs DocID: 1xUr4 - View Document
	Advanced Topics in SAT-Solving Part II: Theoretical Aspects Carsten Sinz Wilhelm-Schickard-Institut for Computer Science University of T¨ubingen DocID: 1xTuz - View Document
	CS 153 Current Topics in Theoretical Computer Science Spring 2016 DocID: 1vryF - View Document