Sciweavers

973 search results - page 184 / 195
» New Bounds on Crossing Numbers
Sort
View
TCC
2007
Springer
104views Cryptology» more  TCC 2007»
14 years 2 months ago
Unifying Classical and Quantum Key Distillation
Assume that two distant parties, Alice and Bob, as well as an adversary, Eve, have access to (quantum) systems prepared jointly according to a tripartite state ρABE. In addition, ...
Matthias Christandl, Artur Ekert, Michal Horodecki...
INFOCOM
2006
IEEE
14 years 2 months ago
Backbone Topology Synthesis for Multi-Radio Meshed Wireless LANs
—Wireless local area network (WLAN) systems are widely implemented today to provide hot spot coverage. Operated typically in an infrastructure mode, each WLAN is managed by an ac...
Laura Huei-jiun Ju, Izhak Rubin
ASM
2004
ASM
14 years 1 months ago
Observations on the Decidability of Transitions
Consider a multiple-agent transition system such that, for some basic types T1, . . . , Tn, the state of any agent can be represented as an element of the Cartesian product T1 ×·...
Yuri Gurevich, Rostislav Yavorskiy
INDOCRYPT
2004
Springer
14 years 1 months ago
Advances in Alternative Non-adjacent Form Representations
Abstract. From several decades, non-adjacent form (NAF) representations for integers have been extensively studied as an alternative to the usual binary number system where digits ...
Gildas Avoine, Jean Monnerat, Thomas Peyrin
LPAR
2004
Springer
14 years 1 months ago
Entanglement - A Measure for the Complexity of Directed Graphs with Applications to Logic and Games
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...
Dietmar Berwanger, Erich Grädel