LATIN 2010 - PDF Preprint Papers

LATIN 2010 Latin American Symposium on Theoretical Informatics

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed LATIN-2010 Paper

click to vote

LATIN
2010
Springer

238views Information Technology» more LATIN 2010»

Compact Rich-Functional Binary Relation Representations

14 years 6 months ago

Download www.dcc.uchile.cl

Binary relations are an important abstraction arising in a number of data representation problems. Each existing data structure specializes in the few basic operations required by ...

Jérémy Barbay, Francisco Claude, Gon...

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.

Related Conferences

Id	Views	Title	Status

1	238	Compact Rich-Functional Binary Relation Representations	claim
2	233	Minimum-Perimeter Intersecting Polygons	claim
3	225	Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs	claim
4	223	Pairs of Complementary Unary Languages with "Balanced" Nondeterministic Automata	claim
5	186	The I/O Complexity of Sparse Matrix Dense Matrix Multiplication	claim
6	183	Colorful Strips	claim
7	170	Sharp Separation and Applications to Exact and Parameterized Algorithms	claim
8	168	Kernelization through Tidying	claim
9	164	Optimal Succinctness for Range Minimum Queries	claim
10	163	Rank Selection in Multidimensional Data	claim
11	162	Lipschitz Unimodal and Isotonic Regression on Paths and Trees	claim
12	162	Prize-Collecting Steiner Networks via Iterative Rounding	claim
13	157	Euclidean Prize-Collecting Steiner Forest	claim
14	157	On Quadratic Threshold CSPs	claim
15	155	Modelling the LLL Algorithm by Sandpiles	claim
16	150	Some Observations on Holographic Algorithms	claim
17	149	Finding the Minimum-Distance Schedule for a Boundary Searcher with a Flashlight	claim
18	148	Visiting a Sequence of Points with a Bevel-Tip Needle	claim
19	147	Complexity of Operations on Cofinite Languages	claim
20	145	The Complexity of Counting Eulerian Tours in 4-Regular Graphs	claim
21	143	Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization	claim
22	143	The Power of Fair Pricing Mechanisms	claim
23	142	Gradual Sub-lattice Reduction and a New Complexity for Factoring Polynomials	claim
24	141	The Language Theory of Bounded Context-Switching	claim
25	139	Optimal Polygonal Representation of Planar Graphs	claim
26	137	Packet Routing on the Grid	claim
27	133	Layered Working-Set Trees	claim
28	133	Lightweight Data Indexing and Compression in External Memory	claim
29	133	Randomized Truthful Algorithms for Scheduling Selfish Tasks on Parallel Machines	claim
30	132	Average Parameterization and Partial Kernelization for Computing Medians	claim
31	132	Sparse Recovery Using Sparse Random Matrices	claim
32	131	Tilings Robust to Errors	claim
33	129	Matching Points with Things	claim
34	129	Finding the Smallest Gap between Sums of Square Roots	claim
35	123	Faithful Representations of Graphs by Islands in the Extended Grid	claim
36	117	The Size and Depth of Layered Boolean Circuits	claim
37	116	The Interval Constrained 3-Coloring Problem	claim
38	112	Radix Cross-Sections for Length Morphisms	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers