1 citations · 1 across the 1 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2002★ 1 cited
Linear-Time Pointer-Machine Algorithms for Path-Evaluation Problems on Trees and Graphs
Adam L. Buchsbaum, Loukas Georgiadis, Haim Kaplan +3
We present algorithms that run in linear time on pointer machines for a collection of problems, each of which either directly or indirectly requires the evaluation of a function de…
cs.DS2002
Improving Table Compression with Combinatorial Optimization
Adam L. Buchsbaum, Glenn S. Fowler, Raffaele Giancarlo
We study the problem of compressing massive tables within the partition-training paradigm introduced by Buchsbaum et al. [SODA'00], in which a table is partitioned by an off-line t…