Metadata Search Funding Data Link References Status API Help
Facet browsing currently unavailable
Page 1 of 1044 results
Sort by: relevance publication year

Tighter Lower Bounds on the Exact Complexity of String Matching

JOURNAL ARTICLE published February 1995 in SIAM Journal on Computing

Authors: Richard Cole | Ramesh Hariharan | Mike Paterson | Uri Zwick

https://doi.org/10.1137/s0097539793245829 Actions

The Complexity of Pattern Matching for a Random String

JOURNAL ARTICLE published August 1979 in SIAM Journal on Computing

Authors: Andrew Chi-Chih Yao

https://doi.org/10.1137/0208029 Actions

On the Exact Complexity of String Matching: Upper Bounds

JOURNAL ARTICLE published June 1992 in SIAM Journal on Computing

Authors: Zvi Galil | Raffaele Giancarlo

https://doi.org/10.1137/0221028 Actions

On the Exact Complexity of String Matching: Lower Bounds

JOURNAL ARTICLE published December 1991 in SIAM Journal on Computing

Authors: Zvi Galil | Raffaele Giancarlo

https://doi.org/10.1137/0220063 Actions

Tighter Upper Bounds on the Exact Complexity of String Matching

JOURNAL ARTICLE published June 1997 in SIAM Journal on Computing

Authors: Richard Cole | Ramesh Hariharan

https://doi.org/10.1137/s009753979324694x Actions

Tight Bounds on the Complexity of the Boyer–Moore String Matching Algorithm

JOURNAL ARTICLE published October 1994 in SIAM Journal on Computing

Authors: Richard Cole

https://doi.org/10.1137/s0097539791195543 Actions

On the complexity of approximately matching a string to a directed graph

JOURNAL ARTICLE published October 2022 in Information and Computation

Authors: Riccardo Dondi | Giancarlo Mauri | Italo Zoppis

https://doi.org/10.1016/j.ic.2021.104748 Actions

String Complexity

BOOK CHAPTER published 30 June 2015 in Analytic Pattern Matching

https://doi.org/10.1017/cbo9780511843204.013 Actions

Generalized String Matching

JOURNAL ARTICLE published December 1987 in SIAM Journal on Computing

Authors: Karl Abrahamson

https://doi.org/10.1137/0216067 Actions

String Matching under a General Matching Relation

JOURNAL ARTICLE published October 1995 in Information and Computation

Authors: S. Muthukrishnan | H. Ramesh

https://doi.org/10.1006/inco.1995.1144 Actions

SIAM 1973 National Meeting

JOURNAL ARTICLE published January 1974 in SIAM Review

https://doi.org/10.1137/1016024 Actions

Approximate Boyer–Moore String Matching

JOURNAL ARTICLE published April 1993 in SIAM Journal on Computing

Authors: Jorma Tarhio | Esko Ukkonen

https://doi.org/10.1137/0222018 Actions

Other Books Received

JOURNAL ARTICLE published April 1974 in SIAM Review

https://doi.org/10.1137/1016048 Actions

Other Books Received

JOURNAL ARTICLE published July 1974 in SIAM Review

https://doi.org/10.1137/1016074 Actions

Other Books Received

JOURNAL ARTICLE published October 1974 in SIAM Review

https://doi.org/10.1137/1016112 Actions

Other Books Received

JOURNAL ARTICLE published January 1974 in SIAM Review

https://doi.org/10.1137/1016023 Actions

Joint AMS–SIAM Conference

JOURNAL ARTICLE published June 2002 in Journal of Complexity

Authors: Eugene Allgower | Kurt Georg | Christopher Sikorski

https://doi.org/10.1006/jcom.2002.0647 Actions

Efficient Comparison Based String Matching

JOURNAL ARTICLE published September 1993 in Journal of Complexity

Authors: Dany Breslauer | Zvi Galil

https://doi.org/10.1006/jcom.1993.1022 Actions

Massively Parallel Computation of Matching and MIS in Sparse Graphs

PROCEEDINGS ARTICLE published 16 July 2019 in Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing

Research funded by NSF (CCF:SPX 1822738,IIS:BIGDATA 1546108) | DARPA (SI3CMD)

Authors: Soheil Behnezhad | Sebastian Brandt | Mahsa Derakhshan | Manuela Fischer | MohammadTaghi Hajiaghayi | Richard M. Karp | Jara Uitto

https://doi.org/10.1145/3293611.3331609 Actions

Saving Space in Fast String-Matching

JOURNAL ARTICLE published May 1980 in SIAM Journal on Computing

Authors: Zvi Galil | Joel Seiferas

https://doi.org/10.1137/0209032 Actions
Feedback: support@crossref.org