Sciweavers

3208 search results - page 221 / 642
» A Lower Bound for Primality
Sort
View
CORR
2010
Springer
82views Education» more  CORR 2010»
15 years 3 months ago
Secret-key Agreement with Channel State Information at the Transmitter
We study the capacity of secret-key agreement over a wiretap channel with state parameters. The transmitter communicates to the legitimate receiver and the eavesdropper over a disc...
Ashish Khisti, Suhas N. Diggavi, Gregory W. Wornel...
ICALP
2011
Springer
14 years 10 months ago
Steiner Transitive-Closure Spanners of Low-Dimensional Posets
Given a directed graph G = (V, E) and an integer k ≥ 1, a Steiner k-transitive-closure-spanner (Steiner k-TC-spanner) of G is a directed graph H = (VH , EH ) such that (1) V ⊆ ...
Piotr Berman, Arnab Bhattacharyya, Elena Grigoresc...
ICALP
2011
Springer
14 years 10 months ago
On the Advice Complexity of the k-Server Problem
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
Hans-Joachim Böckenhauer, Dennis Komm, Rastis...
SIAMCOMP
1998
138views more  SIAMCOMP 1998»
15 years 6 months ago
Dynamic Trees and Dynamic Point Location
This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision S. The main approach is based on the maintenance of...
Michael T. Goodrich, Roberto Tamassia
SPAA
2010
ACM
15 years 11 months ago
Basic network creation games
We study a natural network creation game, in which each node locally tries to minimize its local diameter or its local average distance to other nodes, by swapping one incident ed...
Noga Alon, Erik D. Demaine, MohammadTaghi Hajiagha...