Skip header Section
Skip Bibliometrics Section
Online computation and competitive analysisMay 1998
- Authors:
- Allan Borodin,
- Ran El-Yaniv
Abstract
No abstract available.
Cited By
- Liu H, Luo K, Xu Y and Zhang H (2024). Online car-sharing problem with variable booking times, Journal of Combinatorial Optimization, 47:3, Online publication date: 1-Apr-2024.
- Bilò V, Moscardelli L and Vinci C (2024). Uniform Mixed Equilibria in Network Congestion Games with Link Failures, Mathematics of Operations Research, 49:1, (509-535), Online publication date: 1-Feb-2024.
- Chen X, Ma W, Simchi-Levi D and Xin L (2024). Assortment Planning for Recommendations at Checkout Under Inventory Constraints, Mathematics of Operations Research, 49:1, (297-325), Online publication date: 1-Feb-2024.
- Bajaj S, Bopardikar S, Torng E, Von Moll A and Casbeer D (2024). Multivehicle Perimeter Defense in Conical Environments, IEEE Transactions on Robotics, 40, (1439-1456), Online publication date: 1-Jan-2024.
- Burjons E, Frei F, Gehnen M, Lotze H, Mock D and Rossmanith P Delaying Decisions and Reservation Costs Computing and Combinatorics, (371-383)
Bienkowski M, Fuchssteiner D and Schmid S Optimizing Reconfigurable Optical Datacenters: The Power of Randomization Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, (1-11)- Shiri D, Akbari V and Tozan H (2023). Online optimisation for ambulance routing in disaster response with partial or no information on victim conditions, Computers and Operations Research, 159:C, Online publication date: 1-Nov-2023.
- Bein W and Larmore L (2023). Breaking the 2-competitiveness barrier for two servers in a tree, Theoretical Computer Science, 977:C, Online publication date: 25-Oct-2023.
- Hajiesmaili M (2023). Trade-off Analysis in Learning-augmented Algorithms with Societal Design Criteria, ACM SIGMETRICS Performance Evaluation Review, 51:2, (53-58), Online publication date: 28-Sep-2023.
- Basiak M, Bienkowski M and Tatarczuk A An Improved Deterministic Algorithm for the Online Min-Sum Set Cover Problem Approximation and Online Algorithms , (45-58)
- Ni G (2023). An improved online replenishment policy and its competitive ratio analysis for a purchase-to-order seller, Journal of Combinatorial Optimization, 46:2, Online publication date: 1-Sep-2023.
- Patil V, Nair V, Ghalme G and Khan A Mitigating disparity while maximizing reward Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, (4100-4108)
- Banerjee S, Gkatzelis V, Hossain S, Jin B, Micha E and Shah N Proportionally fair online allocation of public goods with predictions Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, (20-28)
- Yu F, Zeng Y, Mao J and Li W Online estimation of similarity matrices with incomplete data Proceedings of the Thirty-Ninth Conference on Uncertainty in Artificial Intelligence, (2454-2464)
- Boyar J, Favrholdt L, Kamali S and Larsen K Online Interval Scheduling with Predictions Algorithms and Data Structures, (193-207)
- Lindermayr A, Megow N and Rapp M Speed-oblivious online scheduling Proceedings of the 40th International Conference on Machine Learning, (21312-21334)
- Lassota A, Lindermayr A, Megow N and Schlöter J Minimalistic predictions to schedule jobs with online precedence constraints Proceedings of the 40th International Conference on Machine Learning, (18563-18583)
- Correa J, Cristi A, Duetting P, Hajiaghayi M, Olkowski J and Schewior K Trading Prophets Proceedings of the 24th ACM Conference on Economics and Computation, (490-510)
- Bender M, Das R, Farach-Colton M and Tagliavini G An Associativity Threshold Phenomenon in Set-Associative Caches Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, (117-127)
- Berndt N and Lotze H Advice Complexity Bounds for Online Delayed -Node-, H-Node- and H-Edge-Deletion Problems Combinatorial Algorithms, (62-73)
- Li X, Pan L and Liu S (2023). An online service provisioning strategy for container-based cloud brokers, Journal of Network and Computer Applications, 214:C, Online publication date: 1-May-2023.
- Bastankhah M, Chatterjee K, Maddah-Ali M, Schmid S, Svoboda J and Yeo M R2: Boosting Liquidity in Payment Channel Networks with Online Admission Control Financial Cryptography and Data Security, (309-325)
- Antoniadis A, Coester C, Eliáš M, Polak A and Simon B (2023). Online Metric Algorithms with Untrusted Predictions, ACM Transactions on Algorithms, 19:2, (1-34), Online publication date: 30-Apr-2023.
- Rabinowitz A and Rawitz D (2023). Overflow management with self-eliminations, Theoretical Computer Science, 948:C, Online publication date: 28-Feb-2023.
- Bienkowski M and Mucha M An improved algorithm for online min-sum set cover Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence and Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence and Thirteenth Symposium on Educational Advances in Artificial Intelligence, (6815-6822)
- Kahng A, Latifian M and Shah N Voting with preference intensities Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence and Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence and Thirteenth Symposium on Educational Advances in Artificial Intelligence, (5697-5704)
- Erlebach T, Hoffmann M and de Lima M (2023). Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries, Algorithmica, 85:2, (406-443), Online publication date: 1-Feb-2023.
- Bansal N, Eliáš M, Koumoutsos G and Nederlof J (2022). Competitive Algorithms for Generalized k-Server in Uniform Metrics, ACM Transactions on Algorithms, 19:1, (1-15), Online publication date: 31-Jan-2023.
- Bergé P and Salaün L (2023). The influence of maximum (s,t)-cuts on the competitiveness of deterministic strategies for the Canadian Traveller Problem, Theoretical Computer Science, 941:C, (221-240), Online publication date: 4-Jan-2023.
- Aggarwal A, Gupta D, Vining W, Fricke G and Moses M Ignorance is Not Bliss: An Analysis of Central-Place Foraging Algorithms 2019 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), (6510-6517)
- Liu M and Tang X (2022). Dynamic Bin Packing with Predictions, Proceedings of the ACM on Measurement and Analysis of Computing Systems, 6:3, (1-24), Online publication date: 1-Dec-2022.
- Liu M and Tang X (2022). Busy-Time Scheduling on Heterogeneous Machines: Algorithms and Analysis, IEEE Transactions on Parallel and Distributed Systems, 33:12, (3942-3958), Online publication date: 1-Dec-2022.
- Zhao H, Deng S, Liu Z, Xiang Z, Yin J, Dustdar S and Zomaya A (2022). DPoS: Decentralized, Privacy-Preserving, and Low-Complexity Online Slicing for Multi-Tenant Networks, IEEE Transactions on Mobile Computing, 21:12, (4296-4309), Online publication date: 1-Dec-2022.
- He X, Xiang J, Xiao J, Cheng T and Tian Y (2022). An online algorithm for the inventory retrieval problem with an uncertain selling duration, uncertain prices, and price-dependent demands, Computers and Operations Research, 148:C, Online publication date: 1-Dec-2022.
- Hajiaghayi M, Khani M, Panigrahi D and Springer M Online algorithms for the santa claus problem Proceedings of the 36th International Conference on Neural Information Processing Systems, (30732-30743)
- Bhattacharya A and Das R (2022). Machine learning advised algorithms for the ski rental problem with a discount, Theoretical Computer Science, 938:C, (39-49), Online publication date: 26-Nov-2022.
- Perez-Salazar S, Singh M and Toriello A (2022). Adaptive Bin Packing with Overflow, Mathematics of Operations Research, 47:4, (3317-3356), Online publication date: 1-Nov-2022.
- Liu W and Zhu J (2022). A multistage decision-making method with quantum-guided expert state transition based on normal cloud models, Information Sciences: an International Journal, 615:C, (700-730), Online publication date: 1-Nov-2022.
- Chen H and Zheng C (2022). Efficient and competitive broadcast in multi-channel radio networks, Information and Computation, 289:PA, Online publication date: 1-Nov-2022.
- Song X, Pan L and Liu S (2022). An online algorithm for optimally releasing multiple on-demand instances in IaaS clouds, Future Generation Computer Systems, 136:C, (311-321), Online publication date: 1-Nov-2022.
- Dai W, Zheng M, Chen X and Yang Z (2022). Online economic ordering problem for deteriorating items with limited price information, Journal of Combinatorial Optimization, 44:4, (2246-2268), Online publication date: 1-Nov-2022.
- De M and Singh S Hitting Geometric Objects Online via Points in Computing and Combinatorics, (537-548)
- Chai X, Li W, Yuan H and Wang L (2022). Online scheduling on a single machine with linear deteriorating processing times and delivery times, Journal of Combinatorial Optimization, 44:3, (1900-1912), Online publication date: 1-Oct-2022.
- Danassis P, Sakota M, Filos-Ratsikas A and Faltings B (2022). Putting ridesharing to the test: efficient and scalable solutions and the power of dynamic vehicle relocation, Artificial Intelligence Review, 55:7, (5781-5844), Online publication date: 1-Oct-2022.
- Giannakopoulos Y, Poças D and Tsigonias-Dimitriadis A (2022). Robust Revenue Maximization Under Minimal Statistical Information, ACM Transactions on Economics and Computation, 10:3, (1-34), Online publication date: 30-Sep-2022.
- Li S, Li M, Duan L and Lee V (2022). Efficient algorithms for ride-hitching in UAV travelling, Theoretical Computer Science, 929:C, (140-156), Online publication date: 11-Sep-2022.
- Smedira D and Shmoys D Scheduling Appointments Online: The Power of Deferred Decision-Making Approximation and Online Algorithms, (82-115)
- Poursoltani M and Delage E (2022). Adjustable Robust Optimization Reformulations of Two-Stage Worst-Case Regret Minimization Problems, Operations Research, 70:5, (2906-2930), Online publication date: 1-Sep-2022.
- Hemaspaandra E, Hemaspaandra L and Rothe J (2022). The complexity of online bribery in sequential elections, Journal of Computer and System Sciences, 127:C, (66-90), Online publication date: 1-Aug-2022.
- Liu S and Poon C (2022). Greedy algorithms for the profit-aware social team formation problem, Journal of Combinatorial Optimization, 44:1, (94-118), Online publication date: 1-Aug-2022.
- Agrawal K, Bender M, Das R, Kuszmaul W, Peserico E and Scquizzato M Online Parallel Paging with Optimal Makespan Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures, (205-216)
- DeLayo D, Zhang K, Agrawal K, Bender M, Berry J, Das R, Moseley B and Phillips C Automatic HBM Management Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures, (147-159)
- Zhao T, Li C, Li W and Zomaya A Brief Announcement Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures, (385-388)
- Farahani M, Dawande M and Janakiraman G (2022). Order Now, Pickup in 30 Minutes, Operations Research, 70:4, (2013-2031), Online publication date: 1-Jul-2022.
- Perez-Salazar S, Menache I, Singh M and Toriello A (2022). Dynamic Resource Allocation in the Cloud with Near-Optimal Efficiency, Operations Research, 70:4, (2517-2537), Online publication date: 1-Jul-2022.
- Feng X and Chu C (2022). Online leasing problem with price fluctuations and the second-hand transaction, Journal of Combinatorial Optimization, 43:5, (1280-1297), Online publication date: 1-Jul-2022.
- Luo K, Xu Y and Liu H (2022). Online scheduling of car-sharing request pairs between two locations, Journal of Combinatorial Optimization, 43:5, (1240-1263), Online publication date: 1-Jul-2022.
- Vinci C, Bilò V, Monaco G and Moscardelli L (2022). Nash Social Welfare in Selfish and Online Load Balancing, ACM Transactions on Economics and Computation, 10:2, (1-41), Online publication date: 30-Jun-2022.
- Menati A, Chau S and Chen M Competitive prediction-aware online algorithms for energy generation scheduling in microgrids Proceedings of the Thirteenth ACM International Conference on Future Energy Systems, (383-394)
- Chau S and Zhou Y Blockchain-enabled decentralized privacy-preserving group purchasing for retail energy plans Proceedings of the Thirteenth ACM International Conference on Future Energy Systems, (172-187)
- Böckenhauer H, Corvelo Benz N and Komm D (2022). Call admission problems on trees, Theoretical Computer Science, 922:C, (410-423), Online publication date: 24-Jun-2022.
- Yang L, Zeynali A, Hajiesmaili M, Sitaraman R and Towsley D (2022). Competitive Algorithms for Online Multidimensional Knapsack Problems, ACM SIGMETRICS Performance Evaluation Review, 50:1, (87-88), Online publication date: 20-Jun-2022.
- Dwibedy D and Mohanty R (2022). Online List Scheduling for Makespan Minimization, ACM SIGACT News, 53:2, (84-105), Online publication date: 10-Jun-2022.
- Burjons E, Fuchs J and Lotze H The Slotted Online One-Sided Crossing Minimization Problem on 2-Regular Graphs Combinatorial Algorithms, (243-256)
- Yang L, Zeynali A, Hajiesmaili M, Sitaraman R and Towsley D Competitive Algorithms for Online Multidimensional Knapsack Problems Abstract Proceedings of the 2022 ACM SIGMETRICS/IFIP PERFORMANCE Joint International Conference on Measurement and Modeling of Computer Systems, (87-88)
- Luo K, Erlebach T and Xu Y (2022). Car-sharing between two locations, Discrete Applied Mathematics, 313:C, (53-66), Online publication date: 31-May-2022.
- Böckenhauer H, Komm D and Wegner R (2022). Call admission problems on grids with advice, Theoretical Computer Science, 918:C, (77-93), Online publication date: 29-May-2022.
- Komm D, Královič R, Královič R and Mömke T (2022). Randomized Online Computation with High Probability Guarantees, Algorithmica, 84:5, (1357-1384), Online publication date: 1-May-2022.
- Dumitrescu A and Tóth C (2022). Online Unit Clustering and Unit Covering in Higher Dimensions, Algorithmica, 84:5, (1213-1231), Online publication date: 1-May-2022.
- Batz K, Gallus A, Kaminski B, Katoen J and Winkler T (2022). Weighted programming: a programming paradigm for specifying mathematical models, Proceedings of the ACM on Programming Languages, 6:OOPSLA1, (1-30), Online publication date: 29-Apr-2022.
- Liu M, Pan L and Liu S (2022). Effeclouds, Future Generation Computer Systems, 129:C, (33-49), Online publication date: 1-Apr-2022.
- Tong Y, Zeng Y, Zhou Z, Chen L and Xu K (2022). Unified Route Planning for Shared Mobility: An Insertion-based Framework, ACM Transactions on Database Systems, 47:1, (1-48), Online publication date: 31-Mar-2022.
- Lee R, Zhou Y, Yang L, Hajiesmaili M and Sitaraman R (2022). Competitive Bidding Strategies for Online Linear Optimization with Inventory Management Constraints, ACM SIGMETRICS Performance Evaluation Review, 49:3, (6-7), Online publication date: 22-Mar-2022.
- Cheung W, Ma W, Simchi-Levi D and Wang X (2022). Inventory Balancing with Online Learning, Management Science, 68:3, (1776-1807), Online publication date: 1-Mar-2022.
- Bogomolnaia A, Moulin H and Sandomirskiy F (2022). On the Fair Division of a Random Object, Management Science, 68:2, (1174-1194), Online publication date: 1-Feb-2022.
- Bernstein A, Disser Y, Groß M and Himburg S (2022). General bounds for incremental maximization, Mathematical Programming: Series A and B, 191:2, (953-979), Online publication date: 1-Feb-2022.
- Boyar J, Favrholdt L and Larsen K (2021). Relative Worst-order Analysis, ACM Computing Surveys, 54:1, (1-21), Online publication date: 31-Jan-2022.
- Markovitch M and Scalosub G (2021). Bounded delay scheduling with packet dependencies, Computer Communications, 182:C, (98-109), Online publication date: 15-Jan-2022.
- Flammini M, Monaco G, Moscardelli L, Shalom M and Zaks S (2021). On the Online Coalition Structure Generation Problem, Journal of Artificial Intelligence Research, 72, (1215-1250), Online publication date: 4-Jan-2022.
- Chen X, Zhang J, Fu C, Fekete J and Wang Y (2022). Pyramid-based Scatterplots Sampling for Progressive and Streaming Data Visualization, IEEE Transactions on Visualization and Computer Graphics, 28:1, (593-603), Online publication date: 1-Jan-2022.
- Yang L, Zeynali A, Hajiesmaili M, Sitaraman R and Towsley D (2021). Competitive Algorithms for Online Multidimensional Knapsack Problems, Proceedings of the ACM on Measurement and Analysis of Computing Systems, 5:3, (1-30), Online publication date: 14-Dec-2021.
- Rivkin D, Meger D, Wu D, Chen X, Liu X and Dudek G Learning Assisted Identification of Scenarios Where Network Optimization Algorithms Under-Perform 2021 IEEE Global Communications Conference (GLOBECOM), (1-7)
- Kobayashi K (2021). An optimal algorithm for 2-bounded delay buffer management with lookahead, Theoretical Computer Science, 896:C, (65-78), Online publication date: 6-Dec-2021.
- Chaplick S, Halldórsson M, de Lima M and Tonoyan T (2021). Query minimization under stochastic uncertainty, Theoretical Computer Science, 895:C, (75-95), Online publication date: 4-Dec-2021.
- Lee R, Zhou Y, Yang L, Hajiesmaili M and Sitaraman R (2021). Competitive bidding strategies for online linear optimization with inventory management constraints, Performance Evaluation, 152:C, Online publication date: 1-Dec-2021.
- Zhou Y and Chau S Sharing economy meets energy markets Proceedings of the 8th ACM International Conference on Systems for Energy-Efficient Buildings, Cities, and Transportation, (196-199)
- Lee R, Maghakian J, Hajiesmaili M, Li J, Sitaraman R and Liu Z (2022). Online peak-aware energy scheduling with untrusted advice, ACM SIGEnergy Energy Informatics Review, 1:1, (59-77), Online publication date: 1-Nov-2021.
- Li S, Li M, Duan L and Lee V Online Ride-Hitching in UAV Travelling Computing and Combinatorics, (565-576)
- Burjons E, Gehnen M, Lotze H, Mock D and Rossmanith P The Secretary Problem with Reservation Costs Computing and Combinatorics, (553-564)
- Gokul Vasan L, F. Zulian É, Weis C, Jung M and Wehn N Online Working Set Change Detection with Constant Complexity Proceedings of the International Symposium on Memory Systems, (1-16)
- Selivanov V and Selivanova S Primitive Recursive Ordered Fields and Some Applications Computer Algebra in Scientific Computing, (353-369)
- Rabinowitz A and Rawitz D Overflow Management with Self-eliminations Algorithms for Sensor Systems, (124-139)
- Bienkowski M, Böhm M, Koutecký M, Rothvoß T, Sgall J and Veselý P Improved Analysis of Online Balanced Clustering Approximation and Online Algorithms, (224-233)
- Moraga-Correa J, Quezada F, Rojo-González L and Vásquez Ó (2021). The balanced dispatching problem in passengers transport services on demand, Expert Systems with Applications: An International Journal, 177:C, Online publication date: 1-Sep-2021.
- Lykouris T and Vassilvitskii S (2021). Competitive Caching with Machine Learned Advice, Journal of the ACM, 68:4, (1-25), Online publication date: 1-Aug-2021.
- Azar Y, Ganesh A, Ge R and Panigrahi D (2021). Online Service with Delay, ACM Transactions on Algorithms, 17:3, (1-31), Online publication date: 31-Jul-2021.
- Coester C, Koutsoupias E and Lazos P (2021). The Infinite Server Problem, ACM Transactions on Algorithms, 17:3, (1-23), Online publication date: 31-Jul-2021.
- Bender M, Bhattacharjee A, Conway A, Farach-Colton M, Johnson R, Kannan S, Kuszmaul W, Mukherjee N, Porter D, Tagliavini G, Vorobyeva J and West E Paging and the Address-Translation Problem Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures, (105-117)
- Liu M and Tang X Analysis of Busy-Time Scheduling on Heterogeneous Machines Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures, (340-350)
- Narayana V, Moharir S and Karamchandani N (2021). On Renting Edge Resources for Service Hosting, ACM Transactions on Modeling and Performance Evaluation of Computing Systems, 6:2, (1-30), Online publication date: 30-Jun-2021.
- Lee R, Maghakian J, Hajiesmaili M, Li J, Sitaraman R and Liu Z Online Peak-Aware Energy Scheduling with Untrusted Advice Proceedings of the Twelfth ACM International Conference on Future Energy Systems, (107-123)
- Mo Y, Lin Q, Chen M and Qin S Optimal Online Algorithms for Peak-Demand Reduction Maximization with Energy Storage Proceedings of the Twelfth ACM International Conference on Future Energy Systems, (73-83)
- Haeupler B, Wajc D and Zuzic G Universally-optimal distributed algorithms for known topologies Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, (1166-1179)
- Pacut M, Parham M and Schmid S Optimal Online Balanced Graph Partitioning IEEE INFOCOM 2021 - IEEE Conference on Computer Communications, (1-9)
- Demaine E, Huang Y, Liao C and Sadakane K (2021). Approximating the Canadian Traveller Problem with Online Randomization, Algorithmica, 83:5, (1524-1543), Online publication date: 1-May-2021.
- Bienkowski M, Fuchssteiner D, Marcinkowski J and Schmid S (2021). Online Dynamic B-Matching, ACM SIGMETRICS Performance Evaluation Review, 48:3, (99-108), Online publication date: 5-Mar-2021.
- Agrawal K, Bender M, Das R, Kuszmaul W, Peserico E and Scquizzato M Tight bounds for parallel paging and green paging Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, (3022-3041)
- Bistaffa F, Blum C, Cerquides J, Farinelli A and Rodríguez-Aguilar J (2020). A Computational Approach to Quantify the Benefits of Ridesharing for Policy Makers and Travellers, IEEE Transactions on Intelligent Transportation Systems, 22:1, (119-130), Online publication date: 1-Jan-2021.
- Gaoa L and Rouskas G Service Chain Rerouting for NFV Load Balancing GLOBECOM 2020 - 2020 IEEE Global Communications Conference, (1-6)
- Bilò V, Monaco G, Moscardelli L and Vinci C Nash Social Welfare in Selfish and Online Load Balancing Web and Internet Economics, (323-337)
- Bender M, Gilbert J, Krishnan A and Pruhs K Competitively Pricing Parking in a Tree Web and Internet Economics, (220-233)
- Giannakopoulos Y, Poças D and Tsigonias-Dimitriadis A Robust Revenue Maximization Under Minimal Statistical Information Web and Internet Economics, (177-190)
- Banerjee S Improving online rent-or-buy algorithms with sequential decision making and ML predictions Proceedings of the 34th International Conference on Neural Information Processing Systems, (21072-21080)
- Ren R, Zhu Y, Li C and Tang X (2020). Interval Job Scheduling With Machine Launch Cost, IEEE Transactions on Parallel and Distributed Systems, 31:12, (2776-2788), Online publication date: 1-Dec-2020.
- Karami F, Vancroonenburg W and Vanden Berghe G (2020). A periodic optimization approach to dynamic pickup and delivery problems with time windows, Journal of Scheduling, 23:6, (711-731), Online publication date: 1-Dec-2020.
- Dürr C, Erlebach T, Megow N and Meißner J (2020). An Adversarial Model for Scheduling with Testing, Algorithmica, 82:12, (3630-3675), Online publication date: 1-Dec-2020.
- Angelopoulos S, Dürr C and Jin S (2020). Online maximum matching with recourse, Journal of Combinatorial Optimization, 40:4, (974-1007), Online publication date: 1-Nov-2020.
- Lee E and Singla S (2020). Maximum Matching in the Online Batch-arrival Model, ACM Transactions on Algorithms, 16:4, (1-31), Online publication date: 31-Oct-2020.
- Li S, Zheng L and Lee V Car-Sharing: Online Scheduling k Cars Between Two Locations Frontiers in Algorithmics, (49-61)
- Hanji K, Fujiwara H and Yamamoto H Online Removable Knapsack Problems for Integer-Sized Items Theory and Applications of Models of Computation, (82-93)
- Allouah A and Besbes O (2020). Prior-Independent Optimal Auctions, Management Science, 66:10, (4417-4432), Online publication date: 1-Oct-2020.
- Kogan K, Menikkumbura D, Petri G, Noh Y, Nikolenko S, Sirotkin A and Eugster P (2020). Towards Software-Defined Buffer Management, IEEE/ACM Transactions on Networking, 28:5, (2337-2349), Online publication date: 1-Oct-2020.
- El Ghor H and Aggoune E (2016). Energy efficient scheduler of aperiodic jobs for real-time embedded systems, International Journal of Automation and Computing, 17:5, (733-743), Online publication date: 1-Oct-2020.
- Liu Q, Zheng L, Shen Y and Chen L Finish Them on the Fly: An Incentive Mechanism for Real-Time Spatial Crowdsourcing Database Systems for Advanced Applications, (694-710)
- Christou D, Fotakis D and Koumoutsos G Memoryless Algorithms for the Generalized k-server Problem on Uniform Metrics Approximation and Online Algorithms, (143-158)
- Chen Z, Cheng P, Chen L, Lin X and Shahabi C (2020). Fair task assignment in spatial crowdsourcing, Proceedings of the VLDB Endowment, 13:12, (2479-2492), Online publication date: 1-Aug-2020.
- Almagor S and Kupferman O Good-Enough Synthesis Computer Aided Verification, (541-563)
- Antoniadis A, Coester C, Eliáš M, Polak A and Simon B Online metric algorithms with untrusted predictions Proceedings of the 37th International Conference on Machine Learning, (345-355)
- Castenow J, Feldkord B, Knollmann T, Malatyali M and Meyer Auf der Heide F The Online Multi-Commodity Facility Location Problem Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, (129-139)
- Wang C, Chiang S, Shen S, Yang D and Chen W Multicast Traffic Engineering with Segment Trees in Software-Defined Networks IEEE INFOCOM 2020 - IEEE Conference on Computer Communications, (1808-1817)
- Stein C, Truong V and Wang X (2020). Advance Service Reservations with Heterogeneous Customers, Management Science, 66:7, (2929-2950), Online publication date: 1-Jul-2020.
- Bienkowski M, Byrka J, Coester C and Jeż Ł Unbounded lower bound for k-server against weak adversaries Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, (1165-1169)
- Jha R, Lee S, Iyengar S, Hajiesmaili M, Irwin D and Shenoy P Emission-aware Energy Storage Scheduling for a Greener Grid Proceedings of the Eleventh ACM International Conference on Future Energy Systems, (363-373)
- Chen L, Hung L, Lotze H and Rossmanith P Further Results on Online Node- and Edge-Deletion Problems with Advice Combinatorial Algorithms, (140-153)
- Yang L, Hajiesmaili M, Sitaraman R, Wierman A, Mallada E and Wong W (2020). Online Linear Optimization with Inventory Management Constraints, Proceedings of the ACM on Measurement and Analysis of Computing Systems, 4:1, (1-29), Online publication date: 27-May-2020.
- Borodin A, Boyar J, Larsen K and Pankratov D (2019). Advice Complexity of Priority Algorithms, Theory of Computing Systems, 64:4, (593-625), Online publication date: 1-May-2020.
- Paschos G, Destounis A and Iosifidis G (2020). Online Convex Optimization for Caching Networks, IEEE/ACM Transactions on Networking, 28:2, (625-638), Online publication date: 1-Apr-2020.
- Chrobak M, Dürr C, Fabijan A and Nilsson B (2019). Online Clique Clustering, Algorithmica, 82:4, (938-965), Online publication date: 1-Apr-2020.
- Dinh T, Liang B, Quek T and Shin H (2020). Online Resource Procurement and Allocation in a Hybrid Edge-Cloud Computing System, IEEE Transactions on Wireless Communications, 19:3, (2137-2149), Online publication date: 1-Mar-2020.
- Dumitrescu A, Ghosh A and Tóth C (2020). Online unit covering in Euclidean space, Theoretical Computer Science, 809:C, (218-230), Online publication date: 24-Feb-2020.
- Kobayashi K (2020). Online interval scheduling to maximize total satisfaction, Theoretical Computer Science, 806:C, (673-688), Online publication date: 2-Feb-2020.
- Erradi A and Mansouri Y (2020). Online cost optimization algorithms for tiered cloud storage services, Journal of Systems and Software, 160:C, Online publication date: 1-Feb-2020.
- Sangha P, Wong P and Zito M (2020). Dynamic programming optimization in line of sight networks, Information and Computation, 270:C, Online publication date: 1-Feb-2020.
- Bienkowski M, Böhm M, Byrka J, Chrobak M, Dürr C, Folwarczný L, Jeż Ł, Sgall J, Thang N and Veselý P (2020). Online Algorithms for Multilevel Aggregation, Operations Research, 68:1, (214-232), Online publication date: 1-Jan-2020.
- Tan X, Leon-Garcia A, Wu Y and Tsang D (2020). Posted-Price Retailing of Transactive Energy: An Optimal Online Mechanism Without Prediction, IEEE Journal on Selected Areas in Communications, 38:1, (5-16), Online publication date: 1-Jan-2020.
- Alinia B, Hajiesmaili M and Crespi N (2019). Online EV Charging Scheduling With On-Arrival Commitment, IEEE Transactions on Intelligent Transportation Systems, 20:12, (4524-4537), Online publication date: 1-Dec-2019.
- Liu Y (2019). An optimization-driven dynamic vehicle routing algorithm for on-demand meal delivery using drones, Computers and Operations Research, 111:C, (1-20), Online publication date: 1-Nov-2019.
- Bergé P, Desmarchelier J, Guo W, Lefebvre A, Rimmel A and Tomasik J (2019). Multiple Canadians on the road: minimizing the distance competitive ratio, Journal of Combinatorial Optimization, 38:4, (1086-1100), Online publication date: 1-Nov-2019.
- Bienkowski M, Byrka J and Mucha M (2019). Dynamic Beats Fixed, ACM Transactions on Algorithms, 15:4, (1-21), Online publication date: 31-Oct-2019.
- Erlebach T, Liu F, Liu H, Shalom M, Wong P and Zaks S (2019). Complexity and online algorithms for minimum skyline coloring of intervals, Theoretical Computer Science, 788:C, (66-78), Online publication date: 8-Oct-2019.
- Luo K, Xu Y and Zhang H (2019). On-line scheduling with monotone subsequence constraints, Theoretical Computer Science, 786:C, (13-25), Online publication date: 27-Sep-2019.
- Wu G, Chen J and Wang J (2019). On scheduling inclined jobs on multiple two-stage flowshops, Theoretical Computer Science, 786:C, (67-77), Online publication date: 27-Sep-2019.
- Avarikioti G, Besic K, Wang Y and Wattenhofer R Online Payment Network Design Data Privacy Management, Cryptocurrencies and Blockchain Technology, (307-320)
- Bergé P and Salaün L Improved Deterministic Strategy for the Canadian Traveller Problem Exploiting Small Max-(s, t)-Cuts Approximation and Online Algorithms, (29-42)
- Liu F, Liu H and Wong P Greedy Is Optimal for Online Restricted Assignment and Smart Grid Scheduling for Unit Size Jobs Approximation and Online Algorithms, (217-231)
- Balseiro S and Gur Y (2019). Learning in Repeated Auctions with Budgets, Management Science, 65:9, (3952-3968), Online publication date: 1-Sep-2019.
- Yang C, Chen L, Shang S, Zhu F, Liu L and Shao L Toward efficient navigation of massive-scale geo-textual streams Proceedings of the 28th International Joint Conference on Artificial Intelligence, (4838-4845)
- De Filippo A, Lombardi M and Milano M How to tame your anticipatory algorithm Proceedings of the 28th International Joint Conference on Artificial Intelligence, (1071-1077)
- Danassis P, Filos-Ratsikas A and Faltings B Anytime heuristic for weighted matching through altruism-inspired behavior Proceedings of the 28th International Joint Conference on Artificial Intelligence, (215-222)
- Kobayashi K An Optimal Algorithm for 2-Bounded Delay Buffer Management with Lookahead Computing and Combinatorics, (350-362)
- Aggarwal A, Fricke G, Gupta D and Moses M On Site Fidelity and the Price of Ignorance in Swarm Robotic Central Place Foraging Algorithms Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, (63-65)
- Böhm M, Chrobak M, Jeż Ł, Li F, Sgall J and Veselý P (2019). Online packet scheduling with bounded delay and lookahead, Theoretical Computer Science, 776:C, (95-113), Online publication date: 12-Jul-2019.
- Zang S, Bao W, Yeoh P, Vucetic B and Li Y (2019). Filling Two Needs With One Deed: Combo Pricing Plans for Computing-Intensive Multimedia Applications, IEEE Journal on Selected Areas in Communications, 37:7, (1518-1533), Online publication date: 1-Jul-2019.
- Morozov V (2019). A Securities Selling Game, Computational Mathematics and Modeling, 30:3, (295-301), Online publication date: 1-Jul-2019.
- Azar Y, Emek Y, van Stee R and Vainstein D The Price of Clustering in Bin-Packing with Applications to Bin-Packingwith Delays The 31st ACM Symposium on Parallelism in Algorithms and Architectures, (1-10)
- Chau S, Xu J, Bow W and Elbassioni K Peer-to-Peer Energy Sharing Proceedings of the Tenth ACM International Conference on Future Energy Systems, (215-225)
- Ahmad S, Rosenthal A, Hajiesmaili M and Sitaraman R Learning from Optimal Proceedings of the Tenth ACM International Conference on Future Energy Systems, (326-330)
- Zhai J, Chau S and Chen M Stay or Switch Proceedings of the Tenth ACM International Conference on Future Energy Systems, (100-110)
- Sung Y and Tokekar P A Competitive Algorithm for Online Multi-Robot Exploration of a Translating Plume 2019 International Conference on Robotics and Automation (ICRA), (3391-3397)
- Bansal N, Eliéš M, Jeż Ł and Koumoutsos G (2019). The (h,k)-Server Problem on Bounded Depth Trees, ACM Transactions on Algorithms, 15:2, (1-26), Online publication date: 2-May-2019.
- Boyar J, Eidenbenz S, Favrholdt L, KotrbăýÍk M and Larsen K (2019). Online Dominating Set, Algorithmica, 81:5, (1938-1964), Online publication date: 1-May-2019.
- Burjons E, Komm D and Schöngens M (2019). The k-Server Problem with Advice in d Dimensions and on the Sphere, Algorithmica, 81:5, (1859-1880), Online publication date: 1-May-2019.
- Kuo J, Chiang S, Shen S, Yang D and Chen W Dynamic Multicast Traffic Engineering with Efficient Rerouting for Software-Defined Networks IEEE INFOCOM 2019 - IEEE Conference on Computer Communications, (793-801)
- Paschos G, Destounis A, Vigneri L and Iosifidis G Learning to Cache With No Regrets IEEE INFOCOM 2019 - IEEE Conference on Computer Communications, (235-243)
- Comden J, Yao S, Chen N, Xing H and Liu Z (2019). Online Optimization in Cloud Resource Provisioning, Proceedings of the ACM on Measurement and Analysis of Computing Systems, 3:1, (1-30), Online publication date: 26-Mar-2019.
- Balseiro S and Brown D (2019). Approximations to Stochastic Dynamic Programs via Information Relaxation Duality, Operations Research, 67:2, (577-597), Online publication date: 1-Mar-2019.
- Angelopoulos S, Dorrigiv R and López-Ortiz A (2019). On the Separation and Equivalence of Paging Strategies and Other Online Algorithms, Algorithmica, 81:3, (1152-1179), Online publication date: 1-Mar-2019.
- Goel G (2019). Smoothed Online Convex Optimization via Online Balanced Descent, ACM SIGMETRICS Performance Evaluation Review, 46:2, (42-44), Online publication date: 18-Jan-2019.
- Dumitrescu A (2018). Computational Geometry Column 68, ACM SIGACT News, 49:4, (46-54), Online publication date: 15-Dec-2018.
- Dumitrescu A, Ghosh A and Tóth C Online Unit Covering in Euclidean Space Combinatorial Optimization and Applications, (609-623)
- Bergé P, Hemery J, Rimmel A and Tomasik J On the Competitiveness of Memoryless Strategies for the k-Canadian Traveller Problem Combinatorial Optimization and Applications, (566-576)
- Kumar R, Purohit M and Svitkina Z Improving online algorithms via ML predictions Proceedings of the 32nd International Conference on Neural Information Processing Systems, (9684-9693)
- Tong Y and Zhou Z (2018). Dynamic task assignment in spatial crowdsourcing, SIGSPATIAL Special, 10:2, (18-25), Online publication date: 13-Nov-2018.
- Angelopoulos S, Dürr C, Kamali S, Renault M and Rosén A (2018). Online Bin Packing with Advice of Small Size, Theory of Computing Systems, 62:8, (2006-2034), Online publication date: 1-Nov-2018.
- Eugster P, Kesselman A, Kogan K, Nikolenko S and Sirotkin A (2018). Admission control in shared memory switches, Journal of Scheduling, 21:5, (533-543), Online publication date: 1-Oct-2018.
- Böckenhauer H, Komm D and Wegner R Call Admission Problems on Grids with Advice (Extended Abstract) Approximation and Online Algorithms, (118-133)
- Borodin A, Boyar J, Larsen K and Pankratov D Advice Complexity of Priority Algorithms Approximation and Online Algorithms, (69-86)
- Bansal N, Kamphorst B and Zwart B (2018). Achievable Performance of Blind Policies in Heavy Traffic, Mathematics of Operations Research, 43:3, (949-964), Online publication date: 1-Aug-2018.
- Flammini M, Monaco G, Moscardelli L, Shalom M and Zaks S Online Coalition Structure Generation in Graph Games Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, (1353-1361)
- Dickerson J, Sankararaman K, Srinivasan A and Xu P Assigning Tasks to Workers based on Historical Data Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, (318-326)
- Luo K, Erlebach T and Xu Y Car-Sharing Between Two Locations: Online Scheduling with Flexible Advance Bookings Computing and Combinatorics, (242-254)
- Kobayashi K Online Interval Scheduling to Maximize Total Satisfaction Computing and Combinatorics, (108-119)
- Tong Y, Zeng Y, Zhou Z, Chen L, Ye J and Xu K (2018). A unified approach to route planning for shared mobility, Proceedings of the VLDB Endowment, 11:11, (1633-1646), Online publication date: 1-Jul-2018.
- Bubeck S, Cohen M, Lee Y, Lee J and Mądry A k-server via multiscale entropic regularization Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, (3-16)
- Khorandi S and Sharifi M (2018). Non-clairvoyant online scheduling of synchronized jobs on virtual clusters, The Journal of Supercomputing, 74:6, (2353-2384), Online publication date: 1-Jun-2018.
- Zhou B, Dastjerdi A, Calheiros R and Buyya R (2018). An Online Algorithm for Task Offloading in Heterogeneous Mobile Clouds, ACM Transactions on Internet Technology, 18:2, (1-25), Online publication date: 31-May-2018.
- Bienkowski M, Jurdzinski T, Korzeniowski M and Kowalski D (2018). Distributed Online and Stochastic Queueing on a Multiple Access Channel, ACM Transactions on Algorithms, 14:2, (1-22), Online publication date: 30-Apr-2018.
- Im S, Shadloo M and Zheng Z Online Partial Throughput Maximization for Multidimensional Coflow IEEE INFOCOM 2018 - IEEE Conference on Computer Communications, (2042-2050)
- Chiang S, Kuo J, Shen S, Yang D and Chen W Online Multicast Traffic Engineering for Software-Defined Networks IEEE INFOCOM 2018 - IEEE Conference on Computer Communications, (414-422)
- Bitton S, Emek Y and Kutten S Efficient Jobs Dispatching in Emerging Clouds IEEE INFOCOM 2018 - IEEE Conference on Computer Communications, (2033-2041)
- Boyar J, Favrholdt L, Kudahl C, Larsen K and Mikkelsen J (2017). Online Algorithms with Advice, ACM Computing Surveys, 50:2, (1-34), Online publication date: 31-Mar-2018.
- Schmitz H and Lykourentzou I (2018). Online Sequencing of Non-Decomposable Macrotasks in Expert Crowdsourcing, ACM Transactions on Social Computing, 1:1, (1-33), Online publication date: 23-Feb-2018.
- Favrholdt L and Mikkelsen J (2018). Online edge coloring of paths and trees with a fixed number of colors, Acta Informatica, 55:1, (57-80), Online publication date: 1-Feb-2018.
- Reineke J and Salinger A (2018). On the Smoothness of Paging Algorithms, Theory of Computing Systems, 62:2, (366-418), Online publication date: 1-Feb-2018.
- Bansal N, Eliáš M, Jeź ź, Koumoutsos G and Pruhs K (2018). Tight Bounds for Double Coverage Against Weak Adversaries, Theory of Computing Systems, 62:2, (349-365), Online publication date: 1-Feb-2018.
- Bansal N, Eliáš M, Koumoutsos G and Nederlof J Competitive algorithms for generalized k-server in uniform metrics Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, (992-1001)
- Azar Y, Cohen I and Panigrahi D Randomized algorithms for online vector load balancing Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, (980-991)
- Scalosub G (2017). Towards optimal buffer management for streams with packet dependencies, Computer Networks: The International Journal of Computer and Telecommunications Networking, 129:P1, (207-214), Online publication date: 24-Dec-2017.
- Yang L, Wong W and Hajiesmaili M (2017). An Optimal Randomized Online Algorithm for QoS Buffer Management, Proceedings of the ACM on Measurement and Analysis of Computing Systems, 1:2, (1-26), Online publication date: 19-Dec-2017.
- Erlebach T, Liu F, Liu H, Shalom M, Wong P and Zaks S Complexity and Online Algorithms for Minimum Skyline Coloring of Intervals Combinatorial Optimization and Applications, (317-332)
- Einziger G, Friedman R and Manes B (2017). TinyLFU, ACM Transactions on Storage, 13:4, (1-31), Online publication date: 15-Dec-2017.
- Koren T, Livni R and Mansour Y Multi-armed bandits with metric movement costs Proceedings of the 31st International Conference on Neural Information Processing Systems, (4122-4131)
- Uziel G and El-Yaniv R Multi-objective non-parametric sequential prediction Proceedings of the 31st International Conference on Neural Information Processing Systems, (3374-3383)
- Folwarczný L and Sgall J (2017). General Caching Is Hard, Algorithmica, 79:2, (319-339), Online publication date: 1-Oct-2017.
- Ambühl C (2017). SIGACT News Online Algorithms Column 31, ACM SIGACT News, 48:3, (68-82), Online publication date: 7-Sep-2017.
- Hemaspaandra E, Hemaspaandra L and Rothe J (2017). The complexity of online voter control in sequential elections, Autonomous Agents and Multi-Agent Systems, 31:5, (1055-1076), Online publication date: 1-Sep-2017.
- Qin L and Xu Y (2017). Fibonacci helps to evacuate from a convex region in a grid network, Journal of Combinatorial Optimization, 34:2, (398-413), Online publication date: 1-Aug-2017.
- Ni Y (2017). Sequential seeding to optimize influence diffusion in a social network, Applied Soft Computing, 56:C, (730-737), Online publication date: 1-Jul-2017.
- Even G and Medina M (2017). Online Packet-Routing in Grids with Bounded Buffers, Algorithmica, 78:3, (819-868), Online publication date: 1-Jul-2017.
- Azar Y, Ganesh A, Ge R and Panigrahi D Online service with delay Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, (551-563)
- Bckenhauer H, Komm D, Krlovi R and Krlovi R (2017). On the advice complexity of the k-server problem, Journal of Computer and System Sciences, 86:C, (159-170), Online publication date: 1-Jun-2017.
- Bilardi G, Ekanadham K and Pattnaik P Optimal On-Line Computation of Stack Distances for MIN and OPT Proceedings of the Computing Frontiers Conference, (237-246)
- Khorandi S, Ghiasvand S and Sharifi M Reducing Load Imbalance of Virtual Clusters via Reconfiguration and Adaptive Job Scheduling Proceedings of the 17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing, (992-999)
- Wang H and Feng J FlashSkipList Proceedings of the ACM Turing 50th Celebration Conference - China, (1-10)
- Rabl T and Jacobsen H Query Centric Partitioning and Allocation for Partially Replicated Database Systems Proceedings of the 2017 ACM International Conference on Management of Data, (315-330)
- Kobayashi K, Miyazaki S and Okabe Y (2017). Competitive buffer management for multi-queue switches in QoS networks using packet buffering algorithms, Theoretical Computer Science, 675:C, (27-42), Online publication date: 2-May-2017.
- (2017). Scheduling of online compute-intensive synchronized jobs on high performance virtual clusters, Journal of Computer and System Sciences, 85:C, (1-17), Online publication date: 1-May-2017.
- Dasgupta A, Kumar R and Sarlós T Caching with Dual Costs Proceedings of the 26th International Conference on World Wide Web Companion, (643-652)
- Wang S, Urgaonkar R, He T, Chan K, Zafer M and Leung K (2017). Dynamic Service Placement for Mobile Micro-Clouds with Predicted Future Costs, IEEE Transactions on Parallel and Distributed Systems, 28:4, (1002-1016), Online publication date: 1-Apr-2017.
- Boyar J, Kamali S, Larsen K and Lpez-Ortiz A (2017). On the list update problem with advice, Information and Computation, 253:P3, (411-423), Online publication date: 1-Apr-2017.
- Schmidt M, Kroon L, Schöbel A and Bouman P (2017). The Travelers Route Choice Problem Under Uncertainty, Operations Research, 65:1, (184-199), Online publication date: 1-Feb-2017.
- Azar Y, Chiplunkar A and Kaplan H Polylogarithmic bounds on the competitiveness of min-cost perfect matching with delays Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, (1051-1061)
- Bansal N, Eliáš M, Jeż Ł and Koumoutsos G The (h, k)-server problem on bounded depth trees Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, (1022-1037)
- Kawahara J, Kobayashi K and Miyazaki S (2017). Better bounds for online k-frame throughput maximization in network switches, Theoretical Computer Science, 657:PB, (173-190), Online publication date: 2-Jan-2017.
- San Felice M, Williamson D and Lee O (2016). A Randomized $$\mathrm {O}(\log n)$$O(logn)-Competitive Algorithm for the Online Connected Facility Location Problem, Algorithmica, 76:4, (1139-1157), Online publication date: 1-Dec-2016.
- Konstantopoulos C, Pantziou G, Venetis I and Gavalas D (2016). Efficient event handling in Wireless Sensor and Actor Networks, Journal of Network and Computer Applications, 75:C, (181-199), Online publication date: 1-Nov-2016.
- Legrain A and Jaillet P (2016). A stochastic algorithm for online bipartite resource allocation problems, Computers and Operations Research, 75:C, (28-37), Online publication date: 1-Nov-2016.
- Nakazono T, Moridomi K, Hatano K and Takimoto E A Combinatorial Metrical Task System Problem Under the Uniform Metric Algorithmic Learning Theory, (276-287)
- Kogan K, López-Ortiz A, Nikolenko S, Scalosub G and Segal M (2016). Large profits or fast gains, Journal of Network and Computer Applications, 74:C, (31-43), Online publication date: 1-Oct-2016.
- Zhang Y and Yang X (2016). Online ordering policies for a two-product, multi-period stationary newsvendor problem, Computers and Operations Research, 74:C, (143-151), Online publication date: 1-Oct-2016.
- van Riessen B, Negenborn R and Dekker R (2016). Real-time container transport planning with decision trees based on offline obtained optimal solutions, Decision Support Systems, 89:C, (1-16), Online publication date: 1-Sep-2016.
- Akhter N and Othman M (2016). Energy aware resource allocation of cloud data center, Cluster Computing, 19:3, (1163-1182), Online publication date: 1-Sep-2016.
- Anagnostopoulos A, Grandoni F, Leonardi S and Sankowski P (2016). Online Network Design with Outliers, Algorithmica, 76:1, (88-109), Online publication date: 1-Sep-2016.
- Boyar J, Favrholdt L, Kudahl C, Larsen K and Mikkelsen J (2016). Online Algorithms with Advice: A Survey, ACM SIGACT News, 47:3, (93-129), Online publication date: 31-Aug-2016.
- Bujtás C, Dósa G, Imreh C, Nagy-György J and Tuza Z (2016). New models of graph-bin packing, Theoretical Computer Science, 640:C, (94-103), Online publication date: 9-Aug-2016.
- Kell N and Panigrahi D Online Budgeted Allocation with General Budgets Proceedings of the 2016 ACM Conference on Economics and Computation, (419-436)
- Chen L, Megow N and Schewior K The Power of Migration in Online Machine Minimization Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, (175-184)
- Ren R and Tang X Clairvoyant Dynamic Bin Packing for Job Scheduling with Minimum Server Usage Time Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, (227-237)
- Berger A, Gross J, Harks T and Tenbusch S (2016). Constrained Resource Assignments, Management Science, 62:7, (2070-2089), Online publication date: 1-Jul-2016.
- Chau C and Yang L Competitive online algorithms for geographical load balancing in data centers with energy storage Proceedings of the 5th International Workshop on Energy Efficient Data Centres, (1-6)
- Chau C, Elbassioni K and Tseng C Fuel minimization of plug-in hybrid electric vehicles by optimizing drive mode selection Proceedings of the Seventh International Conference on Future Energy Systems, (1-11)
- Hajiesmaili M, Chau C, Chen M and Huang L Online microgrid energy generation scheduling revisited Proceedings of the Seventh International Conference on Future Energy Systems, (1-11)
- Emek Y, Kutten S and Wattenhofer R Online matching: haste makes waste! Proceedings of the forty-eighth annual ACM symposium on Theory of Computing, (333-344)
- Nardelli M Placement of distributed stream processing over heterogeneous infrastructures Proceedings of the 10th ACM International Conference on Distributed and Event-based Systems, (422-425)
- Sakr N and Stein C An Empirical Study of Online Packet Scheduling Algorithms Proceedings of the 15th International Symposium on Experimental Algorithms - Volume 9685, (278-293)
- Basu D, Lin Q, Chen W, Vo H, Yuan Z, Senellart P and Bressan S Regularized Cost-Model Oblivious Database Tuning with Reinforcement Learning Transactions on Large-Scale Data- and Knowledge-Centered Systems XXVIII - Volume 9940, (96-132)
- Wu Y, Wang Y, Hu W and Cao G (2016). SmartPhoto, IEEE Transactions on Mobile Computing, 15:5, (1249-1263), Online publication date: 1-May-2016.
- Georgiadis G, Salem I and Papatriantafilou M Tailor your curves after your costume Proceedings of the 31st Annual ACM Symposium on Applied Computing, (2127-2134)
- Zhang R, Wu K, Li M and Wang J (2016). Online Resource Scheduling Under Concave Pricing for Cloud Computing, IEEE Transactions on Parallel and Distributed Systems, 27:4, (1131-1145), Online publication date: 1-Apr-2016.
- Dobrev S, Hromkoviăź J, Komm D, Královiăź R, Královiăź R and Mömke T The Complexity of Paging Against a Probabilistic Adversary Proceedings of the 42nd International Conference on SOFSEM 2016: Theory and Practice of Computer Science - Volume 9587, (265-276)
- Bianchi M, Böckenhauer H, Brülisauer T, Komm D and Palano B Online Minimum Spanning Tree with Advice Proceedings of the 42nd International Conference on SOFSEM 2016: Theory and Practice of Computer Science - Volume 9587, (195-207)
- Chen L, Megow N and Schewior K An O(log m)-competitive algorithm for online machine minimization Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms, (155-163)
- Li Y, Tang X and Cai W (2016). Dynamic Bin Packing for On-Demand Cloud Resource Allocation, IEEE Transactions on Parallel and Distributed Systems, 27:1, (157-170), Online publication date: 1-Jan-2016.
- Feng X, Xu Y and Zheng F Online Scheduling for Electricity Cost in Smart Grid Proceedings of the 9th International Conference on Combinatorial Optimization and Applications - Volume 9486, (783-793)
- Zheng F, Qiao L and Liu M An Online Model of Berth and Quay Crane Integrated Allocation in Container Terminals Proceedings of the 9th International Conference on Combinatorial Optimization and Applications - Volume 9486, (721-730)
- Gurski F, Rethmann J and Wanke E Directed Pathwidth and Palletizers Proceedings of the 9th International Conference on Combinatorial Optimization and Applications - Volume 9486, (31-44)
- Wei Wang , Ben Liang and Baochun Li (2015). Optimal Online Multi-Instance Acquisition in IaaS Clouds, IEEE Transactions on Parallel and Distributed Systems, 26:12, (3407-3419), Online publication date: 1-Dec-2015.
- Bansal N, Buchbinder N, Madry A and Naor J (2015). A Polylogarithmic-Competitive Algorithm for the k-Server Problem, Journal of the ACM, 62:5, (1-49), Online publication date: 2-Nov-2015.
- Gasparri A, Williams R, Priolo A and Sukhatme G (2015). Decentralized and Parallel Constructions for Optimally Rigid Graphs in
$\mathbb{R}^2$ - Fung S Maximizing Throughput in Energy-Harvesting Sensor Nodes Revised Selected Papers of the 11th International Symposium on Algorithms for Sensor Systems - Volume 9536, (129-141)
- Basu D, Lin Q, Chen W, Vo H, Yuan Z, Senellart P and Bressan S Cost-Model Oblivious Database Tuning with Reinforcement Learning Proceedings, Part I, of the 26th International Conference on Database and Expert Systems Applications - Volume 9261, (253-268)
- Eugster P, Kesselman A, Kogan K, Nikolenko S and Sirotkin A Essential Traffic Parameters for Shared Memory Switch Performance Post-Proceedings of the 22nd International Colloquium on Structural Information and Communication Complexity - Volume 9439, (61-75)
- Bienkowski M, Kraska A and Schmidt P A Randomized Algorithm for Online Scheduling with Interval Conflicts Post-Proceedings of the 22nd International Colloquium on Structural Information and Communication Complexity - Volume 9439, (91-103)
- Bender M and Westphal S (2015). An optimal randomized online algorithm for the $$k$$k-Canadian Traveller Problem on node-disjoint paths, Journal of Combinatorial Optimization, 30:1, (87-96), Online publication date: 1-Jul-2015.
- Zaks S Online Lower Bounds and Offline Inapproximability in Optical Networks Proceedings of the 14th International Conference on Ad-hoc, Mobile, and Wireless Networks - Volume 9143, (253-270)
- Zaks S On the Complexity of Approximation and Online Scheduling Problems with Applications to Optical Networks Revised Papers of the 41st International Workshop on Graph-Theoretic Concepts in Computer Science - Volume 9224, (31-46)
- Menache I and Singh M Online Caching with Convex Costs Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures, (46-54)
- Wu Y, Wu C, Li B, Zhang L, Li Z and Lau F (2015). Scaling social media applications into geo-distributed clouds, IEEE/ACM Transactions on Networking, 23:3, (689-702), Online publication date: 1-Jun-2015.
- Chrobak M, Dürr C and Nilsson B Competitive Strategies for Online Clique Clustering Proceedings of the 9th International Conference on Algorithms and Complexity - Volume 9079, (101-113)
- Wehner D Advice Complexity of Fine-Grained Job Shop Scheduling Proceedings of the 9th International Conference on Algorithms and Complexity - Volume 9079, (416-428)
- Matsubayashi A (2015). Asymptotically Optimal Online Page Migration on Three Points, Algorithmica, 71:4, (1035-1064), Online publication date: 1-Apr-2015.
- Dan Zhao , Chuan Huang , Yue Chen , Alsaadi F and Shuguang Cui (2015). Resource Allocation for Multiple Access Channel With Conferencing Links and Shared Renewable Energy Sources, IEEE Journal on Selected Areas in Communications, 33:3, (423-437), Online publication date: 1-Mar-2015.
- Dorrigiv R, Ehmsen M and López-Ortiz A (2015). Parameterized Analysis of Paging and List Update Algorithms, Algorithmica, 71:2, (330-353), Online publication date: 1-Feb-2015.
- Giannakopoulos Y and Koutsoupias E (2015). Competitive analysis of maintaining frequent items of a stream, Theoretical Computer Science, 562:C, (23-32), Online publication date: 11-Jan-2015.
- Kawahara J, Kobayashi K and Maeda T Tight Analysis of Priority Queuing for Egress Traffic Combinatorial Optimization and Applications, (459-473)
- Shalom M, Voloshin A, Wong P, Yung F and Zaks S (2014). Online optimization of busy time on parallel machines, Theoretical Computer Science, 560:P2, (190-206), Online publication date: 4-Dec-2014.
- Slivkins A and Vaughan J (2014). Online decision making in crowdsourcing markets, ACM SIGecom Exchanges, 12:2, (4-23), Online publication date: 25-Nov-2014.
- Böckenhauer H, Hromkovič J, Komm D, Krug S, Smula J and Sprock A (2014). The string guessing problem as a method to prove lower bounds on the advice complexity, Theoretical Computer Science, 554:C, (95-108), Online publication date: 16-Oct-2014.
- Bianchi M, Böckenhauer H, Hromkovič J, Krug S and Steffen B (2014). On the advice complexity of the online L ( 2 , 1 ) -coloring problem on paths and cycles, Theoretical Computer Science, 554:C, (22-39), Online publication date: 16-Oct-2014.
- Li Y, Tang X and Cai W On dynamic bin packing for resource allocation in the cloud Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures, (2-11)
- Zheng Z and Shroff N Online welfare maximization for electric vehicle charging with electricity cost Proceedings of the 5th international conference on Future energy systems, (253-263)
- Margaritis G and Anastasiadis S (2014). Incremental Text Indexing for Fast Disk-Based Search, ACM Transactions on the Web, 8:3, (1-31), Online publication date: 1-Jun-2014.
- Hemaspaandra E, Hemaspaandra L and Rothe J (2014). The complexity of online manipulation of sequential elections, Journal of Computer and System Sciences, 80:4, (697-710), Online publication date: 1-Jun-2014.
- Szkaliczki T, Eberhard M, Hellwagner H and Szobonya L (2014). Piece selection algorithms for layered video streaming in P2P networks, Discrete Applied Mathematics, 167, (269-279), Online publication date: 1-Apr-2014.
- Georgiadis G and Papatriantafilou M Dealing with storage without forecasts in smart grids Proceedings of the 29th Annual ACM Symposium on Applied Computing, (518-524)
- Boyar J, Kamali S, Larsen K and López-Ortiz A On the List Update Problem with Advice Proceedings of the 8th International Conference on Language and Automata Theory and Applications - Volume 8370, (210-221)
- Mohanty R, Dash T, Khan B and Dash S An Experimental Study of a Novel Move-to-Front-or-Middle (MFM) List Update Algorithm Proceedings of the First International Conference on Applied Algorithms - Volume 8321, (187-197)
- Khare M, Mathieu C and Young N First come first served for online slot allocation and Huffman coding Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms, (445-454)
- Bagdouri M, Webber W, Lewis D and Oard D Towards minimizing the annotation cost of certified text classification Proceedings of the 22nd ACM international conference on Information & Knowledge Management, (989-998)
- Cidon I, Kantor E and Kutten S Prudent Opportunistic Cognitive Radio Access Protocols Proceedings of the 27th International Symposium on Distributed Computing - Volume 8205, (462-476)
- Bunn P and Ostrovsky R Secure End-to-End Communication with Optimal Throughput and Resilience against Malicious Adversary Proceedings of the 27th International Symposium on Distributed Computing - Volume 8205, (403-417)
- Dosa G, Tuza Z and Ye D (2013). Bin packing with "Largest In Bottom" constraint, Journal of Combinatorial Optimization, 26:3, (416-436), Online publication date: 1-Oct-2013.
- Ambühl C, Gärtner B and Stengel B (2013). Optimal lower bounds for projective list update algorithms, ACM Transactions on Algorithms, 9:4, (1-18), Online publication date: 1-Sep-2013.
- Boyar J, Gupta S and Larsen K Relative interval analysis of paging algorithms on access graphs Proceedings of the 13th international conference on Algorithms and Data Structures, (195-206)
- Birks M, Cole D, Fung S and Xue H (2013). Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints, Journal of Combinatorial Optimization, 26:2, (237-250), Online publication date: 1-Aug-2013.
- Zhang H, Xu Y and Qin L (2013). The k-Canadian Travelers Problem with communication, Journal of Combinatorial Optimization, 26:2, (251-265), Online publication date: 1-Aug-2013.
- Englert M, Röglin H, Spönemann J and Vöcking B (2013). Economical Caching, ACM Transactions on Computation Theory, 5:2, (1-21), Online publication date: 1-Jul-2013.
- Peserico E Elastic paging Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems, (349-350)
- Lu L, Tu J, Chau C, Chen M and Lin X Online energy generation scheduling for microgrids with intermittent energy sources and co-generation Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems, (53-66)
- Peserico E (2013). Elastic paging, ACM SIGMETRICS Performance Evaluation Review, 41:1, (349-350), Online publication date: 14-Jun-2013.
- Lu L, Tu J, Chau C, Chen M and Lin X (2013). Online energy generation scheduling for microgrids with intermittent energy sources and co-generation, ACM SIGMETRICS Performance Evaluation Review, 41:1, (53-66), Online publication date: 14-Jun-2013.
- Yang L, Zhou J, Gong W, Zhao J and Chen L (2013). Lifetime and QoS-aware energy-saving buffering schemes, Journal of Systems and Software, 86:5, (1408-1425), Online publication date: 1-May-2013.
- Chatterjee K, Kößler A and Schmid U Automated analysis of real-time scheduling using graph games Proceedings of the 16th international conference on Hybrid systems: computation and control, (163-172)
- Angelopoulos S and Schweitzer P (2013). Paging and list update under bijective analysis, Journal of the ACM, 60:2, (1-18), Online publication date: 1-Apr-2013.
- Csirik J, Epstein L, Imreh C and Levin A (2013). Online Clustering with Variable Sized Clusters, Algorithmica, 65:2, (251-274), Online publication date: 1-Feb-2013.
- Georgiadis G and Papatriantafilou M A greedy algorithm for the unforecasted energy dispatch problemwith storage in smart grids Proceedings of the fourth international conference on Future energy systems, (273-274)
- Tu J, Lu L, Chen M and Sitaraman R Dynamic provisioning in next-generation data centers with on-site power production Proceedings of the fourth international conference on Future energy systems, (137-148)
- Divéki G (2013). Online clustering on the line with square cost variable sized clusters, Acta Cybernetica, 21:1, (75-88), Online publication date: 1-Jan-2013.
- Averbakh I and Baysan M (2013). Batching and delivery in semi-online distribution systems, Discrete Applied Mathematics, 161:1-2, (28-42), Online publication date: 1-Jan-2013.
- Zheng F, Cheng Y, Liu M and Xu Y (2013). Online interval scheduling on a single machine with finite lookahead, Computers and Operations Research, 40:1, (180-191), Online publication date: 1-Jan-2013.
- Kogan K, López-Ortiz A, Nikolenko S, Sirotkin A and Tugaryov D FIFO queueing policies for packets with heterogeneous processing Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms, (248-260)
- Jeż Ł, Li F, Sethuraman J and Stein C (2012). Online scheduling of packets with agreeable deadlines, ACM Transactions on Algorithms, 9:1, (1-11), Online publication date: 1-Dec-2012.
- Duong T, Li X, Goh R, Tang X and Cai W QoS-Aware Revenue-Cost Optimization for Latency-Sensitive Services in IaaS Clouds Proceedings of the 2012 IEEE/ACM 16th International Symposium on Distributed Simulation and Real Time Applications, (11-18)
- Bienkowski M, Jurdzinski T, Korzeniowski M and Kowalski D Distributed online and stochastic queuing on a multiple access channel Proceedings of the 26th international conference on Distributed Computing, (121-135)
- Jalaparti V, Ballani H, Costa P, Karagiannis T and Rowstron A Bridging the tenant-provider gap in cloud services Proceedings of the Third ACM Symposium on Cloud Computing, (1-14)
- Bansal N, Buchbinder N and Naor J (2012). A Primal-Dual Randomized Algorithm for Weighted Paging, Journal of the ACM, 59:4, (1-24), Online publication date: 1-Aug-2012.
- Molinaro M and Ravi R Geometry of online packing linear programs Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I, (701-713)
- Mansour Y, Rubinstein A, Vardi S and Xie N Converting online algorithms to local computation algorithms Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I, (653-664)
- Buchbinder N, Naor J, Ravi R and Singh M Approximation algorithms for online weighted rank function maximization under matroid constraints Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I, (145-156)
- Ochel M, Radke K and Vöcking B Online packing with gradually improving capacity estimations and applications to network lifetime maximization Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II, (648-659)
- Krysta P and Vöcking B Online mechanism design (randomized rounding on the fly) Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II, (636-647)
- Bringmann K and Friedrich T Convergence of hypervolume-based archiving algorithms ii Proceedings of the 14th annual conference on Genetic and evolutionary computation, (457-464)
- Yang X, Zhang W, Zhang Y and Xu W (2012). Optimal randomized algorithm for a generalized ski-rental with interest rate, Information Processing Letters, 112:13, (548-551), Online publication date: 1-Jul-2012.
- Dorrigiv R and López-Ortiz A (2012). List update with probabilistic locality of reference, Information Processing Letters, 112:13, (540-543), Online publication date: 1-Jul-2012.
- Jimenez I, Sanchez H, Tran Q and Polyzotis N Kaizen Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data, (685-688)
- Boyar J, Larsen K and Maiti A A comparison of performance measures via online search Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management, (303-314)
- Ye D and Mei L On-Line scheduling of parallel jobs in heterogeneous multiple clusters Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management, (139-148)
- Narayanaswamy B, Garg V and Jayram T Online optimization for the smart (micro) grid Proceedings of the 3rd International Conference on Future Energy Systems: Where Energy, Computing and Communication Meet, (1-10)
- Herlich M and Karl H Average and competitive analysis of latency and power consumption of a queuing system with a sleep mode Proceedings of the 3rd International Conference on Future Energy Systems: Where Energy, Computing and Communication Meet, (1-10)
- Sheng C, Tao Y and Li J (2012). Exact and approximate algorithms for the most connected vertex problem, ACM Transactions on Database Systems, 37:2, (1-39), Online publication date: 1-May-2012.
- Zhang L, Yang J and Tseng B Online modeling of proactive moderation system for auction fraud detection Proceedings of the 21st international conference on World Wide Web, (669-678)
- Forišek M, Keller L and Steinová M Advice complexity of online coloring for paths Proceedings of the 6th international conference on Language and Automata Theory and Applications, (228-239)
- Ehsani S, Ghodsi M, Khajenezhad A, Mahini H and Nikzad A (2012). Optimal online pricing with network externalities, Information Processing Letters, 112:4, (118-123), Online publication date: 1-Feb-2012.
- Moruz G and Negoescu A Outperforming LRU via competitive analysis on parametrized inputs for paging Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete algorithms, (1669-1680)
- López-Ortiz A and Salinger A Paging for multi-core shared caches Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, (113-127)
- Even G, Medina M, Schaffrath G and Schmid S Competitive and deterministic embeddings of virtual networks Proceedings of the 13th international conference on Distributed Computing and Networking, (106-121)
- Schnaitter K and Polyzotis N (2012). Semi-automatic index tuning, Proceedings of the VLDB Endowment, 5:5, (478-489), Online publication date: 1-Jan-2012.
- Zhang Y, Zhang W, Xu W and Yang X (2012). Risk-reward models for on-line leasing of depreciable equipment, Computers & Mathematics with Applications, 63:1, (167-174), Online publication date: 1-Jan-2012.
- Mertzios G, Shalom M, Wong P and Zaks S Online regenerator placement Proceedings of the 15th international conference on Principles of Distributed Systems, (4-17)
- Krumke S, Thielen C and Westphal S (2011). Interval scheduling on related machines, Computers and Operations Research, 38:12, (1836-1844), Online publication date: 1-Dec-2011.
- Aminof B, Kupferman O and Lampert R Formal analysis of online algorithms Proceedings of the 9th international conference on Automated technology for verification and analysis, (213-227)
- Renault M and Rosén A On online algorithms with advice for the k-server problem Proceedings of the 9th international conference on Approximation and Online Algorithms, (198-210)
- Brodal G, Moruz G and Negoescu A ONLINEMIN Proceedings of the 9th international conference on Approximation and Online Algorithms, (164-175)
- Dorrigiv R and López-Ortiz A A new perspective on list update Proceedings of the 9th international conference on Approximation and Online Algorithms, (150-163)
- Even G and Smorodinsky S Hitting sets online and vertex ranking Proceedings of the 19th European conference on Algorithms, (347-357)
- Jeż Ł One to rule them all Proceedings of the 19th European conference on Algorithms, (239-250)
- Fotakis D (2011). Memoryless facility location in one pass, ACM Transactions on Algorithms, 7:4, (1-24), Online publication date: 1-Sep-2011.
- Arora D, Bienkowski M, Feldmann A, Schaffrath G and Schmid S Online strategies for intra and inter provider service migration in virtual networks Proceedings of the 5th International Conference on Principles, Systems and Applications of IP Telecommunications, (1-11)
- Krumke S, Taudes A and Westphal S (2011). Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines, Computers and Operations Research, 38:8, (1103-1108), Online publication date: 1-Aug-2011.
- Megow N, Mehlhorn K and Schweitzer P Online graph exploration Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II, (478-489)
- Böckenhauer H, Komm D, Královič R and Královič R On the advice complexity of the k-server problem Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I, (207-218)
- Bonifaci V, Korteweg P, Marchetti-Spaccamela A and Stougie L (2011). Minimizing flow time in the wireless gathering problem, ACM Transactions on Algorithms, 7:3, (1-20), Online publication date: 1-Jul-2011.
- Zhang Y, Zhang W, Xu W and Li H (2011). Competitive strategy for on-line leasing of depreciable equipment, Mathematical and Computer Modelling: An International Journal, 54:1-2, (466-476), Online publication date: 1-Jul-2011.
- Bansal N, Lee K, Nagarajan V and Zafer M Minimum congestion mapping in a cloud Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing, (267-276)
- Birks M, Cole D, Fung S and Xue H Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management, (319-329)
- Zhang H and Xu Y The k-canadian travelers problem with communication Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management, (17-28)
- Buchbinder N, Jain N and Menache I Online job-migration for reducing the electricity bill in the cloud Proceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part I, (172-185)
- Chen Y, Kung J, Parkes D, Procaccia A and Zhang H Incentive design for adaptive agents The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 2, (627-634)
- Anagnostopoulos A, Kumar R, Mahdian M and Upfal E (2011). Sorting and selection on dynamic data, Theoretical Computer Science, 412:24, (2564-2576), Online publication date: 1-May-2011.
- Emek Y, Fraigniaud P, Korman A and Rosén A (2011). Online computation with advice, Theoretical Computer Science, 412:24, (2642-2656), Online publication date: 1-May-2011.
- Zheng F, Xu Y, Poon C, Zhang E and Wu X (2011). Online deadline scheduling with preemption penalties, Computers and Industrial Engineering, 60:4, (542-549), Online publication date: 1-May-2011.
- López-Ibáñez M, Knowles J and Laumanns M On sequential online archiving of objective vectors Proceedings of the 6th international conference on Evolutionary multi-criterion optimization, (46-60)
- Lavee G, Lempel R, Liberty E and Somekh O Inverted index compression via online document routing Proceedings of the 20th international conference on World wide web, (487-496)
- Fotakis D (2011). Online and incremental algorithms for facility location, ACM SIGACT News, 42:1, (97-131), Online publication date: 21-Mar-2011.
- Afrati F, Borkar V, Carey M, Polyzotis N and Ullman J Map-reduce extensions and recursive queries Proceedings of the 14th International Conference on Extending Database Technology, (1-8)
- Bienkowski M An optimal lower bound for buffer management in multi-queue switches Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete algorithms, (1295-1305)
- Komm D and Královič R Advice complexity and barely random algorithms Proceedings of the 37th international conference on Current trends in theory and practice of computer science, (332-343)
- Malik T, Wang X, Little P, Chaudhary A and Thakar A A dynamic data middleware cache for rapidly-growing scientific repositories Proceedings of the ACM/IFIP/USENIX 11th International Conference on Middleware, (64-84)
- Wagner M (2010). Fully Distribution-Free Profit Maximization, Mathematics of Operations Research, 35:4, (728-741), Online publication date: 1-Nov-2010.
- Flammini M and Nicosia G (2010). On the bicriteria k-server problem, ACM Transactions on Algorithms, 7:1, (1-19), Online publication date: 1-Nov-2010.
- Kesselman A, Kogan K and Segal M (2010). Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing, Distributed Computing, 23:3, (163-175), Online publication date: 1-Nov-2010.
- Anagnostopoulos A, Becchetti L, Castillo C, Gionis A and Leonardi S Power in unity Proceedings of the 19th ACM international conference on Information and knowledge management, (599-608)
- Kannan R and Busch C Bottleneck congestion games with logarithmic price of anarchy Proceedings of the Third international conference on Algorithmic game theory, (222-233)
- Chan J, Chin F, Ye D and Zhang Y (2010). Absolute and Asymptotic Bounds for Online Frequency Allocation in Cellular Networks, Algorithmica, 58:2, (498-515), Online publication date: 1-Oct-2010.
- Kolhe P and Christensen H Planning in logistics Proceedings of the 10th Performance Metrics for Intelligent Systems Workshop, (48-53)
- Chrobak M, Woeginger G, Makino K and Xu H Caching is hard Proceedings of the 18th annual European conference on Algorithms: Part I, (195-206)
- Azar Y, Buchbinder N and Jain K How to allocate goods in an online market? Proceedings of the 18th annual European conference on Algorithms: Part II, (51-62)
- Bienkowski M, Feldmann A, Jurca D, Kellerer W, Schaffrath G, Schmid S and Widmer J Competitive analysis for service migration in VNets Proceedings of the second ACM SIGCOMM workshop on Virtualized infrastructure systems and architectures, (17-24)
- Hromkovič J, Královič R and Královič R Information complexity of online problems Proceedings of the 35th international conference on Mathematical foundations of computer science, (24-36)
- Sempolinski P and Chaudhary A Online algorithms for the newsvendor problem with and without censored demands Proceedings of the 4th international conference on Frontiers in algorithmics, (234-249)
- Bach E, Chawla S and Umboh S Threshold rules for online sample selection Proceedings of the 16th annual international conference on Computing and combinatorics, (489-499)
- Zheng F, Liu B, Xu Y and Zhang E Online splitting interval scheduling on m identical machines Proceedings of the 6th international conference on Algorithmic aspects in information and management, (304-313)
- Liu M, Chu C, Xu Y and Wang L Online scheduling on two uniform machines to minimize the makespan with a periodic availability constraint Proceedings of the 6th international conference on Algorithmic aspects in information and management, (191-198)
- Bunn P and Ostrovsky R Asynchronous throughput-optimal routing in malicious networks Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II, (236-248)
- Even G and Medina M An O(log n)-competitive online centralized randomized packet-routing algorithm for lines Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II, (139-150)
- Bansal N, Buchbinder N and Naor J Metrical task systems and the k-server problem on HSTs Proceedings of the 37th international colloquium conference on Automata, languages and programming, (287-298)
- Anagnostopoulos A, Grandoni F, Leonardi S and Sankowski P Online network design with outliers Proceedings of the 37th international colloquium conference on Automata, languages and programming, (114-126)
- Azar Y, Feige U and Glasner D (2010). A Preemptive Algorithm for Maximizing Disjoint Paths on Trees, Algorithmica, 57:3, (517-537), Online publication date: 1-Jul-2010.
- Epstein L and Levin A (2010). Improved randomized results for the interval selection problem, Theoretical Computer Science, 411:34-36, (3129-3135), Online publication date: 1-Jul-2010.
- Bienkowski M and Schmid S Online function tracking with generalized penalties Proceedings of the 12th Scandinavian conference on Algorithm Theory, (359-370)
- Bunde D and Goldwasser M Dispatching equal-length jobs to parallel machines to maximize throughput Proceedings of the 12th Scandinavian conference on Algorithm Theory, (346-358)
- Tao Y, Sheng C and Li J Finding maximum degrees in hidden bipartite graphs Proceedings of the 2010 ACM SIGMOD International Conference on Management of data, (891-902)
- Halldórsson M and Shachnai H Return of the boss problem Proceedings of the 5th international conference on Fun with algorithms, (237-248)
- Ye D, Han X and Zhang G (2010). Deterministic on-line call control in cellular networks, Theoretical Computer Science, 411:31-33, (2871-2877), Online publication date: 1-Jun-2010.
- Boyar J, Epstein L and Levin A (2010). Tight results for Next Fit and Worst Fit with resource augmentation, Theoretical Computer Science, 411:26-28, (2572-2580), Online publication date: 1-Jun-2010.
- Angelopoulos S and Borodin A (2010). Randomized priority algorithms, Theoretical Computer Science, 411:26-28, (2542-2558), Online publication date: 1-Jun-2010.
- Shalom M, Wong P and Zaks S (2010). Optimal on-line colorings for minimizing the number of ADMs in optical networks, Journal of Discrete Algorithms, 8:2, (174-188), Online publication date: 1-Jun-2010.
- Brenner J and Schäfer G Online cooperative cost sharing Proceedings of the 7th international conference on Algorithms and Complexity, (252-263)
- Yassour B, Ben-Yehuda M and Wasserman O On the DMA mapping problem in direct device assignment Proceedings of the 3rd Annual Haifa Experimental Systems Conference, (1-12)
- Lam V, Mitzenmacher M and Varghese G Carousel Proceedings of the 7th USENIX conference on Networked systems design and implementation, (24-24)
- Malik T, Prasad R, Patil S, Chaudhary A and Venkatasubramanian V Providing scalable data services in ubiquitous networks Proceedings of the 15th international conference on Database systems for advanced applications, (445-457)
- Buchbinder N, Lewin-Eytan L, Menache I, Naor J and Orda A Dynamic power allocation under arbitrary varying channels - the multi-user case Proceedings of the 29th conference on Information communications, (2402-2410)
- Berger A, Gross J and Harks T The k-constrained bipartite matching problem Proceedings of the 29th conference on Information communications, (2043-2051)
- Scalosub G, Marbach P and Liebeherr J Buffer management for aggregated streaming data with packet dependencies Proceedings of the 29th conference on Information communications, (241-245)
- Goldwasser M (2010). A survey of buffer management policies for packet switches, ACM SIGACT News, 41:1, (100-128), Online publication date: 1-Mar-2010.
- Bansal N, Chen N, Cherniavsky N, Rurda A, Schieber B and Sviridenko M (2010). Dynamic pricing for impatient bidders, ACM Transactions on Algorithms, 6:2, (1-21), Online publication date: 1-Mar-2010.
- Aminof B, Kupferman O and Lampert R (2010). Reasoning about online algorithms with weighted automata, ACM Transactions on Algorithms, 6:2, (1-36), Online publication date: 1-Mar-2010.
- Ehmsen M, Favrholdt L, Kohrt J and Mihai R (2010). Comparing First-Fit and Next-Fit for online edge coloring, Theoretical Computer Science, 411:16-18, (1734-1741), Online publication date: 1-Mar-2010.
- Dorrigiv R and López-Ortiz A (2010). On Developing New Models, with Paging as a Case Study, ACM SIGACT News, 40:4, (98-123), Online publication date: 25-Jan-2010.
- Chrobak M (2010). Introduction to the SIGACT news online algorithms column, ACM SIGACT News, 40:4, (98), Online publication date: 25-Jan-2010.
- Bansal N, Buchbinder N and Naor J Towards the randomized k-server conjecture Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete algorithms, (40-55)
- Gassner E, Hatzl J, Krumke S and Saliba S (2010). CLEVER or smart: Strategies for the online target date assignment problem, Discrete Applied Mathematics, 158:1, (71-79), Online publication date: 1-Jan-2010.
- Goyal P, Goyal N, Gupta A and Rahul T Designing self-adaptive websites using online hotlink assignment algorithm Proceedings of the 7th International Conference on Advances in Mobile Computing and Multimedia, (579-583)
- Ashwinkumar B and Kleinberg R Randomized Online Algorithms for the Buyback Problem Proceedings of the 5th International Workshop on Internet and Network Economics, (529-536)
- Kovács A, Meyer U, Moruz G and Negoescu A Online Paging for Flash Memory Devices Proceedings of the 20th International Symposium on Algorithms and Computation, (352-361)
- Böckenhauer H, Komm D, Královič R, Královič R and Mömke T On the Advice Complexity of Online Problems Proceedings of the 20th International Symposium on Algorithms and Computation, (331-340)
- Madani O, Connor M and Greiner W (2009). Learning When Concepts Abound, The Journal of Machine Learning Research, 10, (2571-2613), Online publication date: 1-Dec-2009.
- Hay D and Scalosub G (2009). Jitter regulation for multiple streams, ACM Transactions on Algorithms, 6:1, (1-19), Online publication date: 1-Dec-2009.
- Bienkowski M, Byrka J, Korzeniowski M and Meyer auf der Heide F (2009). Optimal algorithms for page migration in dynamic networks, Journal of Discrete Algorithms, 7:4, (545-569), Online publication date: 1-Dec-2009.
- Egashira R, Yahaya A and Suda T Market-based cooperative resource allocation for overlay networks Proceedings of the 28th IEEE conference on Global telecommunications, (5943-5948)
- Liu M, Xu Y, Chu C and Zheng F (2009). Online scheduling to minimize modified total tardiness with an availability constraint, Theoretical Computer Science, 410:47-49, (5039-5046), Online publication date: 1-Nov-2009.
- Englert M, Vöcking B and Winkler M Economical caching with stochastic prices Proceedings of the 5th international conference on Stochastic algorithms: foundations and applications, (179-190)
- Chan C and Bambos N Throughput loss in task scheduling due to server state uncertainty Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools, (1-10)
- Nicosia G, Pacifici A and Pferschy U Subset Weight Maximization with Two Competing Agents Algorithmic Decision Theory, (74-85)
- Chrobak M (2009). SIGACT news online algorithms column 14, ACM SIGACT News, 40:3, (86-98), Online publication date: 25-Sep-2009.
- Bethea D and Reiter M Data structures with unpredictable timing Proceedings of the 14th European conference on Research in computer security, (456-471)
- Pavlovic D A semantical approach to equilibria and rationality Proceedings of the 3rd international conference on Algebra and coalgebra in computer science, (317-334)
- Liu M, Chu C, Xu Y and Zheng F (2009). Online scheduling on m uniform machines to minimize total (weighted) completion time, Theoretical Computer Science, 410:38-40, (3875-3881), Online publication date: 1-Sep-2009.
- Dorrigiv R, López-Ortiz A and Munro J (2009). On the relative dominance of paging algorithms, Theoretical Computer Science, 410:38-40, (3694-3701), Online publication date: 1-Sep-2009.
- Mehler J and Meyer auf der Heide F Power-aware online file allocation in mobile ad hoc networks Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures, (347-356)
- Kobayashi K, Miyazaki S and Okabe Y Competitive buffer management for multi-queue switches in qos networks using packet buffering algorithms Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures, (328-336)
- Agrawal D, Ganesan D, Sitaraman R, Diao Y and Singh S (2009). Lazy-Adaptive Tree, Proceedings of the VLDB Endowment, 2:1, (361-372), Online publication date: 1-Aug-2009.
- Even-Dar E, Kakade S and Mansour Y (2009). Online Markov Decision Processes, Mathematics of Operations Research, 34:3, (726-736), Online publication date: 1-Aug-2009.
- Ball M and Queyranne M (2009). Toward Robust Revenue Management, Operations Research, 57:4, (950-963), Online publication date: 1-Jul-2009.
- Chierichetti F, Kumar R and Vassilvitskii S Similarity caching Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (127-136)
- Al-Bawani K and Souza A Competitive Buffer Management with Stochastic Packet Arrivals Proceedings of the 8th International Symposium on Experimental Algorithms, (28-39)
- Roughgarden T and Sundararajan M (2009). Quantifying inefficiency in cost-sharing mechanisms, Journal of the ACM, 56:4, (1-33), Online publication date: 1-Jun-2009.
- Bianchi L, Dorigo M, Gambardella L and Gutjahr W (2009). A survey on metaheuristics for stochastic combinatorial optimization, Natural Computing: an international journal, 8:2, (239-287), Online publication date: 1-Jun-2009.
- Deng K, Zhou X, Shen H, Sadiq S and Li X (2009). Instance optimal query processing in spatial networks, The VLDB Journal — The International Journal on Very Large Data Bases, 18:3, (675-693), Online publication date: 1-Jun-2009.
- Sun H, Cao Y and Hsu W Non-clairvoyant speed scaling for batched parallel jobs on multiprocessors Proceedings of the 6th ACM conference on Computing frontiers, (99-108)
- Li F Competitive FIFO Buffer Management for Weighted Packets Proceedings of the 2009 Seventh Annual Communication Networks and Services Research Conference, (126-132)
- Buchbinder N and Naor J (2009). Online Primal-Dual Algorithms for Covering and Packing, Mathematics of Operations Research, 34:2, (270-286), Online publication date: 1-May-2009.
- Liu M, Xu Y, Chu C and Zheng F (2009). Online scheduling on two uniform machines to minimize the makespan, Theoretical Computer Science, 410:21-23, (2099-2109), Online publication date: 1-May-2009.
- Fink I, Krumke S and Westphal S (2009). New lower bounds for online k-server routing problems, Information Processing Letters, 109:11, (563-567), Online publication date: 1-May-2009.
- Jeż A and Łopuszański J (2009). On the two-dimensional cow search problem, Information Processing Letters, 109:11, (543-547), Online publication date: 1-May-2009.
- Pandey S, Broder A, Chierichetti F, Josifovski V, Kumar R and Vassilvitskii S Nearest-neighbor caching for content-match applications Proceedings of the 18th international conference on World wide web, (441-450)
- Johnson M, Bar-Noy A, Feng Y and Liu O Saving energy for (and from) a sunny day Proceedings of the 28th IEEE international conference on Computer Communications Workshops, (397-398)
- Zhang Z Online maximizing weighted throughput in a fading channel Proceedings of the 28th IEEE international conference on Computer Communications Workshops, (385-386)
- Gao J, Guibas L, Milosavljevic N and Dengpan Zhou Distributed resource management and matching in sensor networks Proceedings of the 2009 International Conference on Information Processing in Sensor Networks, (97-108)
- Popescu M, Olaru O and Mastorakis N Equilibrium dynamic systems integration Proceedings of the 10th WSEAS international conference on Automation & information, (424-429)
- Chen K, Kaplan H and Sharir M (2009). Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles, ACM Transactions on Algorithms, 5:2, (1-24), Online publication date: 1-Mar-2009.
- Koga H (2009). Dynamic TCP acknowledgment with sliding window, Theoretical Computer Science, 410:8-10, (914-925), Online publication date: 1-Mar-2009.
- Little P and Chaudhary A Object Caching for Queries and Updates Proceedings of the 3rd International Workshop on Algorithms and Computation, (394-405)
- Buchbinder N and (Seffi) Naor J (2009). The Design of Competitive Online Algorithms via a Primal, Foundations and Trends® in Theoretical Computer Science, 3:2–3, (93-263), Online publication date: 1-Feb-2009.
- Angelopoulos S and Schweitzer P Paging and list update under bijective analysis Proceedings of the twentieth annual ACM-SIAM symposium on Discrete algorithms, (1136-1145)
- Aminof B, Kupferman O and Lampert R Reasoning about online algorithms with weighted automata Proceedings of the twentieth annual ACM-SIAM symposium on Discrete algorithms, (835-844)
- Allulli L, Ausiello G, Bonifaci V and Laura L (2008). On the power of lookahead in on-line server routing problems, Theoretical Computer Science, 408:2-3, (116-128), Online publication date: 20-Nov-2008.
- Lotker Z, Patt-Shamir B and Rawitz D (2008). Ski rental with two general options, Information Processing Letters, 108:6, (365-368), Online publication date: 20-Nov-2008.
- Aiello W, Kesselman A and Mansour Y (2008). Competitive buffer management for shared-memory switches, ACM Transactions on Algorithms, 5:1, (1-16), Online publication date: 1-Nov-2008.
- Goldwasser M and Pedigo M (2008). Online nonpreemptive scheduling of equal-length jobs on two identical machines, ACM Transactions on Algorithms, 5:1, (1-18), Online publication date: 1-Nov-2008.
- Chrobak M (2008). SIGACT news online algorithms column 13, ACM SIGACT News, 39:3, (96-121), Online publication date: 1-Sep-2008.
- Kesselman A, Kogan K and Segal M Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing, (335-344)
- Oswald Y, Schmid S and Wattenhofer R Tight bounds for delay-sensitive aggregation Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing, (195-202)
- Bar-Noy A, Cheilaris P and Smorodinsky S (2008). Deterministic conflict-free coloring for intervals, ACM Transactions on Algorithms, 4:4, (1-18), Online publication date: 1-Aug-2008.
- Kobayashi K, Miyazaki S and Okabe Y (2008). A Tight Bound on Online Buffer Management for Two-Port Shared-Memory Switches, IEICE - Transactions on Information and Systems, E91-D:8, (2105-2114), Online publication date: 1-Aug-2008.
- Caragiannis I, Kaklamanis C, Kanellopoulos P and Papaioannou E (2008). Scheduling to maximize participation, Theoretical Computer Science, 402:2-3, (142-155), Online publication date: 20-Jul-2008.
- Dimitrov N and Plaxton C Competitive Weighted Matching in Transversal Matroids Proceedings of the 35th international colloquium on Automata, Languages and Programming - Volume Part I, (397-408)
- Plaxton C, Sun Y, Tiwari M and Vin H Online Compression Caching Proceedings of the 11th Scandinavian workshop on Algorithm Theory, (414-425)
- Azar Y, Feige U and Glasner D A Preemptive Algorithm for Maximizing Disjoint Paths on Trees Proceedings of the 11th Scandinavian workshop on Algorithm Theory, (319-330)
- Fujiwara H, Iwama K and Sekiguchi Y Average-Case Competitive Analyses for One-Way Trading Proceedings of the 14th annual international conference on Computing and Combinatorics, (41-51)
- Wang H, Chaudhary A and Chen D New Algorithms for Online Rectangle Filling with k-Lookahead Proceedings of the 14th annual international conference on Computing and Combinatorics, (385-394)
- Kesselman A, Kogan K and Segal M Best Effort and Priority Queuing Policies for Buffered Crossbar Switches Proceedings of the 15th international colloquium on Structural Information and Communication Complexity, (170-184)
- Babaioff M, Immorlica N, Kempe D and Kleinberg R (2008). Online auctions and generalized secretary problems, ACM SIGecom Exchanges, 7:2, (1-11), Online publication date: 1-Jun-2008.
- Hon W, Shah R, Varman P and Vitter J Tight competitive ratios for parallel disk prefetching and caching Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures, (352-361)
- Dimitrov N and Roy I A primal-dual resource augmentation analysis of a constant approximate algorithm for stable coalitions in a cluster Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures, (236-245)
- Li K (2008). Experimental average-case performance evaluation of online algorithms for routing and wavelength assignment and throughput maximization in WDM optical networks, ACM Journal of Experimental Algorithmics, 12, (1-24), Online publication date: 1-Jun-2008.
- Ausiello G, Bonifaci V and Laura L (2008). The on-line asymmetric traveling salesman problem, Journal of Discrete Algorithms, 6:2, (290-298), Online publication date: 1-Jun-2008.
- Bansal N, Buchbinder N and Naor J Randomized competitive algorithms for generalized caching Proceedings of the fortieth annual ACM symposium on Theory of computing, (235-244)
- Dell'Olmo P, Iovanella A, Lulli G and Scoppola B (2008). Exploiting incomplete information to manage multiprocessor tasks with variable arrival rates, Computers and Operations Research, 35:5, (1589-1600), Online publication date: 1-May-2008.
- Angelopoulos S, Dorrigiv R and López-Ortiz A List update with locality of reference Proceedings of the 8th Latin American conference on Theoretical informatics, (399-410)
- Westphal S (2008). A note on the k-Canadian Traveller Problem, Information Processing Letters, 106:3, (87-89), Online publication date: 1-Apr-2008.
- Chan W, Chin F, Ye D, Zhang G and Zhang Y (2008). On-line scheduling of parallel jobs on two machines, Journal of Discrete Algorithms, 6:1, (3-10), Online publication date: 1-Mar-2008.
- Divakaran S and Saks M (2008). Approximation algorithms for problems in scheduling with set-ups, Discrete Applied Mathematics, 156:5, (719-729), Online publication date: 1-Mar-2008.
- Xin C, Ma W and Yang L (2008). Competitive analysis of two special online device replacement problems, Journal of Computer Science and Technology, 23:2, (203-213), Online publication date: 1-Mar-2008.
- Dorrigiv R and López-Ortiz A On certain new models for paging with locality of reference Proceedings of the 2nd international conference on Algorithms and computation, (200-209)
- Dorrigiv R and López-Ortiz A Closing the gap between theory and practice Proceedings of the 2nd international conference on Algorithms and computation, (13-24)
- Caragiannis I Better bounds for online load balancing on unrelated machines Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, (972-981)
- Garg N, Gupta A, Leonardi S and Sankowski P Stochastic analyses for online combinatorial optimization problems Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, (942-951)
- Dobrev S, Královič R and Pardubská D How much information about the future is needed? Proceedings of the 34th conference on Current trends in theory and practice of computer science, (247-258)
- Dorrigiv R, LópezOrtiz A and Munro J On the relative dominance of paging algorithms Proceedings of the 18th international conference on Algorithms and computation, (488-499)
- Dorrigiv R, López-Ortiz A and Munro J On the Relative Dominance of Paging Algorithms Algorithms and Computation, (488-499)
- Ghiani G, Quaranta A and Triki C (2007). New policies for the dynamic traveling salesman problem, Optimization Methods & Software, 22:6, (971-983), Online publication date: 1-Dec-2007.
- Chrobak M, Jawor W, Sgall J and Tichý T (2007). Improved online algorithms for buffer management in QoS switches, ACM Transactions on Algorithms, 3:4, (50-es), Online publication date: 1-Nov-2007.
- Wang H, Chaudhary A and Chen D Online rectangle filling Proceedings of the 5th international conference on Approximation and online algorithms, (274-287)
- Bein W, Iwama K, Kawahara J, Larmore L and Oravec J A randomized algorithm for two servers in cross polytope spaces Proceedings of the 5th international conference on Approximation and online algorithms, (246-259)
- Wang H, Chaudhary A and Chen D Online Rectangle Filling Approximation and Online Algorithms, (274-287)
- Bein W, Iwama K, Kawahara J, Larmore L and Oravec J A Randomized Algorithm for Two Servers in Cross Polytope Spaces Approximation and Online Algorithms, (246-259)
- Kobayashi K and Okamoto K Improved upper bounds on the competitive ratio for online realtime scheduling Proceedings of the 15th annual European conference on Algorithms, (463-474)
- Bein W, Larmore L and Noga J Equitable revisited Proceedings of the 15th annual European conference on Algorithms, (419-426)
- Lorenz J, Panagiotou K and Steger A Optimal algorithms for k-search with application in option pricing Proceedings of the 15th annual European conference on Algorithms, (275-286)
- Caragiannis I, Fishkin A, Kaklamanis C and Papaioannou E (2007). A tight bound for online colouring of disk graphs, Theoretical Computer Science, 384:2-3, (152-160), Online publication date: 1-Oct-2007.
- Levina T, Levin Y, Mcgill J and Nediak M (2007). Linear programming with online learning, Operations Research Letters, 35:5, (612-618), Online publication date: 1-Sep-2007.
- Koga H Dynamic tcp acknowledgment with sliding window Proceedings of the 10th international conference on Algorithms and Data Structures, (649-660)
- Harks T and Végh L Nonadaptive selfish routing with online demands Proceedings of the 4th conference on Combinatorial and algorithmic aspects of networking, (27-45)
- Bortnikov E, Cidon I and Keidar I (2007). Nomadic Service Assignment, IEEE Transactions on Mobile Computing, 6:8, (915-928), Online publication date: 1-Aug-2007.
- Bosman P and La Poutré H Learning and anticipation in online dynamic optimization with evolutionary algorithms Proceedings of the 9th annual conference on Genetic and evolutionary computation, (1165-1172)
- Ha P, Papatriantafilou M and Tsigas P (2007). Efficient self-tuning spin-locks using competitive analysis, Journal of Systems and Software, 80:7, (1077-1090), Online publication date: 1-Jul-2007.
- Mahdian M, Nazerzadeh H and Saberi A Allocating online advertisement space with unreliable estimates Proceedings of the 8th ACM conference on Electronic commerce, (288-294)
- Kobayashi K, Miyazaki S and Okabe Y A tight bound on online buffer management for two-port shared-memory switches Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures, (358-364)
- Chan J, Chin F, Ye D and Zhang Y Online frequency allocation in cellular networks Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures, (241-249)
- Allulli L, Baldoni R, Laura L and Tucci Piergiovanni S (2007). On the Complexity of Removing Z-Cycles from a Checkpoints and Communication Pattern, IEEE Transactions on Computers, 56:6, (853-858), Online publication date: 1-Jun-2007.
- Fatima S, Wooldridge M and Jennings N Approximate and online multi-issue negotiation Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems, (1-8)
- Xu Y, Xu W and Li H (2007). On the on-line rent-or-buy problem in probabilistic environments, Journal of Global Optimization, 38:1, (1-20), Online publication date: 1-May-2007.
- Erlebach T, Jacob R, Mihalak M, Nunkesser M, Szabo G and Widmayer P (2007). An Algorithmic View on OVSF Code Assignment, Algorithmica, 47:3, (269-298), Online publication date: 1-Mar-2007.
- Adamy U, Ambuhl C, Anand R and Erlebach T (2007). Call Control in Rings, Algorithmica, 47:3, (217-238), Online publication date: 1-Mar-2007.
- Ben-Jye Chang , Yan-Ling Chen and Chien-Ming Chou Adaptive Hierarchical Polling and Cost-Based Call Admission Control in IEEE 802.16 WiMAX Networks Proceedings of the 2007 IEEE Wireless Communications and Networking Conference, (1954-1958)
- Pandurangan G and Upfal E (2007). Entropy-based bounds for online algorithms, ACM Transactions on Algorithms, 3:1, (1-19), Online publication date: 1-Feb-2007.
- Dynia M, Korzeniowski M and Kutyłowski J Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science, (260-271)
- Bansal N, Chen N, Cherniavsky N, Rudra A, Schieber B and Sviridenko M Dynamic pricing for impatient bidders Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, (726-735)
- Angelopoulos S Improved bounds for the online steiner tree problem in graphs of bounded edge-asymmetry Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, (248-257)
- Angelopoulos S, Dorrigiv R and López-Ortiz A On the separation and equivalence of paging strategies Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, (229-237)
- Li F, Sethuraman J and Stein C Better online buffer management Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, (199-208)
- Engelberg R and Naor J Equilibria in online games Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, (149-158)
- Mercier L and Van Hentenryck P Performance analysis of online anticipatory algorithms for large multistage stochastic integer programs Proceedings of the 20th international joint conference on Artifical intelligence, (1979-1984)
- Remy J, Souza A and Steger A (2007). On an Online Spanning Tree Problem in Randomly Weighted Graphs, Combinatorics, Probability and Computing, 16:1, (127-144), Online publication date: 1-Jan-2007.
- Schmid S and Wattenhofer R Dynamic internet congestion with bursts Proceedings of the 13th international conference on High Performance Computing, (159-170)
- Chan J, Chin F, Ye D, Zhang Y and Zhu H Frequency allocation problems for linear cellular networks Proceedings of the 17th international conference on Algorithms and Computation, (61-70)
- Rührup S and Schindelhauer C Online multi-path routing in a maze Proceedings of the 17th international conference on Algorithms and Computation, (650-659)
- Epstein L and Kesselman A (2006). On the remote server problem or more about TCP acknowledgments, Theoretical Computer Science, 369:1, (285-299), Online publication date: 15-Dec-2006.
- Damaschke P (2006). Scheduling search procedures, Journal of Scheduling, 9:6, (545-557), Online publication date: 1-Dec-2006.
- Caragiannis I, Kaklamanis C, Kanellopoulos P and Papaioannou E Scheduling to maximize participation Proceedings of the 2nd international conference on Trustworthy global computing, (218-232)
- Azar Y, Fiat A, Levy M and Narayanaswamy N (2006). An improved algorithm for online coloring of intervals with bandwidth, Theoretical Computer Science, 363:1, (18-27), Online publication date: 25-Oct-2006.
- Boyar J, Epstein L, Favrholdt L, Kohrt J, Larsen K, Pedersen M and Wøhlk S (2006). The maximum resource bin packing problem, Theoretical Computer Science, 362:1, (127-139), Online publication date: 11-Oct-2006.
- Flammini M and Nicosia G (2006). Competitive algorithms for the bicriteria k-server problem, Discrete Applied Mathematics, 154:15, (2117-2127), Online publication date: 1-Oct-2006.
- Boyar J, Ehmsen M and Larsen K Theoretical evidence for the superiority of LRU-2 over LRU for the paging problem Proceedings of the 4th international conference on Approximation and Online Algorithms, (95-107)
- Bonifaci V and Stougie L Online k-server routing problems Proceedings of the 4th international conference on Approximation and Online Algorithms, (83-94)
- Harks T, Heinz S and Pfetsch M Competitive online multicommodity routing Proceedings of the 4th international conference on Approximation and Online Algorithms, (240-252)
- Panda B, Riedewald M, Pope S, Gehrke J and Chew L Indexing for function approximation Proceedings of the 32nd international conference on Very large data bases, (523-534)
- Blum A, Sandholm T and Zinkevich M (2006). Online algorithms for market clearing, Journal of the ACM, 53:5, (845-879), Online publication date: 1-Sep-2006.
- Gu X, Lin W and Veeravalli B (2006). Practically Realizable Efficient Data Allocation and Replication Strategies for Distributed Databases with Buffer Constraints, IEEE Transactions on Parallel and Distributed Systems, 17:9, (1001-1013), Online publication date: 1-Sep-2006.
- Gutiérrez S, Krumke S, Megow N and Vredeveld T (2006). How to whack moles, Theoretical Computer Science, 361:2, (329-341), Online publication date: 1-Sep-2006.
- Fotakis D (2006). Incremental algorithms for facility location and k-Median, Theoretical Computer Science, 361:2, (275-313), Online publication date: 1-Sep-2006.
- Davis S, Edmonds J and Impagliazzo R Online algorithms to minimize resource reallocations and network communication Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation, (104-115)
- Damaschke P, Ha P and Tsigas P Competitive freshness algorithms for wait-free data objects Proceedings of the 12th international conference on Parallel Processing, (811-820)
- Dynia M, Kutyłowski J, der Heide F and Schindelhauer C Smart robot teams exploring sparse trees Proceedings of the 31st international conference on Mathematical Foundations of Computer Science, (327-338)
- Verhoeven Y (2006). A lower bound on the competitivity of memoryless algorithms for a generalization of the CNN problem, Theoretical Computer Science, 359:1, (58-68), Online publication date: 14-Aug-2006.
- Schmid S and Wattenhofer R A TCP with guaranteed performance in networks with dynamic congestion and random wireless losses Proceedings of the 2nd annual international workshop on Wireless internet, (9-es)
- Megow N, Uetz M and Vredeveld T (2006). Models and Algorithms for Stochastic Online Scheduling, Mathematics of Operations Research, 31:3, (513-525), Online publication date: 1-Aug-2006.
- Bartal Y, Bollobás B and Mendel M (2006). Ramsey-type theorems for metric spaces with applications to online problems, Journal of Computer and System Sciences, 72:5, (890-921), Online publication date: 1-Aug-2006.
- Bar-Noy A, Cheilaris P and Smorodinsky S Conflict-free coloring for intervals Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures, (128-137)
- Plaxton C, Sun Y, Tiwari M and Vin H Reconfigurable resource scheduling Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures, (93-102)
- Goldwasser M and Pedigo M Online, non-preemptive scheduling of equal-length jobs on two identical machines Proceedings of the 10th Scandinavian conference on Algorithm Theory, (113-123)
- Chang B, Lin S and Liang Y Minimizing roaming overheads for vertical handoff in heterogeneous wireless mobile networks Proceedings of the 2006 international conference on Wireless communications and mobile computing, (957-962)
- Thibault N and Laforest C An optimal rebuilding strategy for a decremental tree problem Proceedings of the 13th international conference on Structural Information and Communication Complexity, (157-170)
- Kesselman A and Rosén A (2006). Scheduling policies for CIOQ switches, Journal of Algorithms, 60:1, (60-83), Online publication date: 1-Jul-2006.
- Chen K How to play a coloring game against a color-blind adversary Proceedings of the twenty-second annual symposium on Computational geometry, (44-51)
- Aghassi M and Bertsimas D (2006). Robust game theory, Mathematical Programming: Series A and B, 107:1-2, (231-273), Online publication date: 1-Jun-2006.
- Kenyon C and Sellmann M Plan b Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, (126-138)
- Esmaeilsabzali S and Day N Online pricing for web service providers Proceedings of the 2006 international workshop on Economics driven software engineering research, (37-42)
- Hartline J and Sharp A An incremental model for combinatorial maximization problems Proceedings of the 5th international conference on Experimental Algorithms, (36-48)
- Yu S, Li Z and Liu B Online Algorithm for Application Layer Anycast Proceedings of the 2006 conference on Advances in Intelligent IT: Active Media Technology 2006, (340-345)
- Ausiello G, Allulli L, Bonifaci V and Laura L On-Line algorithms, real time, the virtue of laziness, and the power of clairvoyance Proceedings of the Third international conference on Theory and Applications of Models of Computation, (1-20)
- Ashlagi I, Monderer D and Tennenholtz M Resource selection games with unknown number of players Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems, (819-825)
- Gao J and Zhang L (2006). Load-Balanced Short-Path Routing in Wireless Networks, IEEE Transactions on Parallel and Distributed Systems, 17:4, (377-388), Online publication date: 1-Apr-2006.
- Jawor W, Chrobak M and Dürr C Competitive analysis of scheduling algorithms for aggregated links Proceedings of the 7th Latin American conference on Theoretical Informatics, (617-628)
- Hammar M, Nilsson B and Persson M The online freeze-tag problem Proceedings of the 7th Latin American conference on Theoretical Informatics, (569-579)
- Bornstein C, Laber E and Mas M On behalf of the seller and society Proceedings of the 7th Latin American conference on Theoretical Informatics, (211-223)
- Erlebach T and Vukadinović D (2006). Path problems in generalized stars, complete graphs, and brick wall graphs, Discrete Applied Mathematics, 154:4, (673-683), Online publication date: 15-Mar-2006.
- Dynia M, Korzeniowski M and Schindelhauer C Power-Aware collective tree exploration Proceedings of the 19th international conference on Architecture of Computing Systems, (341-351)
- Guha S, Koudas N and Shim K (2006). Approximation and streaming algorithms for histogram construction problems, ACM Transactions on Database Systems, 31:1, (396-438), Online publication date: 1-Mar-2006.
- Bilò V, Flammini M and Moscardelli L (2006). Pareto approximations for the bicriteria scheduling problem, Journal of Parallel and Distributed Computing, 66:3, (393-402), Online publication date: 1-Mar-2006.
- Fotakis D Memoryless facility location in one pass Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science, (608-620)
- Lin G, Nagarajan C, Rajaraman R and Williamson D A general approach for incremental approximation and hierarchical clustering Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, (1147-1156)
- Hajiaghayi M, Kleinberg R and Leighton T Improved lower and upper bounds for universal TSP in planar metrics Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, (649-658)
- Ailon N, Chazelle B, Comandur S and Liu D Self-improving algorithms Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, (261-270)
- Scharbrodt M, Schickinger T and Steger A (2006). A new average case analysis for completion time scheduling, Journal of the ACM, 53:1, (121-146), Online publication date: 1-Jan-2006.
- Duch A and Martínez C (2005). Improving the performance of multidimensional search using fingers, ACM Journal of Experimental Algorithmics, 10, (2.4-es), Online publication date: 31-Dec-2005.
- Xu Y, Xin C and Yi F New results on online replacement problem Proceedings of the First international conference on Internet and Network Economics, (554-563)
- Ding L, Xu Y and Hu S The bahncard problem with interest rate and risk Proceedings of the First international conference on Internet and Network Economics, (307-314)
- Yu L, Manning E and Li K Heuristic approaches to service level agreements in packet networks Proceedings of the First international conference on Internet and Network Economics, (1003-1012)
- Irani S, Singh G, Shukla S and Gupta R (2005). An overview of the competitive and adversarial approaches to designing dynamic power management strategies, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 13:12, (1349-1361), Online publication date: 1-Dec-2005.
- Fotakis D A primal-dual algorithm for online non-uniform facility location Proceedings of the 10th Panhellenic conference on Advances in Informatics, (47-56)
- Krumke S, de Paepe W, Poensgen D, Lipmann M, Marchetti-Spaccamela A and Stougie L On minimizing the maximum flow time in the online dial-a-ride problem Proceedings of the Third international conference on Approximation and Online Algorithms, (258-269)
- Heinz S, Krumke S, Megow N, Rambau J, Tuchscherer A and Vredeveld T The online target date assignment problem Proceedings of the Third international conference on Approximation and Online Algorithms, (230-243)
- Frahling G and Krokowski J Online occlusion culling Proceedings of the 13th annual European conference on Algorithms, (758-769)
- Rührup S and Schindelhauer C Online routing in faulty meshes with sub-linear comparative time and traffic ratio Proceedings of the 13th annual European conference on Algorithms, (23-34)
- Hay D and Scalosub G Jitter regulation for multiple streams Proceedings of the 13th annual European conference on Algorithms, (496-507)
- Fleischer R and Trippen G Exploring an unknown graph efficiently Proceedings of the 13th annual European conference on Algorithms, (11-22)
- Schäfer G and Sivadasan N (2005). Topology matters, Theoretical Computer Science, 341:1, (216-246), Online publication date: 5-Sep-2005.
- Azar Y and Richter Y (2005). Management of Multi-Queue Switches in QoS Networks, Algorithmica, 43:1-2, (81-96), Online publication date: 1-Sep-2005.
- Kesselman A, Mansour Y and Stee R (2005). Improved Competitive Guarantees for QoS Buffering, Algorithmica, 43:1-2, (63-80), Online publication date: 1-Sep-2005.
- Baille F, Bampis E, Laforest C and Thibault N On-Line bicriteria interval scheduling Proceedings of the 11th international Euro-Par conference on Parallel Processing, (312-322)
- Caragiannis I, Kaklamanis C and Papaioannou E New bounds on the competitiveness of randomized online call control in cellular networks Proceedings of the 11th international Euro-Par conference on Parallel Processing, (1089-1099)
- Bienkowski M and Korzeniowski M Dynamic page migration under brownian motion Proceedings of the 11th international Euro-Par conference on Parallel Processing, (962-971)
- Modani N, Sabharwal Y and Karthik S A framework for session based recommendations Proceedings of the 6th international conference on E-Commerce and Web Technologies, (108-117)
- Boyar J, Epstein L, Favrholdt L, Kohrt J, Larsen K, Pedersen M and Wøhlk S The maximum resource bin packing problem Proceedings of the 15th international conference on Fundamentals of Computation Theory, (397-408)
- Bein W, Iwama K, Larmore L and Noga J The delayed k-server problem Proceedings of the 15th international conference on Fundamentals of Computation Theory, (281-292)
- Baille F, Bampis E, Laforest C and Thibault N On-Line Simultaneous Maximization of the Size and the Weight for Degradable Intervals Schedules Proceedings of the 11th Annual International Conference on Computing and Combinatorics - Volume 3595, (308-317)
- Allulli L, Ausiello G and Laura L On the Power of Lookahead in On-Line Vehicle Routing Problems Proceedings of the 11th Annual International Conference on Computing and Combinatorics - Volume 3595, (728-736)
- Ausiello G, Bonifaci V and Laura L The on-line asymmetric traveling salesman problem Proceedings of the 9th international conference on Algorithms and Data Structures, (306-317)
- Bienkowski M Dynamic page migration with stochastic requests Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures, (270-278)
- Andelman N Randomized qeue management for DiffServ Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures, (1-10)
- Chan W, Lam T and Wong P Dynamic bin packing of unit fractions items Proceedings of the 32nd international conference on Automata, Languages and Programming, (614-626)
- Zeng D and Zhao J (2005). Effective Role Resolution in Workflow Management, INFORMS Journal on Computing, 17:3, (374-387), Online publication date: 1-Jul-2005.
- Ding L, Xin C and Chen J A risk-reward competitive analysis of the bahncard problem Proceedings of the First international conference on Algorithmic Applications in Management, (37-45)
- Hu S, Guo Q and Li H Competitive analysis of on-line securities investment Proceedings of the First international conference on Algorithmic Applications in Management, (224-232)
- Hartline J and McGrew R From optimal limited to unlimited supply auctions Proceedings of the 6th ACM conference on Electronic commerce, (175-182)
- Coja-Oghlan A, Krumke S and Nierhoff T (2005). A Hard Dial-a-Ride Problem that is Easy on Average, Journal of Scheduling, 8:3, (197-210), Online publication date: 1-Jun-2005.
- Orda A and Yassour B Maximum-lifetime routing algorithms for networks with omnidirectional and directional antennas Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing, (426-437)
- Caragiannis I, Fishkin A, Kaklamanis C and Papaioannou E A tight bound for online coloring of disk graphs Proceedings of the 12th international conference on Structural Information and Communication Complexity, (78-88)
- Jia L, Lin G, Noubir G, Rajaraman R and Sundaram R Universal approximations for TSP, Steiner tree, and set cover Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, (386-395)
- Banner R and Orda A Multipath routing algorithms for congestion minimization Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems, (536-548)
- Jiang A and Bruck J (2005). Network file storage with graceful performance degradation, ACM Transactions on Storage, 1:2, (171-189), Online publication date: 1-May-2005.
- Fujiwara H and Iwama K (2005). Average-Case Competitive Analyses for Ski-Rental Problems, Algorithmica, 42:1, (95-107), Online publication date: 1-May-2005.
- Malik T, Burns R and Chaudhary A Bypass Caching Proceedings of the 21st International Conference on Data Engineering, (94-105)
- Chang N and Liu M Optimal Controlled Flooding Search in a Large Wireless Network Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, (229-237)
- Ruhrup S and Schindelhauer C Competitive Time and Traffic Analysis of Position-Based Routing using a Cell Structure Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
- Fuchs B, Hochstättler W and Kern W (2005). Online matching on a line, Theoretical Computer Science, 332:1-3, (251-264), Online publication date: 28-Feb-2005.
- Bienkowski M, Dynia M and Korzeniowski M Improved algorithms for dynamic page migration Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science, (365-376)
- El-Qawasmeh E and Dalalah A Revisiting integer multiplication overflow Proceedings of the 4th WSEAS International Conference on Software Engineering, Parallel & Distributed Systems, (1-14)
- Erlebach T Approximation algorithms for edge-disjoint paths and unsplittable flow Efficient Approximation and Online Algorithms, (97-134)
- Chan W and Wong P On-line windows scheduling of temporary items Proceedings of the 15th international conference on Algorithms and Computation, (259-270)
- Steiger C, Walder H and Platzner M (2004). Operating Systems for Reconfigurable Embedded Platforms, IEEE Transactions on Computers, 53:11, (1393-1407), Online publication date: 1-Nov-2004.
- Ausiello G, Demange M, Laura L and Paschos V (2004). Algorithms for the on-line quota traveling salesman problem, Information Processing Letters, 92:2, (89-94), Online publication date: 31-Oct-2004.
- Jarry A and Lotker Z Connectivity in evolving graph with geometric properties Proceedings of the 2004 joint workshop on Foundations of mobile computing, (24-30)
- Chang N and Liu M Revisiting the TTL-based controlled flooding search Proceedings of the 10th annual international conference on Mobile computing and networking, (85-99)
- Koutsoupias E and Taylor D (2004). The CNN problem and other k-server variants, Theoretical Computer Science, 324:2-3, (347-359), Online publication date: 20-Sep-2004.
- Bartal Y and Koutsoupias E (2004). On the competitive ratio of the work function algorithm for the k-server problem, Theoretical Computer Science, 324:2-3, (337-345), Online publication date: 20-Sep-2004.
- Chrobak M and Sgall J (2004). The weighted 2-server problem, Theoretical Computer Science, 324:2-3, (289-312), Online publication date: 20-Sep-2004.
- Bose P and Morin P (2004). Competitive online routing in geometric graphs, Theoretical Computer Science, 324:2-3, (273-288), Online publication date: 20-Sep-2004.
- Lempel R and Moran S (2004). Competitive caching of query results in search engines, Theoretical Computer Science, 324:2-3, (253-271), Online publication date: 20-Sep-2004.
- Fleischer R, Głazek W and Seiden S (2004). New results for online page replication, Theoretical Computer Science, 324:2-3, (219-251), Online publication date: 20-Sep-2004.
- Kesselman A and Mansour Y (2004). Harmonic buffer management policy for shared memory switches, Theoretical Computer Science, 324:2-3, (161-182), Online publication date: 20-Sep-2004.
- Adamy U, Erlebach T, Mitsche D, Schurr I, Speckmann B and Welzl E Off-line admission control for advance reservations in star networks Proceedings of the Second international conference on Approximation and Online Algorithms, (211-224)
- Chrobak M (2004). SIGACT news online algorithms column 4, ACM SIGACT News, 35:3, (58-66), Online publication date: 1-Sep-2004.
- Damaschke P (2004). Scheduling Search Procedures, Journal of Scheduling, 7:5, (349-364), Online publication date: 1-Sep-2004.
- Gao J and Zhang L Tradeoffs between stretch factor and load balancing ratio in routing on growth restricted graphs Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, (189-196)
- Hyafil N and Boutilier C Regret minimizing equilibria and mechanisms for games with strict type uncertainty Proceedings of the 20th conference on Uncertainty in artificial intelligence, (268-277)
- Miyazawa H and Erlebach T (2004). An Improved Randomized On-Line Algorithm for a Weighted Interval Selection Problem, Journal of Scheduling, 7:4, (293-311), Online publication date: 1-Jul-2004.
- Meyerson A Online algorithms for network design Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures, (275-280)
- Shah R, Varman P and Vitter J Online algorithms for prefetching and caching on parallel disks Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures, (255-264)
- Guez D, Kesselman A and Rosén A Packet-mode policies for input-queued switches Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures, (93-102)
- Bienkowski M, Korzeniowski M and Meyer auf der Heide F Fighting against two adversaries Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures, (64-73)
- Martínez-Vargas M, Meda-Campaña M, Larios-Rosillo V and Ruíz-Sánchez F Quality of service on a distributed virtual reality system for robots tele-operation over the internet Proceedings of the 4th international conference on Innovative Internet Community Systems, (81-90)
- Shachnai H and Tamir T (2004). Tight bounds for online class-constrained packing, Theoretical Computer Science, 321:1, (103-123), Online publication date: 16-Jun-2004.
- Gossa J, Pierson J and Brunie L Replica placement in a pervasive environment Proceedings of the 1st French-speaking conference on Mobility and ubiquity computing, (195-198)
- Yaroshinsky R, El-Yaniv R and Seiden S (2004). How to Better Use Expert Advice, Machine Language, 55:3, (271-309), Online publication date: 1-Jun-2004.
- Tennenholtz M Transitive voting Proceedings of the 5th ACM conference on Electronic commerce, (230-231)
- Kakade S, Kearns M, Mansour Y and Ortiz L Competitive algorithms for VWAP and limit order trading Proceedings of the 5th ACM conference on Electronic commerce, (189-198)
- Porter R Mechanism design for online real-time scheduling Proceedings of the 5th ACM conference on Electronic commerce, (61-70)
- Chrobak M (2004). SIGACT news online algorithms column 2, ACM SIGACT News, 35:1, (38-48), Online publication date: 1-Mar-2004.
- Becchetti L, Leonardi S and Muthukrishnan S (2004). Average stretch without migration, Journal of Computer and System Sciences, 68:1, (80-95), Online publication date: 1-Feb-2004.
- Mansour Y, Patt-Shamir B and Lapid O (2004). Optimal smoothing schedules for real-time streams, Distributed Computing, 17:1, (77-89), Online publication date: 1-Feb-2004.
- Motwani R and Thomas D Caching queues in memory buffers Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, (541-549)
- Davis S and Impagliazzo R Models of greedy algorithms for graph problems Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, (381-390)
- Borodin A, El-Yaniv R and Gogan V (2004). Can we learn to beat the best stock, Journal of Artificial Intelligence Research, 21:1, (579-594), Online publication date: 1-Jan-2004.
- Monderer D and Tennenholtz M (2004). K-implementation, Journal of Artificial Intelligence Research, 21:1, (37-62), Online publication date: 1-Jan-2004.
- Lavi R and Nisan N (2004). Competitive analysis of incentive compatible on-line auctions, Theoretical Computer Science, 310:1-3, (159-180), Online publication date: 1-Jan-2004.
- Jiang X, Abegglen K, Bunke H and Csirik J (2003). Dynamic computation of generalised median strings, Pattern Analysis & Applications, 6:3, (185-193), Online publication date: 1-Dec-2003.
- Borodin A, Nielsen M and Rackoff C (2003). (Incremental) Priority Algorithms, Algorithmica, 37:4, (295-326), Online publication date: 1-Dec-2003.
- Gupta R, Irani S and Shukla S Formal Methods for Dynamic Power Management Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
- Kalyanasundaram B and Pruhs K (2003). Maximizing job completions online, Journal of Algorithms, 49:1, (63-85), Online publication date: 1-Oct-2003.
- Frederiksen J, Larsen K, Noga J and Uthaisombut P (2003). Dynamic TCP acknowledgment in the LogP model, Journal of Algorithms, 48:2, (407-428), Online publication date: 1-Sep-2003.
- Chin F and Fung S Improved competitive algorithms for online scheduling with partial job values Proceedings of the 9th annual international conference on Computing and combinatorics, (425-434)
- Fotakis D On the competitive ratio for online facility location Proceedings of the 30th international conference on Automata, languages and programming, (637-652)
- Damaschke P (2003). Nearly optimal strategies for special cases of on-line capital investment, Theoretical Computer Science, 302:1-3, (35-44), Online publication date: 13-Jun-2003.
- Bansal N and Pruhs K Server scheduling in the Lp norm Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, (242-250)
- Azar Y and Richter Y Management of multi-queue switches in QoS networks Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, (82-89)
- Kesselman A and Rosén A Scheduling policies for CIOQ switches Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures, (353-362)
- Edmonds J, Datta S and Dymond P TCP is competitive against a limited adversary Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures, (174-183)
- Bruce R, Hoffmann M, Krizanc D and Raman R Efficient update strategies for geometric computing with uncertainty Proceedings of the 5th Italian conference on Algorithms and complexity, (12-23)
- Fleischer R and Trippen G Experimental studies of graph traversal algorithms Proceedings of the 2nd international conference on Experimental and efficient algorithms, (120-133)
- Caramia M, Giordan S and Iovanella A An on-line algorithm for the rectangle packing problem with rejection Proceedings of the 2nd international conference on Experimental and efficient algorithms, (59-69)
- Broder A, Najork M and Wiener J Efficient URL caching for world wide web crawling Proceedings of the 12th international conference on World Wide Web, (679-689)
- Goldwasser M and Kerbikov B (2003). Admission control with immediate notification, Journal of Scheduling, 6:3, (269-285), Online publication date: 1-May-2003.
- Irani S and Leung V (2003). Scheduling with conflicts on bipartite and interval graphs, Journal of Scheduling, 6:3, (287-307), Online publication date: 1-May-2003.
- Feuerstein E, Mydlarz M and Stougie L (2003). On-line multi-threaded scheduling, Journal of Scheduling, 6:2, (167-181), Online publication date: 1-Mar-2003.
- Adler R and Azar Y (2003). Beating the logarithmic lower bound, Journal of Scheduling, 6:2, (113-129), Online publication date: 1-Mar-2003.
- Wong J, Qu G and Potkonjak M An on-line approach for power minimization in QoS sensitive systems Proceedings of the 2003 Asia and South Pacific Design Automation Conference, (59-64)
- Aiello W, Ostrovsky R, Kushilevitz E and Rosén A Dynamic routing on networks with fixed-size buffers Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, (771-780)
- Andelman N, Mansour Y and Zhu A Competitive queueing policies for QoS switches Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, (761-770)
- Peserico E Online paging with arbitrary associativity Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, (555-564)
- Goldberg A and Hartline J Competitiveness via consensus Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, (215-222)
- Albers S and Bals H Dynamic TCP acknowledgement Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, (47-55)
- Sussman J and Marzullo K (2003). The Bancomat problem, Theoretical Computer Science, 291:1, (103-131), Online publication date: 4-Jan-2003.
- Chrobak M, Koutsoupias E and Noga J (2003). More on randomized on-line algorithms for caching, Theoretical Computer Science, 290:3, (1997-2008), Online publication date: 3-Jan-2003.
- Epstein L and Favrholdt L (2003). On-line maximizing the number of items packed in variable-sized bins, Acta Cybernetica, 16:1, (57-66), Online publication date: 1-Jan-2003.
- Bejerano Y, Cidon I and Naor J (2002). Efficient handoff rerouting algorithms, IEEE/ACM Transactions on Networking, 10:6, (749-760), Online publication date: 1-Dec-2002.
- Damaschke P (2002). Two short notes on the on-line travelling salesman, Theoretical Computer Science, 289:1, (845-852), Online publication date: 23-Oct-2002.
- Bein W, Chrobak M and Larmore L (2002). The 3-server problem in the plane, Theoretical Computer Science, 289:1, (335-354), Online publication date: 23-Oct-2002.
- Azar Y, Regev O, Sgall J and Woeginger G (2002). Off-line temporary tasks assignment, Theoretical Computer Science, 287:2, (419-428), Online publication date: 28-Sep-2002.
- Peserico E The lazy adversary conjecture fails Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures, (143-144)
- Koo C, Lam T, Ngan T and To K Extra processors versus future information in optimal deadline scheduling Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures, (133-142)
- Boutilier C, Das R, Kephart J, Tesauro G and Walsh W Cooperative negotiation in autonomic systems using incremental utility elicitation Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence, (89-97)
- Tennenholtz M Competitive safety analysis Eighteenth national conference on Artificial intelligence, (404-409)
- Lotker Z and Patt-Shamir B Nearly optimal FIFO buffer management for DiffServ Proceedings of the twenty-first annual symposium on Principles of distributed computing, (134-143)
- Albers S, Favrholdt L and Giel O On paging with locality of reference Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, (258-267)
- Chan W, Lam T, Ting H and Wong W A unified analysis of hot video schedulers Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, (179-188)
- Kontogiannis S Lower bounds & competitive algorithms for online scheduling of unit-size tasks to related machines Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, (124-133)
- Blum A, Sandholm T and Zinkevich M Online algorithms for market clearing Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, (971-980)
- Bar-Yossef Z, Hildrum K and Wu F Incentive-compatible online auctions for digital goods Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, (964-970)
- Gopalan P, Karloff H, Mehta A, Mihail M and Vishnoi N Caching with expiration times Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, (540-547)
- Kolman P and Scheideler C Improved bounds for the unsplittable flow problem Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, (184-193)
- Armon A, Azar Y, Epstein L and Regev O Temporary tasks assignment resolved Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, (116-124)
- Blum A, Chawla S and Kalai A Static optimality and dynamic search-optimality in lists and trees Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, (1-8)
- Lam T, Ting H, To K and Wong W (2002). On-line load balancing of temporary tasks revisited, Theoretical Computer Science, 270:1-2, (325-340), Online publication date: 6-Jan-2002.
- Narayanan L Channel assignment and graph multicoloring Handbook of wireless networks and mobile computing, (71-94)
- Boyar J, Favrholdt L, Larsen K and Nielsen M (2001). The competitive ratio for on-line dual bin packing with restricted input sequences, Nordic Journal of Computing, 8:4, (463-472), Online publication date: 1-Dec-2001.
- Jayram T, Kimbrel T, Krauthgamer R, Schieber B and Sviridenko M Online server allocation in a server farm via benefit task systems Proceedings of the thirty-third annual ACM symposium on Theory of computing, (540-549)
- Mavronicolas M and Spirakis P The price of selfish routing Proceedings of the thirty-third annual ACM symposium on Theory of computing, (510-519)
- Karlin A, Kenyon C and Randall D Dynamic TCP acknowledgement and other stories about e/(e-1) Proceedings of the thirty-third annual ACM symposium on Theory of computing, (502-509)
- Hahne E, Kesselman A and Mansour Y Competitve buffer management for shared-memory switches Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures, (53-58)
- Kolman P and Scheideler C Simple on-line algorithms for the maximum disjoint paths problem Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures, (38-47)
- Carpenter T, Carter R, Cochinwala M and Eiger M (2001). Client-Server Caching with Expiration Timestamps, Distributed and Parallel Databases, 10:1, (5-22), Online publication date: 1-Jul-2001.
- Khanna S and Tan W On computing functions with uncertainty Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (171-182)
- Fagin R, Lotem A and Naor M Optimal aggregation algorithms for middleware Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (102-113)
- Lam T and To K Performance guarantee for online deadline scheduling in the presence of overload Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, (755-764)
- Goldberg A, Hartline J and Wright A Competitive auctions and digital goods Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, (735-744)
- Pandurangan G and Upfal E Can entropy characterize performance of online algorithms? Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, (727-734)
- Kesselman A and Mansour Y Loss-bounded analysis for differentiated services Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, (591-600)
- Lavi R and Nisan N Competitive analysis of incentive compatible on-line auctions Proceedings of the 2nd ACM conference on Electronic commerce, (233-241)
- Liberatore V (2000). Scheduling jobs before shut-down, Nordic Journal of Computing, 7:3, (204-226), Online publication date: 1-Sep-2000.
- Bejerano Y, Cidon I and Naor J Dynamic session management for static and mobile users Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications, (65-74)
- Mansour Y, Patt-Shamir B and Lapid O Optimal smoothing schedules for real-time streams (extended abstract) Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing, (21-29)
- Cohen E, Kaplan H and Zwick U Connection caching under various models of communication Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures, (54-63)
- Charikar M, Fagin R, Guruswami V, Kleinberg J, Raghavan P and Sahai A Query strategies for priced information (extended abstract) Proceedings of the thirty-second annual ACM symposium on Theory of computing, (582-591)
- Becchetti L, Leonardi S and Muthukrishnan S Scheduling to minimize average stretch without migration Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, (548-557)
- Young N K-medians, facility location, and the Chernoff-Wald bound Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, (86-95)
- Koutsoupias E Weak Adversaries for the k-Server Problem Proceedings of the 40th Annual Symposium on Foundations of Computer Science
- Goel A and Indyk P Stochastic Load Balancing and Related Problems Proceedings of the 40th Annual Symposium on Foundations of Computer Science
- Cohen E, Kaplan H and Zwick U Connection caching Proceedings of the thirty-first annual ACM symposium on Theory of Computing, (612-621)
- Chen G, Kao M, Lyuu Y and Wong H Optimal buy-and-hold strategies for financial markets with bounded daily returns Proceedings of the thirty-first annual ACM symposium on Theory of Computing, (119-128)
- Riedel M Online matching for scheduling problems Proceedings of the 16th annual conference on Theoretical aspects of computer science, (571-580)
- Epstein L, Noga J, Seiden S, Sgall J and Woeginger G Randomized online scheduling on two uniform machines Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, (317-326)
- Plonski P, Vander Hook J, Peng C, Noori N and Isler V Navigation around an unknown obstacle for autonomous surface vehicles using a forward-facing sonar 2015 IEEE International Symposium on Safety, Security, and Rescue Robotics (SSRR), (1-7)
- Chuprikov P, Nikolenko S and Kogan K On demand elastic capacity planning for service auto-scaling IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications, (1-9)
- Zhao S, Lin X, Aliprantis D, Villegas H and Chen M Online multi-stage decisions for robust power-grid operations under high renewable uncertainty IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications, (1-9)
- Zheng Z and Shroff N Online multi-resource allocation for deadline sensitive jobs with partial values in the cloud IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications, (1-9)
- Mlika Z, Driouch E and Ajib W Deadline Scheduling in Energy Harvesting Networks: Competitive and Learning Algorithms 2019 IEEE Global Communications Conference (GLOBECOM), (1-6)
Index Terms
- Online computation and competitive analysis
Recommendations
An asymptotic competitive scheme for online bin packing
In the online bin packing problem, a list of items with integral sizes between 1 to B arrive one by one. Each item must be irrevocably assigned into a bin of capacity B upon its arrival without any information on the subsequent items, and the goal is to ...
An Asymptotic Competitive Scheme for Online Bin Packing
Combinatorial Optimization and ApplicationsAbstractWe study the online bin packing problem, in which a list of items with integral size between 1 to arrives one at a time. Each item must be assigned in a bin of capacity upon its arrival without any information on the next items, and the goal is ...
Online computation with advice
We consider a model for online computation in which the online algorithm receives, together with each request, some information regarding the future, referred to as advice. The advice is a function, defined by the online algorithm, of the whole request ...
Ralph Walter Wilkerson
The normal methods of analysis of online algorithms usually employ the techniques of average-case analysis, making assumptions about the distribution of the inputs. In competitive analysis, we compare the performance of the online algorithm to that of an optimal offline algorithm, which would have full knowledge of future inputs. Consequently, competitive analysis is much like worst-case analysis. This book presents a detailed introduction to the methods of competitive analysis. It contains numerous examples, such as list accessing, network routing, k-server systems, load balancing, search, decision theory, and game-theoretic applications. This well-written book will be of interest to students and researchers in algorithms and operations research.
Access critical reviews of Computing literature here
Become a reviewer for Computing Reviews.