Amortized efficiency of list update and paging rules
Communications of the ACM
Competitive algorithms for on-line problems
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
On the power of randomization in online algorithms
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
The competitiveness of on-line assignments
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
High speed switch scheduling for local area networks
ASPLOS V Proceedings of the fifth international conference on Architectural support for programming languages and operating systems
High-speed switch scheduling for local-area networks
ACM Transactions on Computer Systems (TOCS)
Balanced allocations (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Lower bounds for on-line graph problems with application to on-line circuit and optical routing
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
On-line routing of virtual circuits with applications to load balancing and machine scheduling
Journal of the ACM (JACM)
On the analysis of randomized load balancing schemes
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Analyses of load stealing models based on differential equations
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Simple competitive request scheduling strategies
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Competitive routing of virtual circuits with unknown duration
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
On-line complexity of monotone set systems
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
The Power of Two Choices in Randomized Load Balancing
IEEE Transactions on Parallel and Distributed Systems
Online request server matching
Theoretical Computer Science
Online algorithms for market clearing
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Invited Lecture: Online Algorithms: A Study of Graph-Theoretic Concepts
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Management of multi-queue switches in QoS networks
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Studying Balanced Allocations with Differential Equations
Combinatorics, Probability and Computing
AdWords and Generalized On-line Matching
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Randomized online algorithms for minimum metric bipartite matching
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
An improved approximation algorithm for combinatorial auctions with submodular bidders
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Database support for matching: limitations and opportunities
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Online algorithms for market clearing
Journal of the ACM (JACM)
Allocating online advertisement space with unreliable estimates
Proceedings of the 8th ACM conference on Electronic commerce
AdWords and generalized online matching
Journal of the ACM (JACM)
Online budgeted matching in random input models with applications to Adwords
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
On-line bipartite matching made simple
ACM SIGACT News
Competitive analysis of online traffic grooming in WDM rings
IEEE/ACM Transactions on Networking (TON)
Online Primal-Dual Algorithms for Covering and Packing
Mathematics of Operations Research
The adwords problem: online keyword matching with budgeted bidders under random permutations
Proceedings of the 10th ACM conference on Electronic commerce
The Design of Competitive Online Algorithms via a Primal: Dual Approach
Foundations and Trends® in Theoretical Computer Science
Online Ad Assignment with Free Disposal
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Online matching for scheduling problems
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Online primal-dual algorithms for maximizing ad-auctions revenue
ESA'07 Proceedings of the 15th annual European conference on Algorithms
An O(log2k)-competitive algorithm for metric bipartite matching
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Optimal online assignment with forecasts
Proceedings of the 11th ACM conference on Electronic commerce
Online scheduling of targeted advertisements for IPTV
INFOCOM'10 Proceedings of the 29th conference on Information communications
INFOCOM'10 Proceedings of the 29th conference on Information communications
Online set packing and competitive scheduling of multi-part tasks
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Dynamic Matching with a Fall-back Option
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
When LP is the cure for your matching woes: improved bounds for stochastic matchings
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Improved bounds for online stochastic matching
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Online stochastic packing applied to display ad allocation
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Online bipartite matching with unknown distributions
Proceedings of the forty-third annual ACM symposium on Theory of computing
Online bipartite matching with random arrivals: an approach based on strongly factor-revealing LPs
Proceedings of the forty-third annual ACM symposium on Theory of computing
Online algorithms with stochastic input
ACM SIGecom Exchanges
Frequency capping in online advertising
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Social welfare in one-sided matching markets without money
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
AdCell: ad allocation in cellular networks
ESA'11 Proceedings of the 19th European conference on Algorithms
An incremental model for combinatorial maximization problems
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
On the communication and streaming complexity of maximum bipartite matching
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Simultaneous approximations for adversarial and stochastic online budgeted allocation
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Online vertex-weighted bipartite matching and single-bid budgeted allocations
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Online stochastic matching: online actions based on offline statistics
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Fractional matching via balls-and-bins
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
Handling forecast errors while bidding for display advertising
Proceedings of the 21st international conference on World Wide Web
Online stochastic weighted matching: improved approximation algorithms
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
Online matching with concave returns
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Ad serving using a compact allocation plan
Proceedings of the 13th ACM Conference on Electronic Commerce
Mechanism design for dynamic environments: online double auctions
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Geometry of online packing linear programs
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Stochastic matching with commitment
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Online scheduling of targeted advertisements for IPTV
IEEE/ACM Transactions on Networking (TON)
A unified optimization framework for auction and guaranteed delivery in online advertising
Proceedings of the 21st ACM international conference on Information and knowledge management
Online Stochastic Matching: Online Actions Based on Offline Statistics
Mathematics of Operations Research
Catch them if you can: how to serve impatient users
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Online constrained optimization with recourse
Information Processing Letters
Online load balancing under graph constraints
Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems
Optimal Auctions with Positive Network Externalities
ACM Transactions on Economics and Computation - Special Issue on Algorithmic Game Theory
Whole-page optimization and submodular welfare maximization with online bidders
Proceedings of the fourteenth ACM conference on Electronic commerce
Efficient parking allocation as online bipartite matching with posted prices
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
The loss of serving in the dark
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |