Sciweavers

10271 search results - page 329 / 2055
» Self-plagiarism in computer science
Sort
View
FOCS
2002
IEEE
16 years 14 days ago
LT Codes
We introduce LT codes, the first rateless erasure codes that are very efficient as the data length grows.
Michael Luby
FOCS
1999
IEEE
15 years 11 months ago
How Asymmetry Helps Load Balancing
This paper deals with balls and bins processes related to randomized load balancing, dynamic resource allocation, and hashing. Suppose
Berthold Vöcking
137
Voted
ENTCS
2002
66views more  ENTCS 2002»
15 years 7 months ago
Unique, guarded fixed points in an additive setting: Extended Abstract
Abstract Stephen L. Bloom Department of Computer Science Stevens Institute of Technology Hoboken, NJ 07030 and Zolt
Stephen L. Bloom, Zoltán Ésik
144
Voted
MFCS
2010
Springer
15 years 6 months ago
Scheduling Real-Time Mixed-Criticality Jobs
Sanjoy K. Baruah, Vincenzo Bonifaci, Gianlorenzo D...
210
Voted
MFCS
2010
Springer
15 years 6 months ago
Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets
We prove that coverability and termination are not primitive-recursive for lossy counter machines and for Reset Petri nets.
Philippe Schnoebelen