On the public citation graph

Sequential and Parallel Algorithms for the Generalized Maximum Subarray Problem

https://doi.org/10.26021/1644
0 signed · 90 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.1006/inco.1993.1030openalex-snapshot
An Optimal Algorithm for Selection in a Min-Heap
inferredcites →https://doi.org/10.1006/jmbi.1990.9999openalex-snapshot
Basic Local Alignment Search Tool
inferredcites →https://doi.org/10.1006/jmbi.2000.4315openalex-snapshot
Predicting transmembrane protein topology with a hidden markov model: application to complete genomes11Edited by F. Cohen
inferredcites →https://doi.org/10.1007/11533719_63openalex-snapshot
Improved Algorithms for the K-Maximum Subarray Problem for Small K
inferredcites →https://doi.org/10.1007/11758501_80openalex-snapshot
Algorithm for K Disjoint Maximum Subarrays
inferredcites →https://doi.org/10.1007/3-540-18099-0openalex-snapshot
Parallel Algorithms and Architectures
inferredcites →https://doi.org/10.1007/3-540-45089-0_23openalex-snapshot
An Optimal Algorithm for Maximum-Sum Segment and Its Application in Bioinformatics
inferredcites →https://doi.org/10.1007/978-1-4615-5903-0_1openalex-snapshot
Evaluating the Statistical Significance of Multiple Distinct Local Alignments
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_14openalex-snapshot
Efficiency of Equivalence Algorithms
inferredcites →https://doi.org/10.1007/978-3-540-27798-9_31openalex-snapshot
A Faster Algorithm for the All-Pairs Shortest Path Problem and Its Application
inferredcites →https://doi.org/10.1007/978-3-540-74456-6_40openalex-snapshot
A Linear Time Algorithm for the k Maximal Sums Problem
inferredcites →https://doi.org/10.1007/s007780050028openalex-snapshot
An asymptotically optimal multiversion B-tree
inferredcites →https://doi.org/10.1016/0020-0190(80)90001-0openalex-snapshot
A complement to Tarjan's result about the lower bound on the complexity of the set union problem
inferredcites →https://doi.org/10.1016/0020-0190(80)90006-xopenalex-snapshot
Area-time optimal VLSI networks for multiplying matrices
inferredcites →https://doi.org/10.1016/0020-0190(92)90200-fopenalex-snapshot
A new upper bound on the complexity of the all pairs shortest path problem
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/0022-2836(82)90515-0openalex-snapshot
A simple method for displaying the hydropathic character of a protein
inferredcites →https://doi.org/10.1016/0167-6423(83)90015-1openalex-snapshot
A note on a standard strategy for developing loop invariants and loops
inferredcites →https://doi.org/10.1016/0167-8191(94)00063-gopenalex-snapshot
Fast parallel algorithms for the maximum sum problem
inferredcites →https://doi.org/10.1016/0743-7315(92)90038-oopenalex-snapshot
An efficient VLSI algorithm for the all pairs shortest path problem
inferredcites →https://doi.org/10.1016/j.dam.2007.05.018openalex-snapshot
On the range maximum-sum segment query problem
inferredcites →https://doi.org/10.1016/j.entcs.2005.08.003openalex-snapshot
Constructing Induction Rules for Deductive Synthesis Proofs
inferredcites →https://doi.org/10.1016/j.ipl.2005.08.008openalex-snapshot
An time algorithm for the all-pairs shortest path problem
inferredcites →https://doi.org/10.1016/j.jcss.2004.08.001openalex-snapshot
Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications
inferredcites →https://doi.org/10.1016/j.tcs.2007.02.027openalex-snapshot
Randomized algorithm for the sum selection problem
inferredcites →https://doi.org/10.1016/j.tcs.2007.03.011openalex-snapshot
Ranking k maximum sums
inferredcites →https://doi.org/10.1016/s0022-0000(02)00010-7openalex-snapshot
Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis
inferredcites →https://doi.org/10.1016/s0022-0000(73)80033-9openalex-snapshot
Time bounds for selection
inferredcites →https://doi.org/10.1016/s0378-1119(97)00474-5openalex-snapshot
Locus control regions of mammalian β-globin gene clusters: combining phylogenetic analyses and experimental results to gain functional insights
inferredcites →https://doi.org/10.1016/s1571-0661(04)00313-5openalex-snapshot
Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication
inferredcites →https://doi.org/10.1023/b:visi.0000013087.49260.fbopenalex-snapshot
Robust Real-Time Face Detection
inferredcites →https://doi.org/10.1038/ng780openalex-snapshot
Computational identification of promoters and first exons in the human genome
inferredcites →https://doi.org/10.1073/pnas.89.6.2002openalex-snapshot
Methods and algorithms for statistical analysis of protein sequences.
inferredcites →https://doi.org/10.1093/bioinformatics/10.3.219openalex-snapshot
An algorithm for identifying regions of a DNA sequence that satisfy a content requirement
inferredcites →https://doi.org/10.1093/bioinformatics/17.suppl_1.s90openalex-snapshot
Promoter prediction in the human genome
inferredcites →https://doi.org/10.1093/bioinformatics/btg023openalex-snapshot
MaxSubSeq: an algorithm for segment-length optimization. The case study of the transmembrane spanning segments
inferredcites →https://doi.org/10.1093/comjnl/bxl007openalex-snapshot
Improved Algorithms for the K-Maximum Subarray Problem
inferredcites →https://doi.org/10.1093/nar/27.19.3899openalex-snapshot
Comparison of five methods for finding conserved sequences in multiple alignments of gene regulatory regions
inferredcites →https://doi.org/10.1108/eb005421openalex-snapshot
PROCESSES AND THEIR INTERACTIONS
inferredcites →https://doi.org/10.1109/ispan.2004.1300488openalex-snapshot
Algorithms for the problem of K maximum sums and a VLSI algorithm for the K maximum subarrays problem
inferredcites →https://doi.org/10.1109/massp.1985.1163741openalex-snapshot
VLSI Array processors
inferredcites →https://doi.org/10.1109/tc.1980.1675627openalex-snapshot
The Parallel Recognition of Classes of Graphs
inferredcites →https://doi.org/10.1110/ps.37201openalex-snapshot
Prediction of the transmembrane regions of β‐barrel membrane proteins with a neural network‐based predictor
inferredcites →https://doi.org/10.1126/science.1621093openalex-snapshot
Chance and Statistical Significance in Protein and DNA Sequence Analysis
inferredcites →https://doi.org/10.1137/0202024openalex-snapshot
Set Merging Algorithms
inferredcites →https://doi.org/10.1137/0207013openalex-snapshot
Selecting the K th Element in $X + Y$ and $X_1 + X_2 + \cdots + X_m $
inferredcites →https://doi.org/10.1137/0209045openalex-snapshot
Design and Analysis of a Data Structure for Representing Sorted Lists
inferredcites →https://doi.org/10.1137/s0097539795290477openalex-snapshot
Finding the k Shortest Paths
inferredcites →https://doi.org/10.1142/s012905410700470xopenalex-snapshot
ALGORITHMS FOR K-DISJOINT MAXIMUM SUBARRAYS
inferredcites →https://doi.org/10.1142/s0129626495000345openalex-snapshot
PARALLEL ALGORITHMS FOR MAXIMUM SUBSEQUENCE AND MAXIMUM SUBARRAY
inferredcites →https://doi.org/10.1145/12130.12142openalex-snapshot
Making data structures persistent
inferredcites →https://doi.org/10.1145/1244002.1244041openalex-snapshot
Analysis of air pollution (PM 10 ) and respiratory morbidity rate using K -maximum sub-array (2-D) algorithm
inferredcites →https://doi.org/10.1145/1465482.1465560openalex-snapshot
Validity of the single processor approach to achieving large scale computing capabilities
inferredcites →https://doi.org/10.1145/1968.381154openalex-snapshot
Programming pearls
inferredcites →https://doi.org/10.1145/233269.233311openalex-snapshot
Mining quantitative association rules in large relational tables
inferredcites →https://doi.org/10.1145/237814.237865openalex-snapshot
Purely functional representations of catenable sorted lists
inferredcites →https://doi.org/10.1145/321879.321884openalex-snapshot
Efficiency of a Good But Not Linear Set Union Algorithm
inferredcites →https://doi.org/10.1145/322203.322206openalex-snapshot
Information Bounds Are Weak in the Shortest Distance Problem
inferredcites →https://doi.org/10.1145/322217.322232openalex-snapshot
Parallel Prefix Computation
inferredcites →https://doi.org/10.1145/358234.381162openalex-snapshot
Programming pearls
inferredcites →https://doi.org/10.1145/360680.360691openalex-snapshot
Expected time bounds for selection
inferredcites →https://doi.org/10.1145/364099.364331openalex-snapshot
An improved equivalence algorithm
inferredcites →https://doi.org/10.1145/383891.383893openalex-snapshot
Data Mining with optimized two-dimensional association rules
inferredcites →https://doi.org/10.1145/6138.6151openalex-snapshot
Planar point location using persistent search trees
inferredcites →https://doi.org/10.1145/62.2160openalex-snapshot
Worst-case Analysis of Set Union Algorithms
inferredcites →https://doi.org/10.1145/800053.801938openalex-snapshot
Design of special-purpose VLSI chips
inferredcites →https://doi.org/10.1146/annurev.bb.20.060191.001135openalex-snapshot
Statistical Methods and Insights for Protein and DNA Sequences
inferredcites →https://doi.org/10.4018/978-1-59904-951-9.ch074openalex-snapshot
Algorithms for Data Mining
inferredcites →https://doi.org/10.4036/iis.2000.99openalex-snapshot
Algorithms for the Maximum Subarray Problem Based on Matrix Multiplication.
inferredcites →https://doi.org/10.5555/642150.642153openalex-snapshot
Partially persistent data structures of bounded degree with constant update time
inferredcites →https://doi.org/10.5860/choice.30-1561openalex-snapshot
Parallel algorithms: design and analysis
inferredcites →https://doi.org/10.7551/mitpress/12274.003.0027openalex-snapshot
Cramming More Components onto Integrated Circuits (1965)

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-319-21404-7_29openalex-snapshot
Efficient BSP/CGM Algorithms for the Maximum Subarray Sum and Related Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-93387-0_29openalex-snapshot
In-Region Authentication
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_65openalex-snapshot
A Sub-cubic Time Algorithm for the k-Maximum Subarray Problem
inferred← citeshttps://doi.org/10.1016/j.procs.2010.04.163openalex-snapshot
An efficient algorithm for the k maximum convex sums
inferred← citeshttps://doi.org/10.1016/j.procs.2011.04.139openalex-snapshot
An efficient algorithm for computing the K-overlapping maximum convex sum problem
inferred← citeshttps://doi.org/10.1016/j.procs.2012.04.081openalex-snapshot
Improved algorithms for the K overlapping maximum convex sum problem
inferred← citeshttps://doi.org/10.1016/j.procs.2015.05.421openalex-snapshot
Efficient BSP/CGM Algorithms for the Maximum Subsequence Sum and Related Problems 1
inferred← citeshttps://doi.org/10.1109/cibec.2012.6473291openalex-snapshot
High performance CUDA-based implementation for the 2D version of the Maximum Subarray Problem (MSP)
inferred← citeshttps://doi.org/10.1109/icip.2014.7025632openalex-snapshot
Optimal no-intersection multi-label binary localization for time series using totally unimodular linear programming
inferred← citeshttps://doi.org/10.1109/sbac-padw.2014.15openalex-snapshot
A Parallel Maximum Subarray Algorithm on GPUs
inferred← citeshttps://doi.org/10.1117/1.jei.22.4.043011openalex-snapshot
Maximum subarray algorithms for use in astronomical imaging
inferred← citeshttps://doi.org/10.1145/2843043.2843049openalex-snapshot
An efficient parallel algorithm for the maximum convex sum problem
inferred← citeshttps://doi.org/10.18653/v1/2020.aacl-main.18openalex-snapshot
BERT-Based Neural Collaborative Filtering and Fixed-Length Contiguous Tokens Explanation
inferred← citeshttps://doi.org/10.26021/1272openalex-snapshot
Efficient Algorithms for the Maximum Convex Sum Problem
inferred← citeshttps://doi.org/10.26021/8920openalex-snapshot
Sub-cubic Time Algorithm for the k-disjoint Maximum subarray Problem
inferred← citeshttps://doi.org/10.3390/a10010005openalex-snapshot
Efficient Algorithms for the Maximum Sum Problems
inferred← citeshttps://doi.org/10.48550/arxiv.0809.3528openalex-snapshot
Locating Restricted Facilities on Binary Maps
inferred← citeshttps://doi.org/10.5604/01.3001.0010.7507openalex-snapshot
MAXIMUM SUBARRAY PROBLEM OPTIMIZATION FOR SPECIFIC 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.