On the public citation graph

An empirical time analysis of evolutionary algorithms as C programs

0 signed · 56 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.1002/spe.4380231105openalex-snapshot
Engineering a sort function
inferredcites →https://doi.org/10.1002/spe.4380240602openalex-snapshot
Memory allocation costs in large C and C++ programs
inferredcites →https://doi.org/10.1007/3-540-45706-2_132openalex-snapshot
MALLBA: A Library of Skeletons for Combinatorial Optimisation
inferredcites →https://doi.org/10.1007/978-0-387-32833-1_341openalex-snapshot
Random Number Generation
inferredcites →https://doi.org/10.1007/978-1-84800-070-4openalex-snapshot
The Algorithm Design Manual
inferredcites →https://doi.org/10.1007/978-3-540-24777-7openalex-snapshot
Knapsack Problems
inferredcites →https://doi.org/10.1007/978-3-540-75867-9_96openalex-snapshot
The Influence of Data Implementation in the Performance of Evolutionary Algorithms
inferredcites →https://doi.org/10.1007/978-3-642-20364-0_10openalex-snapshot
Fitness-Probability Cloud and a Measure of Problem Hardness for Evolutionary Algorithms
inferredcites →https://doi.org/10.1007/978-3-642-21498-1_42openalex-snapshot
Implementation Matters: Programming Best Practices for Evolutionary Algorithms
inferredcites →https://doi.org/10.1007/s00500-010-0594-yopenalex-snapshot
Heterogeneous computing scheduling with evolutionary algorithms
inferredcites →https://doi.org/10.1007/s10710-011-9148-zopenalex-snapshot
Software review: the ECJ toolkit
inferredcites →https://doi.org/10.1007/s11633-007-0281-3openalex-snapshot
Time complexity of evolutionary algorithms for combinatorial optimization: A decade of results
inferredcites →https://doi.org/10.1016/0021-9991(81)90227-8openalex-snapshot
A very fast shift-register sequence random number generator
inferredcites →https://doi.org/10.1016/j.asoc.2011.09.022openalex-snapshot
A parallel micro evolutionary algorithm for heterogeneous computing and grid scheduling
inferredcites →https://doi.org/10.1016/j.parco.2006.06.007openalex-snapshot
Efficient parallel LAN/WAN algorithms for optimization. The mallba project
inferredcites →https://doi.org/10.1016/s0022-5193(87)80029-2openalex-snapshot
Towards a general theory of adaptive walks on rugged landscapes
inferredcites →https://doi.org/10.1016/s0167-5060(08)70356-xopenalex-snapshot
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
inferredcites →https://doi.org/10.1023/b:heur.0000026900.92269.ecopenalex-snapshot
ParadisEO: A Framework for the Reusable Design of Parallel and Distributed Metaheuristics
inferredcites →https://doi.org/10.1023/b:jmma.0000038617.09620.02openalex-snapshot
A Scatter Search Method for the Bi-Criteria Multi-dimensional {0,1}-Knapsack Problem using Surrogate Relaxation
inferredcites →https://doi.org/10.1093/comjnl/5.1.10openalex-snapshot
Quicksort
inferredcites →https://doi.org/10.1109/cec.2008.4630949openalex-snapshot
Solving one-billion-bit Noisy OneMax problem using Estimation Distribution Algorithm with Arithmetic Coding
inferredcites →https://doi.org/10.1109/hcw.2000.843743openalex-snapshot
Task execution time modeling for heterogeneous computing systems
inferredcites →https://doi.org/10.1109/icec.1998.700144openalex-snapshot
On the effectiveness of evolutionary search in high-dimensional NK-landscapes
inferredcites →https://doi.org/10.1109/iscit.2006.339882openalex-snapshot
Solving One-Million-Bit Problems using LZWGA
inferredcites →https://doi.org/10.1109/isda.2011.6121667openalex-snapshot
Time analysis of standard evolutionary algorithms as software programs
inferredcites →https://doi.org/10.1109/tevc.2004.823470openalex-snapshot
Running Time Analysis of Multiobjective Evolutionary Algorithms on Pseudo-Boolean Functions
inferredcites →https://doi.org/10.1109/tevc.2006.888929openalex-snapshot
A Runtime Analysis of Evolutionary Algorithms for Constrained Optimization Problems
inferredcites →https://doi.org/10.1109/tevc.2010.2083669openalex-snapshot
Evolutionary Improvement of Programs
inferredcites →https://doi.org/10.1109/tsmcb.2008.2012167openalex-snapshot
A New Approach for Analyzing Average Time Complexity of Population-Based Evolutionary Algorithms on Unimodal Problems
inferredcites →https://doi.org/10.1111/j.1475-3995.2012.00862.xopenalex-snapshot
Parallel metaheuristics: recent advances and new trends
inferredcites →https://doi.org/10.1145/1026474.1026482openalex-snapshot
A practical adoption of partial redundancy elimination
inferredcites →https://doi.org/10.1145/1276958.1277077openalex-snapshot
Towards billion-bit optimization via a parallel estimation of distribution algorithm
inferredcites →https://doi.org/10.1145/1570256.1570346openalex-snapshot
Application of a simple binary genetic algorithm to a noiseless testbed benchmark
inferredcites →https://doi.org/10.1145/1830483.1830746openalex-snapshot
Can quantum search accelerate evolutionary algorithms?
inferredcites →https://doi.org/10.1145/2001858.2002142openalex-snapshot
Theory of swarm intelligence
inferredcites →https://doi.org/10.1145/272991.272995openalex-snapshot
Mersenne twister
inferredcites →https://doi.org/10.1145/800230.806987openalex-snapshot
Gprof
inferredcites →https://doi.org/10.1145/989393.989401openalex-snapshot
gprof
inferredcites →https://doi.org/10.1162/106365606776022751openalex-snapshot
Runtime Analysis of the (μ+1) EA on Simple Pseudo-Boolean Functions
inferredcites →https://doi.org/10.1198/tech.2004.s209openalex-snapshot
Handbook of Parametric and Nonparametric Statistical Procedures
inferredcites →https://doi.org/10.1287/opre.47.4.570openalex-snapshot
Core Problems in Knapsack Algorithms
inferredcites →https://doi.org/10.1887/0750308958openalex-snapshot
Handbook of Evolutionary Computation
inferredcites →https://doi.org/10.22237/jmasm/1051747320openalex-snapshot
Random Number Generators
inferredcites →https://doi.org/10.2307/2317055openalex-snapshot
The Art of Computer Programming. Volume 2: Seminumerical Algorithms.
inferredcites →https://doi.org/10.5860/choice.27-0936openalex-snapshot
Genetic algorithms in search, optimization, and machine learning
inferredcites →https://doi.org/10.5860/choice.34-6327openalex-snapshot
Handbook of parametric and nonparametric statistical procedures

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/spe.2476openalex-snapshot
EMP: execution time measurement protocol for compute‐bound programs
inferred← citeshttps://doi.org/10.1007/978-3-319-55849-3_44openalex-snapshot
Ranking Programming Languages for Evolutionary Algorithm Operations
inferred← citeshttps://doi.org/10.1007/978-3-319-65340-2_19openalex-snapshot
Estimating Energy Consumption in Evolutionary Algorithms by Means of FRBS
inferred← citeshttps://doi.org/10.1007/978-3-319-99241-9_4openalex-snapshot
How Can Metaheuristics Help Software Engineers?
inferred← citeshttps://doi.org/10.1109/cec.2016.7743980openalex-snapshot
A comparison of implementations of basic evolutionary algorithm operations in different languages
inferred← citeshttps://doi.org/10.1142/s0218194021500443openalex-snapshot
Metaheuristics and Software Engineering: Past, Present, and Future
inferred← citeshttps://doi.org/10.1145/3449726.3463276openalex-snapshot
Paradiseo: from a modular framework for evolutionary computation to the automated design of metaheuristics
inferred← citeshttps://doi.org/10.2298/csis180110026aopenalex-snapshot
A fuzzy rule-based system to predict energy consumption of genetic programming algorithms
inferred← citeshttps://doi.org/10.4018/978-1-5225-2255-3.ch669openalex-snapshot
Efficient Optimization Using Metaheuristics
inferred← citeshttps://doi.org/10.4018/978-1-5225-7598-6.ch119openalex-snapshot
Efficient Optimization Using Metaheuristics
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.