Sciweavers

3208 search results - page 255 / 642
» A Lower Bound for Primality
Sort
View
MST
2002
152views more  MST 2002»
15 years 6 months ago
Average-Case Analysis of Greedy Packet Scheduling
We study the average number of delays suffered by packets routed using greedy (work conserving) scheduling policies. We obtain tight bounds on the worst-case average number of del...
Zvi Lotker, Boaz Patt-Shamir
CORR
2011
Springer
148views Education» more  CORR 2011»
15 years 1 months ago
On Stabilization in Herman's Algorithm
Herman’s algorithm is a synchronous randomized protocol for achieving self-stabilization in a token ring consisting of N processes. The interaction of tokens makes the dynamics o...
Stefan Kiefer, Andrzej S. Murawski, Joël Ouak...
COMPGEOM
2009
ACM
16 years 1 months ago
Cache-oblivious range reporting with optimal queries requires superlinear space
We consider a number of range reporting problems in two and three dimensions and prove lower bounds on the amount of space used by any cache-oblivious data structure for these pro...
Peyman Afshani, Chris H. Hamilton, Norbert Zeh
STOC
2002
ACM
101views Algorithms» more  STOC 2002»
16 years 7 months ago
An exponential separation between regular and general resolution
: This paper gives two distinct proofs of an exponential separation between regular resolution and unrestricted resolution. The previous best known separation between these systems...
Michael Alekhnovich, Jan Johannsen, Toniann Pitass...
SPAA
2009
ACM
16 years 3 months ago
At-most-once semantics in asynchronous shared memory
Abstract. At-most-once semantics is one of the standard models for object access in decentralized systems. Accessing an object, such as altering the state of the object by means of...
Sotiris Kentros, Aggelos Kiayias, Nicolas C. Nicol...