We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
Coalitional games raise a number of important questions from the point of view of computer science, key among them being how to represent such games compactly, and how to efficien...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
From an engineering point of view, the problem of coordinating a set of autonomous, mobile robots for the purpose of cooperatively performing a task has been studied extensively o...
Paola Flocchini, Giuseppe Prencipe, Nicola Santoro...
This paper deals with distributed demodulation of space-time transmissions of a common message from a multiantenna access point (AP) to a wireless sensor network. Based on local me...