On the public citation graph

Competitive analysis of algorithms

https://doi.org/10.1007/bfb0029562
0 signed · 49 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/j.1538-7305.1966.tb01709.xopenalex-snapshot
Bounds for Certain Multiprocessing Anomalies
inferredcites →https://doi.org/10.1007/bf01294260openalex-snapshot
On the power of randomization in on-line algorithms
inferredcites →https://doi.org/10.1007/bf01762111openalex-snapshot
Competitive snoopy caching
inferredcites →https://doi.org/10.1016/0304-3975(91)90263-2openalex-snapshot
Shortest paths without a map
inferredcites →https://doi.org/10.1016/s0022-0000(74)80026-7openalex-snapshot
Fast algorithms for bin packing
inferredcites →https://doi.org/10.1080/00029890.1974.11993538openalex-snapshot
The Bay Restaurant — A Linear Storage Problem
inferredcites →https://doi.org/10.1111/j.1467-9965.1991.tb00002.xopenalex-snapshot
Universal Portfolios
inferredcites →https://doi.org/10.1145/2786.2793openalex-snapshot
Amortized efficiency of list update and paging rules
inferredcites →https://doi.org/10.1145/28395.28435openalex-snapshot
An optimal online algorithm for metrical task systems
inferredcites →https://doi.org/10.1145/322186.322187openalex-snapshot
New Algorithms for Bin Packing
inferredcites →https://doi.org/10.1145/3828.3835openalex-snapshot
Self-adjusting binary search trees
inferredcites →https://doi.org/10.1145/62212.62243openalex-snapshot
Competitive algorithms for on-line problems
inferredcites →https://doi.org/10.2307/2317055openalex-snapshot
The Art of Computer Programming. Volume 2: Seminumerical Algorithms.

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11427186_51openalex-snapshot
Optimal Competitive Online Ray Search with an Error-Prone Robot
inferred← citeshttps://doi.org/10.1007/3-540-46506-5_13openalex-snapshot
Performance Analysis of Database Systems
inferred← citeshttps://doi.org/10.1007/978-1-4471-4561-5openalex-snapshot
Online Scheduling in Manufacturing
inferred← citeshttps://doi.org/10.1007/978-1-4471-4561-5_2openalex-snapshot
Outline of Scheduling
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_348openalex-snapshot
Robotics
inferred← citeshttps://doi.org/10.1007/978-3-032-12232-2_2openalex-snapshot
Algorithmic Decision-Making in Public Institutions: A Tripartite Analysis of Motivations and Barriers
inferred← citeshttps://doi.org/10.1007/978-3-540-24592-6_13openalex-snapshot
The Pledge Algorithm Reconsidered under Errors in Sensors and Motion
inferred← citeshttps://doi.org/10.1007/978-3-540-30140-0_31openalex-snapshot
Competitive Online Approximation of the Optimal Search Ratio
inferred← citeshttps://doi.org/10.1007/978-3-540-69507-3_13openalex-snapshot
Weighted Nearest Neighbor Algorithms for the Graph Exploration Problem on Cycles
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_348-2openalex-snapshot
Robotics
inferred← citeshttps://doi.org/10.1007/978-981-95-4721-0_12openalex-snapshot
On Online Self-Organizing Linear Search
inferred← citeshttps://doi.org/10.1007/s10878-015-9982-7openalex-snapshot
Online MapReduce scheduling problem of minimizing the makespan
inferred← citeshttps://doi.org/10.1007/s10878-017-0167-4openalex-snapshot
Online MapReduce processing on two identical parallel machines
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50016-4openalex-snapshot
Geometric Shortest Paths and Network Optimization
inferred← citeshttps://doi.org/10.1016/j.amc.2020.125670openalex-snapshot
A semi-online algorithm and its competitive analysis for parallel-machine scheduling problem with rejection
inferred← citeshttps://doi.org/10.1016/j.cor.2011.12.019openalex-snapshot
Algorithms for on-line order batching in an order picking warehouse
inferred← citeshttps://doi.org/10.1016/j.cor.2013.09.016openalex-snapshot
A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time
inferred← citeshttps://doi.org/10.1016/j.cosrev.2010.05.001openalex-snapshot
Online algorithms for searching and exploration in the plane
inferred← citeshttps://doi.org/10.1016/j.ejor.2011.08.009openalex-snapshot
Resequencing of mixed-model assembly lines: Survey and research agenda
inferred← citeshttps://doi.org/10.1016/j.ejor.2023.01.022openalex-snapshot
An on-line seru scheduling algorithm with proactive waiting considering resource conflicts
inferred← citeshttps://doi.org/10.1016/j.endm.2006.06.062openalex-snapshot
Randolphs Robot Game is NP-hard!
inferred← citeshttps://doi.org/10.1016/j.ipl.2009.10.013openalex-snapshot
Weighted nearest neighbor algorithms for the graph exploration problem on cycles
inferred← citeshttps://doi.org/10.1016/j.ipl.2010.02.013openalex-snapshot
An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time
inferred← citeshttps://doi.org/10.1016/j.jmsy.2017.04.019openalex-snapshot
A study on implementing color-batching with selectivity banks in automotive paint shops
inferred← citeshttps://doi.org/10.1016/j.jnca.2023.103618openalex-snapshot
An online service provisioning strategy for container-based cloud brokers
inferred← citeshttps://doi.org/10.1016/s0377-2217(99)00351-3openalex-snapshot
Stack-up algorithms for palletizing at delivery industry
inferred← citeshttps://doi.org/10.1080/00207543.2023.2217294openalex-snapshot
Minimising total weighted completion time for semi-online single machine scheduling with known arrivals and bounded processing times
inferred← citeshttps://doi.org/10.1109/ccdc.2012.6244503openalex-snapshot
A 2.5-competitive Online Algorithm for Pm|rj|ΣwjCj
inferred← citeshttps://doi.org/10.1109/icctdc64446.2025.11158197openalex-snapshot
Examining the Online Food Delivery Problem on K-Ary Trees
inferred← citeshttps://doi.org/10.1142/s0217595921400030openalex-snapshot
A Semi-Online Algorithm for Single Machine Scheduling with Rejection
inferred← citeshttps://doi.org/10.1142/s0217595923500057openalex-snapshot
Online Single-Processor Scheduling with an Unexpected Breakdown
inferred← citeshttps://doi.org/10.1145/1139113.1139123openalex-snapshot
Online pricing for web service providers
inferred← citeshttps://doi.org/10.1587/transinf.e92.d.1620openalex-snapshot
The Online Graph Exploration Problem on Restricted Graphs
inferred← citeshttps://doi.org/10.38124/ijisrt/ijisrt24oct247openalex-snapshot
Using Online Algorithms to Solve NP-Hard Problems
inferred← citeshttps://doi.org/10.3934/jimo.2015.11.185openalex-snapshot
A $2.28$-competitive algorithm for online scheduling on identical machines
inferred← citeshttps://doi.org/10.70675/9976a622z13e6z4feaz8d69zbb5172afa95aopenalex-snapshot
Performance guaranteeing algorithms for solving online decision problems in financial systems
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.