Sciweavers

4403 search results - page 31 / 881
» Galois Theory of Algorithms
Sort
View
GD
2004
Springer
15 years 7 months ago
Fast Algorithms for Hard Graph Problems: Bidimensionality, Minors, and Local Treewidth
Abstract. This paper surveys the theory of bidimensional graph problems. We summarize the known combinatorial and algorithmic results of this theory, the foundational Graph Minor r...
Erik D. Demaine, Mohammad Taghi Hajiaghayi
COCO
2001
Springer
102views Algorithms» more  COCO 2001»
15 years 6 months ago
Links Between Complexity Theory and Constrained Block Coding
Larry J. Stockmeyer, Dharmendra S. Modha
LCC
1994
214views Algorithms» more  LCC 1994»
15 years 6 months ago
Preservation Theorems in Finite Model Theory
Eric Rosen, Scott Weinstein
ESA
2006
Springer
84views Algorithms» more  ESA 2006»
15 years 5 months ago
The Engineering of a Compression Boosting Library: Theory vs Practice in BWT Compression
Paolo Ferragina, Raffaele Giancarlo, Giovanni Manz...