On the public citation graph

Determining the minimum iteration period of an algorithm

0 signed · 59 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.1016/0012-365x(78)90011-0openalex-snapshot
A characterization of the minimum cycle mean in a digraph
inferredcites →https://doi.org/10.1016/0165-1684(85)90048-9openalex-snapshot
VLSI and modern signal processing
inferredcites →https://doi.org/10.1016/0898-1221(78)90043-3openalex-snapshot
Combinatorial algorithms: Theory and practice
inferredcites →https://doi.org/10.1109/12.73588openalex-snapshot
Static rate-optimal scheduling of iterative data-flow programs via optimum unfolding
inferredcites →https://doi.org/10.1109/5.48830openalex-snapshot
Algorithm transformation techniques for concurrent processors
inferredcites →https://doi.org/10.1109/78.285640openalex-snapshot
Pipelining of lattice IIR digital filters
inferredcites →https://doi.org/10.1109/81.109243openalex-snapshot
A polynomial time algorithm for the computation of the iteration-period bound in recursive data flow graphs
inferredcites →https://doi.org/10.1109/81.244917openalex-snapshot
Iteration bounds of single-rate data flow graphs for concurrent processing
inferredcites →https://doi.org/10.1109/apccas.1994.514543openalex-snapshot
Determining the iteration bounds of single-rate and multi-rate data-flow graphs
inferredcites →https://doi.org/10.1109/asap.1993.397122openalex-snapshot
A novel framework for multi-rate scheduling in DSP applications
inferredcites →https://doi.org/10.1109/icassp.1984.1172406openalex-snapshot
A graph theoretic technique for the generation of systolic implementations for shift-invariant flow graphs
inferredcites →https://doi.org/10.1109/tc.1987.5009446openalex-snapshot
Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing
inferredcites →https://doi.org/10.1109/tcs.1981.1084972openalex-snapshot
The maximum sampling rate of digital filters under hardware speed constraints
inferredcites →https://doi.org/10.1109/vlsisp.1993.404488openalex-snapshot
A scheduling framework for minimizing memory requirements of multirate DSP systems represented as dataflow graphs
inferredcites →https://doi.org/10.21236/ada142251openalex-snapshot
A Graph Theoretic Technique for the Generation of Systolic Implementations for Shift-Invariant Flow Graphs.

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-1-4419-6345-1_28openalex-snapshot
Signal Flow Graphs and Data Flow Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4614-6859-2_39openalex-snapshot
Signal Flow Graphs and Data Flow Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4757-4419-4_6openalex-snapshot
Overlapped Scheduling Techniques for High-Level Synthesis and Multiprocessor Realizations of DSP Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-01929-6_4openalex-snapshot
Throughput Constraint for Synchronous Data Flow Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-03095-6_44openalex-snapshot
Unfolding of Multirate Data-Flow Graph to Compute Iteration Bound
inferred← citeshttps://doi.org/10.1007/978-3-642-11515-8_9openalex-snapshot
Buffer Sizing for Self-timed Stream Programs on Heterogeneous Distributed Memory Multiprocessors
inferred← citeshttps://doi.org/10.1007/s10898-016-0487-4openalex-snapshot
Fractional 0–1 programming: applications and algorithms
inferred← citeshttps://doi.org/10.1016/j.artint.2013.09.006openalex-snapshot
CROSS cyclic resource-constrained scheduling solver
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2004.11.005openalex-snapshot
High level synthesis of integrated heterogeneous pipelined processing elements for DSP applications
inferred← citeshttps://doi.org/10.1016/j.jpdc.2013.05.004openalex-snapshot
Maximum-throughput mapping of SDFGs on multi-core SoC platforms
inferred← citeshttps://doi.org/10.1016/j.mcm.2007.05.009openalex-snapshot
Deadline constrained cyclic scheduling on pipelined dedicated processors considering multiprocessor tasks and changeover times
inferred← citeshttps://doi.org/10.1109/43.728912openalex-snapshot
Faster maximum and minimum mean cycle algorithms for system-performance analysis
inferred← citeshttps://doi.org/10.1109/asap.2004.1342454openalex-snapshot
Modeling and scheduling parallel data flow systems sing structured systems of recurrence equations
inferred← citeshttps://doi.org/10.1109/asap.2004.29openalex-snapshot
Modeling and scheduling parallel data flow systems using structured systems of recurrence equations
inferred← citeshttps://doi.org/10.1109/cscloud-edgecom49738.2020.00036openalex-snapshot
Cost Minimization for Music Uploading to a Cloudlet
inferred← citeshttps://doi.org/10.1109/dac.1999.781227openalex-snapshot
Efficient algorithms for optimum cycle mean and optimum cost to time ratio problems
inferred← citeshttps://doi.org/10.1109/dsd.2018.00011openalex-snapshot
Exploring Power and Throughput for Dataflow Applications on Predictable NoC Multiprocessors
inferred← citeshttps://doi.org/10.1109/icacrs58579.2023.10405266openalex-snapshot
Efficient Method for Computing Critical Path Delay using Longest Path Matrix Algorithm
inferred← citeshttps://doi.org/10.1109/icassp.1997.599853openalex-snapshot
An upper bound of the throughput of multirate multiprocessor schedules
inferred← citeshttps://doi.org/10.1109/iccad51958.2021.9643567openalex-snapshot
LayerPipe: Accelerating Deep Neural Network Training by Intra-Layer and Inter-Layer Gradient Pipelining and Multiprocessor Scheduling
inferred← citeshttps://doi.org/10.1109/icniconsmcl.2006.8openalex-snapshot
A Criterion for Speed Evaluation of Content Inspection Engines
inferred← citeshttps://doi.org/10.1109/ieeeconf67917.2025.11443520openalex-snapshot
LayerPipe2: Multistage Pipelining and Weight Recompute via Improved Exponential Moving Average for Training Neural Networks
inferred← citeshttps://doi.org/10.1109/infocom.2006.281openalex-snapshot
Two Level State Machine Architecture for Content Inspection Engines
inferred← citeshttps://doi.org/10.1109/iscas.1999.780176openalex-snapshot
Scheduling of DSP data flow graphs onto multiprocessors for maximum throughput
inferred← citeshttps://doi.org/10.1109/iscas45731.2020.9181242openalex-snapshot
A Gradient-Interleaved Scheduler for Energy-Efficient Backpropagation for Training Neural Networks
inferred← citeshttps://doi.org/10.1109/ispa.2001.938664openalex-snapshot
An optimal software-pipelining method for instruction-level parallel processors based on scaled retiming
inferred← citeshttps://doi.org/10.1109/seaa.2012.20openalex-snapshot
Max-Plus Algebraic Throughput Analysis of Synchronous Dataflow Graphs
inferred← citeshttps://doi.org/10.1109/tcsi.2023.3246468openalex-snapshot
InterGrad: Energy-Efficient Training of Convolutional Neural Networks via Interleaved Gradient Scheduling
inferred← citeshttps://doi.org/10.1109/tsp.2004.826178openalex-snapshot
The hierarchical timing pair model for multirate DSP applications
inferred← citeshttps://doi.org/10.1109/tsp.2013.2251339openalex-snapshot
Low-Latency Sequential and Overlapped Architectures for Successive Cancellation Polar Decoder
inferred← citeshttps://doi.org/10.1145/1027084.1027085openalex-snapshot
Experimental analysis of the fastest optimum cycle ratio and mean algorithms
inferred← citeshttps://doi.org/10.1145/1450135.1450189openalex-snapshot
Slack analysis in the system design loop
inferred← citeshttps://doi.org/10.1145/296333.296338openalex-snapshot
A timing-driven design and validation methodology for embedded real-time systems
inferred← citeshttps://doi.org/10.1145/3023973.3023977openalex-snapshot
Throughput Propagation in Constraint-Based Design Space Exploration for Mixed-Criticality Systems
inferred← citeshttps://doi.org/10.1145/309847.309862openalex-snapshot
Efficient algorithms for optimum cycle mean and optimum cost to time ratio problems
inferred← citeshttps://doi.org/10.1145/3133210openalex-snapshot
Flexible and Tradeoff-Aware Constraint-Based Design Space Exploration for Streaming Applications on Heterogeneous Platforms
inferred← citeshttps://doi.org/10.1155/s1110865702205053openalex-snapshot
High-Level Synthesis of DSP Applications Using Adaptive Negative Cycle Detection
inferred← citeshttps://doi.org/10.14279/depositonce-2036openalex-snapshot
A hierarchical control structure for a class of timed discrete event systems
inferred← citeshttps://doi.org/10.22215/etd/2008-06297openalex-snapshot
High performance transducer architecture for content inspection engines
inferred← citeshttps://doi.org/10.4018/978-1-4666-8737-0.ch009openalex-snapshot
Signal Processing
inferred← citeshttps://doi.org/10.4204/eptcs.72.8openalex-snapshot
Computing Optimal Cycle Mean in Parallel on CUDA
inferred← citeshttps://doi.org/10.5281/zenodo.1080184openalex-snapshot
Computing The Loop Bound In Iterative Data Flow Graphs Using Natural Token Flow
inferred← citeshttps://doi.org/10.5821/dissertation-2117-94642openalex-snapshot
Running stream-like programs on heterogeneous multi-core systems
inferred← citeshttps://doi.org/10.6092/unibo/amsdottorato/5503openalex-snapshot
Constraint based methods for allocation and scheduling of periodic applications
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.