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=116
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Dynamic rectangular point location, with an application to the closest pair problem
Michiel Smid
Information and Computation
116
(1), 1995, January, pp. 1-9
A maximal monoidal closed category of distributive algebraic domains
Michael Huth
Information and Computation
116
(1), 1995, January, pp. 10-25
CCS with priority choice
Juanito Camilleri
,
Glynn Winskel
Information and Computation
116
(1), 1995, January, pp. 26-37
A theory of higher order communicating systems
Bent Thomsen
Information and Computation
116
(1), 1995, January, pp. 38-57
Computing circumscriptive databases. I. Theory and algorithms
Anil Nerode
,
Raymond T. Ng
,
V.S. Subrahmanian
Information and Computation
116
(1), 1995, January, pp. 58-80
Characterizing PAC-learnability of semilinear sets
Naoki Abe
Information and Computation
116
(1), 1995, January, pp. 81-102
The complexity of iterated multiplication
Neil Immerman
,
Susan Landau
Information and Computation
116
(1), 1995, January, pp. 103-116
Fast parallel band matrix arithmetic
Wayne Eberly
Information and Computation
116
(1), 1995, January, pp. 117-127
On encoding and decoding with two-way head machines
Dafna Sheinwald
,
Abraham Lempel
,
Jacob Ziv
Information and Computation
116
(1), 1995, January, pp. 128-133
Rational and recognizable complex trace languages
Volker Diekert
,
Paul Gastin
,
Antoine Petit
Information and Computation
116
(1), 1995, January, pp. 134-153
A communication-randomness tradeoff for two-processor systems
Rudolf Fleischer
,
Hermann Jung
,
Kurt Mehlhorn
Information and Computation
116
(2), 1995, February, pp. 155-161
Communication complexity of sum-type functions invariant under translation
Ulrich Tamm
Information and Computation
116
(2), 1995, February, pp. 162-173
Complexity issues for vacillatory function identification
John Case
,
Sanjay Jain
,
Arun Sharma
Information and Computation
116
(2), 1995, February, pp. 174-192
An operational semantics for timed CSP
Steve Schneider
Information and Computation
116
(2), 1995, February, pp. 193-213
Feasible computability and resource bounded topology
Tomoyuki Yamakami
Information and Computation
116
(2), 1995, February, pp. 214-230
Attributed tree transducers cannot induce all deterministic bottom-up tree transformations
Zoltán Fülöp
,
Sándor Vágvölgyi
Information and Computation
116
(2), 1995, February, pp. 231-240
Updates and subjunctive queries
Gösta Grahne
,
Alberto O. Mendelzon
Information and Computation
116
(2), 1995, February, pp. 241-252
Objects in the
\pi
-calculus
David Walker
Information and Computation
116
(2), 1995, February, pp. 253-271
A quick construction of a retraction of all retractions for stable bifinites
Roberto M. Amadio
Information and Computation
116
(2), 1995, February, pp. 272-274
Structural properties of context-free sets of graphs generated by vertex replacement
Bruno Courcelle
Information and Computation
116
(2), 1995, February, pp. 275-293
Statman's 1-section theorem
Jon G. Riecke
Information and Computation
116
(2), 1995, February, pp. 294-303
Entropy optimization models with convex constraints
S.C. Fang
,
J.R. Rajasekera
Information and Computation
116
(2), 1995, February, pp. 304-311