Volume 81; Issue 2

Theoretical Computer Science

Volume 81; Issue 2
1

Padding, commitment and self-reducibility

Sanjeev N. Khadilkar, Somenath Biswas
Journal:
Theoretical Computer Science
Year:
1991
Language:
english
File:
PDF, 1.22 MB
english, 1991
2

Accumulators: New logic variable abstractions for functional languages

Keshav Pingali, Kattamuri Ekanadham
Journal:
Theoretical Computer Science
Year:
1991
Language:
english
File:
PDF, 2.46 MB
english, 1991
3

A resolution rule for well-formed formulae

K.S.H.S.R. Bhatta, Harish Karnick
Journal:
Theoretical Computer Science
Year:
1991
Language:
english
File:
PDF, 1.35 MB
english, 1991
4

The conjunctive complexity of quadratic Boolean functions

Katja Lenz, Ingo Wegener
Journal:
Theoretical Computer Science
Year:
1991
Language:
english
File:
PDF, 1.41 MB
english, 1991
5

Abstract grammars based on transductions

Peter R.J. Asveld
Journal:
Theoretical Computer Science
Year:
1991
Language:
english
File:
PDF, 2.25 MB
english, 1991
6

Recognizing different types of beta-cycles in a database scheme

To-Yat Cheung, Yunzhou Zhu
Journal:
Theoretical Computer Science
Year:
1991
Language:
english
File:
PDF, 1.15 MB
english, 1991
9

Author index volume 81

Journal:
Theoretical Computer Science
Year:
1991
File:
PDF, 115 KB
1991
10

Semi-unification

Deepak Kapur, David Musser, Paliath Narendran, Jonathan Stillman
Journal:
Theoretical Computer Science
Year:
1991
Language:
english
File:
PDF, 1.90 MB
english, 1991
12

On the connectedness of pictures in chain code picture languges

Jürgen Dassow
Journal:
Theoretical Computer Science
Year:
1991
Language:
english
File:
PDF, 466 KB
english, 1991