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
[1]
Hilfe
Suche: Author="Istrail, S."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The pagenumber of genus
g
graphs is
O(g)
L.S. Heath
,
S. Istrail
Journal of the ACM
39
(3), 1992, July, pp. 479-501
Constructing generalized universal traversing sequences of polynomial size for graphs with small diameter
S. Istrail
Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science. Vol.~I, FOCS'90 (St. Louis, Missouri, October 22-24, 1990)
, 1990, pp. 439-448
The pagenumber of genus
g
graphs is
O(g)
L. Heath
,
S. Istrail
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC'87 (New York City, May 25--27, 1987)
, 1987, pp. 388-397
Nivat's processing systems: Decision problems related to protection and synchronization
S. Istrail
,
C. Masalagiu
Theoretical Computer Science
26
(1,2), 1983, pp. 83-102
Some remarks on non-algebraic adherences
S. Istrail
Theoretical Computer Science
21
(3), 1982, pp. 341-349
Generalization of the Ginsburg-Rice Schützenberger fixed-point theorem for context-sensitive and recursive-enumerable languages (Note)
S. Istrail
Theoretical Computer Science
18
, 1982, pp. 333-341
A fixed-point theorem for recursive-enumerable languages and some considerations about fixed-point semantics of monadic programs
S. Istrail
Lecture Notes in Computer Science
71
, 1979, pp. 289-303
Tag systems generating Thue irreductible sequences
S. Istrail
Information Processing Letters
7
(3), 1978, April, pp. 129-131