Sciweavers

Share
CORR
2010
Springer
62views Education» more  CORR 2010»
9 years 1 months ago
The McEliece Cryptosystem Resists Quantum Fourier Sampling Attacks
Hang Dinh, Cristopher Moore, Alexander Russell
CORR
2010
Springer
105views Education» more  CORR 2010»
9 years 1 months ago
Universal and Robust Distributed Network Codes
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented [1] over fi...
Tracey Ho, Sidharth Jaggi, Svitlana Vyetrenko, Lin...
CORR
2010
Springer
122views Education» more  CORR 2010»
9 years 1 months ago
Concavity of Mutual Information Rate for Input-Restricted Finite-State Memoryless Channels at High SNR
We consider a finite-state memoryless channel with i.i.d. channel state and the input Markov process supported on a mixing finite-type constraint. We discuss the asymptotic behavio...
Guangyue Han, Brian H. Marcus
CORR
2010
Springer
108views Education» more  CORR 2010»
9 years 1 months ago
Finding Cycles and Trees in Sublinear Time
We present sublinear-time (randomized) algorithms for finding simple cycles of length at least k 3 and tree-minors in bounded-degree graphs. The complexity of these algorithms is...
Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadh...
CORR
2010
Springer
127views Education» more  CORR 2010»
9 years 1 months ago
Complexity of Data Dependence problems for Program Schemas with Concurrency
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...
Sebastian Danicic, Robert M. Hierons, Michael R. L...
CORR
2010
Springer
135views Education» more  CORR 2010»
9 years 1 months ago
Secure Communication and Access Control for Mobile Web Service Provisioning
It is now feasible to host basic web services on a smart phone due to the advances in wireless devices and mobile communication technologies. While the applications are quite welco...
Satish Narayana Srirama, Anton Naumenko
CORR
2010
Springer
135views Education» more  CORR 2010»
9 years 1 months ago
Top-K Color Queries for Document Retrieval
In this paper we describe a new efficient (in fact optimal) data structure for the top-K color problem. Each element of an array A is assigned a color c with priority p(c). For a ...
Marek Karpinski, Yakov Nekrich
CORR
2010
Springer
116views Education» more  CORR 2010»
9 years 1 months ago
New Results on the Capacity of the Gaussian Cognitive Interference Channel
The capacity of the two-user Gaussian cognitive interference channel, a variation of the classical interference channel where one of the transmitters has knowledge of both messages...
Stefano Rini, Daniela Tuninetti, Natasha Devroye
books