Sciweavers

1094 search results - page 119 / 219
» One Size Fits All
Sort
View
COCO
2009
Springer
121views Algorithms» more  COCO 2009»
14 years 3 months ago
Lower Bounds on Quantum Multiparty Communication Complexity
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
Troy Lee, Gideon Schechtman, Adi Shraibman
JIT
2004
Springer
204views Database» more  JIT 2004»
14 years 2 months ago
Ercatons: Thing-Oriented Programming
Thing-oriented programming (TP) is an emerging programming model which overcomes some of the limitations of current practice in software development in general and of object-orient...
Oliver Imbusch, Falk Langhammer, Guido von Walter
LATINCRYPT
2010
13 years 7 months ago
Cryptanalysis of the Hidden Matrix Cryptosystem
Abstract. In this paper, we present an efficient cryptanalysis of the socalled HM cryptosystem which was published at Asiacrypt’1999, and one perturbed version of HM. Until now, ...
Jean-Charles Faugère, Antoine Joux, Ludovic...
ATAL
2009
Springer
14 years 3 months ago
Easy and hard coalition resource game formation problems: a parameterized complexity analysis
Coalition formation is a key topic in multi–agent systems (mas). Coalitions enable agents to achieve goals that they may not have been able to achieve independently, and encoura...
Tammar Shrot, Yonatan Aumann, Sarit Kraus
ISAAC
2007
Springer
80views Algorithms» more  ISAAC 2007»
14 years 3 months ago
Geometric Streaming Algorithms with a Sorting Primitive
We solve several fundamental geometric problems under a new streaming model recently proposed by Ruhl et al. [2, 12]. In this model, in one pass the input stream can be scanned to ...
Eric Y. Chen