2924 search results - page 38 / 585 » Lower Bounds in Distributed Computing |
COCO
2010
Springer
13 years 10 months ago
2010
Springer
—A space bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space bounded read-write work tapes, and an unbounded stack. Stack Machines with a...
FOCS
2007
IEEE
14 years 3 months ago
2007
IEEE
We show that any deterministic data-stream algorithm that makes a constant number of passes over the input and gives a constant factor approximation of the length of the longest i...
STACS
2004
Springer
14 years 2 months ago
2004
Springer
We study a class of single-round, sealed-bid auctions for a set of identical items. We adopt the worst case competitive framework defined by [1,2] that compares the profit of an ...
WIOPT
2011
IEEE
13 years 15 days ago
2011
IEEE
—This paper studies the performance of ad hoc networks with local FDMA scheduling using stochastic point processes. In such networks, the Poisson assumption is not justified due...
FOCS
2007
IEEE
14 years 3 months ago
2007
IEEE
We show that every construction of one-time signature schemes from a random oracle achieves black-box security at most 2(1+o(1))q , where q is the total number of oracle queries a...