10304 search results - page 383 / 2061 » Computer science with the sciences: an emphasis in computati... |
169
click to vote
WG
2005
Springer
16 years 8 days 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.
180
click to vote
SPIN
2004
Springer
16 years 4 days ago
2004
Springer
Hard real-time systems need methods to determine upper bounds for their execution times, usually called worst-case execution
217
click to vote
FOCS
2002
IEEE
15 years 11 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...
183
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We introduce LT codes, the first rateless erasure codes that are very efficient as the data length grows.