The Library
Browse by Warwick Author
Up a level |
Number of items: 8.
Journal Article
Clifford, Raphaël, Jalsenius, Markus, Porat, Ely and Sach, Ben (2013) Space lower bounds for online pattern matching. Theoretical Computer Science, 483 . pp. 68-74. doi:10.1016/j.tcs.2012.06.012 ISSN 0304-3975.
Butman, Ayelet, Clifford, Peter, Clifford, Raphaël, Jalsenius, Markus, Lewenstein, Noa, Porat, Benny, Porat, Ely and Sach, Ben (2013) Pattern matching under polynomial transformation. SIAM Journal on Computing, 42 (2). pp. 611-633. doi:10.1137/110853327 ISSN 0097-5397.
Clifford, Raphaël, Jalsenius, Markus, Montanaro, Ashley and Sach, Ben (2012) The complexity of flood filling games. Theory of Computing Systems, Vol.50 (No.1). pp. 72-92. doi:10.1007/s00224-011-9339-2 ISSN 1432-4350.
Clifford, Raphaël, Jalsenius, Markus, Porat, Ely and Sach, Ben (2012) Pattern matching in multiple streams. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Volume 7354 . pp. 97-109. doi:10.1007/978-3-642-31265-6_8 ISSN 0302-9743.
Bille, Philip, Gørtz, Inge Li, Sach, Benjamin and Vildhøj, Hjalte Wedel (2012) Time-space trade-offs for longest common extensions. Combinatorial Pattern Matching, Volume 7354 . pp. 293-305. doi:10.1007/978-3-642-31265-6_24 ISSN 0302-9743.
Clifford, Raphaël and Sach, Ben (2011) Pattern matching in pseudo real-time. Journal of Discrete Algorithms, Vol.9 (No.1). pp. 67-81. doi:10.1016/j.jda.2010.09.005 ISSN 1570-8667.
Book Item
Bille, Philip, Cording, Patrick Hagge, Gørtz, Inge Li, Sach, Benjamin, Vildhøj, Hjalte Wedel and Vind, Søren (2013) Fingerprints in compressed strings. In: Dehne, Frank and Solis-Oba, Roberto and Sack, Jörg-Rüdiger , (eds.) Algorithms and Data Structures : 13th International Symposium, WADS 2013, London, ON, Canada, August 12-14, 2013. Proceedings. Lecture Notes in Computer Science, Volume 8037 . Springer Berlin Heidelberg, pp. 146-157. ISBN 9783642401039
Conference Item
Clifford, Raphaël, Jalsenius, Markus and Sach, Ben (2013) Tight cell-probe bounds for online hamming distance computation. In: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2013, New Orleans, Louisiana, 6-8 January 2013. Published in: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms pp. 664-674.
This list was generated on Thu Apr 18 18:14:57 2024 BST.