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.~Comput. AND Volume=102
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Iteration theories of synchronization trees
Stephen L. Bloom
,
Zoltán ésik
,
Dirk Taubner
Information and Computation
102
(1), 1993, January, pp. 1-55
Real-time semantics for shared-variable concurrency
Eric Shade
,
K.T. Narayana
Information and Computation
102
(1), 1993, January, pp. 56-82
The undecidability of the semi-unification problem
A.J. Kfoury
,
J. Tiuryn
,
P. Urzyczyn
Information and Computation
102
(1), 1993, January, pp. 83-101
Using inductive counting to simulate nondeterministic computation
Gerhard Buntrock
,
Lane A. Hemachandra
,
Dirk Siefkes
Information and Computation
102
(1), 1993, January, pp. 102-117
Learning with the knowledge of an upper bound on program size
Sanjay Jain
,
Arun Sharma
Information and Computation
102
(1), 1993, January, pp. 118-166
Reasoning in a restricted temporal logic
A. Prasad Sistla
,
Lenore D. Zuck
Information and Computation
102
(2), 1993, February, pp. 167-195
An optimal parallel dictionary
Martin Dietzfelbinger
,
Friedhelm Meyer auf der Heide
Information and Computation
102
(2), 1993, February, pp. 196-217
Routing in polygons without rectilinearly visible corners
Michael Kaufmann
,
Gerhard Klär
Information and Computation
102
(2), 1993, February, pp. 218-262
A lower bound for the worst case of bottom-up-heapsort
R. Fleischer
,
B.P. Sinha
,
C. Uhrig
Information and Computation
102
(2), 1993, February, pp. 263-279
Subcube fault-tolerance in hypercubes
Niall Graham
,
Frank Harary
,
Marilynn Livingston
,
Quentin F. Stout
Information and Computation
102
(2), 1993, February, pp. 280-314