ESA 2009 - PDF Preprint Papers

ESA 2009 European Symposium on Algorithms

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ESA-2009 Paper

click to vote

ESA
2009
Springer

346views Algorithms» more ESA 2009»

Hash, Displace, and Compress

13 years 11 months ago

Download cmph.sourceforge.net

A hash function h, i.e., a function from the set U of all keys to the range range [m] = {0, . . . , m − 1} is called a perfect hash function (PHF) for a subset S ⊆ U of size n ...

Djamal Belazzougui, Fabiano C. Botelho, Martin Die...

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	346	Hash, Displace, and Compress	claim
2	190	Accelerating Multi-modal Route Planning by Access-Nodes	claim
3	190	Polynomial-Time Algorithm for the Leafage of Chordal Graphs	claim
4	167	Clustering-Based Bidding Languages for Sponsored Search	claim
5	159	Contraction Bidimensionality: The Accurate Picture	claim
6	156	On Revenue Maximization in Second-Price Ad Auctions	claim
7	151	Experimental Study of FPT Algorithms for the Directed Feedback Vertex Set Problem	claim
8	149	Approximability of OFDMA Scheduling	claim
9	149	On the Power of Uniform Power: Capacity of Wireless Networks with Bounded Resources	claim
10	149	3.5-Way Cuckoo Hashing for the Price of 2-and-a-Bit	claim
11	149	Sparse Cut Projections in Graph Streams	claim
12	146	Kernel Bounds for Disjoint Cycles and Disjoint Paths	claim
13	144	Narrow-Shallow-Low-Light Trees with and without Steiner Points	claim
14	143	On Optimally Partitioning a Text to Improve Its Compression	claim
15	142	An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-Time Scheduling	claim
16	139	Google's Auction for TV Ads	claim
17	139	Optimality and Competitiveness of Exploring Polygons by Mobile Robots	claim
18	131	Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels	claim
19	130	Cauchy's Theorem for Orthogonal Polyhedra of Genus 0	claim
20	130	On the Performance of Approximate Equilibria in Congestion Games	claim
21	129	Constant Ratio Fixed-Parameter Approximation of the Edge Multicut Problem	claim
22	129	Dynamic vs. Oblivious Routing in Network Design	claim
23	127	Maximum Flow in Directed Planar Graphs with Vertex Capacities	claim
24	127	Piercing Translates and Homothets of a Convex Body	claim
25	127	Geometric Spanners for Weighted Point Sets	claim
26	124	Minimum Makespan Multi-vehicle Dial-a-Ride	claim
27	122	Bounded Budget Betweenness Centrality Game for Strategic Network Formations	claim
28	120	Rank-Pairing Heaps	claim
29	116	On the Expansion and Diameter of Bluetooth-Like Topologies	claim
30	115	Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs	claim
31	112	Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution	claim
32	111	d-Dimensional Knapsack in the Streaming Model	claim
33	111	Exact and Approximate Equilibria for Optimal Group Network Formation	claim
34	109	Iterative Rounding for Multi-Objective Optimization Problems	claim
35	109	Linear-Time Recognition of Probe Interval Graphs	claim
36	109	Preemptive Online Scheduling with Reordering	claim
37	107	Disproof of the Neighborhood Conjecture with Implications to SAT	claim
38	106	Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth	claim
39	104	Complete Parsimony Haplotype Inference Problem and Algorithms	claim
40	104	Improved Approximation Algorithms for Label Cover Problems	claim
41	104	Hyperbolic Dovetailing	claim
42	99	Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling	claim
43	98	Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard	claim
44	98	Bipartite Graph Matchings in the Semi-streaming Model	claim
45	98	The Oil Searching Problem	claim
46	98	A Linear Time Algorithm for L(2, 1)-Labeling of Trees	claim
47	94	Shape Fitting on Point Sets with Probability Distributions	claim
48	94	Some Open Questions Related to Cuckoo Hashing	claim
49	92	Minimizing Movement: Fixed-Parameter Tractability	claim
50	90	Storing a Compressed Function with Constant Time Access	claim
51	81	Wireless Scheduling with Power Control	claim
52	81	k-Outerplanar Graphs, Planar Duality, and Low Stretch Spanning Trees	claim
53	77	Short Labels for Lowest Common Ancestors in Trees	claim
54	74	On Inducing Polygons and Related Problems	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers