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=J. ACM AND YEAR=1994
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Circumscription with homomorphisms: Solving the equality and counterexample problems
Peter K. Rathmann
,
Marianne Winslett
,
Mark Manasse
Journal of the ACM
41
(5), 1994, pp. 819-873
The turn model for adaptive routing
Christopher J. Glass
,
Lionel M. Ni
Journal of the ACM
41
(5), 1994, pp. 874-902
Equivalence, reversibility, symmetry and concavity properties in fork-join networks with blocking
Yves Dallery
,
Zhen Liu
,
Don Towsley
Journal of the ACM
41
(5), 1994, pp. 903-942
Fully persistent lists with catenation
James R. Driscoll
,
Daniel D.K. Sleator
,
Robert E. Tarjan
Journal of the ACM
41
(5), 1994, pp. 943-959
On the hardness of approximating minimization problems
Carsten Lund
,
Mihalis Yannakakis
Journal of the ACM
41
(5), 1994, pp. 960-981
Shortest paths in the plane with polygonal obstacles
James A. Storer
,
John H. Reif
Journal of the ACM
41
(5), 1994, pp. 982-1012
A single-exponential upper bound for finding shortest paths in three dimensions
John H. Reif
,
James A. Storer
Journal of the ACM
41
(5), 1994, pp. 1013-1019
Counting networks
James Aspnes
,
Maurice Herlihy
,
Nir Shavit
Journal of the ACM
41
(5), 1994, pp. 1020-1048