On the public citation graph
Combinatorial Register Allocation and Instruction Scheduling
0 signed · 105 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.1002/(sici)1097-024x(199608)26:8<929::aid-spe40>3.0.co;2-topenalex-snapshot
Optimal and Near-optimal Global Register Allocation Using 0-1 Integer Programming
inferredcites →https://doi.org/10.1002/cpe.1012openalex-snapshot
Optimal integrated code generation for VLIW architectures
inferredcites →https://doi.org/10.1002/nav.3800060205openalex-snapshot
An integer linear‐programming model for machine scheduling
inferredcites →https://doi.org/10.1007/11688839_19openalex-snapshot
SARA: Combining Stack Allocation and Register Allocation
inferredcites →https://doi.org/10.1007/11688839_20openalex-snapshot
Register Allocation for Programs in SSA-Form
inferredcites →https://doi.org/10.1007/3-540-46423-9_8openalex-snapshot
Simple Generation of Static Single-Assignment Form
inferredcites →https://doi.org/10.1007/3-540-48294-6_13openalex-snapshot
Translating Out of Static Single Assignment Form
inferredcites →https://doi.org/10.1007/978-1-4612-4380-9_16openalex-snapshot
Individual Comparisons by Ranking Methods
inferredcites →https://doi.org/10.1007/978-1-4615-2323-9_6openalex-snapshot
An ILP-Based Approach to Code Generation
inferredcites →https://doi.org/10.1007/978-3-540-30201-8_28openalex-snapshot
Global Constraints for Integer and Set Value Precedence
inferredcites →https://doi.org/10.1007/978-3-540-71229-9_9openalex-snapshot
Register Allocation and Optimal Spill Code Scheduling in Software Pipelined Loops Using 0-1 Integer Linear Programming Formulation
inferredcites →https://doi.org/10.1007/978-3-540-72521-3_20openalex-snapshot
Optimal Bitwise Register Allocation Using Integer Linear Programming
inferredcites →https://doi.org/10.1007/978-3-540-74061-2_10openalex-snapshot
A Framework for End-to-End Verification and Evaluation of Register Allocators
inferredcites →https://doi.org/10.1007/978-3-540-74970-7_38openalex-snapshot
MiniZinc: Towards a Standard CP Modelling Language
inferredcites →https://doi.org/10.1007/978-3-540-85958-1_4openalex-snapshot
Search Strategies for Rectangle Packing
inferredcites →https://doi.org/10.1007/978-3-540-85958-1_7openalex-snapshot
An Application of Constraint Programming to Superblock Instruction Scheduling
inferredcites →https://doi.org/10.1007/978-3-642-33558-7_54openalex-snapshot
Constraint-Based Register Allocation and Instruction Scheduling
inferredcites →https://doi.org/10.1007/978-3-642-37051-9_2openalex-snapshot
Optimal and Heuristic Global Code Motion for Minimal Spilling
inferredcites →https://doi.org/10.1007/bf01205181openalex-snapshot
Instruction-level parallel processing: History, overview, and perspective
inferredcites →https://doi.org/10.1007/s10601-011-9115-6openalex-snapshot
Optimal methods for resource allocation and scheduling: a cross-disciplinary survey
inferredcites →https://doi.org/10.1016/0096-0551(81)90048-5openalex-snapshot
Register allocation via coloring
inferredcites →https://doi.org/10.1016/0895-7177(93)90068-aopenalex-snapshot
Extending chip in order to solve complex scheduling and placement problems
inferredcites →https://doi.org/10.1016/0895-7177(94)90127-9openalex-snapshot
Introducing global constraints in CHIP
inferredcites →https://doi.org/10.1016/s0377-2217(02)00123-6openalex-snapshot
Two-dimensional packing problems: A survey
inferredcites →https://doi.org/10.1016/s0898-1221(97)00184-3openalex-snapshot
Using integer linear programming for instruction scheduling and register allocation in multi-issue processors
inferredcites →https://doi.org/10.1016/s1574-6526(06)x8001-xopenalex-snapshot
Handbook of Constraint Programming
inferredcites →https://doi.org/10.1023/a:1006314320276openalex-snapshot
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems
inferredcites →https://doi.org/10.1023/a:1008966522714openalex-snapshot
Phase-Coupled Mapping of Data Flow Graphs to Irregular Data Paths
inferredcites →https://doi.org/10.1109/ecrts.2011.10openalex-snapshot
WCET-aware Register Allocation Based on Integer-Linear Programming
inferredcites →https://doi.org/10.1109/ispass.2005.1430555openalex-snapshot
Measuring Program Similarity: Experiments with SPEC CPU Benchmark Suites
inferredcites →https://doi.org/10.1109/mm.2014.12openalex-snapshot
Hexagon DSP: An Architecture Optimized for Mobile Multimedia and Communications
inferredcites →https://doi.org/10.1142/s0218213008003765openalex-snapshot
OPTIMAL BASIC BLOCK INSTRUCTION SCHEDULING FOR MULTIPLE-ISSUE PROCESSORS USING CONSTRAINT PROGRAMMING
inferredcites →https://doi.org/10.1145/1133255.1134006openalex-snapshot
A global progressive register allocator
inferredcites →https://doi.org/10.1145/1133981.1134006openalex-snapshot
A global progressive register allocator
inferredcites →https://doi.org/10.1145/115372.115320openalex-snapshot
Efficiently computing static single assignment form and the control dependence graph
inferredcites →https://doi.org/10.1145/12276.13338openalex-snapshot
Global register allocation at link time
inferredcites →https://doi.org/10.1145/1375581.1375609openalex-snapshot
Register allocation by puzzle solving
inferredcites →https://doi.org/10.1145/1543820.1543824openalex-snapshot
Register allocation deconstructed
inferredcites →https://doi.org/10.1145/1629395.1629408openalex-snapshot
Progressive spill code placement
inferredcites →https://doi.org/10.1145/1772954.1772980openalex-snapshot
Integrated instruction selection and register allocation for compact code generation exploiting freeform mixing of 16- and 32-bit instructions
inferredcites →https://doi.org/10.1145/2180887.2180896openalex-snapshot
Integrated Code Generation for Loops
inferredcites →https://doi.org/10.1145/2509420.2512432openalex-snapshot
Preallocation instruction scheduling with register pressure minimization using a combinatorial optimization approach
inferredcites →https://doi.org/10.1145/2591635.2667158openalex-snapshot
Code scheduling and register allocation in large basic blocks
inferredcites →https://doi.org/10.1145/2597809.2597815openalex-snapshot
Combinatorial spill code optimization and ultimate coalescing
inferredcites →https://doi.org/10.1145/2685392openalex-snapshot
Studying Optimal Spilling in the Light of SSA
inferredcites →https://doi.org/10.1145/285930.285985openalex-snapshot
Very long instruction work architectures and the ELI-512
inferredcites →https://doi.org/10.1145/2892208.2892211openalex-snapshot
Verified construction of static single assignment form
inferredcites →https://doi.org/10.1145/2892208.2892237openalex-snapshot
Register allocation and instruction scheduling in Unison
inferredcites →https://doi.org/10.1145/349299.349318openalex-snapshot
Optimal instruction scheduling using integer programming
inferredcites →https://doi.org/10.1145/378795.378854openalex-snapshot
Optimal spilling for CISC machines with few registers
inferredcites →https://doi.org/10.1145/502874.502896openalex-snapshot
Register allocation by priority-based coloring
inferredcites →https://doi.org/10.1145/502949.502896openalex-snapshot
Register allocation by priority-based coloring
inferredcites →https://doi.org/10.1145/513829.513851openalex-snapshot
Compiling with code-size constraints
inferredcites →https://doi.org/10.1145/513829.513854openalex-snapshot
Register allocation for irregular architectures
inferredcites →https://doi.org/10.1145/53990.53999openalex-snapshot
Minimizing register usage penalty at procedure calls
inferredcites →https://doi.org/10.1145/55364.55407openalex-snapshot
Code scheduling and register allocation in large basic blocks
inferredcites →https://doi.org/10.1145/800046.801649openalex-snapshot
Very Long Instruction Word architectures and the ELI-512
inferredcites →https://doi.org/10.1145/960116.53999openalex-snapshot
Minimizing register usage penalty at procedure calls
inferredcites →https://doi.org/10.1145/989393.989415openalex-snapshot
Global register allocation at link time
inferredcites →https://doi.org/10.1287/ijoc.6.4.445openalex-snapshot
Preprocessing and Probing Techniques for Mixed Integer Programming Problems
inferredcites →https://doi.org/10.1287/opre.8.2.219openalex-snapshot
On the Job-Shop Scheduling Problem
inferredcites →https://doi.org/10.2307/1412159openalex-snapshot
The Proof and Measurement of Association between Two Things
inferredcites →https://doi.org/10.2307/2583737openalex-snapshot
Integer and Combinatorial Optimization
inferredcites →https://doi.org/10.2307/3001968openalex-snapshot
Individual Comparisons by Ranking Methods
inferredcites →https://doi.org/10.5555/1331699.1331707openalex-snapshot
Optimal versus Heuristic Global Code Scheduling
inferredcites →https://doi.org/10.5555/254208.254233openalex-snapshot
An integrated approach to retargetable code generation
inferredcites →https://doi.org/10.5555/261693.261706openalex-snapshot
An efficient model for DSP code generation: performance, code size, estimated energy
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-030-58475-7_46openalex-snapshot
Constraint-Based Software Diversification for Efficient Mitigation of Code-Reuse Attacks
inferred← citeshttps://doi.org/10.1007/978-3-031-06794-5_54openalex-snapshot
Energy Reduction Method by Compiler Optimization
inferred← citeshttps://doi.org/10.1007/978-3-032-23456-8_13openalex-snapshot
Multi-dimensional Cost-Driven LDSP Instruction Scheduling Optimization
inferred← citeshttps://doi.org/10.1007/978-3-032-35248-4_10openalex-snapshot
CoDA: Constraint-Based Distance Adjustment Optimization for Distance-Based ISAs
inferred← citeshttps://doi.org/10.1016/j.cose.2023.103405openalex-snapshot
Thwarting code-reuse and side-channel attacks in embedded systems
inferred← citeshttps://doi.org/10.1016/j.jocs.2022.101711openalex-snapshot
QuOp_MPI: A framework for parallel simulation of quantum variational algorithms
inferred← citeshttps://doi.org/10.1016/j.sysarc.2026.103732openalex-snapshot
Series–parallel-loop decompositions of control-flow graphs
inferred← citeshttps://doi.org/10.1049/tje2.12368openalex-snapshot
Automatic constraint programming solver selection method based on machine learning for the cable tree wiring problem
inferred← citeshttps://doi.org/10.1109/access.2024.3439352openalex-snapshot
Graph Coloring Algorithm Based on Minimal Cost Graph Neural Network
inferred← citeshttps://doi.org/10.1109/cgo57630.2024.10444869openalex-snapshot
Instruction Scheduling for the GPU on the GPU
inferred← citeshttps://doi.org/10.1109/cgo68049.2026.11395221openalex-snapshot
Enabling Spill-Free Compilation via Affine-Based Live Range Reduction Optimization
inferred← citeshttps://doi.org/10.1109/csf57540.2023.00016openalex-snapshot
Securing Optimized Code Against Power Side Channels
inferred← citeshttps://doi.org/10.1109/iccad66269.2025.11240719openalex-snapshot
e-boost: Boosted E-Graph Extraction with Adaptive Heuristics and Exact Solving
inferred← citeshttps://doi.org/10.1109/tcad.2025.3649448openalex-snapshot
An Arbitrary Register Grouping Scheme for RISC-V Vector Extension: Compilation Support and Hardware Implementation
inferred← citeshttps://doi.org/10.1134/s0361768821070082openalex-snapshot
Development of DSL Compilers for Specialized Processors
inferred← citeshttps://doi.org/10.1145/3301489openalex-snapshot
Exploring an Alternative Cost Function for Combinatorial Register-Pressure-Aware Instruction Scheduling
inferred← citeshttps://doi.org/10.1145/3368826.3377918openalex-snapshot
Optimizing occupancy and ILP on the GPU using a combinatorial approach
inferred← citeshttps://doi.org/10.1145/3428197openalex-snapshot
Certified and efficient instruction scheduling: application to interlocked VLIW processors
inferred← citeshttps://doi.org/10.1145/3445814.3446724openalex-snapshot
PacketMill: toward per-Core 100-Gbps networking
inferred← citeshttps://doi.org/10.1145/3497776.3517767openalex-snapshot
Loner: utilizing the CPU vector datapath to process scalar integer data
inferred← citeshttps://doi.org/10.1145/3497776.3517771openalex-snapshot
Graph transformations for register-pressure-aware instruction scheduling
inferred← citeshttps://doi.org/10.1145/3505558openalex-snapshot
Register-Pressure-Aware Instruction Scheduling Using Ant Colony Optimization
inferred← citeshttps://doi.org/10.1145/3578360.3580261openalex-snapshot
Register Allocation for Compressed ISAs in LLVM
inferred← citeshttps://doi.org/10.1145/3669940.3707286openalex-snapshot
Faster Chaitin-like Register Allocation via Grammatical Decompositions of Control-Flow Graphs
inferred← citeshttps://doi.org/10.1145/3732771.3742715openalex-snapshot
Optimal Language Design is Hard: A Case Study in ECMAScript (JavaScript) Standardization
inferred← citeshttps://doi.org/10.1145/3779212.3790248openalex-snapshot
Wax: Optimizing Data Center Applications With Stale Profile
inferred← citeshttps://doi.org/10.15514/ispras-2020-32(5)-3openalex-snapshot
Accelerating the Development of DSL Compilers for Specialized Processors
inferred← citeshttps://doi.org/10.1613/jair.1.12848openalex-snapshot
Constraint-based Diversification of JOP Gadgets
inferred← citeshttps://doi.org/10.32604/csse.2023.026238openalex-snapshot
Algorithms for Pre-Compiling Programs by Parallel Compilers
inferred← citeshttps://doi.org/10.48550/arxiv.1910.02653openalex-snapshot
Checkmate: Breaking the Memory Wall with Optimal Tensor Rematerialization
inferred← citeshttps://doi.org/10.70675/4ca8962fz96b1z4291zbc7bz64918999dbe3openalex-snapshot
Optimized and formally-verified compilation for a VLIW processor
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.