On the public citation graph
A strongly competitive randomized paging algorithm
0 signed · 229 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.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.1145/2786.2793openalex-snapshot
Amortized efficiency of list update and paging rules
inferredcites →https://doi.org/10.1145/62212.62243openalex-snapshot
Competitive algorithms for on-line problems
inferredcites →https://doi.org/10.1147/sj.52.0078openalex-snapshot
A study of replacement algorithms for a virtual-storage computer
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jos.60openalex-snapshot
Randomized online scheduling on two uniform machines
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.1999.2809openalex-snapshot
A Randomized Algorithm for Two Servers on the Line
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.1996.0041openalex-snapshot
Randomized On-line Scheduling of Parallel Jobs
inferred← citeshttps://doi.org/10.1006/jagm.1999.1061openalex-snapshot
Competitive Algorithms for Relaxed List Update and Multilevel Caching
inferred← citeshttps://doi.org/10.1006/jagm.2000.1099openalex-snapshot
On-Line Paging Against Adversarially Biased Random Inputs
inferred← citeshttps://doi.org/10.1007/11549345_1openalex-snapshot
Page Migration in Dynamic Networks
inferred← citeshttps://doi.org/10.1007/11561071_60openalex-snapshot
Online View Maintenance Under a Response-Time Constraint
inferred← citeshttps://doi.org/10.1007/3-540-40996-3_4openalex-snapshot
A New Competitive Analysis of Randomized Caching
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-45061-0_52openalex-snapshot
A Study of Integrated Document and Connection Caching
inferred← citeshttps://doi.org/10.1007/3-540-45253-2_7openalex-snapshot
Online Algorithms for Caching Multimedia Streams
inferred← citeshttps://doi.org/10.1007/3-540-45471-3_43openalex-snapshot
Paging on a RAM with Limited Resources
inferred← citeshttps://doi.org/10.1007/3-540-46541-3_49openalex-snapshot
The Weighted 2-Server Problem
inferred← citeshttps://doi.org/10.1007/3-540-57273-2_39openalex-snapshot
The influence of lookahead in competitive paging algorithms
inferred← citeshttps://doi.org/10.1007/3-540-60922-9_48openalex-snapshot
On competitive on-line paging with lookahead
inferred← citeshttps://doi.org/10.1007/3-540-61680-2_72openalex-snapshot
Competitive analysis of randomized paging algorithms
inferred← citeshttps://doi.org/10.1007/3-540-64359-1_708openalex-snapshot
Randomized parallel prefetching and buffer management
inferred← citeshttps://doi.org/10.1007/3-540-68530-8_21openalex-snapshot
A Randomized Algorithm for Two Servers on the Line (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_267openalex-snapshot
Online Paging and Caching
inferred← citeshttps://doi.org/10.1007/978-1-4613-3282-4_9openalex-snapshot
Randomized Parallel Prefetching and Buffer Management
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_267openalex-snapshot
Online Paging and Caching
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-319-28684-6_15openalex-snapshot
On the Smoothness of Paging Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-59647-1_18openalex-snapshot
Competitive Clustering of Stochastic Communication Patterns on a Ring
inferred← citeshttps://doi.org/10.1007/978-3-540-24749-4_17openalex-snapshot
Online Competitive Algorithms for Maximizing Weighted Throughput of Unit Jobs
inferred← citeshttps://doi.org/10.1007/978-3-540-72914-3_13openalex-snapshot
The Worst Page-Replacement Policy
inferred← citeshttps://doi.org/10.1007/978-3-642-00202-1_34openalex-snapshot
Object Caching for Queries and Updates
inferred← citeshttps://doi.org/10.1007/978-3-642-02927-1_53openalex-snapshot
Greedy ${\ensuremath{\Delta}}$ -Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost
inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_37openalex-snapshot
Online Paging for Flash Memory Devices
inferred← citeshttps://doi.org/10.1007/978-3-642-20009-0_102openalex-snapshot
Online Optimization: Probabilistic Analysis and Algorithm Engineering
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_17openalex-snapshot
On Variants of File Caching
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_267-2openalex-snapshot
Online Paging and Caching
inferred← citeshttps://doi.org/10.1007/978-3-642-29116-6_14openalex-snapshot
OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-30850-5_28openalex-snapshot
Engineering Efficient Paging Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-34862-4_5openalex-snapshot
Energy Efficient Caching for Phase-Change Memory
inferred← citeshttps://doi.org/10.1007/978-3-642-39206-1_64openalex-snapshot
Improved Space Bounds for Strongly Competitive Randomized Paging Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-662-44777-2_18openalex-snapshot
Competitive Algorithms for Restricted Caching and Matroid Caching
inferred← citeshttps://doi.org/10.1007/978-3-662-48971-0_11openalex-snapshot
General Caching Is Hard: Even with Small Pages
inferred← citeshttps://doi.org/10.1007/978-3-662-53426-7_18openalex-snapshot
Online Balanced Repartitioning
inferred← citeshttps://doi.org/10.1007/bf00123680openalex-snapshot
Modelling a tool switching problem on a single NC-machine
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/bf01294260openalex-snapshot
On the power of randomization in on-line algorithms
inferred← citeshttps://doi.org/10.1007/bf01294264openalex-snapshot
A new measure for the study of on-line algorithms
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/pl00009192openalex-snapshot
A Unified Analysis of Paging and Caching
inferred← citeshttps://doi.org/10.1007/s00224-008-9114-1openalex-snapshot
The Worst Page-Replacement Policy
inferred← citeshttps://doi.org/10.1007/s00224-012-9427-yopenalex-snapshot
OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm
inferred← citeshttps://doi.org/10.1007/s00224-017-9813-6openalex-snapshot
On the Smoothness of Paging Algorithms
inferred← citeshttps://doi.org/10.1007/s00450-011-0149-1openalex-snapshot
Probabilistic alternatives for competitive analysis
inferred← citeshttps://doi.org/10.1007/s00450-011-0150-8openalex-snapshot
Migrating and replicating data in networks
inferred← citeshttps://doi.org/10.1007/s00450-011-0152-6openalex-snapshot
Adversarial models in paging
inferred← citeshttps://doi.org/10.1007/s00453-001-0095-6openalex-snapshot
Randomized Weighted Caching with Two Page Weights
inferred← citeshttps://doi.org/10.1007/s00453-006-0174-9openalex-snapshot
A Study of Integrated Document and Connection Caching in the WWW
inferred← citeshttps://doi.org/10.1007/s00453-008-9276-xopenalex-snapshot
New Results on Web Caching with Request Reordering
inferred← citeshttps://doi.org/10.1007/s00453-012-9629-3openalex-snapshot
Greedy Δ-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost
inferred← citeshttps://doi.org/10.1007/s00453-013-9793-0openalex-snapshot
Online File Caching with Rejection Penalties
inferred← citeshttps://doi.org/10.1007/s00453-024-01270-zopenalex-snapshot
Online Paging with Heterogeneous Cache Slots
inferred← citeshttps://doi.org/10.1007/s00607-018-0666-xopenalex-snapshot
Competitive clustering of stochastic communication patterns on a ring
inferred← citeshttps://doi.org/10.1007/s10107-003-0436-0openalex-snapshot
Online algorithms: a survey
inferred← citeshttps://doi.org/10.1007/s10878-017-0135-zopenalex-snapshot
A primal–dual online algorithm for the k-server problem on weighted HSTs
inferred← citeshttps://doi.org/10.1007/s10951-014-0400-2openalex-snapshot
Scheduling multi-colour print jobs with sequence-dependent setup times
inferred← citeshttps://doi.org/10.1016/0167-6377(95)00021-bopenalex-snapshot
A proof of the optimality of the MIN paging algorithm using linear programming duality
inferred← citeshttps://doi.org/10.1016/0196-6774(90)90003-wopenalex-snapshot
Competitive algorithms for server problems
inferred← citeshttps://doi.org/10.1016/0196-6774(91)90041-vopenalex-snapshot
Competitive paging algorithms
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/0377-2217(94)90002-7openalex-snapshot
Scheduling with resource management in manufacturing systems
inferred← citeshttps://doi.org/10.1016/j.cor.2017.07.013openalex-snapshot
Improved heuristic algorithms for the Job Sequencing and Tool Switching Problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2015.02.018openalex-snapshot
Improved integer linear programming formulations for the job Sequencing and tool Switching Problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2024.02.030openalex-snapshot
Exploiting symmetry for the job sequencing and tool switching problem
inferred← citeshttps://doi.org/10.1016/j.ipl.2004.01.009openalex-snapshot
Analysis of simple randomized buffer management for parallel I/O
inferred← citeshttps://doi.org/10.1016/j.ipl.2015.07.011openalex-snapshot
The optimal structure of algorithms for α -paging
inferred← citeshttps://doi.org/10.1016/j.jalgor.2004.06.002openalex-snapshot
Randomized k-server algorithms for growth-rate bounded graphs
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.jcss.2007.03.001openalex-snapshot
The relative worst-order ratio applied to paging
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.rcim.2007.02.011openalex-snapshot
An exact solution to the TLP problem in an NC machine
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.05.016openalex-snapshot
Combining request scheduling with web caching
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.05.018openalex-snapshot
Competitive caching of query results in search engines
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.2007.02.009openalex-snapshot
Paging with connections: FIFO strikes again
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.06.026openalex-snapshot
The k -resource problem in uniform metric spaces
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00034-xopenalex-snapshot
Trackless online algorithms for the server problem
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00099-9openalex-snapshot
A better lower bound on the competitive ratio of the randomized 2-server problem
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00128-2openalex-snapshot
The working set algorithm has competitive ratio less than two
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00080-5openalex-snapshot
Uniform multipaging reduces to paging
inferred← citeshttps://doi.org/10.1016/s0022-0000(03)00041-2openalex-snapshot
Connection caching: model and algorithms
inferred← citeshttps://doi.org/10.1016/s0022-0000(05)80060-1openalex-snapshot
Competitive k-server algorithms
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00045-2openalex-snapshot
More on randomized on-line algorithms for caching
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)89513-8openalex-snapshot
Paging more than one page
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00116-9openalex-snapshot
Competitive analysis of randomized paging algorithms
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00118-2openalex-snapshot
On competitive on-line paging with lookahead
inferred← citeshttps://doi.org/10.1016/s0377-2217(96)00388-8openalex-snapshot
Combinatorial optimization models for production scheduling in automated manufacturing systems
inferred← citeshttps://doi.org/10.1023/a:1009703014438openalex-snapshot
Optimal Randomized Scheduling by Replacement
inferred← citeshttps://doi.org/10.1023/a:1018939132489openalex-snapshot
k-server problems with bulk requests: an application to tool switching in manufacturing
inferred← citeshttps://doi.org/10.1080/00207543.2020.1748906openalex-snapshot
A new multicommodity flow model for the job sequencing and tool switching problem
inferred← citeshttps://doi.org/10.1080/002075498192120openalex-snapshot
The online tool switching problem with non-uniform tool size
inferred← citeshttps://doi.org/10.1080/07408170490257871openalex-snapshot
Exact algorithms for the job sequencing and tool switching problem
inferred← citeshttps://doi.org/10.1090/dimacs/007/02openalex-snapshot
The server problem and on-line games
inferred← citeshttps://doi.org/10.1109/focs.2007.43openalex-snapshot
A primal-dual randomized algorithm for weighted paging
inferred← citeshttps://doi.org/10.1109/focs.2007.7openalex-snapshot
Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments
inferred← citeshttps://doi.org/10.1109/focs.2011.63openalex-snapshot
A Polylogarithmic-Competitive Algorithm for the k-Server Problem
inferred← citeshttps://doi.org/10.1109/focs.2018.00049openalex-snapshot
Fusible HSTs and the Randomized k-Server Conjecture
inferred← citeshttps://doi.org/10.1109/fscs.1990.89566openalex-snapshot
Competitive k-server algorithms
inferred← citeshttps://doi.org/10.1109/infocom42981.2021.9488824openalex-snapshot
Optimal Online Balanced Graph Partitioning
inferred← citeshttps://doi.org/10.1109/infocom52122.2024.10621422openalex-snapshot
Dependency-Aware Online Caching
inferred← citeshttps://doi.org/10.1109/ipdps.2012.29openalex-snapshot
Competitive Cache Replacement Strategies for Shared Cache Environments
inferred← citeshttps://doi.org/10.1109/isca.2018.00020openalex-snapshot
Rethinking Belady's Algorithm to Accommodate Prefetching
inferred← citeshttps://doi.org/10.1109/istcs.1995.377026openalex-snapshot
Randomized on-line scheduling of parallel jobs
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185360openalex-snapshot
Optimal prefetching via data compression
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.1993.366885openalex-snapshot
Heat and Dump: competitive distributed paging
inferred← citeshttps://doi.org/10.1109/sfcs.1994.365677openalex-snapshot
Beyond competitive analysis [on-line algorithms]
inferred← citeshttps://doi.org/10.1109/sfcs.1995.492476openalex-snapshot
A unified analysis of paging and caching
inferred← citeshttps://doi.org/10.1109/sfcs.1995.492477openalex-snapshot
Application-controlled paging for a shared cache
inferred← citeshttps://doi.org/10.1109/tc.2002.1047757openalex-snapshot
PC-OPT: optimal offline prefetching and caching for parallel I/O systems
inferred← citeshttps://doi.org/10.1137/0220008openalex-snapshot
An Optimal On-Line Algorithm for K Servers on Trees
inferred← citeshttps://doi.org/10.1137/090779000openalex-snapshot
Randomized Competitive Algorithms for Generalized Caching
inferred← citeshttps://doi.org/10.1137/1.9781611975994.112openalex-snapshot
Near-Optimal Bounds for Online Caching with Machine Learned Advice
inferred← citeshttps://doi.org/10.1137/1.9781611977073.4openalex-snapshot
Learning-Augmented Weighted Paging
inferred← citeshttps://doi.org/10.1137/17m1158513openalex-snapshot
Dynamic Balanced Graph Partitioning
inferred← citeshttps://doi.org/10.1137/s0097539792224838openalex-snapshot
Lower Bounds for Randomized k -Server and Motion-Planning Algorithms
inferred← citeshttps://doi.org/10.1137/s0097539794261817openalex-snapshot
Optimal Prediction for Prefetching in the Worst Case
inferred← citeshttps://doi.org/10.1137/s0097539796299540openalex-snapshot
Beyond Competitive Analysis
inferred← citeshttps://doi.org/10.1137/s0097539797324278openalex-snapshot
Application-Controlled Paging for a Shared Cache
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.1145/100216.100268openalex-snapshot
On the power of randomization in online algorithms
inferred← citeshttps://doi.org/10.1145/1007912.1007925openalex-snapshot
New results on web caching with request reordering
inferred← citeshttps://doi.org/10.1145/1007912.1007950openalex-snapshot
Online algorithms for prefetching and caching on parallel disks
inferred← citeshttps://doi.org/10.1145/103418.103422openalex-snapshot
Competitive paging with locality of reference
inferred← citeshttps://doi.org/10.1145/103418.103450openalex-snapshot
Lower bounds for randomized k-server and motion-planning algorithms
inferred← citeshttps://doi.org/10.1145/1374376.1374412openalex-snapshot
Randomized competitive algorithms for generalized caching
inferred← citeshttps://doi.org/10.1145/1412700.1412719openalex-snapshot
SIGACT news online algorithms column 13
inferred← citeshttps://doi.org/10.1145/146585.146588openalex-snapshot
An optimal on-line algorithm for metrical task system
inferred← citeshttps://doi.org/10.1145/2339123.2339126openalex-snapshot
A Primal-Dual Randomized Algorithm for Weighted Paging
inferred← citeshttps://doi.org/10.1145/234752.234753openalex-snapshot
Optimal prefetching via data compression
inferred← citeshttps://doi.org/10.1145/2670127openalex-snapshot
Engineering Efficient Paging Algorithms
inferred← citeshttps://doi.org/10.1145/2783434openalex-snapshot
A Polylogarithmic-Competitive Algorithm for the k -Server Problem
inferred← citeshttps://doi.org/10.1145/2993749.2993765openalex-snapshot
SIGACT News Online Algorithms Column 29
inferred← citeshttps://doi.org/10.1145/2993749.2993766openalex-snapshot
Online Algorithms with Advice: A Survey
inferred← citeshttps://doi.org/10.1145/3188745.3188798openalex-snapshot
k-server via multiscale entropic regularization
inferred← citeshttps://doi.org/10.1145/3280826openalex-snapshot
An O (log k )-Competitive Algorithm for Generalized Caching
inferred← citeshttps://doi.org/10.1145/335305.335408openalex-snapshot
Better algorithms for unfair metrical task systems and applications
inferred← citeshttps://doi.org/10.1145/3357713.3384306openalex-snapshot
Unbounded lower bound for k-server against weak adversaries
inferred← citeshttps://doi.org/10.1145/3409964.3461801openalex-snapshot
Efficient Online Weighted Multi-Level Paging
inferred← citeshttps://doi.org/10.1145/341800.341808openalex-snapshot
Connection caching under various models of communication
inferred← citeshttps://doi.org/10.1145/3445028openalex-snapshot
Optimal Online Algorithms for File-Bundle Caching and Generalization to Distributed Caching
inferred← citeshttps://doi.org/10.1145/3490148.3538567openalex-snapshot
Competitive Algorithms for Block-Aware Caching
inferred← citeshttps://doi.org/10.1145/3568677openalex-snapshot
Competitive Algorithms for Generalized k -Server in Uniform Metrics
inferred← citeshttps://doi.org/10.1145/3581784.3607057openalex-snapshot
Optimizing Reconfigurable Optical Datacenters: The Power of Randomization
inferred← citeshttps://doi.org/10.1145/3676641.3716253openalex-snapshot
Concurrency-Informed Orchestration for Serverless Functions
inferred← citeshttps://doi.org/10.1145/378580.378648openalex-snapshot
Optimal prefetching and caching for parallel I/O sytems
inferred← citeshttps://doi.org/10.1145/3816782.3819196openalex-snapshot
Tight Latency Guarantees for Weighted Caching with Delayed Hits
inferred← citeshttps://doi.org/10.1147/rd.386.0683openalex-snapshot
Memory versus randomization in on-line algorithms
inferred← citeshttps://doi.org/10.11606/t.55.2017.tde-06012017-104534openalex-snapshot
O problema de minimização de trocas de ferramentas
inferred← citeshttps://doi.org/10.12681/eadd/10816openalex-snapshot
On-Line Algorithms and the k-Server Conjecture
inferred← citeshttps://doi.org/10.1561/0400000024openalex-snapshot
The Design of Competitive Online Algorithms via a Primal—Dual Approach
inferred← citeshttps://doi.org/10.1561/9781601982179openalex-snapshot
The Design of Competitive Online Algorithms via a Primal—Dual Approach
inferred← citeshttps://doi.org/10.1590/s0104-530x2009000300005openalex-snapshot
Um algoritmo enumerativo baseado em ordenamento parcial para resolução do problema de minimização de trocas de ferramentas
inferred← citeshttps://doi.org/10.17760/d20467217openalex-snapshot
Algorithms for network resource allocation under adversarial dynamics and assignment constraints
inferred← citeshttps://doi.org/10.21236/ada411858openalex-snapshot
Optimization Problems in High-Speed Networks
inferred← citeshttps://doi.org/10.34917/9112163openalex-snapshot
Analysis of Power-Down Systems with Five States
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2017.126openalex-snapshot
Stochastic k-Server: How Should Uber Work?
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2014.87openalex-snapshot
Generalized Reordering Buffer Management
showing the first 200 of 224 · page through all 224
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.