Information Processing Letters, Volume 101
Volume 101, Number 1, January 2007
Junhu Wang:
Binary equality implication constraints, normal forms and data redundancy. 20-25
Volume 101, Number 2, January 2007
Daniel Sawitzki:
Lower bounds on the OBDD size of two fundamental functions' graphs. 66-71 Eric Bach:
Bounds for the expected duration of the monopolist game. 86-92
Volume 101, Number 3, February 2007
Ulrich Ultes-Nitsche:
A power-set construction for reducing Büchi automata to non-determinism degree two. 107-111 Marcin Peczarski:
The Ford-Johnson algorithm still unbeaten for less than 47 elements. 126-128
Volume 101, Number 4, February 2007
Jan Krajícek:
Substitutions into propositional tautologies. 163-167 Wenbin Chen,
Jiangtao Meng:
An improved lower bound for approximating Shortest Integer Relation in linfinity norm (SIRinfinity). 174-179
Volume 101, Number 5, March 2007
Shiyan Hu:
A linear time algorithm for max-min length triangulation of a convex polygon. 203-208
Volume 101, Number 6, March 2007
Moritz G. Maaß:
Computing suffix links for suffix trees and arrays. 250-254
maintained by

, founded at
