Publications

Export 231 results:
Author [ Title(Desc)] Type Year
Filters: First Letter Of Title is L  [Clear All Filters]
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
L
Ambainis A, Gasarch W, Srinivasan A, Utis A.  2006.  Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems. Algorithms and ComputationAlgorithms and Computation. 4288:628-637.
Gennaro R, Gertner Y, Katz J.  2003.  Lower bounds on the efficiency of encryption and digital signature schemes. Proceedings of the thirty-fifth annual ACM symposium on Theory of computing. :417-425.
Horak MN, Nowick SM, Carlberg M, Vishkin U.  2011.  A Low-Overhead Asynchronous Interconnection Network for GALS Chip Multiprocessors. Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on. 30(4):494-507.
Boutellier J, Bhattacharyya SS, Silvén O.  2007.  Low-overhead run-time scheduling for fine-grained acceleration of signal processing systems. Signal Processing Systems, 2007 IEEE Workshop on. :457-462.
Boutellier J, Bhattacharyya SS, Silvén O.  2010.  A Low-overhead Scheduling Methodology for Fine-grained Acceleration of Signal Processing Systems. Journal of Signal Processing Systems. 60(3):333-343.
Byrka J, Ghodsi M, Srinivasan A.  2010.  LP-rounding algorithms for facility-location problems. arXiv:1007.3611.

Pages