Copertina

On the Average Runtime of an Open Source Binomial Random Variate Generation Algorithm

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autore principale:	Cicirello, Vincent A.
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Data Structures and Algorithms Mathematical Software 68Q25, 68Q87, 68W40, 60-04 F.2.1; G.3; G.4; I.1.2
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Algorithms for Generating Small Random Samples
di: Cicirello, Vincent A.
Pubblicazione: (2024)

Fast Gaussian Distributed Pseudorandom Number Generation in Java via the Ziggurat Algorithm
di: Cicirello, Vincent A.
Pubblicazione: (2024)

On (In)approximability of MaxMin Independent Set Reconfiguration
di: Hoang, Hung P., et al.
Pubblicazione: (2026)

Fast sampling of satisfying assignments from random $k$-SAT with applications to connectivity
di: Chen, Zongchen, et al.
Pubblicazione: (2022)

Extending Exact Integrality Gap Computations for the Metric TSP
di: Cook, William, et al.
Pubblicazione: (2026)

On the PLS-Completeness of $k$-Opt Local Search for the Traveling Salesman Problem
di: Heimann, Sophia, et al.
Pubblicazione: (2026)

Extending the Extension: Deterministic Algorithm for Non-monotone Submodular Maximization
di: Buchbinder, Niv, et al.
Pubblicazione: (2024)

The Bottom-Left Algorithm for the Strip Packing Problem
di: Hougardy, Stefan, et al.
Pubblicazione: (2024)

A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem
di: Heimann, Sophia, et al.
Pubblicazione: (2025)

Achieving Tight $O(4^k)$ Runtime Bounds on Jump$_k$ by Proving that Genetic Algorithms Evolve Near-Maximal Population Diversity
di: Opris, Andre, et al.
Pubblicazione: (2024)

Runtime Analyses of NSGA-III on Many-Objective Problems
di: Opris, Andre, et al.
Pubblicazione: (2024)

The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$
di: Heimann, Sophia, et al.
Pubblicazione: (2024)

A First Runtime Analysis of the PAES-25: An Enhanced Variant of the Pareto Archived Evolution Strategy
di: Opris, Andre
Pubblicazione: (2025)

On the Average-Case Performance of Greedy for Maximum Coverage
di: Balkanski, Eric, et al.
Pubblicazione: (2026)

Design, Configuration, Implementation, and Performance of a Simple 32 Core Raspberry Pi Cluster
di: Cicirello, Vincent A.
Pubblicazione: (2017)

An Explicit and Efficient $O(n^2)$-Time Algorithm for Sorting Sumsets
di: Mundhra, S.
Pubblicazione: (2025)

Submodular Maximization over a Matroid $k$-Intersection: Multiplicative Improvement over Greedy
di: Feldman, Moran, et al.
Pubblicazione: (2026)

Many Objective Problems Where Crossover is Provably Essential
di: Opris, Andre
Pubblicazione: (2024)

Optimal rolling of fair dice using fair coins
di: Huber, Mark, et al.
Pubblicazione: (2024)

Probabilistic Analysis of Edge Elimination for Euclidean TSP
di: Zhong, Xianghui
Pubblicazione: (2018)

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
di: DasGupta, Bhaskar, et al.
Pubblicazione: (2026)

Complete Decomposition of Symmetric Tensors in Linear Time and Polylogarithmic Precision
di: Koiran, Pascal, et al.
Pubblicazione: (2022)

Advances in Quantum Genetic Algorithms
di: Lima, Dennis, et al.
Pubblicazione: (2025)

How to Compute a Moving Sum
di: Maslen, David K., et al.
Pubblicazione: (2025)

Revisiting Chazelle's Implementation of the Bottom-Left Heuristic: A Corrected and Rigorous Analysis
di: Michel, Stefan
Pubblicazione: (2025)

On the twin-width of near-regular graphs
di: Heinrich, Irene, et al.
Pubblicazione: (2025)

Low-temperature Sampling on Sparse Random Graphs
di: Galanis, Andreas, et al.
Pubblicazione: (2025)

On the Approximation Ratio of the $k$-Opt and Lin-Kernighan Algorithm
di: Zhong, Xianghui
Pubblicazione: (2019)

Efficient Binary Decision Diagram Manipulation in External Memory
di: Sølvsten, Steffan Christ, et al.
Pubblicazione: (2021)

The Quasi-probability Method and Applications for Trace Reconstruction
di: Rubinstein, Ittai
Pubblicazione: (2024)

Near-Optimal Bootstrapping of Hitting Sets for Algebraic Models
di: Kumar, Mrinal, et al.
Pubblicazione: (2018)

Exact Set Packing in Multimodal Transportation with Ridesharing System for First/Last Mile
di: Gu, Qian-Ping, et al.
Pubblicazione: (2025)

A Space-Efficient Algorithm for Longest Common Almost Increasing Subsequence of Two Sequences
di: Rahat, Md Tanzeem, et al.
Pubblicazione: (2025)

Safety-Certified CRT Sparse FFT: $Ω(k^2)$ Lower Bound and $O(N \log N)$ Worst-Case
di: Flouro, Aaron R., et al.
Pubblicazione: (2026)

Formal Foundations for Controlled Stochastic Activity Networks
di: Movaghar, Ali
Pubblicazione: (2025)

Planting and MCMC Sampling from the Potts model
di: Galanis, Andreas, et al.
Pubblicazione: (2024)

A 13/6-Approximation for Strip Packing via the Bottom-Left Algorithm
di: Hougardy, Stefan, et al.
Pubblicazione: (2025)

Predicting Memory Demands of BDD Operations using Maximum Graph Cuts (Extended Paper)
di: Sølvsten, Steffan Christ, et al.
Pubblicazione: (2023)

A Simple and Efficient Algorithm for Sorting Signed Permutations by Reversals
di: Swenson, Krister M.
Pubblicazione: (2024)

Exact Dynamic Programming for Solow--Polasky Diversity Subset Selection on Lines and Staircases
di: Emmerich, Michael T. M.
Pubblicazione: (2026)