Sciweavers

2767 search results - page 181 / 554
» Universal Exponentiation Algorithm
Sort
View
WADS
2009
Springer
257views Algorithms» more  WADS 2009»
15 years 8 months ago
Rank-Balanced Trees
Since the invention of AVL trees in 1962, a wide variety of ways to balance binary search trees have been proposed. Notable are red-black trees, in which bottom-up rebalancing afte...
Bernhard Haeupler, Siddhartha Sen, Robert Endre Ta...
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
15 years 8 months ago
3.5-Way Cuckoo Hashing for the Price of 2-and-a-Bit
The study of hashing is closely related to the analysis of balls and bins; items are hashed to memory locations much as balls are thrown into bins. In particular, Azar et. al. [2] ...
Eric Lehman, Rina Panigrahy
FOSSACS
2010
Springer
15 years 8 months ago
Reachability Analysis of Communicating Pushdown Systems
Abstract. The reachability analysis of recursive programs that communicate asynchronously over reliable Fifo channels calls for restrictions to ensure decidability. We extend here ...
Alexander Heußner, Jérôme Lerou...
BROADNETS
2006
IEEE
15 years 8 months ago
A Statistical Approach to Anomaly Detection in Interdomain Routing
Abstract— A number of events such as hurricanes, earthquakes, power outages can cause large-scale failures in the Internet. These in turn cause anomalies in the interdomain routi...
Shivani Deshpande, Marina Thottan, Tin Kam Ho, Bip...
STOC
1994
ACM
134views Algorithms» more  STOC 1994»
15 years 6 months ago
A coding theorem for distributed computation
Shannon's Coding Theorem shows that in order to reliably transmit a message of T bits over a noisy communication channel, only a constant slowdown factor is necessary in the ...
Sridhar Rajagopalan, Leonard J. Schulman