Storing a Sparse Table with 0(1) Worst Case Access Time
Journal of the ACM (JACM)
Amortized efficiency of list update and paging rules
Communications of the ACM
An optimal algorithm for on-line bipartite matching
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Efficient PRAM simulation on a distributed memory machine
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
The competitiveness of on-line assignments
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Online load balancing and network flow
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On-line load balancing with applications to machine scheduling and virtual circuit routing
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Competitive routing of virtual circuits with unknown duration
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Expected Length of the Longest Probe Sequence in Hash Code Searching
Journal of the ACM (JACM)
Online Load Balancing of Temporary Tasks
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
Parallel randomized load balancing
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
On trading task reallocation for thread management in partitionable multiprocessors
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
On the analysis of randomized load balancing schemes
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Allocating weighted jobs in parallel
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
How useful is old information (extended abstract)?
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Random duplicated assignment: an alternative to striping in video servers
MULTIMEDIA '97 Proceedings of the fifth ACM international conference on Multimedia
Randomized protocols for low-congestion circuit routing in multistage interconnection networks
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Parallel continuous randomized load balancing (extended abstract)
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Recovery time of dynamic allocation processes
Proceedings of the tenth 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
Randomized and adversarial load balancing
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Average-case analyses of first fit and random fit bin packing
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
How Useful Is Old Information?
IEEE Transactions on Parallel and Distributed Systems
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
Fast concurrent access to parallel disks
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Comparing random data allocation and data striping in multimedia servers
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Asynchronous scheduling of redundant disk arrays
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Interpreting Stale Load Information
IEEE Transactions on Parallel and Distributed Systems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
The Power of Two Choices in Randomized Load Balancing
IEEE Transactions on Parallel and Distributed Systems
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
Managing parallel disks for continuous media data
Information organization and databases
The CNN Problem and Other k-Server Variants
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
On Balls and Bins with Deletions
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Simplified Witness Tree Arguments
SOFSEM '00 Proceedings of the 27th Conference on Current Trends in Theory and Practice of Informatics
Asymptotic Complexity from Experiments? A Case Study for Randomized Algorithms
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Design and Analysis of Dynamic Processes: A Stocastic Approach
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Analyzing an Infinite Parallel Job Allocation Process
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Cuckoo hashing: further analysis
Information Processing Letters
How asymmetry helps load balancing
Journal of the ACM (JACM)
Reducing Network Congestion and Blocking Probability through Balanced Allocation
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
How Asymmetry Helps Load Balancing
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Using finite experiments to study asymptotic performance
Experimental algorithmics
Asynchronous Scheduling of Redundant Disk Arrays
IEEE Transactions on Computers
Studying Balanced Allocations with Differential Equations
Combinatorics, Probability and Computing
Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Efficient hashing with lookups in two memory accesses
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Steady state analysis of balanced-allocation routing
Random Structures & Algorithms
Fast hash table lookup using extended bloom filter: an aid to network processing
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Segmented hash: an efficient hash table implementation for high performance networking subsystems
Proceedings of the 2005 ACM symposium on Architecture for networking and communications systems
Chisel: A Storage-efficient, Collision-free Hash-based Network Processing Architecture
Proceedings of the 33rd annual international symposium on Computer Architecture
The power of choice in random walks: an empirical study
Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
A Staffing Algorithm for Call Centers with Skill-Based Routing
Manufacturing & Service Operations Management
Locality-Aware and Churn-Resilient Load-Balancing Algorithms in Structured Peer-to-Peer Networks
IEEE Transactions on Parallel and Distributed Systems
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Multiple choice tries and distributed hash tables
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
The power of choice in random walks: An empirical study
Computer Networks: The International Journal of Computer and Telecommunications Networking
Balls and bins with structure: balanced allocations on hypergraphs
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Linked decompositions of networks and the power of choice in Polya urns
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Hash-based proximity clustering for efficient load balancing in heterogeneous DHT networks
Journal of Parallel and Distributed Computing
CHAP: Enabling Efficient Hardware-Based Multiple Hash Schemes for IP Lookup
NETWORKING '09 Proceedings of the 8th International IFIP-TC 6 Networking Conference
Dynamically replicated memory: building reliable systems from nanoscale resistive memories
Proceedings of the fifteenth edition of ASPLOS on Architectural support for programming languages and operating systems
On the use of hash tables in real-time applications
ETFA'09 Proceedings of the 14th IEEE international conference on Emerging technologies & factory automation
Load balancing for structured P2P networks using the advanced finger selection algorithm (AFSA)
Proceedings of the 2010 ACM Symposium on Applied Computing
Modulation codes for flash memory based on load-balancing theory
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Balls into bins with related random choices
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Delay analysis for cognitive radio networks with random access: a fluid queue view
INFOCOM'10 Proceedings of the 29th conference on Information communications
Divide and discriminate: algorithm for deterministic and fast hash lookups
Proceedings of the 5th ACM/IEEE Symposium on Architectures for Networking and Communications Systems
Fast crash recovery in RAMCloud
SOSP '11 Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles
Balls into bins with related random choices
Journal of Parallel and Distributed Computing
Hash tables with finite buckets are less resistant to deletions
Computer Networks: The International Journal of Computer and Telecommunications Networking
Asymptotic independence of queues under randomized load balancing
Queueing Systems: Theory and Applications
Concise lookup tables for IPv4 and IPv6 longest prefix matching in scalable routers
IEEE/ACM Transactions on Networking (TON)
Performance, scalability, and semantics of concurrent FIFO queues
ICA3PP'12 Proceedings of the 12th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I
Access-efficient Balanced Bloom Filters
Computer Communications
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |