Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
10271
search results - page 329 / 2055
»
Self-plagiarism in computer science
Sort
relevance
views
votes
recent
update
View
thumb
title
199
click to vote
FOCS
2002
IEEE
113
views
Theoretical Computer Science
»
more
FOCS 2002
»
LT Codes
16 years 14 days ago
Download
www.inference.phy.cam.ac.uk
We introduce LT codes, the first rateless erasure codes that are very efficient as the data length grows.
Michael Luby
claim paper
Read More »
176
click to vote
FOCS
1999
IEEE
94
views
Theoretical Computer Science
»
more
FOCS 1999
»
How Asymmetry Helps Load Balancing
15 years 11 months ago
Download
www.cc.gatech.edu
This paper deals with balls and bins processes related to randomized load balancing, dynamic resource allocation, and hashing. Suppose
Berthold Vöcking
claim paper
Read More »
137
Voted
ENTCS
2002
66
views
more
ENTCS 2002
»
Unique, guarded fixed points in an additive setting: Extended Abstract
15 years 7 months ago
Download
www.cs.stevens.edu
Abstract Stephen L. Bloom Department of Computer Science Stevens Institute of Technology Hoboken, NJ 07030 and Zolt
Stephen L. Bloom, Zoltán Ésik
claim paper
Read More »
144
Voted
MFCS
2010
Springer
125
views
Theoretical Computer Science
»
more
MFCS 2010
»
Scheduling Real-Time Mixed-Criticality Jobs
15 years 6 months ago
Download
www.cs.unc.edu
Sanjoy K. Baruah, Vincenzo Bonifaci, Gianlorenzo D...
claim paper
Read More »
210
Voted
MFCS
2010
Springer
152
views
Theoretical Computer Science
»
more
MFCS 2010
»
Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets
15 years 6 months ago
Download
www.lsv.ens-cachan.fr
We prove that coverability and termination are not primitive-recursive for lossy counter machines and for Reset Petri nets.
Philippe Schnoebelen
claim paper
Read More »
« Prev
« First
page 329 / 2055
Last »
Next »