CPM 2010 | Sciweavers

57

CPM
2010
Springer

145views Combinatorics» more CPM 2010»

Succinct Representations of Separable Graphs

13 years 7 months ago

Abstract. We consider the problem of highly space-efficient representation of separable graphs while supporting queries in constant time in the RAM with logarithmic word size. In p...

Guy E. Blelloch, Arash Farzan

claim paper

Read More »

29

click to vote

CPM
2010
Springer

120views Combinatorics» more CPM 2010»

Pseudo-realtime Pattern Matching: Closing the Gap

14 years 5 months ago

Download cs.nyu.edu

Raphaël Clifford, Benjamin Sach

claim paper

Read More »

27

click to vote

CPM
2010
Springer

119views Combinatorics» more CPM 2010»

Phylogeny- and Parsimony-Based Haplotype Inference with Constraints

14 years 5 months ago

Download cs.nyu.edu

Michael Elberfeld, Till Tantau

claim paper

Read More »

29

click to vote

CPM
2010
Springer

114views Combinatorics» more CPM 2010»

Small-Space 2D Compressed Dictionary Matching

14 years 5 months ago

Download cs.nyu.edu

Shoshana Neuburger, Dina Sokol

claim paper

Read More »

29

click to vote

CPM
2010
Springer

134views Combinatorics» more CPM 2010»

On the Parameterized Complexity of Some Optimization Problems Related to Multiple-Interval Graphs

14 years 5 months ago

Download cs.nyu.edu

Minghui Jiang

claim paper

Read More »

28

click to vote

CPM
2010
Springer

130views Combinatorics» more CPM 2010»

Building the Minimal Automaton of A*X in Linear Time, When X Is of Bounded Cardinality

14 years 5 months ago

Download cs.nyu.edu

Omar AitMous, Frédérique Bassino, Cy...

claim paper

Read More »

30

click to vote

CPM
2010
Springer

144views Combinatorics» more CPM 2010»

Breakpoint Distance and PQ-Trees

14 years 5 months ago

Download cs.nyu.edu

Haitao Jiang, Cedric Chauve, Binhai Zhu

claim paper

Read More »

36

click to vote

CPM
2010
Springer

146views Combinatorics» more CPM 2010»

Parallel and Distributed Compressed Indexes

14 years 5 months ago

Download www.dcc.uchile.cl

Abstract. We study parallel and distributed compressed indexes. Compressed indexes are a new and functional way to index text strings. They exploit the compressibility of the text,...

Luís M. S. Russo, Gonzalo Navarro, Arlindo ...

claim paper

Read More »

23

click to vote

CPM
2010
Springer

124views Combinatorics» more CPM 2010»

Succinct Dictionary Matching with No Slowdown

14 years 5 months ago

Download cs.nyu.edu

Djamal Belazzougui

claim paper