On the public citation graph
Heavy-tailed distributions in combinatorial search
0 signed · 133 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/3-540-61532-6_22openalex-snapshot
Validity of normality assumption in CSP research
inferredcites →https://doi.org/10.1007/978-1-4757-2763-0_14openalex-snapshot
The variation of certain speculative prices
inferredcites →https://doi.org/10.1016/0004-3702(92)90020-xopenalex-snapshot
A generic arc-consistency algorithm and its specializations
inferredcites →https://doi.org/10.1016/0004-3702(94)90109-0openalex-snapshot
Easy problems are sometimes hard
inferredcites →https://doi.org/10.1016/0004-3702(95)00044-5openalex-snapshot
Phase transitions and the search problem
inferredcites →https://doi.org/10.1016/0004-3702(95)00047-xopenalex-snapshot
The satisfiability constraint gap
inferredcites →https://doi.org/10.1016/0004-3702(95)00052-6openalex-snapshot
Locating the phase transition in binary constraint satisfaction problems
inferredcites →https://doi.org/10.1016/0004-3702(95)00054-2openalex-snapshot
A study of complexity transitions on the asymmetric traveling salesman problem
inferredcites →https://doi.org/10.1016/0004-3702(95)00056-9openalex-snapshot
Critical behavior in the computational cost of satisfiability testing
inferredcites →https://doi.org/10.1016/0097-3165(80)90078-3openalex-snapshot
Completing partial latin squares
inferredcites →https://doi.org/10.1016/0097-3165(83)90031-6openalex-snapshot
Embedding partial steiner triple systems is NP-complete
inferredcites →https://doi.org/10.1016/0304-4076(95)01791-7openalex-snapshot
On the robustness of nonlinearity tests to moment condition failure
inferredcites →https://doi.org/10.1016/c2014-0-03412-0openalex-snapshot
Latin Squares and their Applications
inferredcites →https://doi.org/10.1080/01621459.1976.10480344openalex-snapshot
A Method for Simulating Stable Random Variables
inferredcites →https://doi.org/10.1086/294632openalex-snapshot
The Variation of Certain Speculative Prices
inferredcites →https://doi.org/10.1090/mmono/065openalex-snapshot
One-Dimensional Stable Distributions
inferredcites →https://doi.org/10.1093/ej/31.121.133openalex-snapshot
Journal of the Royal Statistical Society.
inferredcites →https://doi.org/10.1111/j.2517-6161.1982.tb01183.xopenalex-snapshot
On Some Simple Estimates of an Exponent of Regular Variation
inferredcites →https://doi.org/10.1126/science.264.5163.1297openalex-snapshot
Critical Behavior in the Satisfiability of Random Boolean Expressions
inferredcites →https://doi.org/10.1126/science.275.5296.51openalex-snapshot
An Economics Approach to Hard Computational Problems
inferredcites →https://doi.org/10.1145/359094.359101openalex-snapshot
New methods to color the vertices of a graph
inferredcites →https://doi.org/10.1201/9780203738818openalex-snapshot
Stable Non-Gaussian Random Processes
inferredcites →https://doi.org/10.2307/2291104openalex-snapshot
Stable Non-Gaussian Random Processes: Stochastic Models with Infinite Variance.
inferredcites →https://doi.org/10.2307/2525289openalex-snapshot
The Pareto-Levy Law and the Distribution of Income
inferredcites →https://doi.org/10.4018/978-1-59904-849-9openalex-snapshot
Encyclopedia of Artificial Intelligence
inferredcites →https://doi.org/10.4153/cjm-1989-049-4openalex-snapshot
The Non-Existence of Finite Projective Planes of Order 10
inferredcites →https://doi.org/10.5860/choice.33-1577openalex-snapshot
Artificial intelligence: a modern approach
inferredcites →https://doi.org/10.7551/mitpress/2122.001.0001openalex-snapshot
Constraint-Based Reasoning
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11493853_9openalex-snapshot
Identifying and Exploiting Problem Structures Using Explanation-Based Constraint Programming
inferred← citeshttps://doi.org/10.1007/11564751_26openalex-snapshot
Search Heuristics and Heavy-Tailed Behaviour
inferred← citeshttps://doi.org/10.1007/11814948_12openalex-snapshot
A Complete Random Jump Strategy with Guiding Paths
inferred← citeshttps://doi.org/10.1007/11889205_58openalex-snapshot
Dynamic Symmetry Breaking Restarted
inferred← citeshttps://doi.org/10.1007/3-540-45578-7_10openalex-snapshot
Capturing Structure with Satisfiability
inferred← citeshttps://doi.org/10.1007/3-540-45578-7_28openalex-snapshot
Formal Models of Heavy-Tailed Behavior in Combinatorial Search
inferred← citeshttps://doi.org/10.1007/3-540-46014-4_7openalex-snapshot
On Algorithms for Decomposable Constraints
inferred← citeshttps://doi.org/10.1007/3-540-46135-3_38openalex-snapshot
Restart Policies with Dependence among Runs: A Dynamic Programming Approach
inferred← citeshttps://doi.org/10.1007/978-1-4419-8917-8_8openalex-snapshot
Randomized Backtrack Search
inferred← citeshttps://doi.org/10.1007/978-3-030-58475-7_18openalex-snapshot
Towards Faster Reasoners by Using Transparent Huge Pages
inferred← citeshttps://doi.org/10.1007/978-3-030-75762-5_13openalex-snapshot
Algorithm Selection as Superset Learning: Constructing Algorithm Selectors from Imprecise Performance Data
inferred← citeshttps://doi.org/10.1007/978-3-030-78230-6_8openalex-snapshot
Heavy-Tails and Randomized Restarting Beam Search in Goal-Oriented Neural Sequence Decoding
inferred← citeshttps://doi.org/10.1007/978-3-319-06089-7_11openalex-snapshot
A Bit-Encoding Phase Selection Strategy for Satisfiability Solvers
inferred← citeshttps://doi.org/10.1007/978-3-319-41842-1_12openalex-snapshot
DPLL: The Core of Modern Satisfiability Solvers
inferred← citeshttps://doi.org/10.1007/978-3-319-66263-3_5openalex-snapshot
On the Community Structure of Bounded Model Checking SAT Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-67504-6openalex-snapshot
Algorithmic Decision Theory
inferred← citeshttps://doi.org/10.1007/978-3-319-73117-9_35openalex-snapshot
Runtime Distributions and Criteria for Restarts
inferred← citeshttps://doi.org/10.1007/978-3-319-93031-2_18openalex-snapshot
Model Agnostic Solution of CSPs via Deep Learning: A Preliminary Study
inferred← citeshttps://doi.org/10.1007/978-3-540-30201-8_17openalex-snapshot
Heuristic Selection for Stochastic Search Optimization: Modeling Solution Quality by Extreme Value Theory
inferred← citeshttps://doi.org/10.1007/978-3-540-30201-8_58openalex-snapshot
How Much Backtracking Does It Take to Color Random Graphs? Rigorous Results on Heavy Tails
inferred← citeshttps://doi.org/10.1007/978-3-540-30201-8_6openalex-snapshot
Statistical Regimes Across Constrainedness Regions
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_48openalex-snapshot
On Universal Restart Strategies for Backtracking Search
inferred← citeshttps://doi.org/10.1007/978-3-540-85958-1_38openalex-snapshot
Model Restarts for Structural Symmetry Breaking
inferred← citeshttps://doi.org/10.1007/978-3-540-85958-1_7openalex-snapshot
An Application of Constraint Programming to Superblock Instruction Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-642-01929-6_6openalex-snapshot
Backdoors to Combinatorial Optimization: Feasibility and Optimality
inferred← citeshttps://doi.org/10.1007/978-3-642-02777-2_32openalex-snapshot
Width-Based Restart Policies for Clause-Learning Satisfiability Solvers
inferred← citeshttps://doi.org/10.1007/978-3-642-04244-7_51openalex-snapshot
On the Power of Clause-Learning SAT Solvers with Restarts
inferred← citeshttps://doi.org/10.1007/978-3-642-14186-7_4openalex-snapshot
Lower Bounds for Width-Restricted Clause Learning on Small Width Formulas
inferred← citeshttps://doi.org/10.1007/978-3-642-21581-0_18openalex-snapshot
Between Restarts and Backjumps
inferred← citeshttps://doi.org/10.1007/978-3-642-21581-0_27openalex-snapshot
Empirical Study of the Anatomy of Modern Sat Solvers
inferred← citeshttps://doi.org/10.1007/978-3-642-24769-9_49openalex-snapshot
Domain-Splitting Generalized Nogoods from Restarts
inferred← citeshttps://doi.org/10.1007/978-3-642-31612-8_4openalex-snapshot
Off the Trail: Re-examining the CDCL Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-33119-0_5openalex-snapshot
On the Application of SAT Solvers to the Test Suite Minimization Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-33558-7_52openalex-snapshot
A Hybrid Paradigm for Adaptive Parallel Search
inferred← citeshttps://doi.org/10.1007/978-3-642-34413-8_23openalex-snapshot
Learning Algorithm Portfolios for Parallel Execution
inferred← citeshttps://doi.org/10.1007/978-3-642-38171-3_28openalex-snapshot
An Adaptive Model Restarts Heuristic
inferred← citeshttps://doi.org/10.1007/978-3-642-39071-5_5openalex-snapshot
Exponential Separations in a Hierarchy of Clause Learning Proof Systems
inferred← citeshttps://doi.org/10.1007/s00224-021-10041-0openalex-snapshot
Restart Strategies in a Continuous Setting
inferred← citeshttps://doi.org/10.1007/s10472-004-9417-0openalex-snapshot
On SAT Instance Classes and a Method for Reliable Performance Experiments with SAT Solvers
inferred← citeshttps://doi.org/10.1007/s10472-015-9459-5openalex-snapshot
Portfolio approaches for constraint optimization problems
inferred← citeshttps://doi.org/10.1007/s10601-005-2807-zopenalex-snapshot
Statistical Regimes Across Constrainedness Regions
inferred← citeshttps://doi.org/10.1007/s10601-006-8061-1openalex-snapshot
The Impact of Search Heuristics on Heavy-Tailed Behaviour
inferred← citeshttps://doi.org/10.1007/s10601-006-9002-8openalex-snapshot
Identifying and Exploiting Problem Structures Using Explanation-based Constraint Programming
inferred← citeshttps://doi.org/10.1007/s10732-005-6997-8openalex-snapshot
Enhancing Stochastic Search Performance by Value-Biased Randomization of Heuristics
inferred← citeshttps://doi.org/10.1007/s10732-010-9146-yopenalex-snapshot
Generating highly balanced sudoku problems as hard problems
inferred← citeshttps://doi.org/10.1007/s10994-022-06161-4openalex-snapshot
Algorithm selection on a meta level
inferred← citeshttps://doi.org/10.1007/s40840-022-01317-wopenalex-snapshot
Modeling Right-skewed Heavy-tail Right-censored Survival Data with Application to HIV Viral Load
inferred← citeshttps://doi.org/10.1007/springerreference_65540openalex-snapshot
Probabilistic Analysis
inferred← citeshttps://doi.org/10.1016/j.artint.2010.10.002openalex-snapshot
On the power of clause-learning SAT solvers as resolution engines
inferred← citeshttps://doi.org/10.1016/j.cor.2008.08.017openalex-snapshot
A generative power-law search tree model
inferred← citeshttps://doi.org/10.1016/j.dam.2005.10.020openalex-snapshot
Regular-SAT: A many-valued approach to solving combinatorial problems
inferred← citeshttps://doi.org/10.1016/j.orl.2010.10.003openalex-snapshot
On algorithm portfolios and restart strategies
inferred← citeshttps://doi.org/10.1016/s1574-6526(07)03002-7openalex-snapshot
Chapter 2 Satisfiability Solvers
inferred← citeshttps://doi.org/10.1017/s0269888900001090openalex-snapshot
Artificial intelligence and operations research: challenges and opportunities in planning and scheduling
inferred← citeshttps://doi.org/10.1017/s1471068411000275openalex-snapshot
Optimal placement of valves in a water distribution network with CLP(FD)
inferred← citeshttps://doi.org/10.1023/a:1006314320276openalex-snapshot
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1023/a:1006326723002openalex-snapshot
Logical Cryptanalysis as a SAT Problem
inferred← citeshttps://doi.org/10.1023/a:1006351428454openalex-snapshot
Implementing the Davis–Putnam Method
inferred← citeshttps://doi.org/10.1023/a:1011455027066openalex-snapshot
Robust Estimation of Tail Parameters for Two-Parameter Pareto and Exponential Models via Generalized Quantile Statistics
inferred← citeshttps://doi.org/10.1023/a:1018946526109openalex-snapshot
Parallel cooperative propositional theorem proving
inferred← citeshttps://doi.org/10.1023/b:anor.0000032572.32788.daopenalex-snapshot
Approximations and Randomization to Boost CSP Techniques
inferred← citeshttps://doi.org/10.1038/22055openalex-snapshot
Determining computational complexity from characteristic ‘phase transitions’
inferred← citeshttps://doi.org/10.1051/ro:2007004openalex-snapshot
Des explications pour reconnaître et exploiter les structures cachées d'un problème combinatoire
inferred← citeshttps://doi.org/10.1080/03610910008813662openalex-snapshot
Estimation of the maximal moment exponent with censored data
inferred← citeshttps://doi.org/10.1080/03610920601033835openalex-snapshot
Information Measures for Some Well-Known Families
inferred← citeshttps://doi.org/10.1080/10920277.2000.10595935openalex-snapshot
Robust and Efficient Estimation of the Tail Index of a Single-Parameter Pareto Distribution
inferred← citeshttps://doi.org/10.1081/sta-120018188openalex-snapshot
Information Matrix for Pareto(IV), Burr, and Related Distributions
inferred← citeshttps://doi.org/10.1109/access.2021.3120597openalex-snapshot
Employee Scheduling With SAT-Based Pseudo-Boolean Constraint Solving
inferred← citeshttps://doi.org/10.1109/etfa46521.2020.9212047openalex-snapshot
A Neighborhood Selection Strategy for Production Scheduling using CP and LNS
inferred← citeshttps://doi.org/10.1109/icmlc.2003.1259705openalex-snapshot
The robust backpropagation training of MLP's: an optimal rapid restart method
inferred← citeshttps://doi.org/10.1109/icspcc.2011.6061650openalex-snapshot
A new algorithm for solving the quasi group completion problem
inferred← citeshttps://doi.org/10.1109/ictai.2007.38openalex-snapshot
On Portfolios for Backtracking Search in the Presence of Deadlines
inferred← citeshttps://doi.org/10.1109/ictai.2010.55openalex-snapshot
Enhancing Clause Learning by Symmetry in SAT Solvers
inferred← citeshttps://doi.org/10.1109/ipdpsw.2013.211openalex-snapshot
Sequential and Parallel Restart Policies for Constraint-Based Local Search
inferred← citeshttps://doi.org/10.1109/iscid.2012.254openalex-snapshot
A Heuristic Restart Strategy to Speed Up the Solving of Satisfiability Problem
inferred← citeshttps://doi.org/10.1109/iske47853.2019.9170372openalex-snapshot
A Learned Clause Deletion Strategy Based on Distance Ratio
inferred← citeshttps://doi.org/10.1109/qcnc64685.2025.00120openalex-snapshot
Quantum Walkers and Diffusion
inferred← citeshttps://doi.org/10.1109/tai.1999.809786openalex-snapshot
On the fine structure of large search spaces
inferred← citeshttps://doi.org/10.1109/tai.1999.809823openalex-snapshot
Search strategies for hybrid search spaces
inferred← citeshttps://doi.org/10.1109/tsmca.2005.859095openalex-snapshot
Internet user behavior: compared study of the access traces and application to the discovery of communities
inferred← citeshttps://doi.org/10.1142/s0218213000000057openalex-snapshot
HYBRID SEARCH STRATEGIES FOR HETEROGENEOUS SEARCH SPACES
inferred← citeshttps://doi.org/10.1145/3102071.3110575openalex-snapshot
On using graph partitioning with isomorphism constraint in procedural content generation
inferred← citeshttps://doi.org/10.1287/opre.2013.1231openalex-snapshot
Exploiting Erraticism in Search
inferred← citeshttps://doi.org/10.1609/aaai.v28i1.9121openalex-snapshot
Non-Restarting SAT Solvers with Simple Preprocessing Can Efficiently Simulate Resolution
inferred← citeshttps://doi.org/10.1609/aaai.v32i1.12092openalex-snapshot
Fat- and Heavy-Tailed Behavior in Satisficing Planning
inferred← citeshttps://doi.org/10.1609/aaai.v36i9.21279openalex-snapshot
Machine Learning for Online Algorithm Selection under Censored Feedback
inferred← citeshttps://doi.org/10.1609/icaps.v20i1.13423openalex-snapshot
Simultaneously Searching with Multiple Settings: An Alternative to Parameter Tuning for Suboptimal Single-Agent Search Algorithms
inferred← citeshttps://doi.org/10.1613/jair.3809openalex-snapshot
Boolean Equi-propagation for Concise and Efficient SAT Encodings of Combinatorial Problems
inferred← citeshttps://doi.org/10.2514/2.3852openalex-snapshot
Field-Programmable Gate-Array-Based Graph Coloring Accelerator
inferred← citeshttps://doi.org/10.3233/sat190082openalex-snapshot
Reusing the Assignment Trail in CDCL Solvers
inferred← citeshttps://doi.org/10.3390/sym11020197openalex-snapshot
An Adaptive Strategy for Tuning Duplicate Trails in SAT Solvers
inferred← citeshttps://doi.org/10.46298/arima.6750openalex-snapshot
Parallel Hybridization for SAT: An Efficient Combination of Search Space Splitting and Portfolio
inferred← citeshttps://doi.org/10.46586/tosc.v2017.i1.281-306openalex-snapshot
Analysis of AES, SKINNY, and Others with Constraint Programming
inferred← citeshttps://doi.org/10.70675/5732022dzaf3bz44e9zae98z41d4facf3deaopenalex-snapshot
Contributions à la résolution du problème de la Satisfiabilité Propositionnelle
inferred← citeshttps://doi.org/10.70675/6ef488bbz240ez4bcdz98e9z9b15980a474copenalex-snapshot
Informatique ubiquitaire : techniques de curage d'informations perverties
inferred← citeshttps://doi.org/10.70675/932a7c81z8d8dz4199z9e7bz02240dcf3998openalex-snapshot
Reasoning and inference for (maximum) satisfiability : new insights
inferred← citeshttps://doi.org/10.70675/ef2412acz2c06z4b2dzbcdcz11c3bbb0c27aopenalex-snapshot
Exploitation of dynamic symmetries for solving SAT problems
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.