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=Inf.~Control AND YEAR=1985
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Alternation with restrictions on looping
J.M. Robson
Information and Control
67
(1-3), 1985, pp. 2-11
Fast recognition of pushdown automaton and context-free languages
W. Rytter
Information and Control
67
(1-3), 1985, pp. 12-22
The power of the future perfect in program logics
M. Hennessy
,
C. Stirling
Information and Control
67
(1-3), 1985, pp. 23-52
Uniform characterizations of non-uniform complexity measures
J.L. Balcázar
,
J. Díaz
,
J. Gabarró
Information and Control
67
(1-3), 1985, pp. 53-69
A zero-one law for logic with a fixed-point operator
A. Blass
,
Y. Gurevich
,
D. Kozen
Information and Control
67
(1-3), 1985, pp. 70-90
Optimal parallel pattern matching in strings
U. Vishkin
Information and Control
67
(1-3), 1985, pp. 91-113
Some characterizations of multihead finite automata
O.H. Ibarra
,
S.M. Kim
,
L.E. Rosier
Information and Control
67
(1-3), 1985, pp. 114-125
On space and time efficient TM simulations of some restricted classes of PDA's
O.H. Ibarra
,
S.M. Kim
,
L.E. Rosier
Information and Control
67
(1-3), 1985, pp. 126-143
Optimal parallel algorithms for string matching
Z. Galil
Information and Control
67
(1-3), 1985, pp. 144-157
There is no polynomial deterministic space simulation of probabilistic space with a two-way random-tape generator
M. Karpinski
,
R. Verbeek
Information and Control
67
(1-3), 1985, pp. 158-162
Symmetrical one-dimensional cellular spaces
H. Szwerinski
Information and Control
67
(1-3), 1985, pp. 163-172
AVL-trees for localized search
A.K. Tsakalidis
Information and Control
67
(1-3), 1985, pp. 173-194
Lower time bounds for solving linear Diophantine equations on several parallel computational models
F. Meyer auf der Heide
Information and Control
67
(1-3), 1985, pp. 195-211
The critical complexity of all (monotone) Boolean functions and monotone graph properties
I. Wegener
Information and Control
67
(1-3), 1985, pp. 212-222
Unraveling k-page graphs
R. Kannan
Information and Control
66
(1/2), 1985, pp. 1-5
On the relationships between Scott domains, synchronization trees, and metric spaces
W.C. Rounds
Information and Control
66
(1-2), 1985, pp. 6-28
On relative completeness of Hoare logics
M. Grabowski
Information and Control
66
(1-2), 1985, pp. 29-44
An area-maximum edge length trade-off for VLSI layout
N. Blum
Information and Control
66
(1-2), 1985, pp. 45-52
The complexity of cubical graphs
Foto Afrati
,
Christos H. Papadimitriou
,
George Papageorgiou
Information and Control
66
(1/2), 1985, pp. 53-60
Implicit data structures for weighted elements
G.N. Frederickson
Information and Control
66
(1-2), 1985, pp. 61-82
A proof rule for fair termination of guarded commands
O. Grumberg
,
N. Francez
,
J.A. Makowsky
,
W.P. de Roever
Information and Control
66
(1-2), 1985, pp. 83-102
The complexity of equivalence problems for commutative grammars
D.T. Huynh
Information and Control
66
(1/2), 1985, pp. 103-121
Effective Hilbert irreducibility
E. Kaltofen
Information and Control
66
(3), 1985, pp. 123-137
Powerposets
T. Adachi
Information and Control
66
(3), 1985, pp. 138-162
Complexity of some problems from the theory of automata
J. Stern
Information and Control
66
(3), 1985, pp. 163-176
Seiten 1
2
>