On the public citation graph

Exploiting Pseudo-Locality of Interchange Distance

https://doi.org/10.2139/ssrn.4090455
0 signed · 33 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-12476-1_1openalex-extracted
String Rearrangement Metrics: A Survey
inferredcites →https://doi.org/10.1007/s00224-011-9344-5openalex-extracted
On Approximate Jumbled Pattern Matching in Strings
inferredcites →https://doi.org/10.1016/0020-0190(93)90177-bopenalex-extracted
Fast algorithms for approximately counting mismatches
inferredcites →https://doi.org/10.1016/0304-3975(85)90047-7openalex-extracted
The complexity of finding minimum-length generator sequences
inferredcites →https://doi.org/10.1016/j.dam.2018.05.028openalex-extracted
Improved online algorithms for jumbled matching
inferredcites →https://doi.org/10.1016/j.jalgor.2003.12.001openalex-extracted
An improved data stream summary: the count-min sketch and its applications
inferredcites →https://doi.org/10.1016/j.jcss.2009.03.001openalex-extracted
Pattern matching with address errors: Rearrangement distances
inferredcites →https://doi.org/10.1016/j.jcss.2016.09.003openalex-extracted
Fast algorithms for Abelian periods in words and greatest common divisor queries
inferredcites →https://doi.org/10.1016/j.tcs.2009.07.013openalex-extracted
Interchange rearrangement: The element-cost model
inferredcites →https://doi.org/10.1016/j.tcs.2015.11.026openalex-extracted
LCSk: A refined similarity measure
inferredcites →https://doi.org/10.1016/s0020-0190(01)00302-7openalex-extracted
Approximate swapped matching
inferredcites →https://doi.org/10.1016/s0020-0190(96)00155-xopenalex-extracted
Sorting permutations by block-interchanges
inferredcites →https://doi.org/10.1016/s0166-218x(96)00061-3openalex-extracted
Polynomial-time algorithm for computing translocation distance between genomes
inferredcites →https://doi.org/10.1016/s0304-3975(03)00400-6openalex-extracted
Finding frequent items in data streams
inferredcites →https://doi.org/10.1017/cbo9780511703676.073openalex-extracted
Note on the Theory of Permutations
inferredcites →https://doi.org/10.1109/sfcs.1998.743440openalex-extracted
Faster algorithms for string matching problems: matching the convolution bound
inferredcites →https://doi.org/10.1137/080712969openalex-extracted
On the Cost of Interchange Rearrangement in Strings
inferredcites →https://doi.org/10.1137/s0097539798347177openalex-extracted
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
inferredcites →https://doi.org/10.1137/s089548019528280xopenalex-extracted
Sorting by Transpositions
inferredcites →https://doi.org/10.1137/s089548019731994xopenalex-extracted
Sorting Permutations by Reversals and Eulerian Cycle Decompositions
inferredcites →https://doi.org/10.1145/1060590.1060621openalex-extracted
Optimal approximations of the frequency moments of data streams
inferredcites →https://doi.org/10.1145/141818.141820openalex-extracted
A supplement to sampling-based methods for query size estimation in a database system
inferredcites →https://doi.org/10.1145/2390176.2390189openalex-extracted
Cycle detection and correction
inferredcites →https://doi.org/10.1145/2746539.2746553openalex-extracted
Optimal Data-Dependent Hashing for Approximate Near Neighbors
inferredcites →https://doi.org/10.1145/276698.276876openalex-extracted
Approximate nearest neighbors
inferredcites →https://doi.org/10.1145/321879.321880openalex-extracted
An Extension of the String-to-String Correction Problem
inferredcites →https://doi.org/10.1145/375360.375365openalex-extracted
A guided tour to approximate string matching
inferredcites →https://doi.org/10.1145/502807.502808openalex-extracted
Searching in metric spaces
inferredcites →https://doi.org/10.4086/toc.2012.v008a014openalex-extracted
inferredcites →https://doi.org/10.4230/lipics.icalp.2016.20openalex-extracted
Approximate Hamming Distance in a Stream
inferredcites →https://doi.org/10.48550/arxiv.1509.02897openalex-extracted
Practical and Optimal LSH for Angular Distance
inferredcites →https://doi.org/10.48550/arxiv.1803.02807openalex-extracted
Flexible and Efficient Algorithms for Abelian Matching in Strings
inferredcites →https://doi.org/10.1145/3357713.3384266openalex-snapshot
Approximating text-to-pattern Hamming distances
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.