Sciweavers

568 search results - page 3 / 114
» New bounds for the Cebysev functional
Sort
View
GLOBECOM
2008
IEEE
14 years 1 months ago
A New Upper Bound for a Binary Additive Noisy Multiple Access Channel with Feedback
— We use the idea of dependence balance [1] to obtain the first improvement over the cut-set bound for the discrete memoryless multiple access channel with noiseless feedback (M...
Ravi Tandon, Sennur Ulukus
CRYPTO
2005
Springer
116views Cryptology» more  CRYPTO 2005»
14 years 1 months ago
New Monotones and Lower Bounds in Unconditional Two-Party Computation
Since bit and string oblivious transfer and commitment, two primitives of paramount importance in secure two- and multi-party computation, cannot be realized in an unconditionally ...
Stefan Wolf, Jürg Wullschleger
INFORMATICALT
2002
103views more  INFORMATICALT 2002»
13 years 7 months ago
Numerical Representations as Purely Functional Data Structures: a New Approach
This paper is concerned with design, implementation and verification of persistent purely functional data structures which are motivated by the representation of natural numbers us...
Mirjana Ivanovic, Viktor Kuncak
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
14 years 7 months ago
New upper and lower bounds for randomized and quantum local search
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
Shengyu Zhang
ACISP
1997
Springer
13 years 11 months ago
New Lower Bounds on Nonlinearity and a Class of Highly Nonlinear Functions
Abstract. Highly nonlinear Boolean functions occupy an important position in the design of secure block as well as stream ciphers. This paper proves two new lower bounds on the non...
Xian-Mo Zhang, Yuliang Zheng