3208 search results - page 429 / 642 » A Lower Bound for Primality |
165
click to vote
ISAAC
2007
Springer
16 years 23 days ago
2007
Springer
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
194
click to vote
LFCS
2007
Springer
16 years 23 days ago
2007
Springer
We present a general algorithm scheme for model checking logics of knowledge, common knowledge and linear time, based on simulations to a class of structures that capture the way t...
177
click to vote
WINE
2007
Springer
16 years 22 days ago
2007
Springer
We study the problem of hiring a team of selfish agents to perform a task. Each agent is assumed to own one or more elements of a set system, and the auctioneer is trying to purch...
169
click to vote
MOBICOM
2006
ACM
16 years 17 days ago
2006
ACM
In this paper we study the broadcast capacity of multihop wireless networks which we define as the maximum rate at which broadcast packets can be generated in the network such th...
190
click to vote
FOCS
2005
IEEE
16 years 7 days ago
2005
IEEE
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...