Volume 72; Issue 1-2

Information Processing Letters

Volume 72; Issue 1-2
1

Memory-efficient enumeration of constrained spanning trees

Jurg Nievergelt, Narsingh Deo, Ambros Marzetta
Journal:
Information Processing Letters
Year:
1999
Language:
english
File:
PDF, 85 KB
english, 1999
2

Estimating the range of a function in an online setting

John A. Mount
Journal:
Information Processing Letters
Year:
1999
Language:
english
File:
PDF, 69 KB
english, 1999
3

A new one pass algorithm for estimating stochastic context-free grammars

Dong-Yul Ra, George C. Stockman
Journal:
Information Processing Letters
Year:
1999
Language:
english
File:
PDF, 125 KB
english, 1999
4

Generating all the acyclic orientations of an undirected graph

Valmir C. Barbosa, Jayme L. Szwarcfiter
Journal:
Information Processing Letters
Year:
1999
Language:
english
File:
PDF, 67 KB
english, 1999
5

Very fast and simple approximate string matching

Gonzalo Navarro, Ricardo Baeza-Yates
Journal:
Information Processing Letters
Year:
1999
Language:
english
File:
PDF, 95 KB
english, 1999
6

Christmas tree: A versatile 1-fault-tolerant design for token rings

Chun-Nan Hung, Lih-Hsing Hsu, Ting-Yi Sung
Journal:
Information Processing Letters
Year:
1999
Language:
english
File:
PDF, 161 KB
english, 1999
8

Regularity of normed PA processes

Antonı́n Kučera
Journal:
Information Processing Letters
Year:
1999
Language:
english
File:
PDF, 125 KB
english, 1999
9

Linear complexity of the x2 mod p orbits

F. Montoya Vitini, J. Muñoz Masqué, A. Peinado Domínguez
Journal:
Information Processing Letters
Year:
1999
Language:
english
File:
PDF, 506 KB
english, 1999
10

A note on self-modifying finite automata

Y. Wang, K. Inoue, A. Ito, T. Okazaki
Journal:
Information Processing Letters
Year:
1999
Language:
english
File:
PDF, 83 KB
english, 1999