On the public citation graph
Stochastic program optimization
0 signed · 45 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/978-3-540-73368-3_52openalex-snapshot
A Decision Procedure for Bit-Vectors and Arrays
inferredcites →https://doi.org/10.1023/a:1020281327116openalex-snapshot
An Introduction to MCMC for Machine Learning
inferredcites →https://doi.org/10.1080/00401706.1997.10485132openalex-snapshot
Markov Chain Monte Carlo in Practice
inferredcites →https://doi.org/10.1093/biomet/57.1.97openalex-snapshot
Monte Carlo sampling methods using Markov chains and their applications
inferredcites →https://doi.org/10.1145/1168857.1168907openalex-snapshot
Combinatorial sketching for finite programs
inferredcites →https://doi.org/10.1145/1390156openalex-snapshot
Proceedings of the 25th international conference on Machine learning - ICML '08
inferredcites →https://doi.org/10.1145/1993498.1993506openalex-snapshot
Synthesis of loop-free programs
inferredcites →https://doi.org/10.1145/2509136.2509509openalex-snapshot
Data-driven equivalence checking
inferredcites →https://doi.org/10.1145/2594291.2594302openalex-snapshot
Stochastic optimization of floating-point programs with tunable precision
inferredcites →https://doi.org/10.1145/36206.36194openalex-snapshot
Superoptimizer: a look at the smallest program
inferredcites →https://doi.org/10.1145/567806.567807openalex-snapshot
An updated set of basic linear algebra subprograms (BLAS)
inferredcites →https://doi.org/10.2168/lmcs-7(1:10)2011openalex-snapshot
Equality Saturation: A New Approach to Optimization
inferredcites →https://doi.org/10.5555/1855741.1855754openalex-snapshot
Binary translation using peephole superoptimizers
inferredcites →https://doi.org/10.5555/1855741.1855756openalex-snapshot
KLEE: unassisted and automatic generation of high-coverage tests for complex systems programs
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-25540-4_15openalex-snapshot
Efficient Synthesis with Probabilistic Constraints
inferred← citeshttps://doi.org/10.1007/978-3-030-25540-4_18openalex-snapshot
Proving Unrealizability for Syntax-Guided Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-030-99524-9_24openalex-snapshot
cvc5: A Versatile and Industrial-Strength SMT Solver
inferred← citeshttps://doi.org/10.1007/978-3-032-07106-4_10openalex-snapshot
Enhancing Neural Network Robustness via Synthesis of Repair Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-96145-3_21openalex-snapshot
Syntax-Guided Synthesis with Quantitative Syntactic Objectives
inferred← citeshttps://doi.org/10.1016/j.ijdrr.2023.104213openalex-snapshot
A data-driven, scenario-based human evacuation model for passenger ships addressing hybrid uncertainty
inferred← citeshttps://doi.org/10.1021/acs.jctc.2c00035openalex-snapshot
Program Synthesis of Sparse Algorithms for Wave Function and Energy Prediction in Grid-Based Quantum Simulations
inferred← citeshttps://doi.org/10.1109/cgo51591.2021.9370322openalex-snapshot
ANGHABENCH: A Suite with One Million Compilable C Benchmarks for Code-Size Reduction
inferred← citeshttps://doi.org/10.1109/dac63849.2025.11133351openalex-snapshot
Approximate SMT Counting Beyond Discrete Domains
inferred← citeshttps://doi.org/10.1109/icse55347.2025.00203openalex-snapshot
Large Language Models for Safe Minimization
inferred← citeshttps://doi.org/10.1109/iiswc59245.2023.00023openalex-snapshot
Facile: Fast, Accurate, and Interpretable Basic-Block Throughput Prediction
inferred← citeshttps://doi.org/10.1145/3290386openalex-snapshot
FrAngel: component-based synthesis with control structures
inferred← citeshttps://doi.org/10.1145/3412382.3458266openalex-snapshot
Deep Functional Network (DFN)
inferred← citeshttps://doi.org/10.1145/3453483.3454071openalex-snapshot
Adaptive restarts for stochastic synthesis
inferred← citeshttps://doi.org/10.1145/3503222.3507714openalex-snapshot
Vector instruction selection for digital signal processors using program synthesis
inferred← citeshttps://doi.org/10.1145/3623278.3624768openalex-snapshot
Fast Instruction Selection for Fast Digital Signal Processing
inferred← citeshttps://doi.org/10.14722/ndss.2019.23170openalex-snapshot
Establishing Software Root of Trust Unconditionally
inferred← citeshttps://doi.org/10.1609/aaai.v33i01.33012362openalex-snapshot
Stepping Stones to Inductive Synthesis of Low-Level Looping Programs
inferred← citeshttps://doi.org/10.24963/ijcai.2019/847openalex-snapshot
Synthesizing Datalog Programs using Numerical Relaxation
inferred← citeshttps://doi.org/10.3138/cpp.2018-011openalex-snapshot
All Companies Are Technology Companies: Preparing Canadians with the Skills for a Digital Future
inferred← citeshttps://doi.org/10.3929/ethz-b-000466244openalex-snapshot
Guiding Program Synthesis by Learning to Generate Examples
inferred← citeshttps://doi.org/10.48550/arxiv.1909.05964openalex-snapshot
Quantitative Programming by Examples
inferred← citeshttps://doi.org/10.48550/arxiv.2001.09995openalex-snapshot
Automated Parallel Kernel Extraction from Dynamic Application Traces
inferred← citeshttps://doi.org/10.48550/arxiv.2008.12613openalex-snapshot
Type-driven Neural Programming by Example
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.