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=Acta Inf. AND Volume=33
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Possibility and impossibility results in a shared memory environment
Gadi Taubenfeld
,
Shlomo Moran
Acta Informatica
33
(1), 1996, pp. 1-20
Kinded type inference for parametric overloading
Dominic Duggan
,
Gordon Cormack
,
John Ophel
Acta Informatica
33
(1), 1996, pp. 21-68
A theory of bisimulation for the
\pi
-calculus
Davide Sangiorgi
Acta Informatica
33
(1), 1996, pp. 69-97
Alias analysis of pointers in Pascal and Fortran 90: Dependence analysis between pointer references
Aki Matsumoto
,
D.S. Han
,
Takao Tsuda
Acta Informatica
33
(2), 1996, pp. 99-130
Multi-granularity locking for nested transactions: A proof using a possibilities mapping
John Lee
,
Alan Fekete
Acta Informatica
33
(2), 1996, pp. 131-152
Parallel composition of assumption-commitment specifications: A unifying approach for shared variable and distributed message passing concurrency
A. Cau
,
P. Collette
Acta Informatica
33
(2), 1996, pp. 153-176
Simple extensions of 1-writer atomic variable constructions to multiwriter ones
S. Haldar
,
K. Vidyasankar
Acta Informatica
33
(2), 1996, pp. 177-202
Modeling data-intensive reactive systems with relational transition systems
Alexander Tuzhilin
,
Zvi M. Kedem
Acta Informatica
33
(3), 1996, pp. 203-231
Bounded delay for a free address
Wim H. Hesselink
Acta Informatica
33
(3), 1996, pp. 233-254
Optimizing the costs of hierarchical quorum consensus
Akhil Kumar
,
Kavindra Malik
Acta Informatica
33
(3), 1996, pp. 255-275
Short resolution proofs for a sequence of tricky formulas
Gunnar Stålmarck
Acta Informatica
33
(3), 1996, pp. 277-280
On the rational subsets of the free group
Géraud Sénizergues
Acta Informatica
33
(3), 1996, pp. 281-296
The synthesis problem of Petri nets
Jörg Desel
,
Wolfgang Reisig
Acta Informatica
33
(4), 1996, pp. 297-315
Timing and causality in process algebra
Luca Aceto
,
David Murphy
Acta Informatica
33
(4), 1996, pp. 317-350
The log-structured merge-tree (LSM-tree)
Patrick O'Neil
,
Edward Cheng
,
Dieter Gawlick
,
Elizabeth O'Neil
Acta Informatica
33
(4), 1996, pp. 351-385
Parallel approximation schemes for problems on planar graphs
J. Díaz
,
M.J. Serna
,
J. Torán
Acta Informatica
33
(4), 1996, pp. 387-408
Forgetting automata and context-free languages
Petr Janc̑ar
,
Frantis̑ek Mráz
,
Martin Plátek
Acta Informatica
33
(5), 1996, pp. 409-420
Algebraic models of microprocessors architecture and organisation
N.A. Harman
,
J.V. Tucker
Acta Informatica
33
(5), 1996, pp. 421-456
Syntactic complexity of context-free grammars over word monoids
Alexander Meduna
Acta Informatica
33
(5), 1996, pp. 457-462
Undecidability of restricted uniform recurrence equations
E. Wanke
Acta Informatica
33
(5), 1996, pp. 463-475
Category-based modularisation for equational logic programming
Rȃzvan Diaconescu
Acta Informatica
33
(5), 1996, pp. 477-510
Disambiguating grammars by exclusion of sub-parse trees
Mikkel Thorup
Acta Informatica
33
(6), 1996, pp. 511-522
A kernel language for programmed rewriting of (hyper)graphs
Andrea Maggiolo-Schettini
,
Józef Winkowski
Acta Informatica
33
(6), 1996, pp. 523-546
Chromatic binary search trees - A structure for concurrent rebalancing
Otto Nurmi
,
Eljas Soisalon-Soininen
Acta Informatica
33
(6), 1996, pp. 547-557
On the recognition of permuted Supnick and incomplete Monge matrices
Vladimir Deineko
,
Rüdiger Rudolf
,
Gerhard J. Woeginger
Acta Informatica
33
(6), 1996, pp. 559-569
Seiten 1
2
>