Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
ISAAC
2010
Springer
313views Algorithms» more  ISAAC 2010»
11 years 3 months ago
A Cache-Oblivious Implicit Dictionary with the Working Set Property
Abstract. In this paper we present an implicit dictionary with the working set property i.e. a dictionary supporting insert(e), delete(x) and predecessor(x) in O(log n) time and se...
Gerth Stølting Brodal, Casper Kejlberg-Rasm...
ISAAC
2010
Springer
291views Algorithms» more  ISAAC 2010»
11 years 3 months ago
A Tighter Analysis of Work Stealing
Abstract. Classical list scheduling is a very popular and efficient technique for scheduling jobs in parallel platforms. However, with the increasing number of processors, the cost...
Marc Tchiboukdjian, Nicolas Gast, Denis Trystram, ...
ISAAC
2010
Springer
221views Algorithms» more  ISAAC 2010»
11 years 3 months ago
Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing
In this paper, we study 1-space bounded 2-dimensional bin packing and square packing. A sequence of rectangular items (square items, respectively) arrive over time, which must be p...
Yong Zhang, Jing-Chi Chen, Francis Y. L. Chin, Xin...
ISAAC
2010
Springer
245views Algorithms» more  ISAAC 2010»
11 years 3 months ago
Alphabet Partitioning for Compressed Rank/Select and Applications
Jérémy Barbay, Travis Gagie, Gonzalo...
ISAAC
2010
Springer
277views Algorithms» more  ISAAC 2010»
11 years 3 months ago
Induced Subgraph Isomorphism on Interval and Proper Interval Graphs
The Induced Subgraph Isomorphism problem on two input graphs G and H is to decide whether G has an induced subgraph isomorphic to H. Already for the restricted case where H is a c...
Pinar Heggernes, Daniel Meister, Yngve Villanger
ISAAC
2010
Springer
265views Algorithms» more  ISAAC 2010»
11 years 3 months ago
On the Approximability of the Maximum Interval Constrained Coloring Problem
Stefan Canzar, Khaled M. Elbassioni, Amr Elmasry, ...
ISAAC
2010
Springer
231views Algorithms» more  ISAAC 2010»
11 years 3 months ago
Entropy-Bounded Representation of Point Grids
We give the first fully compressed representation of a set of m points on an n
Arash Farzan, Travis Gagie, Gonzalo Navarro
ISAAC
2010
Springer
270views Algorithms» more  ISAAC 2010»
11 years 3 months ago
Generating Trees on Multisets
Given a multiset M = V1 V2
Bingbing Zhuang, Hiroshi Nagamochi
ISAAC
2010
Springer
226views Algorithms» more  ISAAC 2010»
11 years 3 months ago
On Tractable Cases of Target Set Selection
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
André Nichterlein, Rolf Niedermeier, Johann...
ISAAC
2010
Springer
243views Algorithms» more  ISAAC 2010»
11 years 3 months ago
Lower Bounds for Howard's Algorithm for Finding Minimum Mean-Cost Cycles
Howard's policy iteration algorithm is one of the most widely used algorithms for finding optimal policies for controlling Markov Decision Processes (MDPs). When applied to we...
Thomas Dueholm Hansen, Uri Zwick
books