Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND Volume=73
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Reversible parallel computation: An evolving space-model
G. Jacopini
,
G. Sontacchi
Theoretical Computer Science
73
, 1990, pp. 1-46
On the interpretability of arithmetic in temporal logic
Fred Kröger
Theoretical Computer Science
73
, 1990, pp. 47-60
Exact average message complexity values for distributed election on bidirectional rings of processors
Christian Lavault
Theoretical Computer Science
73
, 1990, pp. 61-79
Factorizations of free monoids and unavoidable regularities
Stefano Varricchio
Theoretical Computer Science
73
, 1990, pp. 81-89
Fast uniform generation of regular graphs
Mark Jerrum
,
Alistair Sinclair
Theoretical Computer Science
73
, 1990, pp. 91-100
A note on inconsistencies caused by fixpoints in a cartesian closed category
Hagen Huwig
,
Axel Poigné
Theoretical Computer Science
73
, 1990, pp. 101-112
A theory of compaction-based parallelization
Alexander Aiken
Theoretical Computer Science
73
, 1990, pp. 121-154
Type inference with subtypes
You-chin Fuh
,
Prateek Mishra
Theoretical Computer Science
73
, 1990, pp. 155-175
Code selection by inversion of order-sorted derivors
Robert Giegerich
Theoretical Computer Science
73
, 1990, pp. 177-211
Adding relational query facilities to software development environments
Susan Horwitz
Theoretical Computer Science
73
, 1990, pp. 213-230
Deforestation: Transforming programs to eliminate trees
Philip Wadler
Theoretical Computer Science
73
, 1990, pp. 231-248
Bi-immunity results for cheatable sets
Richard Beigel
Theoretical Computer Science
73
, 1990, pp. 249-263
The difference between one tape and two tapes: with respect to reversal complexity
Jian-er Chen
Theoretical Computer Science
73
, 1990, pp. 265-278
Results on NLC grammars with one-letter terminal alphabets
Jochen Hoffmann
,
Michael G. Main
Theoretical Computer Science
73
, 1990, pp. 279-294
Complexity and decidability for restricted classes of picture languages
Changwook Kim
Theoretical Computer Science
73
, 1990, pp. 295-311
Strong time bounds: Non-computable bounds and a hierarchy theorem
J.M. Robson
Theoretical Computer Science
73
, 1990, pp. 313-317
String matching with weighted errors
Alan A. Bertossi
,
Fabrizio Luccio
,
Elena Lodi
,
Linda Pagli
Theoretical Computer Science
73
, 1990, pp. 319-328
The set of strings mapped into a submonoid by iterates of a morphism
Tom Head
Theoretical Computer Science
73
, 1990, pp. 329-333
Hopf algebras and identities in free partially commutative monoids
William Schmitt
Theoretical Computer Science
73
, 1990, pp. 335-340