On the public citation graph

A method for obtaining randomized algorithms with small tail probabilities

0 signed · 32 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.1007/3-540-30863-6_7openalex-snapshot
Differential- und Integralrechnung
inferredcites →https://doi.org/10.1007/3-540-55488-2openalex-snapshot
Data structures and efficient algorithms
inferredcites →https://doi.org/10.1007/bf01707336openalex-snapshot
Differential- und Integralrechnung
inferredcites →https://doi.org/10.1090/s0025-5718-1970-0400642-2openalex-snapshot
Table errata: The art of computer programming, Vol. 2: Seminumerical algorithms (Addison-Wesley, Reading, Mass., 1969) by Donald E. Knuth

What points at this work

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

inferred← citeshttps://doi.org/10.1007/0-387-25486-2_4openalex-snapshot
Branch-and-Price Heuristics: A Case Study on the Vehicle Routing Problem with Time Windows
inferred← citeshttps://doi.org/10.1007/11777830_16openalex-snapshot
Experimental Analysis of the Correlation of HTTP GET Invocations
inferred← citeshttps://doi.org/10.1007/11889205_14openalex-snapshot
Impact of Censored Sampling on the Performance of Restart Strategies
inferred← citeshttps://doi.org/10.1007/3-540-55719-9_94openalex-snapshot
A tail estimate for Mulmuley's segment intersection algorithm
inferred← citeshttps://doi.org/10.1007/978-3-540-30225-4_7openalex-snapshot
A Measurement Study of the Interplay Between Application Level Restart and Transport Protocol
inferred← citeshttps://doi.org/10.1007/bf01940869openalex-snapshot
Introduction to special issue on randomized and derandomized algorithms
inferred← citeshttps://doi.org/10.1007/s00453-021-00809-8openalex-snapshot
Fixed-Parameter Tractability of Crossover: Steady-State GAs on the Closest String Problem
inferred← citeshttps://doi.org/10.1007/s11009-017-9600-5openalex-snapshot
Hitting Times in Markov Chains with Restart and their Application to Network Centrality
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90029-9openalex-snapshot
Optimal speedup of Las Vegas algorithms
inferred← citeshttps://doi.org/10.1016/s0004-3702(00)00081-3openalex-snapshot
Algorithm portfolios
inferred← citeshttps://doi.org/10.1016/s0004-3702(99)00048-xopenalex-snapshot
Towards a characterisation of the behaviour of stochastic local search algorithms for SAT
inferred← citeshttps://doi.org/10.1017/s0021900200013735openalex-snapshot
Markov Processes with Restart
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.1023/a:1006314320276openalex-snapshot
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1023/a:1006350622830openalex-snapshot
Local Search Algorithms for SAT: An Empirical Evaluation
inferred← citeshttps://doi.org/10.1038/s41467-025-62398-2openalex-snapshot
Adaptive resetting for informed search strategies and the design of non-equilibrium steady-states
inferred← citeshttps://doi.org/10.1049/ip-sen:20041090openalex-snapshot
Optimal restart times for moments of completion time
inferred← citeshttps://doi.org/10.1088/1751-8121/ad1e1bopenalex-snapshot
Preface: stochastic resetting—theory and applications
inferred← citeshttps://doi.org/10.1103/physrevlett.87.257901openalex-snapshot
Portfolios of Quantum Algorithms
inferred← citeshttps://doi.org/10.1103/w2yj-91m8openalex-snapshot
First-passage time in space-dependent stochastic resetting
inferred← citeshttps://doi.org/10.1109/istcs.1993.253477openalex-snapshot
Optimal speedup of Las Vegas algorithms
inferred← citeshttps://doi.org/10.1109/qest.2004.1348034openalex-snapshot
Analysis and algorithms for restart
inferred← citeshttps://doi.org/10.1109/qest.2004.5openalex-snapshot
Collecting Data about Moving Objects in a Distributed Environment
inferred← citeshttps://doi.org/10.1109/tse.2006.73openalex-snapshot
Analysis of Restart Mechanisms in Software Systems
inferred← citeshttps://doi.org/10.1239/jap/1389370093openalex-snapshot
Markov Processes with Restart
inferred← citeshttps://doi.org/10.22214/ijraset.2018.4623openalex-snapshot
A Survey of Inducing Fault Tolerance in Software Systems with Stochastic Modelling Approach
inferred← citeshttps://doi.org/10.48550/arxiv.1301.7383openalex-snapshot
Evaluating Las Vegas Algorithms - Pitfalls and Remedies
inferred← citeshttps://doi.org/10.70675/cf0edb8dz0512z4aeez99adzaaa58c3e2721openalex-snapshot
Declarative Approaches for Mining Frequent Itemsets over Transactional Databases
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.