Optimal buy-and-hold strategies for financial markets with bounded daily returns
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Randomized online scheduling on two uniform machines
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
ACM Computing Surveys (CSUR)
Query strategies for priced information (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
An axiomatic treatment of three qualitative decision criteria
Journal of the ACM (JACM)
K-medians, facility location, and the Chernoff-Wald bound
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Scheduling to minimize average stretch without migration
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Connection caching under various models of communication
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Optimal smoothing schedules for real-time streams (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Dynamic session management for static and mobile users: a competitive on-line algorithmic approach
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
Speed is as powerful as clairvoyance
Journal of the ACM (JACM)
Competitive analysis of incentive compatible on-line auctions
Proceedings of the 2nd ACM conference on Electronic commerce
Loss-bounded analysis for differentiated services
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Can entropy characterize performance of online algorithms?
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Competitive auctions and digital goods
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Performance guarantee for online deadline scheduling in the presence of overload
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Optimal aggregation algorithms for middleware
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On computing functions with uncertainty
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Simple on-line algorithms for the maximum disjoint paths problem
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Competitve buffer management for shared-memory switches
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Dynamic TCP acknowledgement and other stories about e/(e-1)
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Online server allocation in a server farm via benefit task systems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A new lower bound for the list update problem in the partial cost model
Theoretical Computer Science
On-line scheduling of parallel jobs with runtime restrictions
Theoretical Computer Science
Online paging and file caching with expiration times
Theoretical Computer Science
An optimal online algorithm for scheduling two machines with release times
Theoretical Computer Science
Online request server matching
Theoretical Computer Science
Jitter control in QoS networks
IEEE/ACM Transactions on Networking (TON)
Online variable sized covering
Information and Computation
Lower bounds & competitive algorithms for online scheduling of unit-size tasks to related machines
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
A unified analysis of hot video schedulers
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
On paging with locality of reference
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Channel assignment and graph multicoloring
Handbook of wireless networks and mobile computing
Static optimality and dynamic search-optimality in lists and trees
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Temporary tasks assignment resolved
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Improved bounds for the unsplittable flow problem
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Incentive-compatible online auctions for digital goods
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Online algorithms for market clearing
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Extra processors versus future information in optimal deadline scheduling
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
The lazy adversary conjecture fails
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Client-Server Caching with Expiration Timestamps
Distributed and Parallel Databases
On-line load balancing of temporary tasks revisited
Theoretical Computer Science
A general decomposition theorem for the k-server problem
Information and Computation
Nearly optimal FIFO buffer management for DiffServ
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Architecture and algorithms for scalable mobile QoS
Wireless Networks
More on random walks, electrical networks, and the harmonic k-server algorithm
Information Processing Letters
Priority algorithms for makespan minimization in the subset model
Information Processing Letters
Off-line temporary tasks assignment
Theoretical Computer Science
Efficient handoff rerouting algorithms: a competitive on-line algorithmic approach
IEEE/ACM Transactions on Networking (TON)
The 3-server problem in the plane
Theoretical Computer Science
Two short notes on the on-line travelling salesman: handling times and lookahead
Theoretical Computer Science
Scheduling jobs before shut-down
Nordic Journal of Computing
Dynamic TCP acknowledgement: penalizing long delays
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Online paging with arbitrary associativity
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Competitive queueing policies for QoS switches
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Dynamic routing on networks with fixed-size buffers
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Strongly Polynomial Algorithms for the Unsplittable Flow Problem
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
News from the Online Traveling Repairman
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Lower Bounds for On-Line Single-Machine Scheduling
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
On-Line Scheduling with Precedence Constraints
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Scheduling Jobs Before Shut-Down
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Call Control with k Rejections
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Seller-Focused Algorithms for Online Auctioning
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Competitive Analysis of the LRFU Paging Algorithm
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Competitive Hill-Climbing Strategies for Replica Placement in a Distributed File System
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Finding Worst-Case Instances of, and Lower Bounds for, Online Algorithms Using Genetic Algorithms
AI '02 Proceedings of the 15th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Caching for Mobile Communication
ADBIS-DASFAA '00 Proceedings of the East-European Conference on Advances in Databases and Information Systems Held Jointly with International Conference on Database Systems for Advanced Applications: Current Issues in Databases and Information Systems
Optimal Projective Algorithms for the List Update Problem
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Preemptive Scheduling in Overloaded Systems
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
On-Line Load Balancing of Temporary Tasks Revisited
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Carrying Umbrellas: An Online Relocation Problem on Graphs
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Optimal Bid Sequences for Multiple-Object Auctions with Unequal Budgets
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
A New Competitive Analysis of Randomized Caching
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Online Routing in Convex Subdivisions
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Average-Case Competitive Analyses for Ski-Rental Problems
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
On-line Algorithms for Edge-Disjoint Paths in Trees of Rings
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Tight Bounds for Online Class-Constrained Packing
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Game Theory and Artificial Intelligence
Selected papers from the UKMAS Workshop on Foundations and Applications of Multi-Agent Systems
The CNN Problem and Other k-Server Variants
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Online Dial-a-Ride Problems: Minimizing the Completion Time
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
On the Competitive Ratio of the Work Function Algorithm for the k-Server Problem
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Analysis of the Harmonic Algorithm for Three Servers
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
On-Line Variable Sized Covering
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
New results for online page replication
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Dynamic Spectrum Allocation: The Impotency of Duration Notification
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Randomized Lower Bounds for Online Path Coloring
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
From Algorithm to Program to Software Library
Informatics - 10 Years Back. 10 Years Ahead.
Online Call Admission in Optical Networks with Larger Demands
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
DCW '00 Proceedings of the Third International Workshop on Distributed Communities on the Web
Off-Line Temporary Tasks Assignment
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
On Multicriteria Online Problems
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Offline List Update is NP-Hard
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
On the Competitiveness of Linear Search
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Strongly Competitive Algorithms for Caching with Pipelined Prefetching
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Buying a Constant Competitive Ratio for Paging
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
A General Decomposition Theorem for the k-Server Problem
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Duality between Prefetching and Queued Writing with Parallel Disks
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Competitive Auctions for Multiple Digital Goods
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
On-Line Dial-a-Ride Problems under a Restricted Information Model
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Optimal Online Flow Time with Resource Augmentation
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
The Online-TSP against Fair Adversaries
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
The Online Dial-a-Ride Problem under Reasonable Load
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
On-Line Maximizing the Number of Items Packed in Variable-Sized Bins
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Randomized online multi-threaded paging
Nordic Journal of Computing
On-line stream merging in a general setting
Theoretical Computer Science - Computing and combinatorics
News from the online traveling repairman
Theoretical Computer Science - Mathematical foundations of computer science
The competitive ratio for on-line dual bin packing with restricted input sequences
Nordic Journal of Computing
Interval selection: applications, algorithms, and lower bounds
Journal of Algorithms
Loss-bounded analysis for differentiated services
Journal of Algorithms
Efficient URL caching for world wide web crawling
WWW '03 Proceedings of the 12th international conference on World Wide Web
Eighteenth national conference on Artificial intelligence
TCP is competitive against a limited adversary
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Scheduling policies for CIOQ switches
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Information Sciences—Informatics and Computer Science: An International Journal
Query strategies for priced information
Journal of Computer and System Sciences - Special issue on STOC 2000
Management of multi-queue switches in QoS networks
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Server scheduling in the Lp norm: a rising tide lifts all boat
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
More on randomized on-line algorithms for caching
Theoretical Computer Science
Minimizing flow time nonclairvoyantly
Journal of the ACM (JACM)
The Bancomat problem: an example of resource allocation in a partitionable asynchronous system
Theoretical Computer Science - Special issue: Distributed computing
Stochastic Load Balancing and Related Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Weak Adversaries for the k-Server Problem
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Nearly optimal FIFO buffer management for two packet classes
Computer Networks: The International Journal of Computer and Telecommunications Networking
Online strategies for dynamic power management in systems with multiple power-saving states
ACM Transactions on Embedded Computing Systems (TECS)
Nearly optimal strategies for special cases of on-line capital investment
Theoretical Computer Science
Optimal aggregation algorithms for middleware
Journal of Computer and System Sciences - Special issu on PODS 2001
Competitive video on demand schedulers for popular movies
Discrete Applied Mathematics - Special issue: Algorithmic aspects of communication
On-line maximizing the number of items packed in variable-sized bins
Acta Cybernetica
Connection caching: model and algorithms
Journal of Computer and System Sciences
Preemptive scheduling in overloaded systems
Journal of Computer and System Sciences
Maximizing job completions online
Journal of Algorithms
Call control with k rejections
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Competitive analysis of incentive compatible on-line auctions
Theoretical Computer Science
SIGACT news online algorithms column 2
ACM SIGACT News
Average stretch without migration
Journal of Computer and System Sciences
Distributed cost-based update policies for QoS routing on hierarchical networks
Information Sciences—Informatics and Computer Science: An International Journal
Models of greedy algorithms for graph problems
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Caching queues in memory buffers
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
New lower and upper bounds for the competitive ratio of transmission protocols
Information Processing Letters
Mechanism design for online real-time scheduling
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
Competitive algorithms for VWAP and limit order trading
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
Dynamic TCP acknowledgment in the LogP model
Journal of Algorithms
How to Better Use Expert Advice
Machine Learning
An Improved Randomized On-Line Algorithm for a Weighted Interval Selection Problem
Journal of Scheduling
Fighting against two adversaries: page migration in dynamic networks
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Packet-mode policies for input-queued switches
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Online algorithms for prefetching and caching on parallel disks
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Online algorithms for network design
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Journal of Scheduling - Special issue: On-line algorithm part I
On-line multi-threaded scheduling
Journal of Scheduling - Special issue: On-line algorithm part I
Competitive deadline scheduling via additional or faster processors
Journal of Scheduling - Special issue: On-line algorithm part I
Admission control with immediate notification
Journal of Scheduling - Special issue: On-line scheduling
Scheduling with conflicts on bipartite and interval graphs
Journal of Scheduling - Special issue: On-line scheduling
Formal Methods for Dynamic Power Management
Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
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
Journal of Scheduling
Tight bounds for online class-constrained packing
Theoretical Computer Science - Latin American theorotical informatics
Competitive algorithms for the dynamic selection of component implementations
IBM Systems Journal
Strongly competitive algorithms for caching with pipelined prefetching
Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
Optimal smoothing schedules for real-time streams
Distributed Computing
Performance guarantee for EDF under overload
Journal of Algorithms
Connectivity in evolving graph with geometric properties
Proceedings of the 2004 joint workshop on Foundations of mobile computing
Revisiting the TTL-based controlled flooding search: optimality and randomization
Proceedings of the 10th annual international conference on Mobile computing and networking
Operating Systems for Reconfigurable Embedded Platforms: Online Scheduling of Real-Time Tasks
IEEE Transactions on Computers
SIGACT news online algorithms column 4
ACM SIGACT News
Regret minimizing equilibria and mechanisms for games with strict type uncertainty
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Algorithms for the on-line quota traveling salesman problem
Information Processing Letters
Harmonic buffer management policy for shared memory switches
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
New results for online page replication
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
Competitive caching of query results in search engines
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
Competitive online routing in geometric graphs
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
On the competitive ratio of the work function algorithm for the k-server problem
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
The CNN problem and other k-server variants
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
Improved competitive algorithms for online scheduling with partial job values
Theoretical Computer Science - Special papers from: COCOON 2003
Replica placement in a pervasive environment
UbiMob '04 Proceedings of the 1st French-speaking conference on Mobility and ubiquity computing
Bypass Caching: Making Scientific Databases Good Network Citizens
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Competitive Time and Traffic Analysis of Position-Based Routing using a Cell Structure
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
Optimal Controlled Flooding Search in a Large Wireless Network
WIOPT '05 Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Universal approximations for TSP, Steiner tree, and set cover
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
A Hard Dial-a-Ride Problem that is Easy on Average
Journal of Scheduling
On paging with locality of reference
Journal of Computer and System Sciences
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
On the effect of a configuration choice on the performance of a mirrored storage system
Journal of Parallel and Distributed Computing
Network file storage with graceful performance degradation
ACM Transactions on Storage (TOS)
From optimal limited to unlimited supply auctions
Proceedings of the 6th ACM conference on Electronic commerce
Randomized qeue management for DiffServ
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Dynamic page migration with stochastic requests
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Competitive queue policies for differentiated services
Journal of Algorithms
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Improved lower and upper bounds for universal TSP in planar metrics
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A general approach for incremental approximation and hierarchical clustering
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
An on-line approach for power minimization in QoS sensitive systems
ASP-DAC '03 Proceedings of the 2003 Asia and South Pacific Design Automation Conference
Minimizing the total completion time on-line on a single machine, using restarts
Journal of Algorithms
A new average case analysis for completion time scheduling
Journal of the ACM (JACM)
A tight lower bound for job scheduling with cancellation
Information Processing Letters
Load-Balanced Short-Path Routing in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Competitive Analysis for the On-line Truck Transportation Problem
Journal of Global Optimization
Approximation and streaming algorithms for histogram construction problems
ACM Transactions on Database Systems (TODS)
How to play a coloring game against a color-blind adversary
Proceedings of the twenty-second annual symposium on Computational geometry
Online pricing for web service providers
Proceedings of the 2006 international workshop on Economics driven software engineering research
Pareto approximations for the bicriteria scheduling problem
Journal of Parallel and Distributed Computing
Path problems in generalized stars, complete graphs, and brick wall graphs
Discrete Applied Mathematics - Special issue: Efficient algorithms
Minimizing roaming overheads for vertical handoff in heterogeneous wireless mobile networks
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Scheduling search procedures: The wheel of fortune
Journal of Scheduling
Reconfigurable resource scheduling
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Conflict-free coloring for intervals: from offline to online
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Scheduling policies for CIOQ switches
Journal of Algorithms
Ramsey-type theorems for metric spaces with applications to online problems
Journal of Computer and System Sciences - Special issue on FOCS 2001
IEEE Transactions on Parallel and Distributed Systems
Resource selection games with unknown number of players
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Indexing for function approximation
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
A lower bound on the competitivity of memoryless algorithms for a generalization of the CNN problem
Theoretical Computer Science
Incremental algorithms for facility location and k-Median
Theoretical Computer Science - Approximation and online algorithms
Theoretical Computer Science - Approximation and online algorithms
Improving the performance of multidimensional search using fingers
Journal of Experimental Algorithmics (JEA)
Online algorithms for market clearing
Journal of the ACM (JACM)
Entropy-based bounds for online algorithms
ACM Transactions on Algorithms (TALG)
On an Online Spanning Tree Problem in Randomly Weighted Graphs
Combinatorics, Probability and Computing
Topology matters: smoothed competitiveness of metrical task systems
Theoretical Computer Science
On queuing lengths in on-line switching
Theoretical Computer Science
Competitive algorithms for the bicriteria k-server problem
Discrete Applied Mathematics - Special issue: International symposium on combinatorial optimization CO'02
Theoretical Computer Science
The maximum resource bin packing problem
Theoretical Computer Science
An improved algorithm for online coloring of intervals with bandwidth
Theoretical Computer Science - Computing and combinatorics
Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs
Discrete Applied Mathematics
A primal-dual algorithm for online non-uniform facility location
Journal of Discrete Algorithms
Greedy online frequency allocation in cellular networks
Information Processing Letters
A TCP with guaranteed performance in networks with dynamic congestion and random wireless losses
WICON '06 Proceedings of the 2nd annual international workshop on Wireless internet
Models and Algorithms for Stochastic Online Scheduling
Mathematics of Operations Research
On the remote server problem or more about TCP acknowledgments
Theoretical Computer Science
On the on-line rent-or-buy problem in probabilistic environments
Journal of Global Optimization
Efficient self-tuning spin-locks using competitive analysis
Journal of Systems and Software
Effective Role Resolution in Workflow Management
INFORMS Journal on Computing
Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm
Mathematics of Operations Research
Online Routing Problems: Value of Advanced Information as Improved Competitive Ratios
Transportation Science
Online frequency allocation in cellular networks
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
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
Allocating online advertisement space with unreliable estimates
Proceedings of the 8th ACM conference on Electronic commerce
On line markets for distributed object services: the MAJIC system
USITS'01 Proceedings of the 3rd conference on USENIX Symposium on Internet Technologies and Systems - Volume 3
On the Complexity of Removing Z-Cycles from a Checkpoints and Communication Pattern
IEEE Transactions on Computers
IEEE Transactions on Mobile Computing
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Multipath routing algorithms for congestion minimization
IEEE/ACM Transactions on Networking (TON)
Controlled flooding search in a large network
IEEE/ACM Transactions on Networking (TON)
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Better online buffer management
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
On the separation and equivalence of paging strategies
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Improved bounds for the online steiner tree problem in graphs of bounded edge-asymmetry
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Dynamic pricing for impatient bidders
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Uniform metrical task systems with a limited number of states
Information Processing Letters
A tight bound for online colouring of disk graphs
Theoretical Computer Science
Improved online algorithms for buffer management in QoS switches
ACM Transactions on Algorithms (TALG)
Exploiting incomplete information to manage multiprocessor tasks with variable arrival rates
Computers and Operations Research
International Journal of Robotics Research
Approximate and online multi-issue negotiation
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
How much can lookahead help in online single machine scheduling
Information Processing Letters
Approximation algorithms for problems in scheduling with set-ups
Discrete Applied Mathematics
On-line scheduling of parallel jobs on two machines
Journal of Discrete Algorithms
Stochastic analyses for online combinatorial optimization problems
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Better bounds for online load balancing on unrelated machines
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A note on the k-Canadian Traveller Problem
Information Processing Letters
The on-line asymmetric traveling salesman problem
Journal of Discrete Algorithms
Revisiting integer multiplication overflow
SEPADS'05 Proceedings of the 4th WSEAS International Conference on Software Engineering, Parallel & Distributed Systems
Journal of Experimental Algorithmics (JEA)
Randomized competitive algorithms for generalized caching
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Tight competitive ratios for parallel disk prefetching and caching
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Deterministic conflict-free coloring for intervals: From offline to online
ACM Transactions on Algorithms (TALG)
A randomized competitive algorithm for evaluating priced AND/OR trees
Theoretical Computer Science
Scheduling to maximize participation
Theoretical Computer Science
New policies for the dynamic traveling salesman problem
Optimization Methods & Software
Online auctions and generalized secretary problems
ACM SIGecom Exchanges
Tight bounds for delay-sensitive aggregation
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Improved on-line broadcast scheduling with deadlines
Journal of Scheduling
Online chasing problems for regular polygons
Information Processing Letters
Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
An Optimal Strategy for Online Non-uniform Length Order Scheduling
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Best Effort and Priority Queuing Policies for Buffered Crossbar Switches
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
Average-Case Competitive Analyses for One-Way Trading
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
New Algorithms for Online Rectangle Filling with k-Lookahead
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
A Preemptive Algorithm for Maximizing Disjoint Paths on Trees
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
A Risk-Reward Competitive Analysis for the Recoverable Canadian Traveller Problem
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Stochastic Online Scheduling Revisited
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Improved Randomized Results for That Interval Selection Problem
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Probabilistic Analysis of Online Bin Coloring Algorithms Via Stochastic Comparison
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Improved Competitive Performance Bounds for CIOQ Switches
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Ski rental with two general options
Information Processing Letters
Online nonpreemptive scheduling of equal-length jobs on two identical machines
ACM Transactions on Algorithms (TALG)
Competitive buffer management for shared-memory switches
ACM Transactions on Algorithms (TALG)
Competitive analysis of online traffic grooming in WDM rings
IEEE/ACM Transactions on Networking (TON)
On the power of lookahead in on-line server routing problems
Theoretical Computer Science
Information Processing Letters
Dynamic bin packing of unit fractions items
Theoretical Computer Science
Reasoning about online algorithms with weighted automata
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Paging and list update under bijective analysis
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles
ACM Transactions on Algorithms (TALG)
Dynamic TCP acknowledgment with sliding window
Theoretical Computer Science
Online and Offline Selling in Limit Order Markets
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Minimizing Average Flow Time in Sensor Data Gathering
Algorithmic Aspects of Wireless Sensor Networks
Improved Randomized Online Scheduling of Unit Length Intervals and Jobs
Approximation and Online Algorithms
Randomized Algorithms for Buffer Management with 2-Bounded Delay
Approximation and Online Algorithms
Peak Shaving through Resource Buffering
Approximation and Online Algorithms
Caching Content under Digital Rights Management
Approximation and Online Algorithms
Object Caching for Queries and Updates
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Data aggregation in sensor networks: Balancing communication and delay costs
Theoretical Computer Science
On the two-dimensional cow search problem
Information Processing Letters
New lower bounds for online k-server routing problems
Information Processing Letters
A Tight Bound on Online Buffer Management for Two-Port Shared-Memory Switches
IEICE - Transactions on Information and Systems
Nearest-neighbor caching for content-match applications
Proceedings of the 18th international conference on World wide web
Online scheduling on two uniform machines to minimize the makespan
Theoretical Computer Science
Non-clairvoyant speed scaling for batched parallel jobs on multiprocessors
Proceedings of the 6th ACM conference on Computing frontiers
Quantifying inefficiency in cost-sharing mechanisms
Journal of the ACM (JACM)
Online Primal-Dual Algorithms for Covering and Packing
Mathematics of Operations Research
A survey on metaheuristics for stochastic combinatorial optimization
Natural Computing: an international journal
Competitive FIFO Buffer Management for Weighted Packets
CNSR '09 Proceedings of the 2009 Seventh Annual Communication Networks and Services Research Conference
Instance optimal query processing in spatial networks
The VLDB Journal — The International Journal on Very Large Data Bases
Equilibrium dynamic systems intelligence
WSEAS Transactions on Information Science and Applications
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Adaptive Physical Design for Curated Archives
SSDBM 2009 Proceedings of the 21st International Conference on Scientific and Statistical Database Management
Equilibrium dynamic systems integration
ICAI'09 Proceedings of the 10th WSEAS international conference on Automation & information
Online Algorithm for Application Layer Anycast
Proceedings of the 2006 conference on Advances in Intelligent IT: Active Media Technology 2006
Competitive Buffer Management with Stochastic Packet Arrivals
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Improved Online Algorithms for Multiplexing Weighted Packets in Bounded Buffers
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
On Job Scheduling with Preemption Penalties
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Optimal Semi-online Algorithm for Scheduling on a Batch Processing Machine
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
The Design of Competitive Online Algorithms via a Primal: Dual Approach
Foundations and Trends® in Theoretical Computer Science
Competitive Analysis of Aggregate Max in Windowed Streaming
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Online Computation with Advice
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Power-aware online file allocation in mobile ad hoc networks: [extended abstract]
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
On the relative dominance of paging algorithms
Theoretical Computer Science
Online scheduling on m uniform machines to minimize total (weighted) completion time
Theoretical Computer Science
Toward Robust Revenue Management: Competitive Analysis of Online Booking
Operations Research
Eliciting bid taker non-price preferences in (combinatorial) auctions
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Worker allocation in make-to-order assembly cells
Robotics and Computer-Integrated Manufacturing
Online Markov Decision Processes
Mathematics of Operations Research
Distributed resource management and matching in sensor networks
IPSN '09 Proceedings of the 2009 International Conference on Information Processing in Sensor Networks
Online Priority Steiner Tree Problems
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
A Comparison of Performance Measures for Online Algorithms
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
SIGACT news online algorithms column 14
ACM SIGACT News
Journal of Artificial Intelligence Research
Can we learn to beat the best stock
Journal of Artificial Intelligence Research
Competitive safety analysis: robust decision-making in multi-agent systems
Journal of Artificial Intelligence Research
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Optimal algorithms for page migration in dynamic networks
Journal of Discrete Algorithms
Online scheduling to minimize modified total tardiness with an availability constraint
Theoretical Computer Science
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
Jitter regulation for multiple streams
ACM Transactions on Algorithms (TALG)
Note: CLEVER or smart: Strategies for the online target date assignment problem
Discrete Applied Mathematics
Lazy-Adaptive Tree: an optimized index structure for flash devices
Proceedings of the VLDB Endowment
Improved results for scheduling batched parallel jobs by using a generalized analysis framework
Journal of Parallel and Distributed Computing
Subset Weight Maximization with Two Competing Agents
ADT '09 Proceedings of the 1st International Conference on Algorithmic Decision Theory
On the Advice Complexity of Online Problems
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Online Paging for Flash Memory Devices
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Regret Minimization and Job Scheduling
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Randomized Online Algorithms for the Buyback Problem
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Throughput loss in task scheduling due to server state uncertainty
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
Online maximizing weighted throughput in a fading channel
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Path problems in generalized stars, complete graphs, and brick wall graphs
Discrete Applied Mathematics - Special issue: Efficient algorithms
A tight lower bound for job scheduling with cancellation
Information Processing Letters
Introduction to the SIGACT news online algorithms column
ACM SIGACT News
Minimizing the total completion time on-line on a single machine, using restarts
Journal of Algorithms
On Developing New Models, with Paging as a Case Study
ACM SIGACT News
Online maximizing weighted throughput in a fading channel
INFOCOM'09 Proceedings of the 28th IEEE international conference on Computer Communications Workshops
Saving energy for (and from) a sunny day: lowering peak demands with batteries
INFOCOM'09 Proceedings of the 28th IEEE international conference on Computer Communications Workshops
Reasoning about online algorithms with weighted automata
ACM Transactions on Algorithms (TALG)
Dynamic pricing for impatient bidders
ACM Transactions on Algorithms (TALG)
Distributed flow detection over multi-path sessions
Computer Communications
Optimal on-line colorings for minimizing the number of ADMs in optical networks
Journal of Discrete Algorithms
Comparing First-Fit and Next-Fit for online edge coloring
Theoretical Computer Science
A survey of buffer management policies for packet switches
ACM SIGACT News
The Journal of Machine Learning Research
Improved competitive algorithms for online scheduling with partial job values
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Efficient update strategies for geometric computing with uncertainty
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
On the competitive ratio for online facility location
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
An on-line algorithm for the rectangle packing problem with rejection
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Experimental studies of graph traversal algorithms
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Online matching for scheduling problems
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Online shape learning using binary search trees
Image and Vision Computing
Scheduling to maximize participation
TGC'06 Proceedings of the 2nd international conference on Trustworthy global computing
Nonadaptive selfish routing with online demands
CAAN'07 Proceedings of the 4th conference on Combinatorial and algorithmic aspects of networking
Optimal algorithms for k-search with application in option pricing
ESA'07 Proceedings of the 15th annual European conference on Algorithms
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Improved upper bounds on the competitive ratio for online realtime scheduling
ESA'07 Proceedings of the 15th annual European conference on Algorithms
On the relative dominance of paging algorithms
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
How much information about the future is needed?
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Randomized priority algorithms
Theoretical Computer Science
Tight results for Next Fit and Worst Fit with resource augmentation
Theoretical Computer Science
Closing the gap between theory and practice: new measures for on-line algorithm analysis
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
On certain new models for paging with locality of reference
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
A randomized algorithm for two servers in cross polytope spaces
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
List update with locality of reference
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Finding maximum degrees in hidden bipartite graphs
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Deterministic on-line call control in cellular networks
Theoretical Computer Science
Market-based cooperative resource allocation for overlay networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
A semantical approach to equilibria and rationality
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Data structures with unpredictable timing
ESORICS'09 Proceedings of the 14th European conference on Research in computer security
Economical caching with stochastic prices
SAGA'09 Proceedings of the 5th international conference on Stochastic algorithms: foundations and applications
On the DMA mapping problem in direct device assignment
Proceedings of the 3rd Annual Haifa Experimental Systems Conference
Designing self-adaptive websites using online hotlink assignment algorithm
Proceedings of the 7th International Conference on Advances in Mobile Computing and Multimedia
Improved randomized results for the interval selection problem
Theoretical Computer Science
Buffer management for aggregated streaming data with packet dependencies
INFOCOM'10 Proceedings of the 29th conference on Information communications
INFOCOM'10 Proceedings of the 29th conference on Information communications
Dynamic power allocation under arbitrary varying channels - the multi-user case
INFOCOM'10 Proceedings of the 29th conference on Information communications
Adaptive security protocol selection for mobile computing
Journal of Network and Computer Applications
Competitive analysis for service migration in VNets
Proceedings of the second ACM SIGCOMM workshop on Virtualized infrastructure systems and architectures
Online conflict-free colouring for hypergraphs
Combinatorics, Probability and Computing
Carousel: scalable logging for intrusion prevention systems
NSDI'10 Proceedings of the 7th USENIX conference on Networked systems design and implementation
On the bicriteria k-server problem
ACM Transactions on Algorithms (TALG)
Dynamic bin packing with unit fraction items revisited
Information Processing Letters
Power in unity: forming teams in large-scale community systems
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Towards the randomized k-server conjecture: a primal-dual approach
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Return of the boss problem: competing online against a non-adaptive adversary
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
Online time-constrained scheduling in linear and ring networks
Journal of Discrete Algorithms
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Online splitting interval scheduling on m identical machines
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Providing scalable data services in ubiquitous networks
DASFAA'10 Proceedings of the 15th international conference on Database systems for advanced applications
Online network design with outliers
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Metrical task systems and the k-server problem on HSTs
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
An O(log n)-competitive online centralized randomized packet-routing algorithm for lines
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Asynchronous throughput-optimal routing in malicious networks
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Online algorithms for the newsvendor problem with and without censored demands
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
How to allocate goods in an online market?
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Information complexity of online problems
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Threshold rules for online sample selection
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Caching is hard: even in the fault model
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
On the additive constant of the k-server Work Function Algorithm
Information Processing Letters
Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines
Computers and Operations Research
Offline file assignments for online load balancing
Information Processing Letters
Fully Distribution-Free Profit Maximization: The Inventory Management Case
Mathematics of Operations Research
New algorithms for online rectangle filling with k-lookahead
Journal of Combinatorial Optimization
Journal of Combinatorial Optimization
Average-case competitive analyses for one-way trading
Journal of Combinatorial Optimization
Bottleneck congestion games with logarithmic price of anarchy
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
A randomized algorithm for two servers in cross polytope spaces
Theoretical Computer Science
A risk-reward model for the on-line leasing of depreciable equipment
Information Processing Letters
List factoring and relative worst order analysis
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Online tracking of the dominance relationship of distributed multi-dimensional data
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Online ranking for tournament graphs
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Advice complexity and barely random algorithms
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Map-reduce extensions and recursive queries
Proceedings of the 14th International Conference on Extending Database Technology
Server Scheduling to Balance Priorities, Fairness, and Average Quality of Service
SIAM Journal on Computing
Online and incremental algorithms for facility location
ACM SIGACT News
Online deadline scheduling with preemption penalties
Computers and Industrial Engineering
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Inverted index compression via online document routing
Proceedings of the 20th international conference on World wide web
Sorting and selection on dynamic data
Theoretical Computer Science
Online computation with advice
Theoretical Computer Science
Interval scheduling on related machines
Computers and Operations Research
Minimizing flow time in the wireless gathering problem
ACM Transactions on Algorithms (TALG)
On sequential online archiving of objective vectors
EMO'11 Proceedings of the 6th international conference on Evolutionary multi-criterion optimization
Competitive analysis of two special online device replacement problems
Journal of Computer Science and Technology
Minimum congestion mapping in a cloud
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Memoryless facility location in one pass
ACM Transactions on Algorithms (TALG)
Online job-migration for reducing the electricity bill in the cloud
NETWORKING'11 Proceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part I
The k-canadian travelers problem with communication
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
A dynamic data middleware cache for rapidly-growing scientific repositories
Proceedings of the ACM/IFIP/USENIX 11th International Conference on Middleware
On the advice complexity of the k-server problem
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Online graph exploration: new results on old and new algorithms
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
On-line machine covering on two machines with local migration
Computers & Mathematics with Applications
Incentive design for adaptive agents
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
A comprehensive study of an online packet scheduling algorithm
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
A near-optimal memoryless online algorithm for FIFO buffering two packet classes
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
One to rule them all: a general randomized algorithm for buffer management with bounded delay
ESA'11 Proceedings of the 19th European conference on Algorithms
Hitting sets online and vertex ranking
ESA'11 Proceedings of the 19th European conference on Algorithms
Resource constrained multirobot task allocation based on leader-follower coalition methodology
International Journal of Robotics Research
Algorithms for optimizing the bandwidth cost of content delivery
Computer Networks: The International Journal of Computer and Telecommunications Networking
Formal analysis of online algorithms
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Online call control in cellular networks revisited
Information Processing Letters
Information Processing Letters
A General Approach for Incremental Approximation and Hierarchical Clustering
SIAM Journal on Computing
SIAM Journal on Computing
Dynamic internet congestion with bursts
HiPC'06 Proceedings of the 13th international conference on High Performance Computing
Paging for multi-core shared caches
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
An incremental model for combinatorial maximization problems
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Outperforming LRU via competitive analysis on parametrized inputs for paging
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Memoryless facility location in one pass
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Power-Aware collective tree exploration
ARCS'06 Proceedings of the 19th international conference on Architecture of Computing Systems
An optimal rebuilding strategy for a decremental tree problem
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Online, non-preemptive scheduling of equal-length jobs on two identical machines
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
A primal-dual algorithm for online non-uniform facility location
PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
Cooperative negotiation in autonomic systems using incremental utility elicitation
UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
Dynamic bin packing of unit fractions items
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Exploring an unknown graph efficiently
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Online routing in faulty meshes with sub-linear comparative time and traffic ratio
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Jitter regulation for multiple streams
ESA'05 Proceedings of the 13th annual European conference on Algorithms
ESA'05 Proceedings of the 13th annual European conference on Algorithms
The online target date assignment problem
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
On minimizing the maximum flow time in the online dial-a-ride problem
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Risk-reward models for on-line leasing of depreciable equipment
Computers & Mathematics with Applications
Optimal online pricing with network externalities
Information Processing Letters
On-line simultaneous maximization of the size and the weight for degradable intervals schedules
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
On the power of lookahead in on-line vehicle routing problems
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
The bahncard problem with interest rate and risk
WINE'05 Proceedings of the First international conference on Internet and Network Economics
New results on online replacement problem
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Heuristic approaches to service level agreements in packet networks
WINE'05 Proceedings of the First international conference on Internet and Network Economics
On-Line algorithms, real time, the virtue of laziness, and the power of clairvoyance
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Online strategies for intra and inter provider service migration in virtual networks
IPTcomm '11 Proceedings of the 5th International Conference on Principles, Systems and Applications of IP Telecommunications
Wireless Personal Communications: An International Journal
On dynamic bin packing: an improved lower bound and resource augmentation analysis
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Improved on-line broadcast scheduling with deadlines
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
A framework for session based recommendations
EC-Web'05 Proceedings of the 6th international conference on E-Commerce and Web Technologies
An optimal lower bound for buffer management in multi-queue switches
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Information Sciences: an International Journal
A risk-reward competitive analysis of the bahncard problem
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
Competitive analysis of on-line securities investment
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
Competitive freshness algorithms for wait-free data objects
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
Smart robot teams exploring sparse trees
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Page migration in dynamic networks
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
On-Line bicriteria interval scheduling
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Dynamic page migration under brownian motion
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
New bounds on the competitiveness of randomized online call control in cellular networks
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Improved algorithms for dynamic page migration
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Semi-automatic index tuning: keeping DBAs in the loop
Proceedings of the VLDB Endowment
Off-line admission control for advance reservations in star networks
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
The on-line asymmetric traveling salesman problem
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
On-line windows scheduling of temporary items
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Multipath routing algorithms for congestion minimization
NETWORKING'05 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
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
The maximum resource bin packing problem
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Dispatching equal-length jobs to parallel machines to maximize throughput
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Online function tracking with generalized penalties
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
A tight bound for online coloring of disk graphs
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
An optimal online algorithm for single machine scheduling to minimize total general completion time
Journal of Combinatorial Optimization
On-line scheduling of equal-length intervals on parallel machines
Information Processing Letters
Price fluctuations: to buy or to rent
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Parameterized analysis of paging and list update algorithms
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
On the additive constant of the k-server work function algorithm
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Competitive multi-dimensional dynamic bin packing via l-shape bin packing
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Online algorithms to minimize resource reallocations and network communication
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Approximation algorithms for edge-disjoint paths and unsplittable flow
Efficient Approximation and Online Algorithms
Plan b: uncertainty/time trade-offs for linear and integer programming
CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Frequency allocation problems for linear cellular networks
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Online multi-path routing in a maze
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Online k-server routing problems
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Theoretical evidence for the superiority of LRU-2 over LRU for the paging problem
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Competitive online multicommodity routing
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Online cooperative cost sharing
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
IICS'04 Proceedings of the 4th international conference on Innovative Internet Community Systems
On behalf of the seller and society: bicriteria mechanisms for unit-demand auctions
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Competitive analysis of scheduling algorithms for aggregated links
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Competitive and deterministic embeddings of virtual networks
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
Online modeling of proactive moderation system for auction fraud detection
Proceedings of the 21st international conference on World Wide Web
Exact and approximate algorithms for the most connected vertex problem
ACM Transactions on Database Systems (TODS)
Proceedings of the 3rd International Conference on Future Energy Systems: Where Energy, Computing and Communication Meet
Online optimization for the smart (micro) grid
Proceedings of the 3rd International Conference on Future Energy Systems: Where Energy, Computing and Communication Meet
List update with probabilistic locality of reference
Information Processing Letters
Optimal randomized algorithm for a generalized ski-rental with interest rate
Information Processing Letters
Kaizen: a semi-automatic index advisor
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
A new perspective on list update: probabilistic locality and working set
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
ONLINEMIN: a fast strongly competitive randomized paging algorithm
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
On online algorithms with advice for the k-server problem
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Advice complexity of online coloring for paths
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
On the advice complexity of the knapsack problem
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Optimal algorithms for online single machine scheduling with deteriorating jobs
Theoretical Computer Science
Competitive strategy for on-line leasing of depreciable equipment
Mathematical and Computer Modelling: An International Journal
On the power of lookahead in online lot-sizing
Operations Research Letters
Linear programming with online learning
Operations Research Letters
Online scheduling of parallel jobs on two machines is 2-competitive
Operations Research Letters
Efficient hierarchical QoS routing in ATM networks
Computer Communications
Computer Science Review
Survey: Streaming techniques and data aggregation in networks of tiny artefacts
Computer Science Review
A new variable-sized bin packing problem
Journal of Scheduling
Semi-online two-level supply chain scheduling problems
Journal of Scheduling
Dynamic power allocation under arbitrary varying channels: an online approach
IEEE/ACM Transactions on Networking (TON)
Convergence of hypervolume-based archiving algorithms ii: competitiveness
Proceedings of the 14th annual conference on Genetic and evolutionary computation
A Primal-Dual Randomized Algorithm for Weighted Paging
Journal of the ACM (JACM)
Randomized Competitive Algorithms for Generalized Caching
SIAM Journal on Computing
On-Line scheduling of parallel jobs in heterogeneous multiple clusters
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
A comparison of performance measures via online search
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Online makespan scheduling of linear deteriorating jobs on parallel machines
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Online optimization of busy time on parallel machines
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Concurrency and Computation: Practice & Experience
Finding patterns in an unknown graph
AI Communications - The Symposium on Combinatorial Search
Scheduling light-trails on WDM rings
Journal of Parallel and Distributed Computing
Approximation algorithms for online weighted rank function maximization under matroid constraints
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Converting online algorithms to local computation algorithms
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Geometry of online packing linear programs
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Online mechanism design (randomized rounding on the fly)
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Online graph exploration with advice
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Access graphs results for LRU versus FIFO under relative worst order analysis
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Competitive analysis of maintaining frequent items of a stream
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Online interval scheduling on a single machine with finite lookahead
Computers and Operations Research
Planning in logistics: a survey
Proceedings of the 10th Performance Metrics for Intelligent Systems Workshop
The k-resource problem in uniform metric spaces
Theoretical Computer Science
Batching and delivery in semi-online distribution systems
Discrete Applied Mathematics
Online scheduling of packets with agreeable deadlines
ACM Transactions on Algorithms (TALG)
Bridging the tenant-provider gap in cloud services
Proceedings of the Third ACM Symposium on Cloud Computing
On time lookahead algorithms for the online data acknowledgement problem
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Optimal on-line colorings for minimizing the number of ADMs in optical networks
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Dynamic tcp acknowledgment with sliding window
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
On the competitiveness of AIMD-TCP within a general network
Theoretical Computer Science
Online graph exploration: New results on old and new algorithms
Theoretical Computer Science
Media Independent Handover-based Competitive On-Line CAC for Seamless Mobile Wireless Networks
Wireless Personal Communications: An International Journal
QoS-Aware Revenue-Cost Optimization for Latency-Sensitive Services in IaaS Clouds
DS-RT '12 Proceedings of the 2012 IEEE/ACM 16th International Symposium on Distributed Simulation and Real Time Applications
Online constrained optimization with recourse
Information Processing Letters
Distributed online and stochastic queuing on a multiple access channel
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Providing performance guarantees in multipass network processors
IEEE/ACM Transactions on Networking (TON)
A new approach to solve the k-server problem based on network flows and flow cost reduction
Computers and Operations Research
Buffer overflow management with class segregation
Information Processing Letters
FIFO queueing policies for packets with heterogeneous processing
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Real-time integrated prefetching and caching
Journal of Scheduling
Paging and list update under bijective analysis
Journal of the ACM (JACM)
Lifetime and QoS-aware energy-saving buffering schemes
Journal of Systems and Software
Automated analysis of real-time scheduling using graph games
Proceedings of the 16th international conference on Hybrid systems: computation and control
Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems
Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems
Dynamic provisioning in next-generation data centers with on-site power production
Proceedings of the fourth international conference on Future energy systems
A greedy algorithm for the unforecasted energy dispatch problemwith storage in smart grids
Proceedings of the fourth international conference on Future energy systems
ACM Transactions on Computation Theory (TOCT)
Connectivity games over dynamic networks
Theoretical Computer Science
Optimal lower bounds for projective list update algorithms
ACM Transactions on Algorithms (TALG)
Towards minimizing the annotation cost of certified text classification
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
The k-Canadian Travelers Problem with communication
Journal of Combinatorial Optimization
Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints
Journal of Combinatorial Optimization
On handling ephemeral resource constraints in evolutionary search
Evolutionary Computation
Better bounds on online unit clustering
Theoretical Computer Science
Computer Networks: The International Journal of Computer and Telecommunications Networking
A comprehensive study of an online packet scheduling algorithm
Theoretical Computer Science
A near-optimal memoryless online algorithm for FIFO buffering two packet classes
Theoretical Computer Science
Competitive and deterministic embeddings of virtual networks
Theoretical Computer Science
On randomized online labeling with polynomially many labels
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Improved space bounds for strongly competitive randomized paging algorithms
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Relative interval analysis of paging algorithms on access graphs
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Modeling time criticality of information
Information Processing Letters
Online selection of intervals and t-intervals
Information and Computation
Online competitive algorithms for maximizing weighted throughput of unit jobs
Journal of Discrete Algorithms
A k-server problem with parallel requests and unit distances
Information Processing Letters
Competitive online adaptive scheduling for sets of parallel jobs with fairness and efficiency
Journal of Parallel and Distributed Computing
Dynamic right-sizing for power-proportional data centers
IEEE/ACM Transactions on Networking (TON)
The complexity of online manipulation of sequential elections
Journal of Computer and System Sciences
Competitive analysis for make-to-order scheduling with reliable lead time quotation
Journal of Combinatorial Optimization
Piece selection algorithms for layered video streaming in P2P networks
Discrete Applied Mathematics
Bin packing with "Largest In Bottom" constraint: tighter bounds and generalizations
Journal of Combinatorial Optimization
The Wide-Area Virtual Service Migration Problem: A Competitive Analysis Approach
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.05 |