ISAAC 2010 - PDF Preprint Papers

ISAAC 2010 International Symposium on Algorithms and Computation

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ISAAC-2010 Paper

click to vote

ISAAC
2010
Springer

313views Algorithms» more ISAAC 2010»

A Cache-Oblivious Implicit Dictionary with the Working Set Property

13 years 9 months ago

Download www.cs.au.dk

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...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	313	A Cache-Oblivious Implicit Dictionary with the Working Set Property	claim
2	308	Levelwise Mesh Sparsification for Shortest Path Queries	claim
3	291	A Tighter Analysis of Work Stealing	claim
4	277	Induced Subgraph Isomorphism on Interval and Proper Interval Graphs	claim
5	276	Anonymous Fuzzy Identity-Based Encryption for Similarity Search	claim
6	272	Neighbor Systems, Jump Systems, and Bisubmodular Polyhedra	claim
7	270	Generating Trees on Multisets	claim
8	268	On the Intersection of Tolerance and Cocomparability Graphs	claim
9	266	Structural and Complexity Aspects of Line Systems of Graphs	claim
10	265	On the Approximability of the Maximum Interval Constrained Coloring Problem	claim
11	257	Approximating Minimum Bending Energy Path in a Simple Corridor	claim
12	253	Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut	claim
13	245	Alphabet Partitioning for Compressed Rank/Select and Applications	claim
14	243	Lower Bounds for Howard's Algorithm for Finding Minimum Mean-Cost Cycles	claim
15	240	An Optimal Algorithm for Computing Angle-Constrained Spanners	claim
16	240	Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity	claim
17	233	Computing Sparse Multiples of Polynomials	claim
18	231	Entropy-Bounded Representation of Point Grids	claim
19	230	Seidel Minor, Permutation Graphs and Combinatorial Properties	claim
20	226	On Tractable Cases of Target Set Selection	claim
21	221	Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing	claim
22	216	Fractal Parallelism: Solving SAT in Bounded Space and Time	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers