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
11016
search results - page 522 / 2204
»
Cloud Computing for Science
Sort
relevance
views
votes
recent
update
View
thumb
title
184
click to vote
SPIN
2004
Springer
112
views
Theoretical Computer Science
»
more
SPIN 2004
»
Formal Analysis of Processor Timing Models
16 years 12 days ago
Download
spinroot.com
Hard real-time systems need methods to determine upper bounds for their execution times, usually called worst-case execution
Reinhard Wilhelm
claim paper
Read More »
125
click to vote
STACS
2004
Springer
76
views
Theoretical Computer Science
»
more
STACS 2004
»
Online Competitive Algorithms for Maximizing Weighted Throughput of Unit Jobs
16 years 12 days ago
Download
www.cs.ucr.edu
Yair Bartal, Francis Y. L. Chin, Marek Chrobak, St...
claim paper
Read More »
222
click to vote
FOCS
2002
IEEE
110
views
Theoretical Computer Science
»
more
FOCS 2002
»
Zero-Knowledge
16 years 7 hour ago
Download
www.math.ias.edu
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...
Oded Goldreich
claim paper
Read More »
191
click to vote
FOCS
2002
IEEE
113
views
Theoretical Computer Science
»
more
FOCS 2002
»
LT Codes
16 years 7 hour 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 »
169
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 »
« Prev
« First
page 522 / 2204
Last »
Next »