Sciweavers

740 search results - page 113 / 148
» Lower bounds for Buchsbaum* complexes
Sort
View
ICRA
2006
IEEE
99views Robotics» more  ICRA 2006»
16 years 6 days ago
MRSAM: a Quadratically Competitive Multi-robot Online Navigation Algorithm
— We explore an online problem where a group of robots has to find a target whose position is unknown in an unknown planar environment whose geometry is acquired by the robots d...
Shahar Sarid, Amir Shapiro, Yoav Gabriely
TCC
2009
Springer
146views Cryptology» more  TCC 2009»
16 years 6 months ago
An Optimally Fair Coin Toss
We address one of the foundational problems in cryptography: the bias of coin-flipping protocols. Coin-flipping protocols allow mutually distrustful parties to generate a common u...
Tal Moran, Moni Naor, Gil Segev
IPPS
2009
IEEE
16 years 25 days ago
Competitive buffer management with packet dependencies
We introduce the problem of managing a FIFO buffer of bounded space, where arriving packets have dependencies among them. Our model is motivated by the scenario where large data f...
Alexander Kesselman, Boaz Patt-Shamir, Gabriel Sca...
ASPDAC
2009
ACM
92views Hardware» more  ASPDAC 2009»
16 years 21 days ago
Hybrid LZA: a near optimal implementation of the leading zero anticipator
The Leading Zero Anticipator (LZA) is one of the main components used in floating point addition. It tends to be on the critical path, so it has attracted the attention of many r...
Amit Verma, Ajay K. Verma, Philip Brisk, Paolo Ien...
FOCS
2005
IEEE
15 years 11 months ago
Towards a Final Analysis of Pairing Heaps
Fredman, Sedgewick, Sleator, and Tarjan proposed the pairing heap as a self-adjusting, streamlined version of the Fibonacci heap. It provably supports all priority queue operation...
Seth Pettie