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=J. Comput.~Syst.~Sci. AND Volume=32
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Binary trees and uniform distribution of traffic cutback
Robert Li Shuo-Yen
Journal of Computer and System Sciences
32
(1), 1986, February, pp. 1-14
Reliable computation with cellular automata
P. Gacs
Journal of Computer and System Sciences
32
(1), 1986, February, pp. 15-78
About the Paterson-Wegman linear unification algorithm
D. de Champeaux
Journal of Computer and System Sciences
32
(1), 1986, February, pp. 79-90
Time-space trade-offs for branching programs
I. Wegener
Journal of Computer and System Sciences
32
(1), 1986, February, pp. 91-96
'During' cannot be expressed by 'after'
P. Urzyczyn
Journal of Computer and System Sciences
32
(1), 1986, February, pp. 97-104
A multiparameter analysis of the boundedness problem for vector addition systems
L.E. Rosier
,
Hsu-Chun Yen
Journal of Computer and System Sciences
32
(1), 1986, February, pp. 105-135
New algorithms for multilink robot arms
V. Kantabutra
,
S.R. Kosaraju
Journal of Computer and System Sciences
32
(1), 1986, February, pp. 136-153
Reporting and counting segment intersections
B. Chazelle
Journal of Computer and System Sciences
32
(2), 1986, April, pp. 156-182
Automata-theoretic techniques for modal logics of programs
M.Y. Vardi
,
P. Wolper
Journal of Computer and System Sciences
32
(2), 1986, April, pp. 183-221
Threshold functions and bounded depth monotone circuits
R.B. Boppana
Journal of Computer and System Sciences
32
(2), 1986, April, pp. 222-229
On the possibility and impossibility of achieving clock synchronization
D. Dolev
,
J.Y. Halpern
,
H.R. Strong
Journal of Computer and System Sciences
32
(2), 1986, April, pp. 230-250
The complexity of elementary algebra and geometry
Michael Ben-Or
,
Dexter Kozen
,
John Henry Reif
Journal of Computer and System Sciences
32
(2), 1986, April, pp. 251-264
Finding small simple cycle separators for 2-connected planar graphs
G.L. Miller
Journal of Computer and System Sciences
32
(3), 1986, June, pp. 265-279
Efficient symbolic analysis of programs
John H. Reif
,
Harry R. Lewis
Journal of Computer and System Sciences
32
(3), 1986, June, pp. 280-314
A simple undecidable problem: existential agreement of inverses of two morphisms on a regular language
J. Karhumäki
,
Y. Maon
Journal of Computer and System Sciences
32
(3), 1986, June, pp. 315-322
Conditional rewrite rules: Confluence and termination
J.A. Bergstra
,
J.W. Klop
Journal of Computer and System Sciences
32
(3), 1986, June, pp. 323-362
Uniform normal form for general time-bounded complexity classes
B.R. Hodgson
,
C.F. Kent
Journal of Computer and System Sciences
32
(3), 1986, June, pp. 363-369
Effective choice functions and index sets
J.C., Jr. Owings
Journal of Computer and System Sciences
32
(3), 1986, June, pp. 370-373
Domino-tiling games
B.S. Chlebus
Journal of Computer and System Sciences
32
(3), 1986, June, pp. 374-392
First-order logic and star-free sets
D. Perrin
,
J.-E. Pin
Journal of Computer and System Sciences
32
(3), 1986, June, pp. 393-406
'Global' graph problems tend to be intractable
N. Lakshmipathy
,
K. Winklmann
Journal of Computer and System Sciences
32
(3), 1986, June, pp. 407-428