Barton, C. (2022). On the average-case complexity of pattern matching with wildcards. Theoretical computer science, 922, 37-45. https://doi.org/10.1016/j.tcs.2022.04.009
Citace podle Chicago (17th ed.)Barton, Carl. "On the Average-case Complexity of Pattern Matching with Wildcards." Theoretical Computer Science 922 (2022): 37-45. https://doi.org/10.1016/j.tcs.2022.04.009.
Citace podle MLA (9th ed.)Barton, Carl. "On the Average-case Complexity of Pattern Matching with Wildcards." Theoretical Computer Science, vol. 922, 2022, pp. 37-45, https://doi.org/10.1016/j.tcs.2022.04.009.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..