On the public citation graph

Real-Time Streaming String-Matching

0 signed · 31 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-642-15369-3_41openalex-snapshot
Periodicity in Streams
inferredcites →https://doi.org/10.1016/0022-0000(83)90002-8openalex-snapshot
Time-space-optimal string matching
inferredcites →https://doi.org/10.1016/s0019-9958(85)80031-0openalex-snapshot
Optimal parallel algorithms for string matching
inferredcites →https://doi.org/10.1090/s0002-9939-1965-0174934-9openalex-snapshot
Uniqueness Theorems for Periodic Functions
inferredcites →https://doi.org/10.1109/focs.2009.11openalex-snapshot
Exact and Approximate Pattern Matching in the Streaming Model
inferredcites →https://doi.org/10.1137/0206024openalex-snapshot
Fast Pattern Matching in Strings
inferredcites →https://doi.org/10.1145/322234.322244openalex-snapshot
String Matching in Real Time
inferredcites →https://doi.org/10.1147/rd.312.0249openalex-snapshot
Efficient randomized pattern-matching algorithms

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-031-27051-2_13openalex-snapshot
Finding the Cyclic Covers of a String
inferred← citeshttps://doi.org/10.1007/978-3-032-05228-5_13openalex-snapshot
Two-Player Communication Complexity of Pattern Matching
inferred← citeshttps://doi.org/10.1007/978-3-319-77313-1_2openalex-snapshot
Sliding Window Algorithms for Regular Languages
inferred← citeshttps://doi.org/10.1007/978-3-662-48350-3_31openalex-snapshot
Dictionary Matching in a Stream
inferred← citeshttps://doi.org/10.1007/978-981-16-9885-9_33openalex-snapshot
Efficient Structural Matching for RNA Secondary Structure Using Bit-Parallelism
inferred← citeshttps://doi.org/10.1007/s00453-018-0521-7openalex-snapshot
Streaming Pattern Matching with d Wildcards
inferred← citeshttps://doi.org/10.1007/s00453-021-00876-xopenalex-snapshot
Streaming Dictionary Matching with Mismatches
inferred← citeshttps://doi.org/10.1016/j.ic.2019.104513openalex-snapshot
Streaming k-mismatch with error correcting and applications
inferred← citeshttps://doi.org/10.1016/j.ipl.2025.106594openalex-snapshot
Finding the cyclic covers of a string
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.12.021openalex-snapshot
Time–space trade-offs for Lempel–Ziv compressed indexing
inferred← citeshttps://doi.org/10.1109/dcc.2017.14openalex-snapshot
Streaming K-Mismatch with Error Correcting and Applications
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00090openalex-snapshot
Small-space and streaming pattern matching with $k$ edits
inferred← citeshttps://doi.org/10.1137/1.9781611975994.37openalex-snapshot
Locally Consistent Parsing for Text Indexing in Small Space
inferred← citeshttps://doi.org/10.1137/1.9781611977073.30openalex-snapshot
Streaming Regular Expression Membership and Pattern Matching
inferred← citeshttps://doi.org/10.1137/21m1465706openalex-snapshot
Locally Consistent Parsing for Text Indexing in Small Space
inferred← citeshttps://doi.org/10.1145/3357713.3384266openalex-snapshot
Approximating text-to-pattern Hamming distances
inferred← citeshttps://doi.org/10.1145/3656766.3656822openalex-snapshot
Jumping pattern matching algorithm for protecting search content
inferred← citeshttps://doi.org/10.3390/sym17081227openalex-snapshot
Fingerprint-Based Secure Query Scheme for Databases over Symmetric Mirror Servers
inferred← citeshttps://doi.org/10.4230/lipics.isaac.2019.6openalex-snapshot
Sliding Window Property Testing for Regular Languages
inferred← citeshttps://doi.org/10.4230/lipics.isaac.2023.12openalex-snapshot
Substring Complexity in Sublinear Space
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2019.29openalex-snapshot
Visibly Pushdown Languages over Sliding Windows
inferred← citeshttps://doi.org/10.48550/arxiv.1504.06242openalex-snapshot
Dictionary matching in a stream
inferred← citeshttps://doi.org/10.70675/a61f77f4z0662z41e2z8db6zc2604537b1c1openalex-snapshot
Sketch-based approaches to process massive string data
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.