Sciweavers

83 search results - page 12 / 17
» Linear probing with constant independence
Sort
View
CORR
2011
Springer
143views Education» more  CORR 2011»
13 years 1 months ago
Non-malleable extractors via character sums
In studying how to communicate over a public channel with an active adversary, Dodis and Wichs introduced the notion of a non-malleable extractor. A non-malleable extractor dramat...
Trevor D. Wooley, David Zuckerman
IPPS
2009
IEEE
14 years 4 months ago
Multi-users scheduling in parallel systems
We are interested in this paper to study scheduling problems in systems where many users compete to perform their respective jobs on shared parallel resources. Each user has speci...
Erik Saule, Denis Trystram
FSTTCS
2007
Springer
14 years 4 months ago
Order Scheduling Models: Hardness and Algorithms
We consider scheduling problems in which a job consists of components of different types to be processed on m machines. Each machine is capable of processing components of a singl...
Naveen Garg, Amit Kumar, Vinayaka Pandit
FCT
2009
Springer
14 years 2 months ago
Multiway In-Place Merging
Abstract. We present an algorithm for asymptotically efficient multiway blockwise in-place merging. Given an array A containing sorted subsequences A1, . . . , Ak of respective le...
Viliam Geffert, Jozef Gajdos
USENIX
2008
14 years 4 days ago
A Compacting Real-Time Memory Management System
We propose a real real-time memory management system called Compact-fit that offers both time and space predictability. Compact-fit is a compacting memory management system for al...
Silviu S. Craciunas, Christoph M. Kirsch, Hannes P...