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=175
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The bounded-complete hull of an
\alpha
-space
Yu.L. Ershov
Theoretical Computer Science
175
(1), 1997, pp. 3-13
Program schemata vs. automata for decidability of program logics
N.V. Shilov
Theoretical Computer Science
175
(1), 1997, pp. 15-27
Monad as modality
Satoshi Kobayashi
Theoretical Computer Science
175
(1), 1997, pp. 29-74
Intuitionistic and classical natural deduction systems with the catch and the throw rules
Masahiko Sato
Theoretical Computer Science
175
(1), 1997, pp. 75-92
Infinitary lambda calulus
J.R. Kennaway
,
J.W. Klop
,
M.R. Sleep
,
F.J. de Vries
Theoretical Computer Science
175
(1), 1997, pp. 93-125
Simple termination of rewrite systems
Aart Middeldorp
,
Hans Zantema
Theoretical Computer Science
175
(1), 1997, pp. 127-158
Developing developments
Vincent van Oostrom
Theoretical Computer Science
175
(1), 1997, pp. 159-181
\Delta
-languages for sets and LOGSPACE computable graph transformers
Alexei Lisitsa
,
Vladimir Sazonov
Theoretical Computer Science
175
(1), 1997, pp. 183-222
On-line algorithms for orders
Vincent Bouchitté
,
Jean-Xavier Rampon
Theoretical Computer Science
175
(2), 1997, pp. 225-238
Planar stage graphs: Characterizations and applications
Frank Bauernöppel
,
Evangelos Kranakis
,
Danny Krizanc
,
Anil Maheshwari
,
Jörg-Rüdiger Sack
,
Jorge Urrutia
Theoretical Computer Science
175
(2), 1997, pp. 239-255
Horn functions and submodular Boolean functions
Oya Ekin
,
Peter L. Hammer
,
Uri N. Peled
Theoretical Computer Science
175
(2), 1997, pp. 257-270
Approximating the number of linear extensions
Kevin Ewacha
,
Ivan Rival
,
Nejib Zaguia
Theoretical Computer Science
175
(2), 1997, pp. 271-282
On-line chain partitions of orders
Stefan Felsner
Theoretical Computer Science
175
(2), 1997, pp. 283-292
Drawing and encoding two-dimensional posets
Colin de la Higuera
,
Lhouari Nourine
Theoretical Computer Science
175
(2), 1997, pp. 293-308
On treewidth and minimum fill-in of asteroidal triple-free graphs
Ton Kloks
,
Dieter Kratsch
,
Jeremy Spinrad
Theoretical Computer Science
175
(2), 1997, pp. 309-335
Cover-preserving embeddings of bipartite orders into boolean lattices
Jutta Mitas
,
Klaus Reuter
Theoretical Computer Science
175
(2), 1997, pp. 337-347
Satisfiability problems on intervals and unit intervals
Itsik Pe'er
,
Ron Shamir
Theoretical Computer Science
175
(2), 1997, pp. 349-372
A data structure for lattice representation
M. Talamo
,
P. Vocca
Theoretical Computer Science
175
(2), 1997, pp. 373-392
Parallel
N
-free order recognition
Laurent Viennot
Theoretical Computer Science
175
(2), 1997, pp. 393-406