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=Theor.~Comput.~Sci. AND Volume=140
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Lambda abstraction algebras: Representation theorems
Don Pigozzi
,
Antonino Salibra
Theoretical Computer Science
140
(1), 1995, pp. 5-52
Translations betweeen modal logics of reactive systems
F. Laroussinie
,
S. Pinchinat
,
Ph. Schnoebelen
Theoretical Computer Science
140
(1), 1995, pp. 53-71
A theory of processes with durational actions
Roberto Gorrieri
,
Marco Roccetti
,
Enrico Stancampiano
Theoretical Computer Science
140
(1), 1995, pp. 73-94
On using temporal logic for refinement and compositional verification of concurrent systems
Abdelillah Mokkedem
,
Dominique Méry
Theoretical Computer Science
140
(1), 1995, pp. 95-138
On the correctness of modular systems
Marisa Navarro
,
Fernando Orejas
,
Ana Sánchez
Theoretical Computer Science
140
(1), 1995, pp. 139-177
On the role of memory in object-based and object-oriented languages
E.G. Wagner
Theoretical Computer Science
140
(1), 1995, pp. 179-199
An augmented Voronoi roadmap for 3D translational motion planning for a convex polyhedron moving amidst convex polyhedral obstacles
Abhi Dattasharma
,
S. Sathya Keerthi
Theoretical Computer Science
140
(2), 1995, pp. 205-230
Discrete warehouse problem
Majid Sarrafzadeh
,
Sanjeev R. Maddila
Theoretical Computer Science
140
(2), 1995, pp. 231-247
A note on the combinatorial structure of the visibility graph in simple polygons
L. Prasad
,
S.S. Iyengar
Theoretical Computer Science
140
(2), 1995, pp. 249-263
On fast planning of suboptimal paths amidst polygonal obstacles in plane
Nageswara S.V. Rao
Theoretical Computer Science
140
(2), 1995, pp. 265-289
Efficient algorithms for shortest distance queries on special classes of polygons
R. Sridhar
,
K. Han
,
N. Chandrasekharan
Theoretical Computer Science
140
(2), 1995, pp. 291-300
Reaching a goal with directional uncertainty
Mark de Berg
,
Leonidas Guibas
,
Dan Halperin
,
Mark Overmars
,
Otfried Schwarzkopf
,
Micha Sharir
,
Monique Teillaud
Theoretical Computer Science
140
(2), 1995, pp. 301-317
A simplified design strategy for mapping image processing algorithms on a SIMD torus
Guna Seetharaman
Theoretical Computer Science
140
(2), 1995, pp. 319-331
On the
k
-ary hypercube
Saïd Bettayeb
Theoretical Computer Science
140
(2), 1995, pp. 333-339