On the public citation graph
Necklaces, Convolutions, and X + Y
0 signed · 75 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11496656_7openalex-snapshot
Faster Algorithms for δ,γ-Matching and Related Problems
inferredcites →https://doi.org/10.1007/11534273_28openalex-snapshot
All-Pairs Shortest Paths with Real Weights in O(n 3/log n) Time
inferredcites →https://doi.org/10.1007/978-3-540-73437-6_9openalex-snapshot
Self-normalised Distance with Don’t Cares
inferredcites →https://doi.org/10.1007/bf00348431openalex-snapshot
Gauss and the history of the fast Fourier transform
inferredcites →https://doi.org/10.1007/s00224-005-1239-xopenalex-snapshot
Juggling with Pattern Matching
inferredcites →https://doi.org/10.1007/s00453-007-9036-3openalex-snapshot
Subquadratic Algorithms for 3SUM
inferredcites →https://doi.org/10.1007/s00453-007-9062-1openalex-snapshot
All-Pairs Shortest Paths with Real Weights in O(n 3/log n) Time
inferredcites →https://doi.org/10.1016/0020-0190(94)00201-9openalex-snapshot
A pseudo-algorithmic separation of lines from pseudo-lines
inferredcites →https://doi.org/10.1016/0022-0000(82)90048-4openalex-snapshot
The complexity of selection and ranking in X + Y and matrices with sorted columns
inferredcites →https://doi.org/10.1016/0167-6377(94)90048-5openalex-snapshot
Fast algorithms for the maximum convolution problem
inferredcites →https://doi.org/10.1016/0304-3975(76)90078-5openalex-snapshot
How good is the information theory bound in sorting?
inferredcites →https://doi.org/10.1016/b978-012500451-0/50010-2openalex-snapshot
Differential Morphology
inferredcites →https://doi.org/10.1016/j.ipl.2006.08.002openalex-snapshot
Simple deterministic wildcard matching
inferredcites →https://doi.org/10.1016/s0022-0000(73)80033-9openalex-snapshot
Time bounds for selection
inferredcites →https://doi.org/10.1017/9781139049801.011openalex-snapshot
Fast multiplication and its applications
inferredcites →https://doi.org/10.1089/cmb.2006.13.979openalex-snapshot
An O ( n log n )-Time Algorithm for the Restriction Scaffold Assignment Problem
inferredcites →https://doi.org/10.1090/s0025-5718-1965-0178586-1openalex-snapshot
An Algorithm for the Machine Calculation of Complex Fourier Series
inferredcites →https://doi.org/10.1109/sfcs.1998.743440openalex-snapshot
Faster algorithms for string matching problems: matching the convolution bound
inferredcites →https://doi.org/10.1109/sfcs.2005.39openalex-snapshot
Group-theoretic Algorithms for Matrix Multiplication
inferredcites →https://doi.org/10.1137/0110042openalex-snapshot
Mathematical Programming and the Maximum Transform
inferredcites →https://doi.org/10.1137/0205006openalex-snapshot
New Bounds on the Complexity of the Shortest Path Problem
inferredcites →https://doi.org/10.1145/509907.509992openalex-snapshot
Verifying candidate matches in sparse and wildcard matching
inferredcites →https://doi.org/10.1162/comj.2006.30.3.67openalex-snapshot
Algorithms for Computing Geometric Measures of Melodic Similarity
inferredcites →https://doi.org/10.48550/arxiv.cs/0212050openalex-snapshot
Open Problems from CCCG 2002
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11575832_27openalex-snapshot
Necklace Swap Problem for Rhythmic Similarity Measures
inferred← citeshttps://doi.org/10.1007/978-1-4614-6624-6_86-1openalex-snapshot
Gomory Group Minimization Problem and Its Applications
inferred← citeshttps://doi.org/10.1007/978-1-4614-7621-4_23openalex-snapshot
Techniques and Open Questions in Computational Convex Analysis
inferred← citeshttps://doi.org/10.1007/978-3-030-10564-8_20openalex-snapshot
Linear Pseudo-Polynomial Factor Algorithm for Automaton Constrained Tree Knapsack Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-81396-2_14openalex-snapshot
Approximate Min-Sum Subset Convolution
inferred← citeshttps://doi.org/10.1007/978-3-319-21398-9_44openalex-snapshot
Linear Time Approximation Schemes for Geometric Maximum Coverage
inferred← citeshttps://doi.org/10.1007/978-3-319-26626-8_33openalex-snapshot
Extreme Witnesses and Their Applications
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_72openalex-snapshot
Algorithms for Computing the Length-Constrained Max-Score Segments with Applications to DNA Copy Number Data Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-13122-6_11openalex-snapshot
On Table Arrangements, Scrabble Freaks, and Jumbled Pattern Matching
inferred← citeshttps://doi.org/10.1007/978-3-642-24412-4_19openalex-snapshot
Combining Initial Segments of Lists
inferred← citeshttps://doi.org/10.1007/978-3-642-31265-6_12openalex-snapshot
Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence
inferred← citeshttps://doi.org/10.1007/978-3-642-35261-4_36openalex-snapshot
Optimal Point Movement for Covering Circular Regions
inferred← citeshttps://doi.org/10.1007/978-981-95-0215-8_9openalex-snapshot
Discrete Effort Distribution via Regret-Enabled Greedy Algorithm
inferred← citeshttps://doi.org/10.1007/s00224-007-9088-4openalex-snapshot
A Linear-Time Algorithm for Hamming Distance with Shifts
inferred← citeshttps://doi.org/10.1007/s00224-011-9344-5openalex-snapshot
On Approximate Jumbled Pattern Matching in Strings
inferred← citeshttps://doi.org/10.1007/s00453-013-9857-1openalex-snapshot
Optimal Point Movement for Covering Circular Regions
inferred← citeshttps://doi.org/10.1007/s11228-010-0157-5openalex-snapshot
Convex Hull Algorithms for Piecewise Linear-Quadratic Functions in Computational Convex Analysis
inferred← citeshttps://doi.org/10.1007/s11590-023-02017-5openalex-snapshot
Structured $$(\min ,+)$$-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems
inferred← citeshttps://doi.org/10.1016/j.comgeo.2007.01.003openalex-snapshot
Computational geometric aspects of rhythm, melody, and voice-leading
inferred← citeshttps://doi.org/10.1016/j.ipl.2010.06.012openalex-snapshot
Indexing permutations for binary strings
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.05.032openalex-snapshot
Approximating the maximum consecutive subsums of a sequence
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.09.021openalex-snapshot
Combining initial segments of lists
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.11.026openalex-snapshot
Near-linear time approximation schemes for geometric maximum coverage
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.03.010openalex-snapshot
Characterization of interval graphs that are unpaired 2-disjoint path coverable
inferred← citeshttps://doi.org/10.1089/cmb.2015.0013openalex-snapshot
A Fast Numerical Method for Max-Convolution and the Application to Efficient Max-Product Inference in Bayesian Networks
inferred← citeshttps://doi.org/10.1109/isit.2014.6875145openalex-snapshot
On lower bounds for the Maximum Consecutive Subsums Problem and the (min,+)-convolution
inferred← citeshttps://doi.org/10.1137/1.9781611973402.103openalex-snapshot
Four Soviets Walk the Dog—with an Application to Alt's Conjecture
inferred← citeshttps://doi.org/10.1145/1644015.1644035openalex-snapshot
Computing rank-convolutions with a mask
inferred← citeshttps://doi.org/10.1145/3188745.3188876openalex-snapshot
Fast algorithms for knapsack via convolution and prediction
inferred← citeshttps://doi.org/10.1145/3293465openalex-snapshot
On Problems Equivalent to (min,+)-Convolution
inferred← citeshttps://doi.org/10.1145/3409964.3461793openalex-snapshot
String Matching with Wildcards in the Massively Parallel Computation Model
inferred← citeshttps://doi.org/10.1145/3519935.3520057openalex-snapshot
Faster min-plus product for monotone instances
inferred← citeshttps://doi.org/10.1145/3734517openalex-snapshot
Any-k Algorithms for Enumerating Ranked Answers to Conjunctive Queries
inferred← citeshttps://doi.org/10.1609/aaai.v30i1.10263openalex-snapshot
Decoding Hidden Markov Models Faster Than Viterbi Via Online Matrix-Vector (max, +)-Multiplication
inferred← citeshttps://doi.org/10.46298/lmcs-21(2:14)2025openalex-snapshot
Ranked Enumeration of Conjunctive Query Results
inferred← citeshttps://doi.org/10.48550/arxiv.1505.07519openalex-snapshot
A Bounded $p$-norm Approximation of Max-Convolution for Sub-Quadratic Bayesian Inference on Additive Factors
inferred← citeshttps://doi.org/10.6100/ir777493openalex-snapshot
Similarity measures and algorithms for cartographic schematization
inferred← citeshttps://doi.org/10.7287/peerj-cs.483v0.1/reviews/1openalex-snapshot
Peer Review #1 of "Selection on X1 + X2 + ⋯ + Xm via Cartesian product trees (v0.1)"
inferred← citeshttps://doi.org/10.7287/peerj-cs.483v0.1/reviews/2openalex-snapshot
Peer Review #2 of "Selection on X1 + X2 + ⋯ + Xm via Cartesian product trees (v0.1)"
inferred← citeshttps://doi.org/10.7287/peerj-cs.483v0.2/reviews/1openalex-snapshot
Peer Review #1 of "Selection on X1 + X2 + ⋯ + Xm via Cartesian product trees (v0.2)"
inferred← citeshttps://doi.org/10.7717/peerj-cs.483openalex-snapshot
Selection on X 1 + X 2 + ⋯ + X m via Cartesian product trees
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.