On the public citation graph
On the power of randomization in on-line algorithms
0 signed · 250 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/bf01759073openalex-snapshot
A strongly competitive randomized paging algorithm
inferredcites →https://doi.org/10.1007/bfb0035792openalex-snapshot
Memory versus randomization in on-line algorithms
inferredcites →https://doi.org/10.1016/0196-6774(90)90003-wopenalex-snapshot
Competitive algorithms for server problems
inferredcites →https://doi.org/10.1016/0196-6774(91)90041-vopenalex-snapshot
Competitive paging algorithms
inferredcites →https://doi.org/10.1016/s0022-0000(05)80060-1openalex-snapshot
Competitive k-server algorithms
inferredcites →https://doi.org/10.1109/fscs.1990.89566openalex-snapshot
Competitive k-server algorithms
inferredcites →https://doi.org/10.1145/100216.100266openalex-snapshot
Random walks on weighted graphs, and applications to on-line algorithms
inferredcites →https://doi.org/10.1145/103418.103448openalex-snapshot
The harmonic online K -server algorithm is competitive
inferredcites →https://doi.org/10.1145/146585.146588openalex-snapshot
An optimal on-line algorithm for metrical task system
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/62212.62243openalex-snapshot
Competitive algorithms for on-line problems
inferredcites →https://doi.org/10.1515/9781400882007-002openalex-snapshot
ANNALS OF MATHEMATICS STUDIES
inferredcites →https://doi.org/10.5555/320176.320208openalex-snapshot
A competitive 3-server algorithm
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1097-0118(199911)32:3<265::aid-jgt6>3.0.co;2-8openalex-snapshot
Exploring an unknown graph
inferred← citeshttps://doi.org/10.1002/(sici)1097-0118(199911)32:3<265::aid-jgt6>3.3.co;2-#openalex-snapshot
Exploring an unknown graph
inferred← citeshttps://doi.org/10.1002/cpe.1867openalex-snapshot
Optimal online deterministic algorithms and adaptive heuristics for energy and performance efficient dynamic consolidation of virtual machines in Cloud data centers
inferred← citeshttps://doi.org/10.1002/cpe.5221openalex-snapshot
ETAS: Energy and thermal‐aware dynamic virtual machine consolidation in cloud data center with proactive hotspot mitigation
inferred← citeshttps://doi.org/10.1002/rsa.20124openalex-snapshot
A randomized on–line algorithm for thek–server problem on a line
inferred← citeshttps://doi.org/10.1006/inco.1998.2775openalex-snapshot
On Randomization in On-Line Computation
inferred← citeshttps://doi.org/10.1006/inco.2002.3144openalex-snapshot
A General Decomposition Theorem for the k-Server Problem
inferred← citeshttps://doi.org/10.1006/jagm.1997.0906openalex-snapshot
New On-Line Algorithms for the Page Replication Problem
inferred← citeshttps://doi.org/10.1006/jagm.1999.1060openalex-snapshot
Online Scheduling with Hard Deadlines
inferred← citeshttps://doi.org/10.1006/jpdc.1998.1483openalex-snapshot
Packet Routing in Fixed-Connection Networks: A Survey
inferred← citeshttps://doi.org/10.1007/3-540-44436-x_15openalex-snapshot
New Results for Online Page Replication
inferred← citeshttps://doi.org/10.1007/3-540-44676-1_7openalex-snapshot
A General Decomposition Theorem for the k-Server Problem
inferred← citeshttps://doi.org/10.1007/3-540-45022-x_27openalex-snapshot
Optimal Projective Algorithms for the List Update Problem
inferred← citeshttps://doi.org/10.1007/3-540-46784-x_2openalex-snapshot
Online Algorithms: A Study of Graph-Theoretic Concepts
inferred← citeshttps://doi.org/10.1007/3-540-57568-5_275openalex-snapshot
Randomized on-line algorithms for the page replication problem
inferred← citeshttps://doi.org/10.1007/3-540-58218-5_3openalex-snapshot
New on-line algorithms for the page replication problem
inferred← citeshttps://doi.org/10.1007/3-540-60084-1_83openalex-snapshot
On-line resource management with applications to routing and scheduling
inferred← citeshttps://doi.org/10.1007/3-540-60220-8_58openalex-snapshot
Page migration with limited local memory capacity
inferred← citeshttps://doi.org/10.1007/3-540-63307-3_65openalex-snapshot
On-line scheduling with hard deadlines
inferred← citeshttps://doi.org/10.1007/978-0-387-34928-2_5openalex-snapshot
Online-algorithms for reactive vehicle scheduling
inferred← citeshttps://doi.org/10.1007/978-1-4613-3557-3_6openalex-snapshot
A Study of On-Line Scheduling Two-Stage Shops
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_565openalex-snapshot
Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrierand Derandomization
inferred← citeshttps://doi.org/10.1007/978-3-030-31500-9_20openalex-snapshot
Online Payment Network Design
inferred← citeshttps://doi.org/10.1007/978-3-030-57675-2_24openalex-snapshot
On the Power of Randomization in Distributed Algorithms in Dynamic Networks with Adaptive Adversaries
inferred← citeshttps://doi.org/10.1007/978-3-030-73879-2_2openalex-snapshot
Online k-Taxi via Double Coverage and Time-Reverse Primal-Dual
inferred← citeshttps://doi.org/10.1007/978-3-030-80879-2_10openalex-snapshot
Memoryless Algorithms for the Generalized k-server Problem on Uniform Metrics
inferred← citeshttps://doi.org/10.1007/978-3-031-15714-1_30openalex-snapshot
Online Max-min Fair Allocation
inferred← citeshttps://doi.org/10.1007/978-3-031-49815-2_4openalex-snapshot
An Improved Deterministic Algorithm for the Online Min-Sum Set Cover Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-08001-7_13openalex-snapshot
Online Knapsack Revisited
inferred← citeshttps://doi.org/10.1007/978-3-540-24592-6_3openalex-snapshot
Randomized Priority Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-70575-8_9openalex-snapshot
On List Update with Locality of Reference
inferred← citeshttps://doi.org/10.1007/978-3-540-93980-1_8openalex-snapshot
Randomized Algorithms for Buffer Management with 2-Bounded Delay
inferred← citeshttps://doi.org/10.1007/978-3-642-02094-0_11openalex-snapshot
Resource Management in Large Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-10841-9_52openalex-snapshot
Randomized Online Algorithms for the Buyback Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-23719-5_21openalex-snapshot
One to Rule Them All: A General Randomized Algorithm for Buffer Management with Bounded Delay
inferred← citeshttps://doi.org/10.1007/978-3-642-24372-1_16openalex-snapshot
Formal Analysis of Online Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_565-1openalex-snapshot
Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization
inferred← citeshttps://doi.org/10.1007/978-3-642-30642-6_23openalex-snapshot
On the Advice Complexity of the Set Cover Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-40273-9_17openalex-snapshot
A Survey of Algorithms and Models for List Update
inferred← citeshttps://doi.org/10.1007/978-3-662-12788-9_3openalex-snapshot
An Overview of Randomized Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-662-48971-0_42openalex-snapshot
Randomized Minmax Regret for Combinatorial Optimization Under Uncertainty
inferred← citeshttps://doi.org/10.1007/bf01189992openalex-snapshot
Thek-server dual and loose competitiveness for paging
inferred← citeshttps://doi.org/10.1007/bf01189993openalex-snapshot
Competitive randomized algorithms for nonuniform problems
inferred← citeshttps://doi.org/10.1007/bfb0029562openalex-snapshot
Competitive analysis of algorithms
inferred← citeshttps://doi.org/10.1007/bfb0054307openalex-snapshot
Uniform service systems with k servers
inferred← citeshttps://doi.org/10.1007/bfb0054374openalex-snapshot
Randomized online multi-threaded paging
inferred← citeshttps://doi.org/10.1007/pl00009158openalex-snapshot
On the Influence of Lookahead in Competitive Paging Algorithms
inferred← citeshttps://doi.org/10.1007/pl00009279openalex-snapshot
Competitive Optimal On-Line Leasing
inferred← citeshttps://doi.org/10.1007/s00224-002-1053-7openalex-snapshot
On Generalized Connection Caching
inferred← citeshttps://doi.org/10.1007/s00446-014-0214-7openalex-snapshot
Distributed transactional memory for general networks
inferred← citeshttps://doi.org/10.1007/s00446-023-00459-9openalex-snapshot
Expected linear round synchronization: the missing link for linear Byzantine SMR
inferred← citeshttps://doi.org/10.1007/s00450-011-0150-8openalex-snapshot
Migrating and replicating data in networks
inferred← citeshttps://doi.org/10.1007/s00453-001-0073-zopenalex-snapshot
On-Line Multi-Threaded Paging
inferred← citeshttps://doi.org/10.1007/s00453-001-0090-yopenalex-snapshot
Distributed and On-Line Routing on Tori
inferred← citeshttps://doi.org/10.1007/s00453-012-9700-0openalex-snapshot
A Universal Randomized Packet Scheduling Algorithm
inferred← citeshttps://doi.org/10.1007/s00453-020-00759-7openalex-snapshot
Tight Bounds for Online Coloring of Basic Graph Classes
inferred← citeshttps://doi.org/10.1007/s00453-020-00768-6openalex-snapshot
Non-Greedy Online Steiner Trees on Outerplanar Graphs
inferred← citeshttps://doi.org/10.1007/s00453-021-00916-6openalex-snapshot
Online Unit Clustering and Unit Covering in Higher Dimensions
inferred← citeshttps://doi.org/10.1007/s004530010014openalex-snapshot
Online Randomized Multiprocessor Scheduling
inferred← citeshttps://doi.org/10.1007/s004530010071openalex-snapshot
Algorithms for the On-Line Travelling Salesman1
inferred← citeshttps://doi.org/10.1007/s10107-003-0436-0openalex-snapshot
Online algorithms: a survey
inferred← citeshttps://doi.org/10.1007/s10107-022-01815-6openalex-snapshot
Online k-taxi via Double Coverage and time-reverse primal-dual
inferred← citeshttps://doi.org/10.1007/s10288-016-0330-2openalex-snapshot
Improved lower bounds for the online bin stretching problem
inferred← citeshttps://doi.org/10.1007/s10479-015-2043-xopenalex-snapshot
Two-stage security screening strategies in the face of strategic applicants, congestions and screening errors
inferred← citeshttps://doi.org/10.1007/s10479-019-03153-xopenalex-snapshot
On packet scheduling with adversarial jamming and speedup
inferred← citeshttps://doi.org/10.1007/s10586-024-05076-0openalex-snapshot
Machine learning for user mobility management in a mobile fog computing environment
inferred← citeshttps://doi.org/10.1007/s10626-019-00277-xopenalex-snapshot
Optimal on-off control for a class of discrete event systems with real-time constraints
inferred← citeshttps://doi.org/10.1007/s10898-006-9079-zopenalex-snapshot
On the on-line rent-or-buy problem in probabilistic environments
inferred← citeshttps://doi.org/10.1007/s40305-025-00590-3openalex-snapshot
Group Rent-or-Buy: the Benefits of Having Grouped Consumers
inferred← citeshttps://doi.org/10.1007/s41870-018-0093-4openalex-snapshot
Global host allocation policy for virtual machine in cloud computing
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90209-eopenalex-snapshot
The greedy algorithm is optimal for on-line edge coloring
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00110-3openalex-snapshot
A lower bound for randomized on-line scheduling algorithms
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00000-3openalex-snapshot
Linear bounds for on-line Steiner problems
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00142-yopenalex-snapshot
A combined BIT and TIMESTAMP algorithm for the list update problem
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90201-4openalex-snapshot
The weighted list update problem and the lazy adversary
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00010-7openalex-snapshot
The list update problem and the retrieval of sets
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90150-3openalex-snapshot
On-line scheduling of jobs with fixed start and end times
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90154-6openalex-snapshot
Competitive algorithms for the weighted server problem
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90165-1openalex-snapshot
MOCA: a multiprocessor on-line competitive algorithm for real-time system scheduling
inferred← citeshttps://doi.org/10.1016/j.comcom.2020.01.048openalex-snapshot
Distributed robust time-efficient broadcasting algorithms for multi-channel wireless multi-hop networks with channel disruption
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2024.109636openalex-snapshot
BRAPTOR: An efficient method for instant asset-transfer and generic application in blockchain
inferred← citeshttps://doi.org/10.1016/j.cor.2023.106314openalex-snapshot
Online optimisation for ambulance routing in disaster response with partial or no information on victim conditions
inferred← citeshttps://doi.org/10.1016/j.dam.2022.02.007openalex-snapshot
Some further results on the maximal hitting times of trees with some given parameters
inferred← citeshttps://doi.org/10.1016/j.disc.2020.112226openalex-snapshot
On the (reverse) cover cost of trees with some given parameters
inferred← citeshttps://doi.org/10.1016/j.ejor.2006.01.049openalex-snapshot
Fixed interval scheduling: Models, applications, computational complexity and algorithms
inferred← citeshttps://doi.org/10.1016/j.ejor.2013.02.004openalex-snapshot
Competitive strategies for an online generalized assignment problem with a service consecution constraint
inferred← citeshttps://doi.org/10.1016/j.eswa.2023.120568openalex-snapshot
A deep reinforcement learning hyper-heuristic with feature fusion for online packing problems
inferred← citeshttps://doi.org/10.1016/j.future.2024.03.003openalex-snapshot
To store or not: Online cost optimization for running big data jobs on the cloud
inferred← citeshttps://doi.org/10.1016/j.ipl.2012.04.006openalex-snapshot
Optimal randomized algorithm for a generalized ski-rental with interest rate
inferred← citeshttps://doi.org/10.1016/j.ipl.2020.105973openalex-snapshot
Randomized distributed online algorithms against adaptive offline adversaries
inferred← citeshttps://doi.org/10.1016/j.jcss.2005.05.008openalex-snapshot
Ramsey-type theorems for metric spaces with applications to online problems
inferred← citeshttps://doi.org/10.1016/j.jda.2005.12.005openalex-snapshot
On Multi-threaded Metrical Task Systems
inferred← citeshttps://doi.org/10.1016/j.jda.2009.02.005openalex-snapshot
Randomized algorithm for the k-server problem on decomposable spaces
inferred← citeshttps://doi.org/10.1016/j.jnca.2024.104080openalex-snapshot
Caching or re-computing: Online cost optimization for running big data tasks in IaaS clouds
inferred← citeshttps://doi.org/10.1016/j.jpdc.2021.09.004openalex-snapshot
On the power of randomization in distributed algorithms in dynamic networks with adaptive adversaries
inferred← citeshttps://doi.org/10.1016/j.mcm.2011.02.036openalex-snapshot
Competitive strategy for on-line leasing of depreciable equipment
inferred← citeshttps://doi.org/10.1016/j.omega.2015.10.009openalex-snapshot
A general modeling approach to online optimization with lookahead
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.05.017openalex-snapshot
New results for online page replication
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.05.020openalex-snapshot
The weighted 2-server problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.03.014openalex-snapshot
Randomized priority algorithms
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.05.015openalex-snapshot
Randomized competitive algorithms for online buffer management in the adaptive adversary model
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.05.029openalex-snapshot
Improved analysis of the online set cover problem with advice
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114318openalex-snapshot
Advice complexity of adaptive priority algorithms
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00160-9openalex-snapshot
Revisiting the COUNTER algorithms for list update
inferred← citeshttps://doi.org/10.1016/s0167-6377(98)00019-4openalex-snapshot
Randomized online interval scheduling
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00257-7openalex-snapshot
A new lower bound for the list update problem in the partial cost model
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00259-0openalex-snapshot
On page migration and other relaxed task systems
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00262-0openalex-snapshot
Online algorithms for page replication in rings
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00006-6openalex-snapshot
Randomized algorithms for metrical task systems
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00026-1openalex-snapshot
A competitive analysis of the list update problem with lookahead
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00264-3openalex-snapshot
On the competitiveness of the move-to-front rule
inferred← citeshttps://doi.org/10.1023/a:1009703014438openalex-snapshot
Optimal Randomized Scheduling by Replacement
inferred← citeshttps://doi.org/10.1023/a:1009875403874openalex-snapshot
Randomized Online Scheduling with Delivery Times
inferred← citeshttps://doi.org/10.1023/a:1022956425198openalex-snapshot
Admission Control with Immediate Notification
inferred← citeshttps://doi.org/10.1023/a:1022994010777openalex-snapshot
Patience is a Virtue: The Effect of Slack on Competitiveness for Admission Control
inferred← citeshttps://doi.org/10.1038/srep09381openalex-snapshot
Spatial evolutionary public goods game on complete graph and dense complex networks
inferred← citeshttps://doi.org/10.1038/srep31299openalex-snapshot
Reciprocity in spatial evolutionary public goods game on double-layered network
inferred← citeshttps://doi.org/10.1080/03081087.2020.1789538openalex-snapshot
Extremal hitting times of trees with some given parameters
inferred← citeshttps://doi.org/10.1109/5.784228openalex-snapshot
Performance and efficiency: recent advances in supervised learning
inferred← citeshttps://doi.org/10.1109/access.2024.3406788openalex-snapshot
Online Algorithmic Study of Facility Location Problems: A Survey
inferred← citeshttps://doi.org/10.1109/ccc.1997.612318openalex-snapshot
On randomization in online computation
inferred← citeshttps://doi.org/10.1109/empdp.2001.905065openalex-snapshot
Implementing on-line techniques to allocate file resources in large distributed systems
inferred← citeshttps://doi.org/10.1109/focs.2013.10openalex-snapshot
On Randomized Memoryless Algorithms for the Weighted K-Server Problem
inferred← citeshttps://doi.org/10.1109/focs.2013.64openalex-snapshot
Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization
inferred← citeshttps://doi.org/10.1109/focs.2017.52openalex-snapshot
Weighted k-Server Bounds via Combinatorial Dichotomies
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00099openalex-snapshot
Fast Deterministic Fully Dynamic Distance Approximation
inferred← citeshttps://doi.org/10.1109/fscs.1990.89566openalex-snapshot
Competitive k-server algorithms
inferred← citeshttps://doi.org/10.1109/fskd.2007.201openalex-snapshot
Average-Case Analysis for Special Cases of Online Bahncard Problem
inferred← citeshttps://doi.org/10.1109/icbc51069.2021.9461068openalex-snapshot
Discrepancy Detection in Merkle Tree-Based Hash Aggregation
inferred← citeshttps://doi.org/10.1109/icmlc.2004.1378561openalex-snapshot
Scheduling for on-line taxi problem on a real line and competitive algorithms
inferred← citeshttps://doi.org/10.1109/icmlc.2005.1526991openalex-snapshot
On-Line Distribution System of Trial-Sale Production and its Competitive Algorithms
inferred← citeshttps://doi.org/10.1109/infcom.2002.1019293openalex-snapshot
Base station scheduling of requests with fixed deadlines
inferred← citeshttps://doi.org/10.1109/ipdps.2012.97openalex-snapshot
Distributed Transactional Memory for General Networks
inferred← citeshttps://doi.org/10.1109/isads.1993.262708openalex-snapshot
On the competitiveness of autonomous servers
inferred← citeshttps://doi.org/10.1109/istcs.1993.253459openalex-snapshot
Competitive algorithms for the weighted server problem
inferred← citeshttps://doi.org/10.1109/sccc.2002.1173169openalex-snapshot
Approximate and on-line algorithms for list update problem
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185361openalex-snapshot
Scheduling parallel machines on-line
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185381openalex-snapshot
Competitive algorithms for layered graph traversal
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185392openalex-snapshot
Tree automata, mu-calculus and determinacy
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267756openalex-snapshot
The distributed k-server problem-a competitive distributed translator for k-server algorithms
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267772openalex-snapshot
A decomposition theorem and bounds for randomized server problems
inferred← citeshttps://doi.org/10.1109/sfcs.1994.365675openalex-snapshot
On-line admission control and circuit routing for high performance computing and communication
inferred← citeshttps://doi.org/10.1109/sfcs.1995.492570openalex-snapshot
Competitive access time via dynamic storage rearrangement
inferred← citeshttps://doi.org/10.1109/sfcs.1996.548477openalex-snapshot
Probabilistic approximation of metric spaces and its algorithmic applications
inferred← citeshttps://doi.org/10.1109/sfcs.1996.548512openalex-snapshot
Universal data compression and portfolio selection
inferred← citeshttps://doi.org/10.1109/sfcs.1997.646121openalex-snapshot
Truly online paging with locality of reference
inferred← citeshttps://doi.org/10.1109/sfcs.2000.892066openalex-snapshot
Optimization problems in congestion control
inferred← citeshttps://doi.org/10.1109/tnsm.2021.3096533openalex-snapshot
Keep Hot or Go Cold: A Randomized Online Migration Algorithm for Cost Optimization in STaaS Clouds
inferred← citeshttps://doi.org/10.1137/050648250openalex-snapshot
Randomization Does Not Reduce the Average Delay in Parallel Packet Switches
inferred← citeshttps://doi.org/10.1137/1.9781611974782.28openalex-snapshot
Fully dynamic all-pairs shortest paths with worst-case update-time revisited
inferred← citeshttps://doi.org/10.1137/140957299openalex-snapshot
Dynamic Approximate All-Pairs Shortest Paths: Breaking the $O(mn)$ Barrier and Derandomization
inferred← citeshttps://doi.org/10.1137/24m1689788openalex-snapshot
Online Edge Coloring Is (Nearly) as Easy as Offline
inferred← citeshttps://doi.org/10.1137/s0097539700376159openalex-snapshot
Better Algorithms for Unfair Metrical Task Systems and Applications
inferred← citeshttps://doi.org/10.1137/s0097539704440442openalex-snapshot
Work-Competitive Scheduling for Cooperative Computing with Dynamic Groups
inferred← citeshttps://doi.org/10.1137/s0097539791202301openalex-snapshot
The Cost of Derandomization: Computability or Competitiveness
inferred← citeshttps://doi.org/10.1137/s0097539794277858openalex-snapshot
Improved Randomized On-Line Algorithms for the List Update Problem
inferred← citeshttps://doi.org/10.1137/s0097539795279943openalex-snapshot
Competitive Algorithms for Layered Graph Traversal
inferred← citeshttps://doi.org/10.1137/s0097539795287824openalex-snapshot
Competitive On-Line Algorithms for Distributed Data Management
inferred← citeshttps://doi.org/10.1137/s0097539798335511openalex-snapshot
Design of On-Line Algorithms Using Hitting Times
inferred← citeshttps://doi.org/10.1137/s0097539798346706openalex-snapshot
On-line Randomized Call Control Revisited
inferred← citeshttps://doi.org/10.1137/s0097539799351882openalex-snapshot
A Decomposition Theorem for Task Systems and Bounds for Randomized Server Problems
inferred← citeshttps://doi.org/10.1137/s089548019325647xopenalex-snapshot
Tight Bounds for Dynamic Storage Allocation
inferred← citeshttps://doi.org/10.1145/100216.100262openalex-snapshot
An optimal algorithm for on-line bipartite matching
inferred← citeshttps://doi.org/10.1145/100216.100266openalex-snapshot
Random walks on weighted graphs, and applications to on-line algorithms
inferred← citeshttps://doi.org/10.1145/1008731.1008732openalex-snapshot
Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines
inferred← citeshttps://doi.org/10.1145/103418.103422openalex-snapshot
Competitive paging with locality of reference
inferred← citeshttps://doi.org/10.1145/1073970.1073973openalex-snapshot
Randomization does not reduce the average delay in parallel packet switches
inferred← citeshttps://doi.org/10.1145/1721837.1721844openalex-snapshot
Reasoning about online algorithms with weighted automata
inferred← citeshttps://doi.org/10.1145/174130.174131openalex-snapshot
Random walks on weighted graphs and applications to on-line algorithms
inferred← citeshttps://doi.org/10.1145/195058.195119openalex-snapshot
Efficient routing in all-optical networks
inferred← citeshttps://doi.org/10.1145/242224.242444openalex-snapshot
Future directions in program transformations
inferred← citeshttps://doi.org/10.1145/2647954openalex-snapshot
Quantifying Notions of Extensibility in FlexRay Schedule Synthesis
inferred← citeshttps://doi.org/10.1145/274440.274442openalex-snapshot
Competitive solutions for online financial problems
inferred← citeshttps://doi.org/10.1145/2854155openalex-snapshot
Near-Optimal Deterministic Steiner Tree Maintenance in Sensor Networks
inferred← citeshttps://doi.org/10.1145/301250.301284openalex-snapshot
Optimal buy-and-hold strategies for financial markets with bounded daily returns
inferred← citeshttps://doi.org/10.1145/3219166.3219179openalex-snapshot
How to Make Envy Vanish Over Time
inferred← citeshttps://doi.org/10.1145/331605.331606openalex-snapshot
The harmonic k -server algorithm is competitive
inferred← citeshttps://doi.org/10.1145/335305.335385openalex-snapshot
A guessing game and randomized online algorithms
inferred← citeshttps://doi.org/10.1145/335305.335408openalex-snapshot
Better algorithms for unfair metrical task systems and applications
inferred← citeshttps://doi.org/10.1145/3365002openalex-snapshot
Randomized Memoryless Algorithms for the Weighted and the Generalized k -server Problems
inferred← citeshttps://doi.org/10.1145/3494526openalex-snapshot
Adversarial Deep Learning for Online Resource Allocation
showing the first 200 of 232 · page through all 232
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.