|
Journals in DBLP
Algorithmica 2007, volume: 48, number: 3
- Frédéric Magniez, Ashwin Nayak
Quantum Complexity of Testing Group Commutativity. [Citation Graph (0, 0)][DBLP] Algorithmica, 2007, v:48, n:3, pp:221-232 [Journal]
- Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell
Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem. [Citation Graph (0, 0)][DBLP] Algorithmica, 2007, v:48, n:3, pp:233-248 [Journal]
- Colin Cooper, Alan Frieze, Gregory B. Sorkin
Random 2-SAT with Prescribed Literal Degrees. [Citation Graph (0, 0)][DBLP] Algorithmica, 2007, v:48, n:3, pp:249-265 [Journal]
- Paola Bonizzoni
A Linear-Time Algorithm for the Perfect Phylogeny Haplotype Problem. [Citation Graph (0, 0)][DBLP] Algorithmica, 2007, v:48, n:3, pp:267-285 [Journal]
- Jinsong Tan, Louxin Zhang
The Consecutive Ones Submatrix Problem for Sparse Matrices. [Citation Graph (0, 0)][DBLP] Algorithmica, 2007, v:48, n:3, pp:287-299 [Journal]
|