The Prague Stringology Club Workshop '96

In 1996 a group of people solving string problems decided to found the Prague Stringology Club in order to group people researching in the same field. The first action of the PSC was to organize a workshop.

This workshop was called the Prague Stringology Club Workshop '96 and several reserchers working in the field of strings were invited to give their talks. The workshop took place at Department of Computer Science and Engineering of Czech Technical University in Prague on Wednesday, August 14, 1996. All these papers have been published in proceedings. The workshop is listed in DBLP.

The following papers were accepted to the PSCW '96:

AuthorTitle
Invited talks
Kazuaki Ando, Masami Shishibori and Jun-ichi Aoe An Efficient Multi-Attribute Pattern Matching Machine
Martin Bloch Efficiency of AC-Machine and SNFA in Practical String Matching
Jan Holub Reduced Nondeterministic Finite Automata for Approximate String Matching
Bořivoj Melichar Space Complexity of Linear Time Approximate String Matching
Pavel Mužátko Approximate Regular Expression Matching
Takashi Sato Fast Full Text Search Using Tree Structured[TS] File
Bruce W. Watson A Collection of New Regular Grammar Pattern Matching Algorithms

Download proceedings: PSC1996.ps.gz PSC1996.pdf
 PostScript   PDF 

Organization of the PSCW '96

Chair: Bořivoj Melichar
Program Committee: Jan Holub and Bořivoj Melichar
Organizing Committee: Martin Bloch and Jan Holub