10271 search results - page 388 / 2055 » Computer Science |
124
click to vote
WG
2005
Springer
15 years 10 months ago
2005
Springer
We improve the current complexities for maintaining a chordal graph by starting with an empty graph and repeatedly adding or deleting edges.
133
click to vote
SPIN
2004
Springer
15 years 10 months ago
2004
Springer
Hard real-time systems need methods to determine upper bounds for their execution times, usually called worst-case execution
STACS
2004
Springer
15 years 10 months ago
2004
Springer
161
click to vote
FOCS
2002
IEEE
15 years 9 months ago
2002
IEEE
We show new lower bounds and impossibility results for general (possibly non-black-box) zero-knowledge proofs and arguments. Our main results are that, under reasonable complexity...
137
click to vote
FOCS
2002
IEEE
15 years 9 months ago
2002
IEEE
We introduce LT codes, the first rateless erasure codes that are very efficient as the data length grows.