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=115
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Linear logic, coherence and dinaturality
Richard Blute
Theoretical Computer Science
115
(1), 1993, pp. 3-41
Higher-dimensional word problems with applications to equational logic
Albert Burroni
Theoretical Computer Science
115
(1), 1993, pp. 43-62
Another proof of the intuitionistic Ramsey theorem
Thierry Coquand
Theoretical Computer Science
115
(1), 1993, pp. 63-75
I-categories as a framework for solving domain equations
Abbas Edalat
,
Michael B. Smyth
Theoretical Computer Science
115
(1), 1993, pp. 77-106
Structural polymorphism
P. Freyd
Theoretical Computer Science
115
(1), 1993, pp. 107-129
Programs in partial algebras
Grzegorz Jarzembski
Theoretical Computer Science
115
(1), 1993, pp. 131-149
Tail recursion through universal invariants
C. Barry Jay
Theoretical Computer Science
115
(1), 1993, pp. 151-189
Computing with graph rewriting systems with priorities
Igor Litovsky
,
Yves Métivier
Theoretical Computer Science
115
(2), 1993, pp. 191-224
Almost-everywhere complexity hierarchies for nondeterministic time
Eric Allender
,
Richard Beigel
,
Ulrich Hertrampf
,
Steven Homer
Theoretical Computer Science
115
(2), 1993, pp. 225-241
Overlap-free words and finite automata
Arturo Carpi
Theoretical Computer Science
115
(2), 1993, pp. 243-260
Synchronized finite automata and 2DFA reductions
Oscar H. Ibarra
,
Nicholas Q. Trân
Theoretical Computer Science
115
(2), 1993, pp. 261-275
Hard promise problems and nonuniform complexity
Luc Longpré
,
Alan L. Selman
Theoretical Computer Science
115
(2), 1993, pp. 277-290
Interprétation géométrique de l'algorithme d'Euclide et reconnaissance de segments
A. Troesch
Theoretical Computer Science
115
(2), 1993, pp. 291-319
Games on line graphs and sand piles
Eric Goles
,
Marcos A. Kiwi
Theoretical Computer Science
115
(2), 1993, pp. 321-349
Optimal path cover problem on block graphs and bipartite permutation graphs
R. Srikant
,
Ravi Sundaram
,
Karan Sher Singh
,
C. Pandu Rangan
Theoretical Computer Science
115
(2), 1993, pp. 351-357
The shuffle algebra and its derivations
Masashi Katsura
,
Yuji Kobayashi
Theoretical Computer Science
115
(2), 1993, pp. 359-369
Exponential-time and subexponential-time sets
Shouwen Tang
,
Bin Fu
,
Tian Liu
Theoretical Computer Science
115
(2), 1993, pp. 371-381
On 1-truth-table-hard languages
Steven Homer
,
Stuart Kurtz
,
James Royer
Theoretical Computer Science
115
(2), 1993, pp. 383-389
A fast algorithm for constructing a tree automaton recognizing a congruential tree language
Sándor Vágvölgyi
Theoretical Computer Science
115
(2), 1993, pp. 391-399