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=1982
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
How to reuse a ``write-once'' memory
R.L. Rivest
,
A. Shamir
Information and Control
55
(1-3), 1982, pp. 1-19
On efficient simulations of multicounter machines
P.M.B. Vitányi
Information and Control
55
(1-3), 1982, pp. 20-39
Circuit-size lower bounds and non-reducibility to sparse sets
R. Kannan
Information and Control
55
(1-3), 1982, pp. 40-56
On the security of ping-pong protocols
D. Dolev
,
S. Even
,
R.M. Karp
Information and Control
55
(1-3), 1982, pp. 57-68
The inference problem for template dependencies
Y. Gurevich
,
H.R. Lewis
Information and Control
55
(1-3), 1982, pp. 69-79
On the unique satisfiability problem
A. Blass
,
Y. Gurevich
Information and Control
55
(1-3), 1982, pp. 80-88
A consistent extension of the lambda-calculus as a base for functional programming languages
K.J. Berkling
,
E. Fehr
Information and Control
55
(1-3), 1982, pp. 89-101
A tight
\Omega(\log\log n)
-bound on the time for parallel RAM's to compute nondegenerated boolean functions
Hans-Ulrich Simon
Information and Control
55
(1-3), 1982, pp. 102-107
Fair derivations in context-free grammars
S. Porat
,
N. Francez
,
S. Moran
,
S. Zaks
Information and Control
55
(1-3), 1982, pp. 108-116
A note on deterministic and nondeterministic time complexity
S. Even
,
T.J. Long
,
Y. Yacobi
Information and Control
55
(1-3), 1982, pp. 117-124
The theory of fringe analysis and its application to 2-3 trees and B-trees
B. Eisenbarth
,
N. Ziviani
,
G.H. Gonnet
,
K. Mehlhorn
,
D. Wood
Information and Control
55
(1-3), 1982, pp. 125-174
Looping vs. repeating in dynamic logic
D. Harel
,
R. Sherman
Information and Control
55
(1-3), 1982, pp. 175-192
Two-dimensional alternating Turing machines with only universal states
A. Ito
,
K. Inoue
,
I. Takanami
,
H. Taniguchi
Information and Control
55
(1-3), 1982, pp. 193-221
The enumeration of certain run length sequences
I.F. Blake
Information and Control
55
(1-3), 1982, pp. 222-237
Channel distances and representation
D.L. Neuhoff
,
P.C. Shields
Information and Control
55
(1-3), 1982, pp. 238-264
Why Gödel Didn't Have Church's Thesis
Martin Davis
Information and Control
54
(1/2), 1982, pp. 3-24
The Recursion-Theoretical Complexity of the Semantics of Predicate Logic as a Programming Language
Howard A. Blair
Information and Control
54
(1/2), 1982, pp. 25-47
The Complexity of the Validity Problem for Dynamic Logic
Kenneth L. Manders
,
Robert R. Daley
Information and Control
54
(1/2), 1982, pp. 48-69
Processes and the Denotational Semantics of Concurrency
J.W. de Bakker
,
J.I. Zucker
Information and Control
54
(1/2), 1982, pp. 70-120
Propositional Dynamic Logic of Looping and Converse Is Elementarily Decidable
Robert S. Streett
Information and Control
54
(1/2), 1982, pp. 121-141
Robustness of probabilistic computational complexity classes under definitional perturbations
Stathis Zachos
Information and Control
54
(3), 1982, pp. 143-154
Using String Languages to Describe Picture Languages
H.A. Maurer
,
G. Rozenberg
,
E. Welzl
Information and Control
54
(3), 1982, pp. 155-185
The Completeness of the Algebraic Specification Methods for Computable Data Types
J.A. Bergstra
,
J.V. Tucker
Information and Control
54
(3), 1982, pp. 186-200
Characterization Theorems for a Filter Lambda Model
Simonetta Ronchi Della Rocca
Information and Control
54
(3), 1982, pp. 201-216
On Reversal-Bounded Counter Machines and on Pushdown Automata with a Bound on the Size of their Pushdown Store
Pavol Dúris̑
,
Zvi Galil
Information and Control
54
(3), 1982, pp. 217-227
Seiten 1
2
3
>