Window-Accumulated Subsequence matching Problem is linear

Authors

• 1. Luc Boasson (University of Paris 7)
• 2. Patrick Cegielski (University of Paris 12)
• 3. Irène Guessarian (University of Paris 6)
• 4. Yuri Matiyasevich (Steklov Institute of Mathematics; University of Stuttgart)

@inproceedings{boasson_pods99,
        address = {New York, NY, USA},
        series = {{PODS} '99},
        title = {{Window-Accumulated Subsequence matching Problem is linear}},
        url = {https://dl.acm.org/doi/10.1145/303976.304008},
        doi = {10.1145/303976.304008},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Boasson, Luc and Cegielski, Patrick and Guessarian, Irène and Matiyasevich, Yuri},
        year = {1999}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Semantically Similar Papers