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=1997
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Sparsification - A technique for speeding up dynamic graph algorithms
David Eppstein
,
Zvi Galil
,
Giuseppe F. Italiano
,
Amnon Nissenzweig
Journal of the ACM
44
(5), 1997, pp. 669-696
Learning to reason
Roni Khardon
,
Dan Roth
Journal of the ACM
44
(5), 1997, pp. 697-725
How much can hardware help routing?
Allan Borodin
,
Prabhakar Raghavan
,
Baruch Schieber
,
Eli Upfal
Journal of the ACM
44
(5), 1997, pp. 726-741
Time-work tradeoffs for parallel algorithms
Thomas H. Spencer
Journal of the ACM
44
(5), 1997, pp. 742-778
Contention in shared memory algorithms
Cynthia Dwork
,
Maurice Herlihy
,
Orli Waarts
Journal of the ACM
44
(6), 1997, pp. 779-805
Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to
NP
Edith Hemaspaandra
,
Lane A. Hemaspaandra
,
Jörg Rothe
Journal of the ACM
44
(6), 1997, pp. 806-825
Software reliability via run-time result-checking
Hal Wasserman
,
Manuel Blum
Journal of the ACM
44
(6), 1997, pp. 826-849
Compositional refinement of interactive systems
Manfred Broy
Journal of the ACM
44
(6), 1997, pp. 850-891
Seiten
<
1
2