2095 search results - page 162 / 419 » Improved pebbling bounds |
190
click to vote
CRYPTO
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. We present a lower bound on the number of rounds required by Concurrent Zero-Knowledge proofs for languages in NP. It is shown that in the context of Concurrent Zero-Know...
133
click to vote
PODC
1997
ACM
1997
ACM
Leap Forward Virtual Clock: A New Fair Queuing Scheme with Guaranteed Delays and Throughput Fairness
15 years 10 months ago
We describe an ejjicient fair queuing scheme, Leap Forward Virtual Clock, that provides end-to-end delay bounds simdar to WFQ, along with throughput fairness. Our scheme can be im...
162
click to vote
RTSS
1996
IEEE
15 years 10 months ago
1996
IEEE
The well-known periodic task model of Liu and Layland 1] assumes a worst-case execution time bound for every task and may be too pessimistic if the worst-case execution time of a ...
169
click to vote
COMPGEOM
2007
ACM
15 years 10 months ago
2007
ACM
We prove an optimal generalization of the centerpoint theorem: given a set P of n points in the plane, there exist two points (not necessarily among input points) that hit all con...
200
click to vote
DBPL
2007
Springer
15 years 10 months ago
2007
Springer
Tree pattern matching is a fundamental problem that has a wide range of applications in Web data management, XML processing, and selective data dissemination. In this paper we deve...